Many-to-Many Multicast Routing under a Fixed Topology: Basic Architecture, Problems and Algorithms

Many-to-many multicast can be widely used in computer and communication networks supporting various continuous multi-media applications. This paper assumes each user is both a source and a receiver as well as a terminal in many-to-many multicasting. Under this assumption a many-to-many multicast tree appears as a terminal Steiner tree (TeST). This paper uses a heuristic idea of under a fixed TeST topology to compute a good many-to-many multicast tree. Based on this novel idea two basic problems are proposed, the minimum cost/delay many-to-many multicast tree under a fixed TeST topology problem (MCMP/MDMP). Further both of them are distributed into two types, the centralized and decentralized. This paper presents a polynomial-time exact algorithm for the centralized and decentralized MCMP/MDMP respectively.

[1]  Melody Moh,et al.  QoS-guaranteed one-to-many and many-to-many multicast routing , 2003, Comput. Commun..

[2]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[3]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[4]  Wei Xiao,et al.  A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology , 2004, Algorithmica.

[5]  Guohui Lin,et al.  On the terminal Steiner tree problem , 2002, Inf. Process. Lett..

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

[7]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

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

[9]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[10]  D. Du,et al.  Advances in Steiner trees , 2000 .

[11]  Xiaohua Jia,et al.  Fixed Topology Steiner Trees and Spanning Forests , 1999, Theor. Comput. Sci..

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

[13]  J. J. Garcia-Luna-Aceves,et al.  Multimedia Communications: Protocols and Applications , 1997 .

[14]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[15]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[16]  Arie Tamir,et al.  An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Wei Ding,et al.  A linear time algorithm for computing a most reliable source on a tree network with faulty nodes , 2011, Theor. Comput. Sci..