**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 information for future ants. Each Forward Ant saves in its memory, which we visited and the time spent between each one.

## Thursday, August 2, 2012

### Examples of the algorithm Reviewed AntNet: Data Structures

4:50 PM
No comments

Subscribe to:
Post Comments (Atom)

## 0 comentários:

## Post a Comment