On finding feasible solutions to the group multicast routing problem

Abstract

Group multicast routing problem (GMRP) is a generalization of multicasting whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. The traditional solutions only care for the low cost of multicast trees and sometimes the algorithms will fail during the construction due to the inefficiency of the bandwidth allocation. In this paper we study the feasible solutions to GMRP by proposing a new algorithm to improve the success rate of constructing multicast trees. Simulation results show that our new algorithm performed better in terms of bandwidth utilization and success rate of building multicast trees compared with existing algorithms.