Loading [MathJax]/extensions/TeX/euler_ieee.js
Implementation and evaluation of AntNet, a distributed shortest-path algorithm | IEEE Conference Publication | IEEE Xplore

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


Abstract:

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 networ...Show More

Abstract:

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.
Date of Conference: 17-20 July 2005
Date Added to IEEE Xplore: 17 October 2005
Print ISBN:0-7695-2388-9
Conference Location: Lisbon, Portugal

References

References is not available for this document.