首页 | 本学科首页   官方微博 | 高级检索  
     

时延约束动态不重组组播路由优化
引用本文:刘维群,李元臣.时延约束动态不重组组播路由优化[J].计算机应用,2012,32(5):1244-1246.
作者姓名:刘维群  李元臣
作者单位:洛阳师范学院 信息技术学院,河南 洛阳 471022
基金项目:河南省科技攻关基金资助项目(102102210467,112102310527);河南省自然科学基金资助项目(2008B520027)
摘    要:针对时延约束的组播路由问题,提出了一种动态不重组组播路由算法NDMADC。算法将DGA和Floyd最短路径优化算法相结合,确保节点在满足时延约束的前提下动态选择到组播树有最小代价的路径加入组播会话。由于采用贪心算法思想,NDMADC算法保证了节点加入组播树时不需要组播树重组。仿真表明,该算法能正确地构造出满足时延约束的组播树,具有较低的代价和计算复杂度。

关 键 词:不重组组播路由算法    动态路由    时延约束    贪心算法
收稿时间:2011-11-30
修稿时间:2012-01-09

Delay-constrained dynamic non-rearranged multicast routing optimization
LIU Wei-qun , LI Yuan-chen.Delay-constrained dynamic non-rearranged multicast routing optimization[J].journal of Computer Applications,2012,32(5):1244-1246.
Authors:LIU Wei-qun  LI Yuan-chen
Affiliation:1. Academy of Information Technology, Luoyang Normal University, Luoyang Henan 471022, China
2. College of Information Technology, Luoyang Normal University, Luoyang Henan 471022, China
Abstract:After researching the delay-constrained multicast routing algorithm,a new dynamic non-rearranged multicast routing algorithm,Non-rearranged Dynamic Multicast Algorithm with Delay-Constraint(NDMADC) was proposed in this paper.Combining algorithm DGA(Dynamic Greedy Algorithm) and Floyd optimization of the shortest path,NDMADC ensured that under the premise of satisfying delay constraint,the node can dynamically select minimum cost path to multicast tree to join the multicast session.What’s more,due to the adoption of greedy algorithm,NDMADC needs not to restructure multicast tree when a node joins it.The simulation results show that the algorithm can not only construct correctly multicast tree to meet delay constraint but also has low cost and complexity.
Keywords:non-rearranged multicast algorithm  dynamic routing  delay-constrained  greedy algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号