Some analysis on mobile-agent based network routing

Author

Qu, Wenyu ; Shen, Hong

Author_Institution

Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan

fYear

2004

fDate

10-12 May 2004

Firstpage

12

Lastpage

17

Abstract

Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. This paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding the destination) and the distribution of mobile agents running in the network. To our knowledge, little work has been done on these two aspects. Our results show that the number of mobile agents can be controlled by adjusting the number of agents generated per request and the number of jumps each mobile agent can move. Thus, we can improve network performance by tuning relevant parameters.

Keywords

computer networks; mobile agents; probability; telecommunication network routing; agent population; destination finding probability; mobile agents; network performance; network routing; Computer networks; Delay; Distributed computing; Encapsulation; Fault tolerance; Information science; Mobile agents; Protocols; Robustness; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

ISSN

1087-4089

Print_ISBN

0-7695-2135-5

Type

conf

DOI

10.1109/ISPAN.2004.1300450

Filename

1300450