Advertisement

Byzantine Gathering in Networks with Authenticated Whiteboards

  • Masashi TsuchidaEmail author
  • Fukuhito Ooshita
  • Michiko Inoue
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10167)

Abstract

We propose an algorithm for the gathering problem of mobile agents in Byzantine environments. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is known to agents. Since the existing algorithm achieves gathering without a whiteboard in \(\tilde{O}(n^9\lambda )\) time, where n is the number of nodes and \(\lambda \) is the length of the longest ID, our algorithm shows an authenticated whiteboard can significantly reduce the time for the gathering problem in Byzantine environments.

Keywords

Mobile Agent Current Node Initial Node Port Number Consensus Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Bouchard, S., Dieudonné, Y., Ducourthial, B.: Byzantine gathering in networks. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 179–193. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-25258-2_13 CrossRefGoogle Scholar
  2. 2.
    Cao, J., Das, S.K.: Mobile Agents in Networking and Distributed Computing. Wiley-Interscience, Hoboken (2012)CrossRefGoogle Scholar
  3. 3.
    Czyzowicz, J., Kosowski, A., Pelc, A.: Time versus space trade-offs for rendezvous in trees. Distrib. Comput. 27(2), 95–109 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25(2), 165–178 (2012)CrossRefzbMATHGoogle Scholar
  5. 5.
    Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46(1), 69–96 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11(1), 1:1–1:28 (2014). Article 1MathSciNetCrossRefGoogle Scholar
  7. 7.
    Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656–666 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), 17 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399(1–2), 141–156 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring, 1st edn. Morgan and Claypool Publishers (2010). ISBN: 1608451364, 9781608451364Google Scholar
  11. 11.
    Ooshita, F., Kawai, S., Kakugawa, H., Masuzawa, T.: Randomized gathering of mobile agents in anonymous unidirectional ring networks. IEEE Trans. Parallel Distrib. Syst. 25(5), 1289–1296 (2014)CrossRefGoogle Scholar
  12. 12.
    Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331–347 (2012)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Sudo, Y., Baba, D., Nakamura, J., Ooshita, F., Kakugawa, H., Masuzawa, T.: A single agent exploration in unknown undirected graphs with whiteboards. IEICE Trans. 98–A(10), 2117–2128 (2015)CrossRefGoogle Scholar
  14. 14.
    Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12:1–12:15 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Tsuchida, M., Ooshita, F., Inoue, M.: Byzantine gathering in networks with authenticated whiteboards. NAIST Information Science Technical report, NAIST-IS-TR2016001 (2016)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Masashi Tsuchida
    • 1
    Email author
  • Fukuhito Ooshita
    • 1
  • Michiko Inoue
    • 1
  1. 1.Nara Institute of Science and TechnologyIkomaJapan

Personalised recommendations