认知网络中的拥塞规避多径路由算法

Multiple-Path Routing Algorithm with Congestion Avoidance in Cognitive Networks

链路拥塞导致的数据包传输延时或者数据包丢弃使得网络无法保证业务的QoS,而目前普遍使用的链路状态路由算法不具有拥塞响应机制.本文针对以上问题,提出了一种能够快速规避拥塞的多径路由算法,该算法通过改进蚂蚁算法,在拥塞发生时采用双向蚂蚁寻路的方法,提高了新路径搜索的速度;使用新的寻路准则使其更满足认知网络的QoS需求.使用OPNET仿真比较,表明该算法在控制网络丢包率、时延、剩余带宽方面均具有较好的性能.

The delay and loss of data packets,which caused by the links congestion,will lower down the users′ QoS.While the present link state routing algorithms don＇t possess congestion avoidance mechanism.This paper proposes an ant-based multiple-path routing algorithm with congestion avoidance,in order to solve the above problems.It improves the ant colony algorithm,and adopts double-way ant-exploration method to speed up the exploration of optimal routes.The new searching routings guidance better satisfies the demands of QoS.Simulation contrast with OPNET shows that the algorithm is valid and effective at controlling packet loss ratio,delay and residual bandwidth.