基于改进蚁群算法的拥塞规避QoS路由算法  

QoS Routing Algorithm with Congestion Avoidance Based on Improved Ant Colony Algorithm

作　　者：万博[1] 卢昱[2] 陈立云[1] 申吉红[1] 

机构地区：[1]军械工程学院计算机工程系,石家庄050003 [2]军械工程学院训练部,石家庄050003

出　　处：《计算机工程》2011年第20期49-51,共3页Computer Engineering

摘　　要：服务质量(QoS)路由算法缺少拥塞规避机制,会影响业务QoS。为此,提出一种基于Ant-Pub&Enco的信息素模型,根据蚂蚁行进方向,利用相反的信息素引导模式以及不同的信息素更新策略进行路由搜索。基于改进蚁群算法设计一种规避拥塞算法求解QoS单播路由问题。仿真结果表明,该算法能够有效规避网络中的拥塞链路,均衡网络负载。To solve the problem that congestion influences on Quality of Service（QoS） in network,there is not a function like congestion avoidance in QoS routing algorithms now.Based on a pheromone model called Ant-PubEnco,Ant Colony Algorithm（ACA） is improved.The improved algorithm adopts opposite pheromone-lead mode and pheromone updating policy for different ants＇ action.Based on improved ant colony algorithm,it also designs a congestion avoidance algorithm to solve QoS unicast routing problem.Simulation results demonstrate the algorithm can effectively avoid congestive link and balance the load in network.

关 键 词：蚁群算法 拥塞规避 服务质量 QOS路由算法 信息素模型 

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