The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2002 vol.51)
pp: 581-588
ABSTRACT
<p>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.</p>
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
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool