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

An Optimizing of QoS Multicast Routing Based on Ant Colony Algorithm

作　　者：许毅[1] 李腊元[1] 

机构地区：[1]武汉理工大学,湖北武汉430063

出　　处：《计算机应用研究》2005年第2期183-185,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60172035;90304018);湖北省自然科学基金资助项目(2000J154);全国教育科学规划重点课题(AYA010034)

摘　　要：蚁群算法是一种新型的随机优化算法,能有效地解决QoS受限的多播路由问题。基于蚂蚁具有找到蚁巢与食物之间的最短路径原理工作,并在分析多约束QoS的多播路由的基础上,提出了一种具有全局优化能力的多播路由算法(OQMRA),仿真实验表明了该算法是合理的和有效的。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's) ability of finding the shortest path between their nest and the food source in the process of looking for food and analyzing multicast routing with multiple QoS constrains. Simulation results show that the algorithm is valid and effective.

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

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