Implementation and evaluation of AntNet, a distributed shortest-path algorithm

In the last decade, the OSPF (open shortest path first) routing protocol has proven its robustness, but it also has some major drawbacks. It reacts quite slowly to network changes, and load balancing is limited to paths with equal cost (ECMP). We present our implementation and evaluation of an alter...

Full description

Saved in:
Bibliographic Details
Published inAdvanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05) pp. 320 - 325
Main Authors Strobbe, M., Verstraete, V., Van Breusegem, E., Coppens, J., Pickavet, M., Demeester, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Ant colony optimization
Costs
Data structures
Delay
Genetic algorithms
Information technology
Load management
Neural networks
Robustness
Routing protocols
Online AccessGet full text

Cover

More Information
Summary:In the last decade, the OSPF (open shortest path first) routing protocol has proven its robustness, but it also has some major drawbacks. It reacts quite slowly to network changes, and load balancing is limited to paths with equal cost (ECMP). We present our implementation and evaluation of an alternative: AntNet (Di Caro, G. and Dorigo, M., "AntNet: A Mobile Agents Approach to Adaptive Routing", Technical Report IRIDIA, 1997). AntNet is a distributed shortest-path algorithm based on the principles of ant colony optimization that takes care of load balancing in a very natural way.
ISBN:0769523889
9780769523880
DOI:10.1109/AICT.2005.48