Randomized adaptive routing based on mobile agents

Author

Bui, Marc ; Datta, Ajoy K. ; Flauzac, Olivier ; Nguyen, Dai Tho

Author_Institution

Lab. LRIA, Paris VIII Univ., France

fYear

1999

fDate

1999

Firstpage

380

Lastpage

385

Abstract

The mobile agent has been shown to be a convenient, efficient, and robust approach to designing distributed protocols. This paper introduces an adaptive, mobile agent-based routing algorithm. While performing a random walk through the network, mobile agents sense changes in the 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

Keywords

computer networks; distributed programming; protocols; random processes; randomised algorithms; software agents; telecommunication network routing; bandwidth; distributed protocols; mobile agents; random walk; randomized adaptive routing; randomized moving strategy; updated values; Application software; Bandwidth; Computer science; Electrical capacitance tomography; Graph theory; Large-scale systems; Mobile agents; Network topology; Routing protocols; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

Conference_Location

Perth/Fremantle, WA

ISSN

1087-4089

Print_ISBN

0-7695-0231-8

Type

conf

DOI

10.1109/ISPAN.1999.778968

Filename

778968