计算机工程2011，Vol.37Issue(24)：71-73,3.DOI:10.3969/j.issn.1000-3428.2011.24.023
时延约束动态组播路由的快速低代价算法
Fast Low-cost Algorithm of Delay-constrained Dynamic Multicast Routing
摘要
Abstract
This paper presents a fast low-cost algorithm of delay-constrained dynamic multicast routing. When adding multicast nodes, it uses improved delay-constrained shortest path subgraph to avoid searching non-delay-constrained shortest path, which greatly improves the efficiency of the algorithm. By sharing longest shortest path as much as possible, it greatly reduces total cost of constructing multicast tree. Simulation results show that this algorithm has less computation time and low multicast tree total cost than Shortest Best Path Ttree(SBPT) algorithm, and multicast tree is more stable.关键词
Steiner树/最短路径子图/动态组播路由/时廷约束/快速低代价算法Key words
Steiner tree/ shortest path subgraph/ dynamic multicast routing/ delay-constrained/ fast low-cost algorithm分类
信息技术与安全科学引用本文复制引用
孙光明,王硕,李晓伟,李伟生..时延约束动态组播路由的快速低代价算法[J].计算机工程,2011,37(24):71-73,3.基金项目
河北交通学院青年教师科研基金资助项目(Y-201004) （Y-201004）
