This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem
May 2002 (vol. 51 no. 5)
pp. 581-588

Group multicasting is a generalization of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. In this paper, we study the problem of finding feasible solutions for the delay constrained group multicast routing problem (DCGMRP). The routing problem in this case involves the construction of a set of delay bounded multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. We first show that the problem is NP-complete. Next, we propose a heuristic algorithm to find feasible solutions for this problem. Simulation results show that our proposed algorithm is able to achieve a high probability of finding feasible solutions for DCGMRP, whenever one exists.

[1] T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT): An Architecture for Scalable Inter Domain Multicast Routing,” Proc. ACM SIGCOMM, pp. 85-95, 1993.
[2] F. Bauer and A. Varma, “Distributed Algorithms for Multicast Path Setup in Data Networks,” IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 181-191, 1996.
[3] E. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Math., vol. 1, pp. 269-271, 1959.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[5] X. Jia and L. Wang, “Group Multicast Routing Algorithm by Using Multiple Minimum Steiner Trees,” Computer Comm., vol. 20, pp. 750-758, 1997.
[6] R.M. Karp, “Reducibility among Combinatorial Problems,” Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85-103, New York: Plenum Press, 1972.
[7] V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, June 1993.
[8] L. Kou, G. Markowsky, and L. Berman, “A Fast Algorithm for Steiner Trees,” Acta Informatica, vol. 15, pp. 141-145, 1981.
[9] C.P. Low and N. Wang, “An Efficient Algorithm for Group Multicast Routing with Bandwidth Reservation,” Computer Comm., to appear.
[10] M. Parsa, Q. Zhu, and J.J. Garcia-Luna-Aceves, “An Iterative Algorithm for Delay-Constrained Minimum Cost Multicasting,” IEEE/ACM Trans. Networking, vol. 6, no. 4, pp. 461-474, Aug. 1998.
[11] V.J. Rayward-Smith and A. Clare, “On Finding Steiner Vertices,” Networks, vol. 16, no. 3, pp. 283-294, 1986.
[12] H.F. Salama and D.S. Reeves, “Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 332-345, 1997.
[13] Q. Sun and H. Langendoerfer, “Efficient Multicast Routing for Delay-Sensitive Applications,” Proc. Second Workshop Protocols for Multimedia Systems, pp. 452-458, 1995.
[14] H. Takahashi and A. Matsuyama, “An Approximate Solution for the Steiner Problem in Graphs,” Math. Japonica, vol. 6, pp. 573-577, 1980.
[15] N. Wang and C.P. Low, “On Finding feasible Solutions to the Group Multicast Routing Problem,” Proc. IFIP Int'l Conf. NETWORKING, 2000.
[16] B.M. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
[17] B. Wang and J.C. Hou, Multicast Routing and Its QoS Extensions: Problems, Algorithms, and Protocols IEEE Network, vol. 14, no. 1, Jan./Feb. 2000.

Index Terms:
Delay constrained group multicast routing, NP-completeness, feasible solutions, heuristic algorithm
Citation:
C.P. Low, X. Song, "On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem," IEEE Transactions on Computers, vol. 51, no. 5, pp. 581-588, May 2002, doi:10.1109/TC.2002.1004596
Usage of this product signifies your acceptance of the Terms of Use.