受时延约束的组播路由算法  

Delay-constrained multicast routing algorithm

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

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

出　　处：《计算机工程与设计》2006年第2期248-251,共4页Computer Engineering and Design

基　　金：广西省自然科学基金项目(桂科自0229008);广西"新世纪十百千人才工程"专项基金项目(桂人函2001213号);广西科学研究和技术开发计划应用基础研究专项基金项目(桂科基0342011)

摘　　要：提出了一种新的受时延约束的组播路由算法。算法借鉴了MPH算法的思想,最初的组播树只包含源结点,然后每次将到达组播树的代价最小且满足时延约束的结点及其相应的路径加入到组播树,直到所有的成员加入为止。该算法能够快速地得到一棵满足时延约束的组播树,并且组播树的代价也很小。实验表明:该算法简单,复杂度低,性能良好,易于在分布式环境中实现,可应用于实际的应用系统中。A new multicast routing algorithm with delay-constrained was proposed. Based on MPH algorithm, this algorithm establishes multicast tree merely with a source node at first and then joined a member to multicast tree every time, till the tree hold all members. When a member wants to join multicast tree, it should satisfy the delay-constrained from source to itself and the cost of path from tree to itself is less than the cost of path from tree to other members that are not on the tree. This heuristics could find the least cost multicast tree with delay-constrained if such a tree exists. Experiment results showed that this algorithm was simplicity and low complexity, and had some good performance, so it could be implemented in the distributed environment, and could be applied to the real system.

关 键 词：时延约束 组播 路由算法 组播树 最小生成树 

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