Delay-constrained multicast routing balanced-optimization algorithm of link-sharing based on local information
链路共享的时延约束组播路由局部平衡优化算法*

This paper analyzed the cost and computational complexity as constructing delay-constrained multicast tree. So as to optimize shortest paths,it proposed a new algorithm of ORLSB(optimal routing algorithm for link-sharing balance).The link selection function of the algorithm not only considered the priority of the destination nodes, but also took into account the priority of the low delay path based on local information. Because the multicast tree has fewer possible path, the algorithm reduced the probability of creating multicast tree through the minimum delay path and improved the sharing paths. Simulation results show that this algorithm has balanced cost, delay and computational complexity, and has better overall performance.