Statistical behaviors of mobile agents in network routing

  • Authors:

  • Wenyu Qu;Keqiu Li;Masaru Kitsuregawa;Weilian Xue

  • Affiliations:

  • School of Computer Science and Technology, Dalian Maritime University, Dalian, China 116026 and Institute of Industrial Science, The University of Tokyo, Tokyo, Japan 153-8505;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 116024;Institute of Industrial Science, The University of Tokyo, Tokyo, Japan 153-8505;School of Management, Liaoning Normal University, Dalian, China 116029

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mobile agent-based network routing is a new technique for routing in large-scale networks. An analysis of the searching activity and population growth of mobile agents is important for improving performance in agent-driven networks. In this paper, we describe a general execution model of mobile agents for network routing and classify it into two cases. For each case, we analyze the population distribution of mobile agents (the distribution of mobile agents running in the network) and the probability of success (the probability that an agent can find its destination). We also perform extensive experiments for various network topologies to validate our analytical results. Both theoretical and experimental results show that the population distribution and the probability of success of mobile agents can be controlled by locally adjusting relevant parameters, such as the number of agents generated per request, the number of jumps each mobile agent can move, etc. Our results reveal new theoretical insights into the statistical behaviors of mobile agents and provide useful tools for effectively managing mobile agents in large networks.