Abstract
The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the execution of message-passing algorithms. Like most existing protocols for mobile agents, this simulation protocol works correctly only if the agents are fault-free.
We consider the problem of performing the simulation of message-passing algorithms when the simulating agents may crash unexpectedly. We show how to simulate any distributed algorithm for the message-passing model in a mobile-agents system with k agents, tolerating up to f ≤ k − 1 crashes during the simulation. Two fault-tolerant simulation algorithms are presented, one for non-anonymous settings (i.e., where either the networks nodes or the agents or both have distinct identities), and one for anonymous systems (where both the network nodes and the agents are anonymous). In both cases, the simulation overhead is polynomial.
Unlike the existing fault-free simulation algorithm, both our protocols are able to detect termination even if the simulated algorithm has no explicit termination detection.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afek, Y., Gafni, E.: Distributed algorithms for unidirectional networks. SIAM Journal on Computing 23(6), 1152–1178 (1994)
Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th ACM Symp. on Theory of Computing (STOC ’80), pp. 82–93 (1980)
Barrière, L., et al.: Capture of an intruder by mobile agents. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA’02), pp. 324–332 (2002)
Barrière, L., et al.: Can we elect if we cannot compare? In: Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA’03), pp. 200–209 (2003)
Bender, M., et al.: The power of a pebble: Exploring and mapping directed graphs? In: Proc. 30th ACM Symp. on Theory of Computing (STOC’98), pp. 269–287 (1998)
Fraigniaud, P., et al.: Distributed Chasing of Network Intruders. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 70–84. Springer, Heidelberg (2006)
Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001)
Chalopin, J., et al.: Mobile agents algorithms versus message passing algorithms. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006)
Das, S., et al.: Distributed exploration of an unknown graph. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 99–114. Springer, Heidelberg (2005)
Dobrev, S., et al.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. Distributed Computing, to appear. Preliminary version in: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC’02), pp. 153–162 (2002)
Flocchini, P., Luccio, F.L., Huang, M.: Decontamination of chordal rings and tori using mobile agents. International Journal of Foundation of Computer Science (To appear) (2007)
Fraigniaud, P., Ilcinkas, D.: Digraph exploration with little memory. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 246–257. Springer, Heidelberg (2004)
Fukuda, M., et al.: Messages versus messengers in distributed programming. In: Proc. 17th international Conference on Distributed Computing Systems (ICDCS ’97), pp. 347–354 (1997)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)
Klasing, R., et al.: Hardness and approximation results for black hole search in arbitrary networks. Theoretical Computer Science (To appear) (2007)
Korach, E., Kutten, S., Moran, S.: A modular technique for the design of efficient distributed leader finding algorithms. ACM Trans. Program. Lang. Syst. 12(1), 84–101 (1990)
Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile Agent Rendezvous: A Survey. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 1–9. Springer, Heidelberg (2006)
Kutten, S.: Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map. In: Proc. of 9th Int. Conference on Computer Communication (ICCC’88), pp. 446–452 (1988)
Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. International Journal of Foundation of Computer Science (To appear) (2007)
Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proc. of the 18th annual ACM Symp. on Principles of Distributed Computing (PODC ’99), pp. 173–179 (1999)
Shavit, N., Francez, N.: A new approach to detection of locally indicative stability. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 344–358. Springer, Heidelberg (1986)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I–Characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems 7(1), 69–89 (1996)
Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610–621. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Das, S., Flocchini, P., Santoro, N., Yamashita, M. (2007). Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. In: Prencipe, G., Zaks, S. (eds) Structural Information and Communication Complexity. SIROCCO 2007. Lecture Notes in Computer Science, vol 4474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72951-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72951-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72918-1
Online ISBN: 978-3-540-72951-8
eBook Packages: Computer ScienceComputer Science (R0)