Algorithm for Group Multicast in Cost-Asymmetric Communication Networks
Zhang Jian-zhi · Communications technology · 2008
In this paper,the group multicast routing problem(GMRP) in cost-asymmetric communication networks is considered,and a heuristic algorithm based on fast minimum path cost heuristic algorithm(FMPH),namely NEW-GM,is presented.It can reduce the cost effectively.The simulation results show that the algorithm is effective,and the algorithm has the same time complexity Ο(p3n2)as GTM.