Abstract
Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate Byzantine failures; they called these systems Byzantine quorum systems and gave some examples of such quorum systems. In this paper, we argue that the proposed definition of Byzantine quorums is too strong for synchronous systems and we propose a definition of synchronous Byzantine quorums. We show that the new definition is more appropriate for synchronous systems. We prove tight lower bounds on the load of synchronous Byzantine quorum systems for various failure assumptions and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure assumptions.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
| Place of Publication | New York, NY, United States |
| Publisher | ACM |
| Pages | 259-266 |
| Number of pages | 8 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA Duration: Aug 21 1997 → Aug 24 1997 |
Other
| Other | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| City | Santa Barbara, CA, USA |
| Period | 8/21/97 → 8/24/97 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture