摘要
提出了在组播应用中满足多个约束条件的一种组播路由算法。该算法以最短路径算法为基础,通过调整当前形成的路由树中节点的排列顺序,依次为目的节点选择到路由树的最短路径并加入到该路由树中,得到满足跳数约束条件的低代价组播树,再对所构成的低代价组播树进行同级中继合并,得到最后的组播树。该组播树因为中继最少,所以时隙资源消耗最小。
The article presents a multicast routing algorithm that meets three constraint conditions in the multicast application. The algorithm comprises two steps. First the algorithm is based on MPH and adjusts the nodes rank in the current multicast tree, and gradually gets the low cost and hop constrained multicast tree by selecting the destination node with minimum cost to current multicast tree in turn. Then some relay nodes, which is not fit for the requirement of the resource consumption, is deleted. The rest of the relay nodes makes up of the final multicast tree, which consumes the least time slot.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2004年第4期427-429,433,共4页
Journal of University of Electronic Science and Technology of China
关键词
组播路由算法
组播树
资源消耗
时分多址
multicast routing algorithm
multicast tree
resource consumption
time dwision multi address
