A heuristic algorithm for multicast routing with delay and bandwidth constrains

被引：0
|
作者：
Shi, J. [1 ]
Dong, T. [1 ]
机构：
[1] Dept. of Electron. and Info. Eng., Huazhong Univ. of Sci. and Technol., Wuhan 430074, China
来源：
High Technology Letters | 2001年 / 7卷 / 01期
关键词：
Algorithms - Bandwidth - Computational complexity - Computer simulation - Heuristic methods - Quality of service;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An improved heuristic algorithm is developed which can optimize the multicast routing under the condition that both delay and bandwidth are constrained. Performance analysis and computer simulation show that the routing mechanism can successfully solve the QoS problem in the case of many-to-many cast session. The scheme can make the cost of routing tree optimized and the bandwidth and end-to-end delay guaranteed. Because complexity of algorithm is limited, it is suitable to deal with networks of large size.
引用
收藏
页码：22 / 26
相关论文
共 50 条
12345