一种满足时延和时延差约束的组播路由算法  

Multicast Routing Algorithm Satisfying Delay and Delay Difference Constraint

作　　者：刘维群[1] 李元臣[1] 

机构地区：[1]洛阳师范学院信息技术学院,河南洛阳471022

出　　处：《计算机工程》2012年第14期102-105,共4页Computer Engineering

基　　金：河南省科技攻关基金资助项目(102102210467;112102310527);河南省自然科学基金资助项目(2008B520027)

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

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

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]