The ant colony optimization algorithm

"In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs."

AntNet is an algorithm for adaptive best-effort routing in IP networks. AntNet's design is based on the Ant Colony Optimization (ACO) framework.

"ACO features a multi-agent organization, stigmergic communication among the agents, distributed operations, use of a stochastic decision policy to construct solutions, stigmergic learning of the parameters of the decision policy. AntNet, as well as most of the other ACO routing algorithms designed after AntNet, exhibits a number of interesting properties: it works in a fully distributed way, is highly adaptive to network and traffic changes, uses lightweight mobile agents (called ants) for active path sampling, is robust to agent failures, provides multipath routing, and automatically takes care of data load spreading." Dr. Gianni Di Caro is AntNet Creator and Currently senior researcher at Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), in Lugano, Switzerland. The AntNet Algorithm for the Network Simulator NS-2 (www.isi.edu/nsnam/ns) is maintained by Richardson Lima .

Thursday, August 30, 2012

STANFORD “ANTNET”: LE FORMICHE LAVORANO COME INTERNET

"Apparentemente le formiche e Internet non hanno molto in comune, tuttavia due ricercatori di Stanford hanno scoperto che invece il sistema usato dalle formiche per raccogliere il cibo è concettualmente uguale agli algoritmi usati per il funzionamento di Internet. Deborah Gordon, docente di Biologia dell’università, studia le formiche da oltre 20 anni e per capire in che modo le formiche determinano quante formiche servono per trasferire una fonte di cibo, ha contattato Balaji Prabhakar, docente di informatica ed esperto nel trasferimento dei dati.Grazie...

Thursday, August 2, 2012

Online AntNet Simulator

http://w3.ualg.pt/~pcardoso/antnet_simulator/main.h...

Examples of the algorithm Reviewed AntNet: Data Structures

Routing Table For any one destination d, and for each neighbor node n, is likely Pnd, which represents the "trend" to choose the node n as part of the path to the destination d. Local Traffic Statistics Contains information about the distribution of traffic across the network. AntNet: Description of the algorithm At each time interval t, at each node n is created an ant (Forward Ant), with a pseudo-random target (dependent on traffic patterns). The goal of each ant is to find a path from origin to destination, and let each node visited, useful...

Artificial ants (AntNet)

AntNet is an algorithm to adapt the best effort routing in IP networks. AntNet's design is based on ant colony optimization (ACO), which explores the mechanisms behind the behavior of ants, using the shortest way to define a meta-heuristic inspired by nature for combinatorial optimization. The ACO is characterized by a multi-agent using estigmergia communication between agents (distributed transactions), using a stochastic policy decision to build solutions, estigmergia learning the parameters of the policy decision. It has been successfully applied...

Real ants

The behavior in search of food in many societies of ants is based on indirect communication based on pheromones. While walking from the nest to food sources and vice versa, ants leave a chemical trail (pheromone) forming a trail for other an...

Metrics and goals of the routing

The metrics can be defined as delay in the delivery of packets (seconds), service quality, speed at which packets are sent (bits / second), the network resources used. Have the goals may be too much load, increase the amount of packets sent on the same average delay, with low (decreasing the average delay of each packe...

ACO - Algorithm Routing in Networks

The routing algorithm is distributed throughout the network, you must choose the best path to take the packages to your destination and avoid congestion. Most algorithms using data structures in the nodes (Routing Tables), these structures are both databases and local models of global state, the information such as store and update depends on the algorithm used...

Estigmergia

Term introduced by the French zoologist Pierre-Paul Grasse in 1959. Estigmergia: Greek stigma (mark, sign) + ergon (action, work), the term refers to the notion that an action of a particular agent ceases signals in the environment, and this signal can be perceived by other agents (usually the same species) in order to incite or determine its subsequent actions. In real ants, this signal (or communication) is made by deposition of pheromone in the environment. The shortest paths emerge from the collective behavior through: A choice location and...

ACO: Pseudo-code

1: Initialize parameters 2: Initialize array heuristic 3: Initialize the pheromone matrix 4: while stopping conditions not satisfied do 5: to build solutions 6: Apply Local Search (optional) 7: Pheromone Update 8: end while 9: View best solution 10: S...

Introduction ACO AntNet

Currently, researchers around the world propose new methods to solve classical problems or complex, so simple and / or efficient. A simple proof of this are the new optimization techniques based on swarm intelligence, where through cooperation between individuals, directly or indirectly, can be a better adaptation of the environment. An example of a swarm intelligence technique is the ant colony optimization (ACO), inspired by the behavior of agents (artificial ants) in search of alimento.A ant colony optimization, originally described by Dorigo...

ACO

I present this site, a stochastic meta-heuristic inspired by nature, based on Ant Colony Optimization for (ACO), originally formulated for combinatorial optimization problems, and a Genetic Algorithm (AntNet) to solve the problem of routing in IP networks. Solving the problem of routing in IP networks is complex because it involves a search in a huge search space that grows as the number of nodes, making it impractical to use exact methods. The proposed algorithm is Antnet to obtain good results, so as to circumvent the question of the complexity...

Antnet abstract

AntNet AntNet is an algorithm for adaptive best-effort routing in IP networks. AntNet’s design is based on the Ant Colony Optimization (ACO) framework, which exploits the mechanisms behind the shortest path behavior observed in ant colonies to define a Nature-inspired metaheuristic for combinatorial optimization. ACO features a multi-agent organization, stigmergic communication among the agents, distributed operations, use of a stochastic decision policy to construct solutions, stigmergic learning of the parameters of the decision...

Download AntNet

Download the Antnet Algorithm https://github.com/richardsonlima/antnet/downlo...

AntNet Algorithm on Google+

AntNet is an algorithm for adaptive best-effort routing in IP networks. https://plus.google.com/b/108902716282114833896/108902716282114833896/po...

Gianni Di Caro publication about AntNet implementation for NS-2

Gianni Di Caro ,senior researcher at Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), in Lugano, Switzerland says [ Software implementations of AntNet ] "Lavina Jain made an implementation of AntNet for NS-2 (that can be also downloaded here). Starting from Jain's code, Richardson Lima has released a revised and updated version of AntNet for NS-2.33. Since I'm not an NS-2 user, I haven't checked these implementations, but I guess the Lima's implementation can be used as a good starting point. If you plan to use Lima's code,...

AntNet Algorithm Source Code on github

https://github.com/richardsonlima/antnet...

AntNet Algorithm on ENSC427: COMMUNICATION NETWORKS SPRING 2011

"One of the implementations for routing in MANET is Antnet, first developed by Lavina Jain and later updated by Richardson Lima[1]. Inspired by the foraging behaviour of ants when they search for food and the swarm intelligence to the optimized path between a food source and colony, each node in a MANET stores routing information for the neighbouring nodes and their usage as pheromone values and routes incoming packets to the path with the highest pheromone value. However, during initialization and route discovery phase, all the pheromone values...