Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05)
Implementation and Evaluation of AntNet, A Distributed Shortest-Path Algorithm
Lisbon, Portugal
July 17-July 22
ISBN: 0-7695-2388-9
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