動態(tài)多播最小生成樹算法
Dynamic mimimum path cost heuristic algorithm
-
摘要: 在IP多播網(wǎng)絡(luò)中,如何選擇合適的路由、優(yōu)化配置,以減少開支,是IP多播業(yè)務(wù)推廣使用的關(guān)鍵。該文針對IP多播動態(tài)路由選擇的特點(diǎn)和現(xiàn)有算法的不足,提出了一種新的動態(tài)多播最小生成樹算法(DMPH),隨機(jī)網(wǎng)絡(luò)模型的仿真結(jié)果表明:DMPH算法生成的多播樹總費(fèi)用與靜態(tài)算法基本一致,優(yōu)于現(xiàn)有的動態(tài)算法;計(jì)算復(fù)雜性較靜態(tài)算法有很大降低。
-
關(guān)鍵詞:
- 多播; 最小代價; 動態(tài)算法
Abstract: In IP multicast network, how to choose appropriate multicast routes and optimize the configuration for reducing the cost of multicast are the key to popularize the multicast service. Aiming at characteristics of multicast routing algorithm and weakness of existing algorithm, a new dynamic multicast routing algorithm called Dynamic Minimum Path cost Heuristic (DMPH) is introduce. The simulation results show that the cost of tree from DMPH is similar to that of tree from static algorithm, and DMPH is faster than existing dynamic algorithms. -
P. Winter, Steiner problem in networks: a survey , Networks, 1987, 17(2), 129-167.[2]Wang Bin, C. Jennifer Hou, Multicast routing and its QoS extension: problem, algorithms and protocols, IEEE Network, 2000, 14(1), 22-35.[3]B.M. Waxman, Routing of multipoint connections, IEEE J. on Selected Areas in Communications, 1988, 6(9), 1617-1622.[4]J. Kadirire.[J].G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched network, IEEE INFOCOM95, Boston, IEEE.1995,:-[5]Hwa-Chun Lin.[J].Shou-Chuan Lai, VTDM-A dynamic multicast routing algorithm, IEEE INFOCOM98, San Francisco, IEEE.1998,:-[6]龍?jiān)?廖建新,陳俊亮,動態(tài)啟發(fā)式最小生成樹多播路由算法,北京郵電大學(xué)學(xué)報,1999,22(3),29-33. -
計(jì)量
- 文章訪問數(shù): 2522
- HTML全文瀏覽量: 155
- PDF下載量: 1023
- 被引次數(shù): 0
下載:
