一个新的基于度约束的组播路由算法  

A New Degree-Constrain Based on Multicast Routing Algorithm

作　　者：顾军华[1] 王方伟[1] 李望超[1] 

机构地区：[1]河北工业大学计算机科学与工程系,天津300130

出　　处：《计算机工程与应用》2003年第18期172-175,共4页Computer Engineering and Applications

基　　金：河北省自然科学基金资助(编号:601055)

摘　　要：论文根据网络节点在通信中复制信息的能力,研究了节点的度约束以及费用最小的组播树问题,并提出了一种新的算法,当动态加入节点时,不用完全重新计算就可以得到新的组播树,以适用于某些特殊的场合。通过实验表明,算法的费用接近于以往算法,但是建立初始路由的时间要少得多,实验表明该算法具有较强的实用性。In this paper,a new algorithm is proposed for finding an efficient multicast tree in the presence of con-straints on the copying ability of the individual node in the network,as well as the minimum cost of the multicast tree.The algorithm permits destination nodes to join the multicast group dynamically,without re-computing the existing tree,and can be used in some special applications.Experiment results show that the performance of this algorithm is close to that of the original,but requiring a much shorter computational time ,thereby a better practicality can be provided.

关 键 词：组播路由 度约束 斯坦利树问题 

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