Constructing Delay-Bounded Multicast Trees in Computer Networks

In this paper we propose a distributed protocol for constructing delay-bounded minimum-cost multicast trees in computer networks. The proposed protocol does not require knowledge of the complete network topology. Furthermore, it is unnecessary to know how many nodes are in the networks and which nodes are group members in advance. It is shown, through analysis and simulation on a class of random graphs, that our protocol only uses O(n) messages in the best case, where n is the number of nodes in the networks. Even in the worst case, our protocol uses O(d∗n) messages that has lower message complexity than previous protocols, where d is the average nodal degree.

[1]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[2]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[3]  Lih-Chyau Wuu,et al.  Minimum hop-count multicast algorithms for reliable multiple-stream communications , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[4]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[5]  William C. Fenner.  Internet Group Management Protocol, Version 2 , 1997, RFC.

[6]  Brad Cain,et al.  Internet Group Management Protocol, Version 3 , 2002, RFC.

[7]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[8]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[9]  Hideki Tode,et al.  Multicast routing algorithm for nodal load balancing , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[11]  Heesang Lee,et al.  An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[12]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.

[13]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[14]  C. P. Ravikumar,et al.  Efficient algorithms for delay-bounded minimum cost path problem in communication networks , 1998, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238).

[15]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[16]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[17]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[18]  Mustaque Ahamad,et al.  Low cost algorithms for message delivery in dynamic multicast groups , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[19]  John Moy,et al.  MOSPF: Analysis and Experience , 1994, RFC.

[20]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[21]  Sanghyun Ahn,et al.  A multicast tree algorithm considering maximum delay bound for real-time applications , 1996, Proceedings of LCN - 21st Annual Conference on Local Computer Networks.

[22]  C. Edward Chow,et al.  On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[23]  Joze Rugelj,et al.  Distributed multicast routing mechanism for global point-to-point networks , 1994, Proceedings of Twentieth Euromicro Conference. System Architecture and Integration.

[24]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[25]  Jim Mee Ng,et al.  Cost-delay path selection function for real-time multicast routing , 1998, Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247).

[26]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.