Abstract
Orphan detection in distributed systems is a well-researched field for which many solutions exist. These solutions exploit well defined parent-child relationships given in distributed systems. But they are not applicable in mobile agent systems, since no similar natural relationship between agents exist. Thus new protocols have to be developed. In this paper one such protocol for controlling mobile mobile agents and for orphan detection is presented. The “shadow” approach presented in this paper uses the idea of a placeholder (shadow) which is assigned by the agent system to each new agent. This defines an artificial relationship between agents and shadow. The shadow records the location of all dependent agents. Removing the root shadow implies that all dependent agents are declared orphan and are eventually be terminated. We introduce agent proxies that create a path from shadow to every agent. In an extension of the basic protocol we additionally allow the shadow to be mobile.
The shadow approach can be used for termination of groups of agents even if the exact location of each single agent is not known.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Strasser M, Baumann J, Hohl F. Mole: A java based mobile agent system. In: Workshop reader ECOOP '96. d-punkt verlag, 1996; 327–334
Baumann J, Hohl F, Rothermel K, Strasser M. Mole: concepts of a mobile agent system. In: World Wide Web J (in press), Special issue on software agents
IBM. The aglets workbench. URL:http://www.trl.ibm.co.jp/aglets/
White JE. Telescript technology: the foundation of the electronic marketplace. General Magic, 1994
General Magic. Odyssey Website. URL: http://www.genmagic.com/agents/
Baumann J, Tschudin C, Vitek J. Mobile object systems: workshop summary. Workshop proceedings for the 2nd Workshop on Mobile Object Systems. In: Workshop Reader ECOOP '96. d-punkt. verlag, 1996; 301–308
Baumann J, Hohl F, Radouniklis N, Rothermel K, Strasser M. Communication concepts for mobile agent systems. In: Mobile Agents '97. Lecture Notes in Computer Science 1219, Springer-Verlag, Berlin Heidelberg New York, 1997; 123–135
Baumann J, Radouniklis N. Agent groups for mobile agent systems. In: Distributed applications and interoperable systems. König H et al. (eds) Chapman & Hall, London, 1997; 74–85
Baumann J. A protocol for orphan detection and termination in mobile agent systems. Tech. Report 1997/09. Faculty of Computer Science, University of of Stuttgart, 1997
Mattern F. Verteilte Algorithmen. Springer-Verlag, Berlin Heidelberg New York, 1989
Tel G. Distributed algorithms, Cambridge University Press, Cambridge, 1994
Shapiro M, Dickman P, Plainfossé D. SSP chains: robust, distributed references supportting acyclic garbage collection. Tech. Report 1799, INRIA, Rocquencourt, France, 1992
Tel G, Mattern F. The derivation of distributed termination detection algorithms from garbage collection schemes. ACM TOPLAS 1993 15(1):1–35
Baumann J, Rothermel K. The shadow approach: an orphan detection protocol for mobile agents. Tech. Report 1998/08. Faculty of Computer Science, University of Stuttgart, 1998
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baumann, J., Rothermel, K. The shadow approach: An orphan detection protocol for mobile agents. Personal Technologies 2, 100–108 (1998). https://doi.org/10.1007/BF01324940
Issue Date:
DOI: https://doi.org/10.1007/BF01324940