Abstract
Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated as a minimum Steiner tree problem in networks, which is NP-completeness. MPH (minimum path cost heuristic) algorithm is a famous solution to this problem. In this paper, we present a novel solution TPMPH (two phase minimum path cost heuristic) to improve the MPH by generating the nodes and the edges of multicast tree separately. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is no more than that of MPH in the worst case. Extensive simulation results show that TPMPH can effectively improve the performance on MPH, and performs better in large-scale networks and wireless networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Winter P. Steiner problem in networks: a survey [J]. Networks, 1987, 17(2): 129–167.
Hwang F K. Steiner tree problems [J]. Networks, 1992, 22(1): 55–89.
Salama H F, Reeves D S. Evaluation of multicast routing algorithms for real-time communication on high speed networks [J]. IEEE Journal on Selected Areas in Communication, 1997, 15(3): 332–349.
Takahasi H, Matsuyama A. An approximate solution for the Steiner problem in graphs [J]. Math. Japonica, 1980, 24: 573–577.
Novak R. A note on distributed multicast routing in point-to-point networks [J]. Computers and Operations Research, 2001, 28(12): 1149–1164.
Smirnov M I. Efficient multicast routing in high speed networks [J]. Computer communications, 1996, 19 (1): 59–75.
Wang Chu-fu, Liang Chun-teng, Jan Rong-hong. Heuristic algorithms for packing of multiple-group multicasting [J]. Computers and Operations Research, 2002, 29 (7): 905–924.
Ramanathan S. Multicast tree generation in networks with asymmetric links [J]. IEEE ACM Trans., on Networking, August 1996, 4(4): 558–568.
Li Han-bing, Yu Jian-ping, Xie Wei-xin. Locally searching minimum path cost heuristic [J]. Acta Electronic Sinsca, 2000, 28(5): 92–95.
Hu Guang-ming, Li Le-ming. A fast heuristic algorithm of minimum cost tree [J]. Acta Electronica Sinsca, 2002, 30(6): 880–882.
Waxman M. Routing of multipoint connections [J]. IEEE Journal on Selected Areas in Communication, 1988, 6(9): 1617–1621.
Dijkstra E N. A note on two problems in connection with graphs [J]. Numerische Mathematik, 1959, 1(2): 269–271.
Prim R C. Shortest connection networks and some generalizations [J]. Bell Systems Tech., 1957, 36: 1389–1401.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China (Grant No. 60273075)
About this article
Cite this article
Jiang, Ty., Li, Qh. An improved multicast routing algorithm. J. of Shanghai Univ. 8, 317–321 (2004). https://doi.org/10.1007/s11741-004-0071-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11741-004-0071-x