Research on the Routing Algorithm Based Greedy Multicast Algorithm
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.
computer networks Multicast routing algorithm dynamic multi astrouting algorithm
LuQingmei HeLilin
Department of Electronic Science and Technology, North University of China, Taiyuan, Shanxi, China, Shenzhen Clou Electronics Co., Ltd, Shenzhen, China, 518057
国际会议
太原
英文
437-439
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）