基于自适应蚁群的多约束QoS组播路由算法  

Multi-constrained QoS Multicast Routing Algorithm Based on Adaptive Ant Colony Algorithm

作　　者：梁潇[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,湖北武汉430070

出　　处：《现代电子技术》2009年第5期17-19,27,共4页Modern Electronics Technique

摘　　要：结合多约束QoS组播路由的特点,应用一种自适应蚁群优化算法解决组播路由问题。考虑到实际通信中链路利用率对网络的影响,将网络中链路的带宽转化为链路的代价问题,并在蚁群算法中根据蚂蚁所选路径的代价进行信息素更新,增加了信息素调整的自适应性,同时加快了算法的收敛速度,使得组播路由算法在考虑网络QoS约束的基础上进一步贴合实际网络的需求。This paper unifies the characteristics of multi -constrained QoS multicast routing problem, by using an improved adaptive ant colony optimization algorithm to solve multicast routing problem. In real network communications, by considering the link utilization influence transforms bandwidth of link into cost problems. According to the cost of the way which ants choose to updating pheromone, increase the adaptability of pheromone updating, then improve convergence ability of algorithm. Cause the multieast routing algorithm in considering the QoS constraints of network on the basis of further conforms to actual network demands.

关 键 词：QOS 蚁群算法 自适应 链路利用率 

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