Research on the routing algorithm based greedy multicast algorithm
Qingmei Lu, HeLilin · 2010
Because all the nodes are multi-cast, the minimum spanning tree is the best, therefore, it is expected by the niche tree dynamic greed multicast routing algorithms produce more of the performance with a reasonable level. As for the greedy algorithm and the text of the characters tree dynamic greedy algorithm are made detailed emulation, Simulations result indicates that the results of the algorithm in multicast node are with greater density of the advantages and it shows that the invalid in other cases were acceptable, and has complicated the low quality.