loading...
Implementation and Evaluation of AntNet, A Distributed Shortest-Path Algorithm
Lisbon, Portugal July 17-July 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AICT.2005.48Advanced Industrial Conference on Tel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matthias Strobbe, Ghent University
Vincent Verstraete, Ghent University
Erik Van Breusegem, Ghent University
Jan Coppens, Ghent University
Mario Pickavet, Ghent University
Piet Demeester, Ghent University
In the last decade, the OSPF 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). In this paper, we present our implementation and evaluation of an alternative: AntNet [1]. 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.
Citation:
Matthias Strobbe, Vincent Verstraete, Erik Van Breusegem, Jan Coppens, Mario Pickavet, Piet Demeester, "Implementation and Evaluation of AntNet, A Distributed Shortest-Path Algorithm," aict-sapir-elete, pp.320-325, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.