A simple algorithm for computing minimum spanning trees in the internet

doi:10.1016/S0020-0255(97)00002-9

Information Sciences

Volume 101, Issues 1–2, September 1997, Pages 47-69

https://doi.org/10.1016/S0020-0255(97)00002-9 Get rights and content

Abstract

A central problem in wide-area networks is to efficiently multicast a message to all members (hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propose a new fully distributed algorithm to build a minimum spanning tree (MST) in a generic communication network. During the execution, the algorithm maintains a collection of disjoint trees spanning all the group members. Every tree, which initially consists of only one node, independently expands by joining the closest tree, until all of the nodes are connected in a single tree. The resulting communication topology is both robust (there are no singularities subject to failures) and scalable (every node stores a limited amount of local information that is independent of the size of the network).

References (17)

E.W. Dijkstra et al.
Termination detection for diffusing computations
Inform. Processing Lett.
(1980)
H. Abdel-Wahab et al.
Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications
IEEE Commun. Mag.
(1988)
H. Abdel-Wahab et al.
The design and implementation of an Internet conference information system
B. Awerbuch
Optimal distributed algorithms for minimum spanning trees
T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT)—An architecture for scalable inter-domain multicast...
B. Bollobas
Graph Theory, An Introductory Course
(1979)
F. Chin et al.
An almost linear time and O(n log n +e) messages distributed algorithm for minimum-weight spanning trees
T.H. Cormen et al.
Introduction to Algorithms
(1992)

There are more references available in the full text version of this article.

Cited by (6)

A fast minimum spanning tree algorithm based on K-means
2015, Information Sciences
Minimum spanning trees (MSTs) have long been used in data mining, pattern recognition and machine learning. However, it is difficult to apply traditional MST algorithms to a large dataset since the time complexity of the algorithms is quadratic. In this paper, we present a fast MST (FMST) algorithm on the complete graph of N points. The proposed algorithm employs a divide-and-conquer scheme to produce an approximate MST with theoretical time complexity of $O (N^{1.5})$ , which is faster than the conventional MST algorithms with $O (N^{2})$ . It consists of two stages. In the first stage, called the divide-and-conquer stage, K-means is employed to partition a dataset into $\sqrt{N}$ clusters. Then an exact MST algorithm is applied to each cluster and the produced $\sqrt{N}$ MSTs are connected in terms of a proposed criterion to form an approximate MST. In the second stage, called the refinement stage, the clusters produced in the first stage form $\sqrt{N} - 1$ neighboring pairs, and the dataset is repartitioned into $\sqrt{N} - 1$ clusters with the purpose of partitioning the neighboring boundaries of a neighboring pair into a cluster. With the $\sqrt{N} - 1$ clusters, another approximate MST is constructed. Finally, the two approximate MSTs are combined into a graph and a more accurate MST is generated from it. The proposed algorithm can be regarded as a framework, since any exact MST algorithm can be incorporated into the framework to reduce its running time. Experimental results show that the proposed approximate MST algorithm is computationally efficient, and the approximation is close to the exact MST so that in practical applications the performance does not suffer.
Minimum Spanning Trees Across Well-Connected Cities and with Location-Dependent Weights
2022, Communications in Mathematics and Statistics
A new approach for sensitivity analysis in network flow problems
2020, International Journal of Industrial Engineering : Theory Applications and Practice
On Primal and Dual Approaches for Distributed Stochastic Convex Optimization over Networks
2019, Proceedings of the IEEE Conference on Decision and Control
Minimum spanning trees of weighted scale-free networks
2005, Europhysics Letters
Decomposable Algorithms for Computing Minimum Spanning Tree
2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

^☆: This work was supported by the National Science Foundation under Grant NCR-9313857.

View full text

Informatics and computer scienceA simple algorithm for computing minimum spanning trees in the internet☆

Abstract

Inform. Processing Lett.

Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications

IEEE Commun. Mag.

The design and implementation of an Internet conference information system

Optimal distributed algorithms for minimum spanning trees

Graph Theory, An Introductory Course

An almost linear time and O(n log n +e) messages distributed algorithm for minimum-weight spanning trees

Introduction to Algorithms

Informatics and computer science
A simple algorithm for computing minimum spanning trees in the internet☆