๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network

โœ Scribed by Yaron I. Gold; Shlomo Moran

Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
995 KB
Volume
2
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A distributed algorithm for constructing
A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks
โœ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se

A self-stabilizing distributed algorithm
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
โœ H. Baala; O. Flauzac; J. Gaber; M. Bui; T. El-Ghazawi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo

On finding a minimum spanning tree in a
On finding a minimum spanning tree in a network with random weights
โœ Colin McDiarmid; Theodore Johnson; Harold S. Stone ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB ๐Ÿ‘ 2 views

We investigate Prim's standard ''tree-growing'' method for finding a minimum spanning tree, when applied to a network in which all degrees are about d and the edges e ลฝ . have independent identically distributed random weights w e . We find that when the kth ' ลฝ . edge e is added to the current tree