TY - GEN
T1 - An efficient mailbox-based algorithm for message delivery in mobile agent systems
AU - Feng, Xinyu
AU - Cao, Jiannong
AU - Lü, Jian
AU - Chan, Chun Bun Henry
PY - 2001/1/1
Y1 - 2001/1/1
N2 - Agent mobility presents challenges to the design of efficient message transport protocols for mobile agent communications. A practical mobile agent communication protocol should provide location transparency to the programmer and thus need to keep track of the movement of an agent. In addition, because of the asynchronous nature of message passing and agent migration, how to guarantee the delivery of messages to highly mobile agents is still an active research topic in mobile agent systems. In this paper we propose an efficient mailbox-based algorithm for inter-mobile agent communications. The algorithm decentralizes the role of the origin (home) host in locating an agent. Furthermore, by separating the mailbox from its owner agent, the algorithm can be made adaptive and is efficient in terms of location updating and message delivery. In the cases that mobile agents migrate frequently but seldom communicate, our algorithm turns out to be preferable.
AB - Agent mobility presents challenges to the design of efficient message transport protocols for mobile agent communications. A practical mobile agent communication protocol should provide location transparency to the programmer and thus need to keep track of the movement of an agent. In addition, because of the asynchronous nature of message passing and agent migration, how to guarantee the delivery of messages to highly mobile agents is still an active research topic in mobile agent systems. In this paper we propose an efficient mailbox-based algorithm for inter-mobile agent communications. The algorithm decentralizes the role of the origin (home) host in locating an agent. Furthermore, by separating the mailbox from its owner agent, the algorithm can be made adaptive and is efficient in terms of location updating and message delivery. In the cases that mobile agents migrate frequently but seldom communicate, our algorithm turns out to be preferable.
UR - http://www.scopus.com/inward/record.url?scp=84948149315&partnerID=8YFLogxK
M3 - Conference article published in proceeding or book
SN - 3540429522
SN - 9783540429524
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 135
EP - 151
BT - Mobile Agents - 5th International Conference, MA 2001, Proceedings
PB - Springer Verlag
T2 - 5th International Conference on Mobile Agents, MA 2001
Y2 - 2 December 2001 through 4 December 2001
ER -