计算机工程2011，Vol.37Issue(20)：49-51,3.DOI:10.3969/j.issn.1000-3428.2011.20.017
基于改进蚁群算法的拥塞规避QoS路由算法
QoS Routing Algorithm with Congestion Avoidance Based on Improved Ant Colony Algorithm
万博 1卢昱 2陈立云 1申吉红1
作者信息
- 1. 军械工程学院 计算机工程系
- 2. 军械工程学院训练部,石家庄050003
- 折叠
摘要
Abstract
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-Pub&Enco, 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路由算法/信息素模型Key words
Ant Colony Algorithm(ACA)/ congestion avoidance/ Quality of Service(QoS)/ QoS routing algorithm/ pheromone model分类
信息技术与安全科学引用本文复制引用
万博,卢昱,陈立云,申吉红..基于改进蚁群算法的拥塞规避QoS路由算法[J].计算机工程,2011,37(20):49-51,3.
