Synchronous Byzantine quorum systems

Research output: Contribution to journalArticle

25 Citations (Scopus)

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 propose a new definition of Byzantine quorums that is appropriate for synchronous systems. We show how these quorums can be used for data replication and propose a general construction of synchronous Byzantine quorums using standard quorum systems. We prove tight lower bounds on the load of synchronous Byzantine quorums for various patterns of failures and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure patterns.

Original languageEnglish (US)
Pages (from-to)45-52
Number of pages8
JournalDistributed Computing
Volume13
Issue number1
DOIs
StatePublished - Jan 2000

Fingerprint

Quorum
Data Replication
Lower bound
Synchronous Systems
Mutual Exclusion
Distributed Systems

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Synchronous Byzantine quorum systems. / Bazzi, Rida.

In: Distributed Computing, Vol. 13, No. 1, 01.2000, p. 45-52.

Research output: Contribution to journalArticle

@article{47a56de473aa48f0b9e19d189ab1127e,
title = "Synchronous Byzantine quorum systems",
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 propose a new definition of Byzantine quorums that is appropriate for synchronous systems. We show how these quorums can be used for data replication and propose a general construction of synchronous Byzantine quorums using standard quorum systems. We prove tight lower bounds on the load of synchronous Byzantine quorums for various patterns of failures and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure patterns.",
author = "Rida Bazzi",
year = "2000",
month = "1",
doi = "10.1007/s004460050004",
language = "English (US)",
volume = "13",
pages = "45--52",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Synchronous Byzantine quorum systems

AU - Bazzi, Rida

PY - 2000/1

Y1 - 2000/1

N2 - 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 propose a new definition of Byzantine quorums that is appropriate for synchronous systems. We show how these quorums can be used for data replication and propose a general construction of synchronous Byzantine quorums using standard quorum systems. We prove tight lower bounds on the load of synchronous Byzantine quorums for various patterns of failures and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure patterns.

AB - 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 propose a new definition of Byzantine quorums that is appropriate for synchronous systems. We show how these quorums can be used for data replication and propose a general construction of synchronous Byzantine quorums using standard quorum systems. We prove tight lower bounds on the load of synchronous Byzantine quorums for various patterns of failures and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure patterns.

UR - http://www.scopus.com/inward/record.url?scp=0033894460&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033894460&partnerID=8YFLogxK

U2 - 10.1007/s004460050004

DO - 10.1007/s004460050004

M3 - Article

VL - 13

SP - 45

EP - 52

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 1

ER -