Abstract
Solving the consensus problem requires in one way or another that the underlying system satisfies synchrony assumptions. Considering a system of n processes where up to t < n/3 may commit Byzantine failures, this paper investigates the synchrony assumptions that are required to solve consensus. It presents a corresponding necessary and sufficient condition.
Such a condition is formulated with the notions of a symmetric synchrony property and property ambiguity. A symmetric synchrony property is a set of graphs, where each graph corresponds to a set of bi-directional eventually synchronous links among correct processes. Intuitively, a property is ambiguous if it contains a graph whose connected components are such that it is impossible to distinguish a connected component that contains correct processes only from a connected component that contains faulty processes only. The paper connects then the notion of a symmetric synchrony property with the notion of eventual bi-source, and shows that the existence of a virtual \(\Diamond\)[t + 1]bi-source is a necessary and sufficient condition to solve consensus in presence of up to t Byzantine processes in systems with bi-directional links and message authentication. Finding necessary and sufficient synchrony conditions when links are timely in one direction only, or when processes cannot sign messages, still remains open (and very challenging) problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with Byzantine Failures and Little System Synchrony. In: Int’l Conference on Dependable Systems and Networks (DSN 2006), pp. 147–155. IEEE Computer Press, Los Alamitos (2006)
Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn., 414 pages. Wiley-Interscience, Hoboken (2004)
Cachin, C., Kursawe, K., Shoup, V.: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In: Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 123–132 (2000)
Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)
Delporte-Gallet, C., Devismes, S., Fauconnnier, H., Larrea, M.: Algorithms for Extracting Timeliness Graphs. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 127–141. Springer, Heidelberg (2010)
Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of the ACM 35(2), 288–323 (1988)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)
Friedman, R., Mostéfaoui, A., Raynal, M.: ⋄\( {\cal P}_{mute}\)-Based Consensus for Asynchronous Byzantine Systems. Parallel Processing Letters 15(1-2), 162–182 (2005)
Friedman, R., Mostéfaoui, A., Raynal, M.: Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. IEEE Transactions on Dependable and Secure Computing 2(1), 46–56 (2005)
Hamouna, M., Mostéfaoui, A., Trédan, G.: Byzantine Consensus with Few Synchronous Links. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 76–89. Springer, Heidelberg (2007)
Hamouna, M., Mostéfaoui, A., Trédan, G.: Byzantine Consensus in Signature-free Systems. Submitted to publication
Lamport, L., Shostack, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
Lynch, N.A.: Distributed Algorithms, 872 pages. Morgan Kaufmann Pub., San Francisco (1996)
Okun, M.: Byzantine Agreement. Springer Encyclopedia of Algorithms, pp. 116–119 (2008)
Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. JACM 27, 228–234 (1980)
Raynal, M.: Fault-tolerant Agreement in Synchronous Message-passing Systems. In: Morgan & Claypool, 167 pages (September 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldellon, O., Mostéfaoui, A., Raynal, M. (2011). A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds) Distributed Computing and Networking. ICDCN 2011. Lecture Notes in Computer Science, vol 6522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17679-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-17679-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17678-4
Online ISBN: 978-3-642-17679-1
eBook Packages: Computer ScienceComputer Science (R0)