Skip to main content

Black Hole Search Despite Byzantine Agents

  • 303 Accesses

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

Abstract

We study the black hole search problem of k mobile agents in synchronous Byzantine environments. The goal of the black hole search problem is to detect a black hole node, which deletes all agents visiting the node without any trace. We assume that the graph topology is arbitrary, each agent has a unique ID, and at most \(f_u\) strongly Byzantine agents exist. Under these assumptions, we propose an algorithm that detects a black hole node in \(O(f_u n)\) rounds when \(k \ge 2f_u+2\) holds, where n is the number of nodes. We also show that it is impossible to solve the black hole search problem when \(k \le 2c_u +1\) holds, where \(c_u\) is an upper bound of the number of crash agents. Since a crash fault is a special case of a Byzantine fault, the above result also applies to strongly Byzantine agents. This implies that our proposed algorithm is optimal in terms of the number of tolerable faulty agents. To the best of our knowledge, this is the first work to address the black hole search problem with Byzantine agents.

Keywords

  • Mobile agent
  • Black hole search problem
  • Synchronous network
  • Byzantine fault

This work was supported in part by JSPS KAKENHI Grant Number 18K11167 and JST SICORP Grant Number JPMJSC1806.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-34992-9_28
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-34992-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)

References

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

    CrossRef  Google Scholar 

  2. Chalopin, J., Das, S., Labourel, A., Markou, E.: Black hole search with finite automata scattered in a synchronous torus. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 432–446. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24100-0_41

    CrossRef  Google Scholar 

  3. Cooper, C., Klasing, R., Radzik, T.: Searching for black-hole faults in a network using multiple agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 320–332. Springer, Heidelberg (2006). https://doi.org/10.1007/11945529_23

    CrossRef  Google Scholar 

  4. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48(1), 67–90 (2007)

    MathSciNet  CrossRef  Google Scholar 

  5. Dobrev, S., Královič, R., Santoro, N., Shi, W.: Black hole search in asynchronous rings using tokens. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 139–150. Springer, Heidelberg (2006). https://doi.org/10.1007/11758471_16

    CrossRef  Google Scholar 

  6. Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: optimal black hole search with pure tokens. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 227–241. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87779-0_16

    CrossRef  Google Scholar 

  7. Flocchini, P., Santoro, N.: Distributed security algorithms by mobile agents. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 1–14. Springer, Heidelberg (2006). https://doi.org/10.1007/11947950_1

    CrossRef  Google Scholar 

  8. 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)

    MathSciNet  CrossRef  Google Scholar 

  9. Peng, M., Shi, W., Corriveau, J.P., Pazzi, R., Wang, Y.: Black hole search in computer networks: state-of-the-art, challenges and future directions. J. Parallel Distrib. Comput. 88, 1–15 (2016)

    CrossRef  Google Scholar 

  10. Shi, W., Garcia-Alfaro, J., Corriveau, J.P.: Searching for a black hole in interconnected networks using mobile agents and tokens. J. Parallel Distrib. Comput. 74(1), 1945–1958 (2014)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fukuhito Ooshita .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Tsuchida, M., Ooshita, F., Inoue, M. (2019). Black Hole Search Despite Byzantine Agents. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2019. Lecture Notes in Computer Science(), vol 11914. Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34992-9_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34991-2

  • Online ISBN: 978-3-030-34992-9

  • eBook Packages: Computer ScienceComputer Science (R0)