多播路由kpp算法的改进  

Multicast routing approach with delay-constrained minimum-cost

作　　者：刘山[1] 赵恒[1] 刘轩[2] 

机构地区：[1]中国民航大学计算机学院,天津300300 [2]北京邮电大学电信学院,北京100876

出　　处：《计算机工程与应用》2007年第16期118-120,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60572168)

摘　　要：给出了一种满足端到端时延限制的多播路由算法。该算法是基于通信网络参数加权steiner树的构造技术。当通信网络的目的节点集的时延不受限时,steiner树就是prim算法的最小生成树,而在时延受限的情况下,算法在给定目的节点集后,通过改变费用与时延的加权参数逼近最优解。通过现有算法的算例指出了现有算法的多播路由树构造中的问题,使steiner树的最优性得到保障,实验模拟表明该算法在构造多播树在优化和效率上都有了明显的提高。This paper puts forward a muhicast routing algorithm which satisfies time-delay limitation of point-to-point.This algorithm is based on the constucting method of network parameter weighting steiner tree.When the time-delay of the destination node is not limited,steiner tree is MST of prim algorithm.On the other hand,when time-delay is limited,this algorithm motifies weight parameter of expense and time-delay to approach optimum relation.This paper points out the problem in construction of mihicast routing tree by the example of current algorithm,and proposes a method to ensure the optimization of steiner tree.According to the result of emulation,this algorithm improves the method of constructing muhicast routing tree efficiently.

关 键 词：多播路由算法 时延限制 STEINER树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301[自动化与计算机技术—计算机科学与技术]