基于蚁群算法的多QoS约束的多播路由优化算法  

Optimizing QoS Multicast Routing Based on Ant Colony Algorithm

作　　者：张舜[1] 许毅[2] 

机构地区：[1]武汉工程大学网络信息中心,武汉430073 [2]武汉理工大学计算机科学与技术学院,武汉430063

出　　处：《武汉理工大学学报（交通科学与工程版）》2007年第5期939-942,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

摘　　要：蚁群算法是一种新型的随机优化算法,能有效地解决QoS受限的多播路由问题.文中基于蚂蚁具有找到蚁巢与食物之间的最短路径的工作原理,并在分析多约束QoS的多播路由的基础上,提出了一种具有全局优化能力的多播路由算法(OQMRA),仿真实验表明了该算法是合理的和有效的.With the rapid evolution of multimedia, certain QoS need to be guaranteed in IP network. QoS Routing algorithms rely heavily on network state information specifying the resource availability at network nodes and links. Ant colony system is a new optimization algorithm and effectively solves the problem of multicast routing with QoS constraints. This paper mainly presents a globally-optimizing multicast routing algorithm （OQMRA） based on the ant colony ability of finding the shortest path be- tween their nest and the food source in the process of looking for food and analyze multicast routing with multiple QoS constrains. Simulation results show that the algorithm is valid and effective.

关 键 词：蚁群算法 多播路由 QOS约束 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]