Multicast Routing Based on Ant Algorithm with Multiple Constraints

摘要：

We present an efficient QoS multicast routing algorithm based on ant algorithm. It considers multiple QoS metrics, e.g., bandwidth, delay, delay jittter. Our approach of constructing a multicast tree is to find the shortest paths from the source to each destination separately by ant algorithm and then merge the resulting paths to form a multicast tree. Simulation results show that the proposed algorithm can find the optimal or near-optimal solution quickly.

关键词： QoS Multicast Routing Ant Algorithm

作者: Bencan Gong Layuan Li Xiangli Wang

作者单位: Department of Computer Science Wuhan University of Technology Wuhan, China

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）