A Heuristic Algorithm for Multicast Routing with Delay and Bandwidth Constrains  

作　　者：石坚 Dong Tianlin 

机构地区：[1]Department of Electronics Information Engineering, Huazhong University of Science Technology,

出　　处：《High Technology Letters》2001年第1期22-26,共5页高技术通讯（英文版）

基　　金：UniversityMainstayTeacherFundPlanofChina

摘　　要：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.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.

关 键 词：MULTICAST BANDWIDTH DELAY Routing tree 

分 类 号：TN911[电子电信—通信与信息系统]