摘要
低代价最短路径树是一种广泛使用的多播树,它能够在保证传送时延最小的同时尽量降低带宽消耗。 DDSP(Destination-Driven Shortest Path)算法是一个性能较好,计算效率较高的低代价最短路径树算法,在该算法基 础上,通过改进结点的搜索过程,提出一种改进的快速低代价最短路径树算法。由算法分析和实验比较得出,改进 算法的计算效率高于DDSP算法,且算法构造的最短路径树的性能也优于DDSP算法构造的树。
Lower-cost shortest path tree is a commonly-used multicast tree type, which can minimize end-to-end delay and at the same time reduce bandwidth as possible. This article presents an algorithm for lower cost shortest path tree. The algorithm adjusts the nodes' minimum cost to the current shortest path tree dynamically, and gradually gets shortest path tree with low total cost by selecting the node with minimum cost to current shortest path tree in turn. The algorithm has better performance and lower complexity than Destination-Driven Shortest Path tree (DDSP) algorithm so that is a very fine shortest path tree algorithm by algorithm analysis and simulation.
出处
《电子与信息学报》
EI
CSCD
北大核心
2005年第4期638-641,共4页
Journal of Electronics & Information Technology
关键词
多播
低代价
最短路径树
Multicast routing, Lower cost, Shortest path tree
