Abstract
The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for the aforementioned problem, because they were not designed with mobility in mind, or enforce continuous connectivity with the message source, which in many cases defeats the very purpose of using mobile agents.
In this paper, we propose an algorithm that guarantees delivery to highly mobile agents using a technique similar to a distributed snapshot. A number of enhancements to this basic idea are discussed, which limit the scope of message delivery by allowing dynamic creation of the connectivity graph. Notably, the very structure of our algorithm makes it amenable not only to guarantee message delivery to a specific mobile agent, but also to provide multicast communication to a group of agents, which constitutes another open problem in research on mobile agents. After presenting our algorithm and its properties, we discuss its implementability by analyzing the requirements on the underlying mobile agent platform, and argue about its applicability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Artsy and R. Finkel, “Designing a process migration facility: The Charlotte experience,” IEEE Computer, vol. 22, no. 9, pp. 47-56, 1989.
J. Baumann, F. Hohl, N. Radouniklis, K. Rothermel, and M. Straßer, “Communication concepts for mobile agent systems,” in K. Rothermel and R. Zeletin (eds.), Mobile Agents: 1st Int. Workshop MA'97, LNCS 1219, Springer: Berlin, April 1997, pp. 123-135.
J. Baumann and K. Rothermel, “The shadow approach: An orphan detection protocol for mobile agents,” in K. Rothermel and F. Hohl (eds.), Mobile Agents: 2nd Int. Workshop MA'98, LNCS 1477, Springer: Berlin, September 1998, pp. 2-13.
J. Bradshaw (ed.), Software Agents, MIT Press: Cambridge, MA, 1996.
G. Cabri, L. Leonardi, and F. Zambonelli, “Reactive tuple spaces for mobile agent coordination,” in K. Rothermel and F. Hohl, (eds.), Mobile Agents: 2nd Int. Workshop MA'98, LNCS 1477, Springer: Berlin, September 1998, pp. 237-248.
K. M. Chandy and L. Lamport, “Distributed snapshots: Determining global states of distributed systems,” ACM Trans. Computer Systems, vol. 3, no. 1, pp. 63-75, 1985.
D. R. Cheriton, “The V. Kernel: A software base for distributed systems,” IEEE Software, vol. 1, no. 2, pp. 19-42, 1984.
F. Douglis and J. Ousterhout, “Transparent process migration: Design alternatives and the sprite inplementation,” Software-Practice and Experience, vol. 21, no. 8, 1991.
T. Finin, Y. Labrou, and J. Mayfield, “KQML as an agent communication language,” in J. Bradshaw (ed.), Software Agents, MIT Press: Cambridge, MA, 1996.
A. Fuggetta, G. P. Picco, and G. Vigna, “Understanding code mobility,” IEEE Trans. Software Eng., vol. 24, no. 5, pp. 342-361, 1998.
R. S. Gray, G. Cybenko, D. Kotz, and D. Rus, “Agent Tcl,” in Itinerant Agents: Explanations and Examples with CDROM, Manning, 1996.
E. Jul, H. Levy, N. Hutchinson, and A. Black, “Fine-grained mobility in the Emerald system,” ACM Trans. Computer Systems, vol. 6, no. 2, pp. 109-133, 1988.
D. Lange and M. Oshima, Programming and Deploying Mobile Agents with Aglets, Addison-Wesley: Reading, MA, 1998.
B. P. Miller and D. L. Presotto, “DEMOS/MP,” Software-Practice and Experience, vol. 17, no. 4, 1987.
D. Milojicic, M. Breugst, I. Busse, J. Campbell, S. Covaci, B. Friedman, K. Kosaka, D. Lange, K. Ono, M. Oshima, C. Tham, S. Virdhagriswaran, and J. White, “MASIF-The OMG mobile agent system interoperability facility,” PersonalT echnologies, vol. 00, no. 2, pp. 117-129, 1998.
A. L. Murphy, G.-C. Roman, and G. Varghese, “An exercise in formal reasoning about mobile computations,” in Proc. 9th Int. Workshop on Software Specification and Design, IEEE Computer Society Press, 1998, pp. 25-33.
ObjectSpace Inc., Voyager ORB 3.0-Developer Guide, 1999. objectspace.com.
C. E. Perkins, “IP mobility support,” RFC 2002, IETF Network Working Group, October 1996.
G. P. Picco, “µCode: A lightweight and flexible mobile code toolkit,” in K. Rothermel and F. Hohl, (eds.), Mobile Agents: 2nd Int. Workshop MA'98, LNCS 1477, Springer: Berlin, September 1998, pp. 160-171.
G. P. Picco, A. L. Murphy, and G.-C. Roman, “Lime: Linda meets mobility,” in D. Garlan (ed.), Proc. 21st Int. Conf. on Software Engineering, May 1999, pp. 368-377.
K. Rothermel and F. Hohl, (eds.), Mobile Agents: 2nd Int. Workshop MA'98, LNCS 1477, Springer: Berlin, September 1998.
J. E. White, “Telescript technology: mobile agents,” in J. Bradshaw (ed.), Software Agents, MIT Press: Cambridge, MA, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Murphy, A.L., Pietro Picco, G. Reliable Communication for Highly Mobile Agents. Autonomous Agents and Multi-Agent Systems 5, 81–100 (2002). https://doi.org/10.1023/A:1013449017690
Issue Date:
DOI: https://doi.org/10.1023/A:1013449017690