AntNet is an innovative algorithm for packet routing in communication networks, originally proposed by M. Dorigo and G. Di Caro, in 1997. In AntNet, a group of mobile agents (or artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables. This work analyzes AntNet and proposes improvements that were impl...

In this paper, a new efficient hardware architecture and its implementation for an AntNet-based routing are proposed. This architecture is based on the modified AntNet algorithm, and optimized to the ant packets defined in this paper. The modified AntNet is evaluated by the performance comparisons with the original AntNet algorithm through C-level simulations, and then implemented into RTL desi...

This paper introduces AntNet, a new routing algorithm for telecommunication networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet in a datagram network and compare it with both static and adaptive state-ofthe-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial...

AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In previous works, the efficiency of the AntNet algorithm has been verified in dynamic traffic environments. In spite of this merit, its implementation has been limited till now. There are implementation constraints due to complex arithmetic calculations for determining a reinforcement value a...

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...

This paper introduces AntNet, a new routing algorithm for communications networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet to a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial t...

AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables. This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to th...

This paper introduces AntNet, a novel adaptive approach to routing tables learning in connectionless communications networks. AntNet is inspired by the stigmergy communication model observed in ant colonies. We compare AntNet with the current Internet routing algorithm (OSPF), some old Internet routing algorithms (SPF and distributed adaptive Bellman-Ford), and recently proposed forms of asynch...

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...

✝ This work was partially supported by a DIPRI Research Grant of the National University of Asuncion. Abstract-AntNet is a new algorithm for packet routing in communication networks, firstly proposed by M. Dorigo and G. Di Caro (1997). In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing...