Ant-based routing algorithm with congestion avoidance
Zhigang Cao · Journal of Tsinghua University(Science and Technology) · 2003
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 antbased routing algorithm with congestion avoidance. The algorithm speeds up the exploration of optimal routes in the antbased 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.