Algorithm for Group Multicast Satisfying QoS

In this paper,we consider the Group Multicast Routing Problem(GMRP) in cost-asymmetric communication networks.Firstly,a heuristic algorithm based on the Fast Minimum Path Cost Heuristic Algorithm(FMPH),namely NEW1-GM,is presented.It can reduce cost effectively.The simulation results show that the algorithm is effective.Then,a delay-constrained multicast algorithm,the Delay-Constrained Fast Minimum Path Cost Heuristic Algorithm(DFMPH),is presented.At last,another heuristic algorithm(DGM1) based on NEW1-GM and DFMPH is presented,which can find a set of sub-optimal cost multicast trees satisfying delay and bandwidth constraints.NEW1-GM and DGM1 have the same time complexity O(p(?)n(?)) as GTM.