一种改进的时延受限多播路由算法  

Improved Delay-constrained Multicast Routing Algorithm

作　　者：杨春德[1] 秦宗伟[2] 

机构地区：[1]重庆邮电大学数理学院,重庆400065 [2]重庆邮电大学计算机科学与技术学院,重庆400065

出　　处：《计算机工程》2012年第10期83-85,共3页Computer Engineering

基　　金：重庆市教委科学技术研究基金资助项目(KJ090509)

摘　　要：针对DCMPH算法不能合理选择连接路径的问题,提出一种改进的满足时延限制的多播路由算法。该算法对不能用最小代价路径连接到多播树上的目的节点,求出其到多播树上所有节点的最小时延路径,再从中选出一条能满足时延限制的费用最小的路径,添加到多播树上。实验结果表明,与DCMPH算法相比,该算法构造多播树的代价更低。Aiming at the problem of DCMPH algorithm can not choose the connection path reasonably,an improved meeting delay-constrained multicast routing algorithm is proposed in this paper.In the algorithm,if the destination nodes can not use the least-cost path to join the multicast tree,it calculates the least-delay path to all the nodes in the multicast tree,and then selects the least-cost path which meets the delay constraint to add to the multicast tree.Experimental results show that the cost of the new algorithm in constructing multicast routing tree is superior to DCMPH algorithm.

关 键 词：多播路由算法 时延受限 服务质量 STEINER树 多播树 NP完全问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]