By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
M. Strobbe ; Dept. of Inf. Technol., Ghent Univ., Belgium ; V. Verstraete ; E. Van Breusegem ; J. Coppens
more authors

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.

Published in:

Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05)

Date of Conference:

17-20 July 2005