Parallel Architectures, Algorithms, and Networks, International Symposium on (1999)
June 23, 1999 to June 25, 1999
Marc Bui , Universite Paris 8
Ajoy K. Datta , University of Nevada at Las Vegas
Olivier Flauzac , Universite de Technologie de Compiegne
Dai Tho Nguyen , Universite de Technologie de Compiegne
Mobile agent has been shown to be a convenient, efficient, and robust approach to designing distributed protocols. This paper introduces an adaptive, mobile-agents-based routing algorithm. While performing a random walk through the network, mobile agents sense changes in network state, and trigger the computation of updated values for the routing tables. The randomized moving strategy exerts a negligible and balanced impact on the network resources, both in terms of bandwidth and computation. The memory requirement is very moderate. The correctness of the protocol is proven and its complexity is analyzed.
Distributed computing, routing, mobile agents, random walks
D. T. Nguyen, A. K. Datta, M. Bui and O. Flauzac, "Randomized Adaptive Routing Based on Mobile Agents," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Fremantle, Australia, 1999, pp. 380.