基于主干树的最小代价组播路由算法  

The Minimum Cost Multicast Routing Algorithm Based on Main Frame Tree

作　　者：刘文彬[1] 李陶深[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《广西科学院学报》2004年第3期149-151,共3页Journal of Guangxi Academy of Sciences

基　　金：广西"新世纪十百千人才工程"专项资金 (桂人字 2 0 0 12 13号 );广西教育厅科技项目 (桂教科研 [2 0 0 1] 40 1号 )

摘　　要：提出基于主干树的最小代价组播路由算法 ,该算法首先在网络中找出 K个代价最小的结点 ,然后以这K个结点形成一棵树 ,并称这棵为主干树 ,然后将不在主干树上的成员结点加入到树上 ,最后剪去非成员的叶结点。该算法的时间复杂度 O(n3)。该算法所构造的组播树代价略低于 MPH算法和 KMB算法。The minimum cost multicast routing algorithm based main frame tree is presented The steps of the algorithm are,to find the K nodes with minimum cost in the network firstly,and make a trunk using these nodes;the member nodes which are not in the trunk are put in the trunk,and finally,the non member nodes(leaves nodes) in the trunk are deleted The time consumption of the algorithm is O(n 3) The multicast tree cost of the algorithm is a bit less than those of algorithms of KMB and MPH

关 键 词：主干树 最小代价组播树 路由算法 服务质量 复杂度分析 

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