摘要： 针对时延和时延差约束的组播路由优化问题，提出一种最优代价组播路由算法。基于Dijkstra最短路径树算法，通过指示函数调整新加入节点的优先级，利用局部信息构建低代价组播树，使其能较好地平衡组播树代价、时延和时延差之间的关系。仿真实验结果表明，该算法能正确构造出满足时延和时延差约束的组播树，同时具有时间复杂度低、求解成功率高等综合性能。

关键词: 组播路由, 时延和时延差约束, Dijkstra最短路径树, 服务质量, 链路选择函数

Abstract: According to the delay and delay difference constraint multicast routing optimization problem, an optimal cost multicast routing algorithm is proposed. The algorithm which adjusts the new nodes priority through indicator function, uses a greedy strategy based on Dijkstra Shortest Path Tree(SPT) algorithm and local information to construct lower cost multicast tree. It offers a good balance between tree cost, delay and delay difference. Simulation results show that the algorithm can correctly constructs a multicast tree to meet the delay and delay difference constraint, and has good comprehensive performance such as low time complexity, high success rate and so on.

Key words: multicast routing, delay and delay difference constraint, Dijkstra Shortest Path Tree(SPT), Quality of Service(QoS), link selection function

中图分类号: 

• TP393.02