Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On Byzantine Containment Properties of the min + 1 Protocol

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

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

Included in the following conference series:

Abstract

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors.

We consider the well known problem of constructing a breadth-first spanning tree in this context. Combining these two properties prove difficult: we demonstrate that it is impossible to contain the impact of Byzantine processes in a strictly or strongly stabilizing manner. We then adopt the weaker scheme of topology-aware strict stabilization and we present a similar weakening of strong stabilization. We prove that the classical min + 1 protocol has optimal Byzantine containment properties with respect to these criteria.

This work has been supported in part by ANR projects SHAMAN, ALADDIN, SPADES, by MEXT Global COE Program and by JSPS Grant-in-Aid for Scientific Research ((B) 22300009).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM Commun. 17(11), 643–644 (1974)

    Article  Google Scholar 

  2. Dolev, S.: Self-stabilization. MIT Press, Cambridge (March 2000)

    Book  Google Scholar 

  3. Tixeuil, S.: Self-stabilizing Algorithms. Chapman & Hall/CRC Applied Algorithms and Data Structures. In: Algorithms and Theory of Computation Handbook, 2nd edn., 26.1–26.45. pp. CRC Press/ Taylor & Francis Group (2009)

    Google Scholar 

  4. Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)

    Article  Google Scholar 

  5. Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM 51(5), 780–799 (2004)

    Article  MathSciNet  Google Scholar 

  6. Daliot, A., Dolev, D.: Self-stabilization of byzantine protocols. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, pp. 48–67. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems, p. 22. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  8. Ben-Or, M., Dolev, D., Hoch, E.N.: Fast self-stabilizing byzantine tolerant digital clock synchronization. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 385–394. ACM, New York (2008)

    Google Scholar 

  9. Dolev, D., Hoch, E.N.: On self-stabilizing synchronous actions despite byzantine attacks. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 193–207. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Hoch, E.N., Dolev, D., Daliot, A.: Self-stabilizing byzantine digital clock synchronization. In: [21], pp. 350–362

    Google Scholar 

  11. Sakurai, Y., Ooshita, F., Masuzawa, T.: A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 283–298. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults. International Journal of Principles and Applications of Information Science and Technology (PAIST) 1(1), 1–13 (2007)

    Google Scholar 

  13. Gartner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report ic/2003/38, EPFL (2003)

    Google Scholar 

  14. Huang, S.T., Chen, N.S.: A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett. 41(2), 109–117 (1992)

    Article  MathSciNet  Google Scholar 

  15. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7(1), 3–16 (1993)

    Article  Google Scholar 

  16. Dubois, S., Masuzawa, T., Tixeuil, S.: The Impact of Topology on Byzantine Containment in Stabilization. In: DISC (to appear 2010), Technical report available at http://hal.inria.fr/inria-00481836/en/

  17. Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. In: [21], pp. 440–453

    Google Scholar 

  18. Dubois, S., Masuzawa, T., Tixeuil, S.: Self-stabilization with byzantine tolerance for global tasks. Research report inria-00484645, INRIA (May 2010), http://hal.inria.fr/inria-00484645/en/

  19. Dubois, S., Masuzawa, T., Tixeuil, S.: On byzantine containment properties of the min+1 protocol. Research report inria-00487091, INRIA (May 2010), http://hal.inria.fr/inria-00487091/en/

  20. Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distributed Computing 14(3), 147–162 (2001)

    Article  Google Scholar 

  21. Datta, A.K., Gradinariu, M. (eds.): SSS 2006. LNCS, vol. 4280. Springer, Heidelberg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP6 - UMR 7606 Université Pierre et Marie Curie - Paris 6 & INRIA, France

    Swan Dubois & Sébastien Tixeuil

  2. Osaka University, Japan

    Toshimitsu Masuzawa

Authors
  1. Swan Dubois
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshimitsu Masuzawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sébastien Tixeuil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev,Beer-Sheva, 84105, Israel

    Shlomi Dolev

  2. Department of Computer Science, The University of Texas at Dallas, TX 75083-0688, Richardson, USA

    Jorge Cobb

  3. Department of Computer Science, Yale University, 51 Prospect Street, CT 06511, New Haven, USA

    Michael Fischer

  4. Department of Computer Science, Columbia University, 10027, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubois, S., Masuzawa, T., Tixeuil, S. (2010). On Byzantine Containment Properties of the min + 1 Protocol. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16023-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16022-6

  • Online ISBN: 978-3-642-16023-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation