摘要： 基于标签技术和最短费用路径,根据延迟约束不断调整多播路由树中部分路径以减少路径延迟,提出了一种满足延迟约束费用最小的多播路由启发式算法。仿真结果表明,该算法得到的多播路由树具有较小的费用,平均路径延迟也比较小,并且避免了其它同类算法的高复杂性。

关键词: 最短路径树, 多播, 延迟约束, 服务质量

Abstract: This paper proposes a multicast routing algorithm with delay-bounded, the algorithm employs label and least path technique, it achieves feasible multicast routing tree by replacing partial paths with other paths that has less path delay. Simulation shows that the algorithm can obtain less cost and mean path delay, it also has low time complexity.

中图分类号: 

• TP301.6