Advertisement

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

  • Tsuyoshi Gotoh
  • Fukuhito Ooshita
  • Hirotsugu Kakugawa
  • Toshimitsu Masuzawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10616)

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.

References

  1. 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. 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_7CrossRefGoogle Scholar
  3. 3.
    Cao, J., Das, S.K.: Mobile Agents in Networking and Distributed Computing. Wiley, Hoboken (2012)CrossRefGoogle Scholar
  4. 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_14CrossRefGoogle Scholar
  5. 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_23CrossRefGoogle Scholar
  6. 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_29CrossRefGoogle Scholar
  7. 7.
    Dieudonné, Y., Pelc, A.: Deterministic network exploration by a single agent with byzantine tokens. Inf. Process. Lett. 112(12), 467–470 (2012)MathSciNetCrossRefGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 9.
    Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer Science & Business Media, London (2013). doi: 10.1007/978-1-4471-5173-9CrossRefMATHGoogle Scholar
  10. 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)MathSciNetCrossRefGoogle Scholar
  11. 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)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. Int. J. Found. Comput. Sci. 18(03), 457–474 (2007)MathSciNetCrossRefGoogle Scholar
  13. 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)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Tsuyoshi Gotoh
    • 1
  • Fukuhito Ooshita
    • 2
  • Hirotsugu Kakugawa
    • 1
  • Toshimitsu Masuzawa
    • 1
  1. 1.Graduate School of Information Science and TechnologyOsaka UniversitySuitaJapan
  2. 2.Nara Institute of Science and TechnologyIkomaJapan

Personalised recommendations