一種改進的多播路由算法
An Advanced Algorithm for Fast Lower-Cost Shortest Path Tree
-
摘要: 低代價最短路徑樹是一種廣泛使用的多播樹，它能夠在保證傳送時延最小的同時盡量降低帶寬消耗。DDSP(Destination-Driven Shortest Path)算法是一個性能較好，計算效率較高的低代價最短路徑樹算法，在該算法基礎(chǔ)上，通過改進結(jié)點的搜索過程，提出一種改進的快速低代價最短路徑樹算法。由算法分析和實驗比較得出，改進算法的計算效率高于DDSP算法，且算法構(gòu)造的最短路徑樹的性能也優(yōu)于DDSP算法構(gòu)造的樹．
-
關(guān)鍵詞:
- 多播; 低代價; 最短路徑樹
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. -
張寶賢,等.多媒體通信中的多點路由問題.通信學(xué)報,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- -
計量
- 文章訪問數(shù): 2214
- HTML全文瀏覽量: 119
- PDF下載量: 1082
- 被引次數(shù): 0
下載:
