An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree

Liu Shu; Li Wei-sheng; Wang Tao

Volume 27 Issue 4

Apr. 2005

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2005 > 27(4): 638-641

Liu Shu, Li Wei-sheng, Wang Tao . An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree[J]. Journal of Electronics & Information Technology, 2005, 27(4): 638-641.

Citation:

Liu Shu, Li Wei-sheng, Wang Tao . An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree[J]. Journal of Electronics & Information Technology, 2005, 27(4): 638-641.

Liu Shu, Li Wei-sheng, Wang Tao . An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree[J]. Journal of Electronics & Information Technology, 2005, 27(4): 638-641.

Citation:

Liu Shu, Li Wei-sheng, Wang Tao . An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree[J]. Journal of Electronics & Information Technology, 2005, 27(4): 638-641.

PDF( 1022 KB)

An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree

Received Date: 2004-03-25
Rev Recd Date: 2004-08-05
Publish Date: 2005-04-19

Abstract

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.

FullText(HTML)

References(1)

References

张宝贤,等.多媒体通信中的多点路由问题.通信学报,1999,20(5):63-70.[2]Fujinoki H, Christensen K. The new shortest best path tree (SBPT)algorithm for dynamic multicast tree. Proceedings of the IEEE 24th Conference on Local Computer Networks, Lowell, MA,USA, 1999:204 - 211.[3]Zhang B X, Mouftah H T. A destination-driven shortest path tree algorithm. IEEE International Conference on Communications,Kingston, Canada, 2002, 4:2258 - 2262.[4]Shaikh A, Shin K G. Destination-driven routing for low-cost multicast[J].IEEE J. on Selected Areas in Communications.1997,15(3):373-[5]Waxman B M. Routing of multipoint connections[J].IEEE J. on Selected Areas in Communications.1988, 6(9):1617-[6]Maxemchuk N F. Video distribution on multicast networks[J].IEEE J. on Selected Areas in Communications.1997, 15(2):357-

Relative Articles

Supplements(0)

Cited By

Proportional views