Abstract: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.
刘姝; 李伟生; 王涛. 一种改进的多播路由算法[J]. 电子与信息学报, 2005, 27(4): 638-641 .
Liu Shu; Li Wei-sheng; Wang Tao . An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree. , 2005, 27(4): 638-641 .