基于蚂蚁算法的拥塞规避路由算法  

Ant-based routing algorithm with congestion avoidance

作　　者：林国辉[1] 马正新[1] 王勇前[1] 曹志刚[1] 

机构地区：[1]清华大学电子工程系微波与数字通信技术国家重点实验室,北京100084

出　　处：《清华大学学报（自然科学版）》2003年第1期1-4,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金委员会与香港研究资助局联合资助项目(6001161943);清华大学"九八五"研究基金资助项目;国家"八六三"资助项目(2001AA121062)

摘　　要：对业务提供服务质量(QoS)保证,是提高网络效率的重要方法。现有网络常用的路由算法(比如链路状态路由算法)都不具有拥塞响应机制,当一条链路即将或者已经发生拥塞时,只有简单的丢弃数据包。提出了一种基于蚂蚁算法的拥塞规避路由算法。该算法加速了蚂蚁路由算法探索最优路径的过程,并且能够对链路的拥塞状态做出快速反应,分散流量,以避免链路的拥塞。通过仿真,结果表明:该算法在数据包传输时延和网络丢包率性能上,比现有的链路状态路由算法具有明显的优越性。Quality of service (QoS) and network efficiency are becoming increasingly important in networked society, but commonly used routing algorithms, such as link state routing (LS), have no congestion avoidance mechanism. When congestion occurs, packets are dropped without regard to available bandwidth resources on other links. This paper presents an antbased routing algorithm with congestion avoidance. The algorithm speeds up the exploration of optimal routes in the antbased routing algorithm. The method can detect the congestion status on links and then quickly shift the traffic to an alternate route to avoid congestion. Simulation results show that the algorithm is superior to LS in terms of packet delay and loss probability.

关 键 词：路由算法 蚂蚁算法 拥塞规避 负载均衡 服务质量 网络效率 数据包传输时延 

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