A new dynamic distributed routing algorithm on telecommunication networks
Lianyuan Li, Zemin Liu, Zheng Zhou · 2002
A new dynamic distributed routing scheme on connection-oriented telecommunication networks, which is called the ant colony routing (ACR) scheme, is proposed. It is inspired by the phenomena that ants are always able to find the shortest path between food source and nest. In the ACR scheme, pheromone tables, which are tables of probabilities, replace traditional routing tables. They are updated according to both the lengths of paths and loads on links. Routes of newly arriving calls are selected in accordance with pheromones and loads on links. Simulation results show that the performance of ACR scheme is satisfactory.