Distributed Computing

, Volume 24, Issue 6, pp 299–321

Consensus in the presence of mortal Byzantine faulty processes

Authors

    • Formal Methods in Systems Engineering Group E184/4Technische Universität wien
  • Martin Biely
    • Ecole polytechnique Fédérale de Lausanne (EPFL)
  • Günther Gridling
    • Embedded Computing Systems Group E182/2Technische Universität wien
  • Bettina Weiss
    • Embedded Computing Systems Group E182/2Technische Universität wien
  • Jean-Paul Blanquart
    • Astrium Satellites
Open AccessArticle

DOI: 10.1007/s00446-011-0147-3

Cite this article as:
Widder, J., Biely, M., Gridling, G. et al. Distrib. Comput. (2012) 24: 299. doi:10.1007/s00446-011-0147-3

Abstract

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model “mortal Byzantine”. After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.

Keywords

Consensus Byzantine fault Distributed algorithm Fault tolerance Complexity

Copyright information

© The Author(s) 2011