Application of minimum spanning tree in the greedy multicast routing algorithm
Duan Ming-xiu · Journal of Chongqing University of Arts and Sciences · 2009
Since all nodes are multicast nodes,the minimum spanning tree is the best,so the performance is in a reasonable range through minimum spanning tree in the greedy multicast routing algorithm.The greedy algorithm,the weighted greedy algorithm and minimum spanning tree were simulated in detail in this paper.The results show that the algorithm proposed in this paper showed the superiority in the larger multicast nodes,and its average of invalid degree in other cases is also acceptable,but it also has low complexity.