Accessibility navigation

Adaptive routing in active networks

Di Fatta, G., Gaglio, S., Lo Re, G. and Ortolani, M. (2000) Adaptive routing in active networks. In: OPENARCH 2000: Third IEEE Conference on Open Architectures and Network Programming - Short Paper Session, 27 March 2000, Tel-Aviv, Israel, pp. 8-11.

Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


New conceptual ideas on network architectures have been proposed in the recent past. Current store-andforward routers are replaced by active intermediate systems, which are able to perform computations on transient packets, in a way that results very helpful for developing and deploying new protocols in a short time. This paper introduces a new routing algorithm, based on a congestion metric, and inspired by the behavior of ants in nature. The use of the Active Networks paradigm associated with a cooperative learning environment produces a robust, decentralized algorithm capable of adapting quickly to changing conditions.

Item Type:Conference or Workshop Item (Paper)
Divisions:No Reading authors. Back catalogue items
Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:6143
Uncontrolled Keywords:artificial life, cooperative learning, active networks


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation