计算机工程2012，Vol.38Issue(14)：102-105,4.DOI:10.3969/j.issn.1000-3428.2012.14.030
一种满足时延和时延差约束的组播路由算法
Multicast Routing Algorithm Satisfying Delay and Delay Difference Constraint
摘要
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.关键词
组播路由/时延和时延差约束/Dijkstra最短路径树/服务质量/链路选择函数Key words
multicast routing/ delay and delay difference constraint/ Dijkstra Shortest Path Tree(SPT)/ Quality of Service(QoS)/ link selection function分类
信息技术与安全科学引用本文复制引用
刘维群,李元臣..一种满足时延和时延差约束的组播路由算法[J].计算机工程,2012,38(14):102-105,4.基金项目
河南省科技攻关基金资助项目(102102210467,112102310527) （102102210467,112102310527）
河南省自然科学基金资助项目(2008B520027) （2008B520027）
