A mobile agent-based routing algorithm and some theoretical analysis

摘要

In this paper, we focus on the problem of using mobile agents executing in peer-to-peer networks. We propose a mobile agent-based routing algorithm in which mobile agents are classified into three kinds: inner agents, outer agents, and worker agents. Inner agents roam inside peer groups, outer agents routing among peer groups, and outer agents execute users' tasks on behalf of the users. During agents routing process, the network traffic is considered. For each step, mobile agents select their targets based on a probability distribution. We mathematically model the search process of mobile agents and provide some theoretical analysis on the defined cost function.