Skip to main content
Springer Nature Link
Log in

How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10616))

  • 1175 Accesses

Abstract

We propose a fault-tolerant algorithm to simulate message-passing algorithms in mobile agent systems. We consider a mobile agent system with k agents where f of them may crash for a given f (\(\le k-1\)). The algorithm simulates a message-passing algorithm, say Z, with \(O((m+M)f)\) total agent moves where m is the number of links in the network and M is the total number of messages created in the simulated execution of Z. The previous algorithm [5] can tolerate \(k-1\) agent crashes but requires \(O((m+nM)k)\) total agent moves. Therefore, our algorithm improves the total number of agent moves for \(f=k-1\) and requires a smaller number of total moves if f is smaller.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 200–209. ACM (2002)

    Google Scholar 

  2. Blin, L., Fraigniaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 70–84. Springer, Heidelberg (2006). doi:10.1007/11780823_7

    Chapter  Google Scholar 

  3. Cao, J., Das, S.K.: Mobile Agents in Networking and Distributed Computing. Wiley, Hoboken (2012)

    Book  Google Scholar 

  4. Chalopin, J., Godard, E., Métivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006). doi:10.1007/11945529_14

    Chapter  Google Scholar 

  5. Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Fault-tolerant simulation of message-passing algorithms by mobile agents. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 289–303. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72951-8_23

    Chapter  Google Scholar 

  6. Das, S., Mihalák, M., Šrámek, R., Vicari, E., Widmayer, P.: Rendezvous of mobile agents when tokens fail anytime. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 463–480. Springer, Heidelberg (2008). doi:10.1007/978-3-540-92221-6_29

    Chapter  Google Scholar 

  7. Dieudonné, Y., Pelc, A.: Deterministic network exploration by a single agent with byzantine tokens. Inf. Process. Lett. 112(12), 467–470 (2012)

    Article  MathSciNet  Google Scholar 

  8. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distrib. Comput. 19(1), 1–18 (2006)

    Article  Google Scholar 

  9. Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer Science & Business Media, London (2013). doi:10.1007/978-1-4471-5173-9

    Book  MATH  Google Scholar 

  10. Flocchini, P., Huang, M.J., Luccio, F.L.: Decontaminating chordal rings and tori using mobile agents. Int. J. Found. Comput. Sci. 18(03), 547–563 (2007)

    Article  MathSciNet  Google Scholar 

  11. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoret. Comput. Sci. 384(2–3), 201–221 (2007)

    Article  MathSciNet  Google Scholar 

  12. Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. Int. J. Found. Comput. Sci. 18(03), 457–474 (2007)

    Article  MathSciNet  Google Scholar 

  13. Suzuki, T., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Move-optimal gossiping among mobile agents. Theoret. Comput. Sci. 393(1–3), 90–101 (2008)

    Article  MathSciNet  Google Scholar 

  14. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan

    Tsuyoshi Gotoh, Hirotsugu Kakugawa & Toshimitsu Masuzawa

  2. Nara Institute of Science and Technology, 8916-5 Takayamacho, Ikoma, Nara, 630-0101, Japan

    Fukuhito Ooshita

Authors
  1. Tsuyoshi Gotoh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fukuhito Ooshita
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hirotsugu Kakugawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Toshimitsu Masuzawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tsuyoshi Gotoh .

Editor information

Editors and Affiliations

  1. University of Liverpool, Liverpool, United Kingdom

    Paul Spirakis

  2. Chalmers University of Technology, Gothenburg, Sweden

    Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gotoh, T., Ooshita, F., Kakugawa, H., Masuzawa, T. (2017). How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults. In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science(), vol 10616. Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69084-1_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69083-4

  • Online ISBN: 978-3-319-69084-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics