TY - GEN
T1 - An execution prototype of mobile agent-based peer-to-peer systems
AU - Qu, Wenyu
AU - Kitsuregawa, Masaru
AU - Li, Keqiu
AU - Shen, Hong
PY - 2006
Y1 - 2006
N2 - Peer-to-peer networks are one of the trends in the field of internetworking. Mobile agent-based technology is a newly proposed technology that can be used in peer-to-peer networks. Mobile agents are small software entity that can migrate freely from node to node in heterogeneous networks and has attracted considerable interest in both academia and industry in recent years. In this paper, we focus on the problem of using mobile agents executing in peer-to-peer networks. In our proposed mobile agent-based execution model, 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 proved that this probability distribution is the only distribution that both makes inference on the known traffic information and approximates to a unbiased distribution. We also provide some properties of this probability distribution.
AB - Peer-to-peer networks are one of the trends in the field of internetworking. Mobile agent-based technology is a newly proposed technology that can be used in peer-to-peer networks. Mobile agents are small software entity that can migrate freely from node to node in heterogeneous networks and has attracted considerable interest in both academia and industry in recent years. In this paper, we focus on the problem of using mobile agents executing in peer-to-peer networks. In our proposed mobile agent-based execution model, 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 proved that this probability distribution is the only distribution that both makes inference on the known traffic information and approximates to a unbiased distribution. We also provide some properties of this probability distribution.
KW - Mobile agents
KW - Peer-to-peer
KW - Traffic information
KW - Unbiased distribution
UR - http://www.scopus.com/inward/record.url?scp=33845585449&partnerID=8YFLogxK
U2 - 10.1109/IMSCCS.2006.252
DO - 10.1109/IMSCCS.2006.252
M3 - Conference contribution
AN - SCOPUS:33845585449
SN - 0769525814
SN - 9780769525815
T3 - First International Multi- Symposiums on Computer and Computational Sciences, IMSCCS'06
SP - 330
EP - 338
BT - First International Multi- Symposiums on Computer and Computational Sciences, IMSCCS'06
T2 - First International Multi- Symposiums on Computer and Computational Sciences, IMSCCS'06
Y2 - 20 April 2006 through 24 April 2006
ER -