Skip to main content

Consensus When All Processes May Be Byzantine for Some Time

  • Conference paper

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

Abstract

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process at which a value fault occurs is forever “stigmatized” as being Byzantine, an assumption that might not be acceptable for long-lived systems, where processes need to be reintegrated after a fault.

We thus consider a model where Byzantine processes can recover in a predefined recovery state, and show that consensus can be solved in such a model.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27, 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hutle, M., Schiper, A.: Communication predicates: A high-level abstraction for coping with transient and dynamic faults. In: Dependable Systems and Networks (DSN 2007), pp. 92–101. IEEE, Los Alamitos (2007)

    Google Scholar 

  3. Widder, J., Gridling, G., Weiss, B., Blanquart, J.P.: Synchronous consensus with mortal Byzantines. In: Dependable Systems and Networks, DSN 2007 (2007)

    Google Scholar 

  4. Alvisi, L., Malkhi, D., Pierce, E., Reiter, M.K.: Fault detection for Byzantine quorum systems. IEEE Trans. Parallel Distributed Systems 12, 996–1007 (2001)

    Article  Google Scholar 

  5. Haeberlen, A., Kouznetsov, P., Druschel, P.: The case for Byzantine fault detection. In: HOTDEP 2006: Proceedings of the 2nd conference on Hot Topics in System Dependability, Berkeley, CA, USA, p. 5. USENIX Association (2006)

    Google Scholar 

  6. Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Computer Systems 20, 398–461 (2002)

    Article  Google Scholar 

  7. Dyer, C., Rodgers, D.: Effects on spacecraft & aircraft electronics. In: Proceedings ESA Workshop on Space Weather, ESA WPP-155, Nordwijk, The Netherlands, ESA, pp. 17–27 (1998)

    Google Scholar 

  8. Taber, A., Normand, E.: Single event upset in avionics. IEEE Trans. Nuclear Science 40, 120–126 (1993)

    Article  Google Scholar 

  9. Baumann, R.C.: Radiation-induced soft errors in advanced semiconductor technologies. IEEE Trans. Device and Materials Reliability 5, 305–316 (2005)

    Article  Google Scholar 

  10. Gordon, M., Goldhagen, P., Rodbell, K., Zabel, T., Tang, H., Clem, J., Bailey, P.: Measurement of the flux and energy spectrum of cosmic-ray induced neutrons on the ground. IEEE Trans. on Nuclear Science 51, 3427–3434 (2004)

    Article  Google Scholar 

  11. Shivakumar, P., Kistler, M., Keckler, S.W., Burger, D., Alvisi, L.: Modeling the effect of technology trends on the soft error rate of combinational logic. In: Dependable Systems and Networks (DSN 2002), pp. 389–398. IEEE, Los Alamitos (2002)

    Chapter  Google Scholar 

  12. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35, 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  13. Martin, J.P., Alvisi, L.: Fast Byzantine consensus. In: Dependable Systems and Networks (DSN 2005), pp. 402–411. IEEE, Los Alamitos (2005)

    Chapter  Google Scholar 

  14. Abd-El-Malek, M., Ganger, G.R., Goodson, G.R., Reiter, M.K., Wylie, J.J.: Fault-scalable Byzantine fault-tolerant services. SIGOPS Operating Systems Review 39, 59–74 (2005)

    Article  Google Scholar 

  15. Cowling, J., Myers, D., Liskov, B., Rodrigues, R., Shrira, L.: HQ replication: a hybrid quorum protocol for Byzantine fault tolerance. In: OSDI 2006: Proceedings of the seventh Symposium on Operating Systems Design and Implementation, Berkeley, CA, USA, pp. 177–190. USENIX Association (2006)

    Google Scholar 

  16. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative Byzantine fault tolerance. In: Proceedings of the twenty first ACM Symposium on Operating Systems Principles, SOSP 2007, pp. 45–58 (2007)

    Google Scholar 

  17. Rodrigues, R., Castro, M., Liskov, B.: Base: using abstraction to improve fault tolerance. In: Proceedings of the eighteenth ACM symposium on Operating Systems Principles, pp. 15–28. ACM, New York (2001)

    Chapter  Google Scholar 

  18. Biely, M., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A., Widder, J.: Tolerating corrupted communication. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC 2007). ACM Press, New York (2007)

    Google Scholar 

  19. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with Byzantine failures and little system synchrony. In: Dependable Systems and Networks (DSN 2006), pp. 147–155 (2006)

    Google Scholar 

  20. Anceaume, E., Delporte-Gallet, C., Fauconnier, H., Hurfin, M., Le Lann, G.: Designing modular services in the scattered Byzantine failure model. In: 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), pp. 262–269. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  21. Anceaume, E., Delporte-Gallet, C., Fauconnier, H., Hurfin, M., Widder, J.: Clock synchronization in the Byzantine-recovery failure model. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 90–104. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  22. Barak, B., Halevi, S., Herzberg, A., Naor, D.: Clock synchronization with faults and recoveries (extended abstract). In: Proceeding of the 18th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), Portland, Oregon, United States, pp. 133–142. ACM Press, New York (2000)

    Chapter  Google Scholar 

  23. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  25. Dolev, S., Kat, R.I., Schiller, E.M.: When consensus meets self-stabilization. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 45–63. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Biely, M., Hutle, M.: Consensus when all processes may be Byzantine for some time. Research Report 47/2009, Technische Universität Wien, Institut für Technische Informatik, Treitlstr. 1-3/182-1, 1040 Vienna, Austria (2009)

    Google Scholar 

  27. Song, Y.J., van Renesse, R.: Bosco: One-Step Byzantine Asynchronous Consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 438–450. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biely, M., Hutle, M. (2009). Consensus When All Processes May Be Byzantine for Some Time. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05118-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05117-3

  • Online ISBN: 978-3-642-05118-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics