Distributed multicast routing in point-to-point networks

Abstract A new mechanism for effectively routing packets from a source to multiple destinations in large point-to-point communication networks is presented in this article. As there is no central node with the complete knowledge of network topology, and therefore conventional Steiner tree algorithms can not be used, the need for a distributed approach emerges where each node is supposed to know only the topology of its vicinity. A distributed algorithm based on the cheapest insertion heuristics is proposed in this article. Simulation results have shown that the efficiency of the proposed distributed algorithm is practically identical to that of the distributed Kou-Markowsky-Berman algorithm, whereas it substantially surpasses DKMB as regards time complexity.

[1]  Jonathan Jacky,et al.  The Way of Z: Practical Programming with Formal Methods , 1996 .

[2]  A. F. Adams,et al.  The Survey , 2021, Dyslexia in Higher Education.

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

[4]  C. Siva Ram Murthy,et al.  Algorithms for delay-constrained low-cost multicast tree construction , 1998, Comput. Commun..

[5]  Yanghee Choi,et al.  A distributed multicast routing algorithm for delay-sensitive applications , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

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

[7]  Jeffrey M. Jaffe.  Distributed Multi-Destination Routing: The Constraints of Local Information , 1985, SIAM J. Comput..

[8]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

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

[10]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[11]  Joze Rugelj,et al.  Adaptive Steiner tree balancing in distributed algorithm for multicast connection setup , 1994, Microprocess. Microprogramming.

[12]  Stefan Voß,et al.  Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs , 1993, Inf. Process. Lett..

[13]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[14]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[15]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[16]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[17]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[18]  Jeffrey M. Jaffe.  Distributed multi-destination routing: The constraints of local information , 1982, PODC '82.

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

[20]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[21]  R. Ravi,et al.  A Primal-Dual Approximation Algorithm for the Steiner Forest Problem , 1993, Inf. Process. Lett..

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

[23]  Yanchun Zhang,et al.  A Distributed Multicast Routing Protocol for Real-Time Multicast Applications , 1999, Comput. Networks.

[24]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[25]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[26]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[27]  J. Rugelj.  Multicast real-time communications , 1991, RTSS 1991.