An efficient probabilistic dynamic multicast routing in ATM networks
檔案
- 000082131500002.pdf (111.6 KB, Adobe PDF)
日期
1999-07-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 15 卷第 4 期,頁 485–504
ISSN
1016-2364
語言
英文
摘要
In this paper, we propose a dynamic multicast routing algorithm based on probability for multimedia communications in an asynchronous transfer mode (ATM) network environment. For multimedia communications, we not only aim to arrange a transmission path with the minimal cost from a source node to each destination node, but also consider the dynamic multicast situation with node joining/leaving. To meet the above requirements, we develop a new method based on the relative probability of each node being truncated from the multicast connection tree, such that we can arrange a better path for a new joining node in such a way as to reduce the impact of leaving requests caused by other nodes in the multicast connection tree. The main contribution of this paper is a new and efficient dynamic multicast routing algorithm for multimedia communications which keeps the whole multicast connection tree near optimal in terms of cost inefficiency and guarantees that the transmission delay will be less than the preset bounded end-to-end delay. Simulation results show that under various sizes of networks and requests, the cost inefficiency of the multicast connection tree constructed by our approach is less than those of the trees constructed by the greedy algorithm and the weighted greedy algorithm, respectively.
關鍵詞
dynamic multicast routingprobabilityminimal spanning treebounded delayATM networkmultimedia communicationgreedy algorithm所屬典藏
期刊論文引用此條目
Wang, K., & Chen, J. (1999). An efficient probabilistic dynamic multicast routing in ATM networks. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 15(4), 485–504. https://ir.lib.nycu.edu.tw/handle/11536/31269
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31269