作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (20): 49-51. doi: 10.3969/j.issn.1000-3428.2011.20.017

• 网络与通信 • 上一篇    下一篇

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

万 博 a,卢 昱 b,陈立云 a,申吉红 a   

  1. (军械工程学院 a. 计算机工程系;b. 训练部,石家庄 050003)
  • 收稿日期:2011-04-08 出版日期:2011-10-20 发布日期:2011-10-20
  • 作者简介:万 博(1986-),男,硕士研究生,主研方向:QoS路由算法;卢 昱,教授、博士生导师;陈立云,副教授;申吉红,讲师、硕士

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

WAN Bo a, LU Yu b, CHEN Li-yun a, SHEN Ji-hong a   

  1. (a. Department of Computer Engineering; b. Department of Training, Ordnance Engineering College, Shijiazhuang 050003, China)
  • Received:2011-04-08 Online:2011-10-20 Published:2011-10-20

摘要: 服务质量(QoS)路由算法缺少拥塞规避机制,会影响业务QoS。为此,提出一种基于Ant-Pub&Enco的信息素模型,根据蚂蚁行进方向,利用相反的信息素引导模式以及不同的信息素更新策略进行路由搜索。基于改进蚁群算法设计一种规避拥塞算法求解QoS单播路 由问题。仿真结果表明,该算法能够有效规避网络中的拥塞链路,均衡网络负载。

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

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.

Key words: Ant Colony Algorithm(ACA), congestion avoidance, Quality of Service(QoS), QoS routing algorithm, pheromone model

中图分类号: