基于蚁群遗传算法的QoS多播路由研究  

Research of QoS multicast routing problem based on ant colony algorithm and genetic algorithm

作　　者：倪云竹[1] 李志蜀[1] 刘一静[1] 

机构地区：[1]四川大学计算机学院,成都610064

出　　处：《计算机应用研究》2011年第10期3865-3868,3877,共5页Application Research of Computers

基　　金：浙江省科技厅计划资助项目(2008C21081)

摘　　要：为解决多播路由中的QoS约束问题,不仅研究了QoS多播路由中的带宽、时延﹑时延抖动和包丢失率等约束问题,还重点分析了路径开销问题,从而提出一种基于蚁群遗传算法的多播路由算法。该算法将遗传算法与蚁群算法结合起来,对多播树群体进行编码、选择、杂交和变异等遗传操作,同时利用蚁群算法的信息素正反馈求解,充分发挥两者的优势,从而更快更好地产生出既满足服务质量保障(QoS)又具有最小路径开销的多播树。仿真实验证明了该算法具有更高的运行效率和更好的收敛性。Due to the advent of many new multimedia applications in high-speed networks,the issue of multicast routing has become more and more important.This paper studied the QoS multicast routing restraint and cost problems,and proposed a new multicast routing algorithm based on genetic algorithm and ant colony algorithm.It took full advantage of the GA＇s global search capability and the ACA＇s positive feedback convergence mechanism.Therefore,it could quickly and efficiently achieve the multicast tree which satisfied the QoS restraint and had the minimum path cost.Conducted computer simulations on a random graph to evaluate the performance of the algorithm.The results show that the proposed algorithm is a correct and more effective algorithm.

关 键 词：多播路由 服务质量保障 路径开销 遗传算法 蚁群算法 

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