Abstract
Mobile agents are autonomous objects that can migrate from one node to other node of a computer network. Due to communication nodes failures, mobile agents may be blocked or crashed even if there are other nodes available that could continue processing. To solve it, we propose a scheme with the path reordering and backward recovery to guarantee migration of mobile agents in networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
OMG, “Mobile Agent Facility Interoperability Facilities Specification(MAF)”, OMG
General Magic, “Odyssey”, and URL: http://www.genmagic.com/agents/
IBM,“The Aglets Workbench”, URL: http://www.trl.ibmco.jp/aglets
Robert S. G, “AgentTCL: A Flexible and Secure Mobile-Agent System”, TR98-327, Dartmouth Col. June 1997
J. Baumann,“A Protocol for Orphan Detection and Termination in Mobile Agent Systems”, TR-1997-09,Stuttgart Univ. Jul.,1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, D., Jeon, B., Kim, Y.(. (2000). Mobile Agents for Reliable Migration in Networks. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_50
Download citation
DOI: https://doi.org/10.1007/3-540-44491-2_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41450-6
Online ISBN: 978-3-540-44491-6
eBook Packages: Springer Book Archive