loading...
Randomized Adaptive Routing Based on Mobile Agents
Fremantle, Australia June 23-June 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.7789681999 International Symposium on Paral ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Marc Bui, Ajoy K. Datta, Olivier Flauzac, Dai Tho Nguyen, "Randomized Adaptive Routing Based on Mobile Agents," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 380, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1999.778968,
author = {Marc Bui and Ajoy K. Datta and Olivier Flauzac and Dai Tho Nguyen},
title = {Randomized Adaptive Routing Based on Mobile Agents},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1999},
issn = {1087-4089},
pages = {380},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778968},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Randomized Adaptive Routing Based on Mobile Agents
SN - 1087-4089
SP
EP
A1 - Marc Bui,
A1 - Ajoy K. Datta,
A1 - Olivier Flauzac,
A1 - Dai Tho Nguyen,
PY - 1999
KW - Distributed computing
KW - routing
KW - mobile agents
KW - random walks
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
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.
Index Terms:
Distributed computing, routing, mobile agents, random walks
Citation:
Marc Bui, Ajoy K. Datta, Olivier Flauzac, Dai Tho Nguyen, "Randomized Adaptive Routing Based on Mobile Agents," ispan, pp.380, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.