链路共享的时延约束组播路由局部平衡优化算法

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 muhicast tree. So as to optimize shortest paths, it proposed a new algorithm of ORLSB（ optimal routing algorithm for hnk-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 muhicast 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.