STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal distributed algorithm for minimum spanning trees revisited
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
On the communication complexity of strong time-optimal distributed algorithms
Nordic Journal of Computing
A linear-time optimal-message distributed algorithm for minimum spanning trees
Distributed Computing
Proceedings of the 1st international conference on Robot communication and coordination
Safe and Distributed Kinodynamic Replanning for Vehicular Networks
Mobile Networks and Applications
Topology control strategies on P2P live video streaming service with peer churning
Computer Communications
| Hi-index | 0.00 |
In this paper, we present an efficient distributed protocol for constructing a minimum-weight spanning tree (MST). Gallager, Humblet and Spira [5] proposed a protocol for this problem with time and message complexities O(N log N) and O(E + N log N) respectively. A protocol with O(N) time complexity was proposed by Awerbuch [1]. We show that the time complexity of the protocol in [5] can also be expressed as O((D + d)log N), where D is the maximum degree of a node and d is a diameter of the MST and therefore this protocol performs better than the protocol in [1] whenever D + d N/log N. We give a protocol which requires O(min(N, (D + d)log N)) time and O(E + N log N log N/ log log N) messages. The protocol constructs a minimum spanning tree by growing disjoint subtrees of the MST (which are referred to as fragments). Fragments having the same minimum-weight outgoing edge are combined until a single fragment which spans the entire network remains. The protocols in [5] and [1] enforce a balanced growth of fragments. We relax the requirement of balanced growth and obtain a highly asynchronous protocol. In this protocol, fast growing fragments combine more often and therefore speed up the execution.