时延约束动态不重组组播路由优化  

Delay-constrained dynamic non-rearranged multicast routing optimization

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

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

出　　处：《计算机应用》2012年第5期1244-1246,1264,共4页journal of Computer Applications

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

摘　　要：针对时延约束的组播路由问题,提出了一种动态不重组组播路由算法NDMADC。算法将DGA和Floyd最短路径优化算法相结合,确保节点在满足时延约束的前提下动态选择到组播树有最小代价的路径加入组播会话。由于采用贪心算法思想,NDMADC算法保证了节点加入组播树时不需要组播树重组。仿真表明,该算法能正确地构造出满足时延约束的组播树,具有较低的代价和计算复杂度。After researching the delay-constrained multicast routing algorithm, a new dynamic non-rearranged multicast routing algorithm, Non-rearranged Dynamic Muhicast 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.

关 键 词：不重组组播路由算法 动态路由 时延约束 贪心算法 

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