A simple algorithm for computing minimum spanning trees in the internet

Information Sciences

Volumn 101, Issue 1-2, 1997, Pages 47-69

  Abdel Wahab, H ^a   Stoica, I ^a   Sultan, F ^a   Wilson, K ^a  

^a ECS Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; TELECOMMUNICATION TRAFFIC; WIDE AREA NETWORKS;

INTERNET; MINIMUM SPANNING TREES; MULTICAST;

ALGORITHMS;

EID: 0031237194     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(97)00002-9     Document Type: Article

References (17)

1. H. Abdel-Wahab, S.-U. Guan, and J. Nievergelt, Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications, IEEE Commun. Mag. 26(11):10-16 (1988).
2. H. Abdel-Wahab, I. Stoica, and F. Sultan, The design and implementation of an Internet conference information system, in: Proc. Joint Conf. Inform. Sci., Pinehurst, NC, Nov. 1994, pp. 174-177.
3. B. Awerbuch, Optimal distributed algorithms for minimum spanning trees, in: Proc. ACM Symp. Theory of Computing, pp. 230-240, May 1987.
4. T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT) - An architecture for scalable inter-domain multicast routing, in: SIGCOMM'93 Proc., pp. 85-94.
5. B. Bollobas, Graph Theory, An Introductory Course, Springer-Verlag, New York, 1979.
6. F. Chin and H. F. Ting, An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees, in: Proc. 26th Symp. Foundations of Comput. Sci., Portland, OR, Oct. 1985, pp. 257-266.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1992.
8. S. E. Deering, Multicast routing in internetworks and extended LANs, ACM Trans. Comput. Syst. 8(2):85-110 (1990).
9. S. E. Deering, Multicast routing in a datagram internetworking, Ph.D. Thesis, Stanford University, Stanford, CA, 1991.
10. E. W. Dijkstra and C. S. Scholten, Termination detection for diffusing computations, Inform. Processing Lett. 11:1-4 (1980).
11. R. G. Gallager, P. A. Humblet, and P. M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans. Programming Languages and Syst. 5(1):66-77 (1983).
12. R. M. Karp, Reducibility among combinatorial problems, in: Complexity of Communications, Plenum Press, New York, 1972, pp. 85-103.
13. M. R. Macedonia and D. P. Brutzman, MBone provides video and audio across the Internet, IEEE Comput. 30-35 (Apr. 1994).
14. J. Moy, Multicast extensions to OSPF, IETF Draft (July 1993).
15. C. A. Noronha, Jr. and F. A. Tobagi, Optimum routing of multicast streams, in: Proc. IEEE 13th Ann. Joint Conf. Comput. and Commun., Vol. 3, 1994, pp. 865-873.
16. R. Perlman, An algorithm for distributed computation of a spanning tree in an extended LAN, in: Proc. 9th Data Commun. Symp., Sept. 1985, pp. 44-53.
17. R. Perlman, Interconnections, Addison-Wesley, Reading, MA, 1992.