Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/70156
Title: An efficient mailbox-based algorithm for message delivery in mobile agent systems
Authors: Feng, X
Cao, J 
Lu, J
Chan, H 
Issue Date: 2001
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2001, v. 2240, p. 135-151 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: 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.
Description: 5th IEEE International Conference on Mobile Agents (MA'01), Atlanta, Georgia, USA, 2-4 December 2001
URI: http://hdl.handle.net/10397/70156
ISBN: 978-3-540-42952-4
978-3-540-45647-6
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/3-540-45647-3_10
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

5
Last Week
0
Last month
Citations as of Feb 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.