Title :
A new dynamic distributed routing algorithm on telecommunication networks
Author :
Li, Lianyuan ; Liu, Zemin ; Zhou, Zheng
Author_Institution :
Beijing Univ. of Posts & Telecommun., China
Abstract :
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
Keywords :
distributed algorithms; probability; telecommunication network routing; telecommunication traffic; ant colony routing; connection-oriented telecommunication networks; dynamic distributed routing algorithm; link loads; newly arriving calls; path lengths; performance; pheromone tables; probabilities; shortest path; Electronic mail; Heuristic algorithms; Routing; Vehicle dynamics; Vehicles;
Conference_Titel :
Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-6394-9
DOI :
10.1109/ICCT.2000.889326
