DocumentCode
1955155
Title
A Survey of Ant Colony Optimization-Based Approaches to Routing in Computer Networks
Author
Janacik, P. ; Orfanus, Dalimir ; Wilke, Andreas
Author_Institution
Heinz Nixdorf Inst., Univ. of Paderborn, Paderborn, Germany
fYear
2013
fDate
29-31 Jan. 2013
Firstpage
427
Lastpage
432
Abstract
Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing, finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.
Keywords
ant colony optimisation; computer networks; routing protocols; ant colony optimization; computer network routing; load balancing; network distribution; routing problem; routing protocol; swarm intelligence; Ad hoc networks; Data structures; Mobile computing; Network topology; Probabilistic logic; Routing; Topology; ant colony optimization; bio-inspiration; networks; routing; self-organization;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems Modelling & Simulation (ISMS), 2013 4th International Conference on
Conference_Location
Bangkok
ISSN
2166-0662
Print_ISBN
978-1-4673-5653-4
Type
conf
DOI
10.1109/ISMS.2013.20
Filename
6498308
Link To Document