Access cost for asynchronous Byzantine quorum systems

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we study the cost of accessing quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and argue that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We propose a reformulation of the definition of Byzantine quorum systems that captures the requirement for non-blocking access to quorums in asynchronous systems. We present new Byzantine quorum systems with low asynchronous access cost whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.

Original languageEnglish (US)
Pages (from-to)41-48
Number of pages8
JournalDistributed Computing
Volume14
Issue number1
StatePublished - Jan 2001

Fingerprint

Quorum
Costs
Asynchronous Systems
Message Complexity
Reformulation
Distributed Systems
Disjoint

Keywords

  • Access cost
  • Asynchronous
  • Byzantine failures
  • Distributed systems
  • Fault tolerance
  • Quorum

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Access cost for asynchronous Byzantine quorum systems. / Bazzi, Rida.

In: Distributed Computing, Vol. 14, No. 1, 01.2001, p. 41-48.

Research output: Contribution to journalArticle

@article{df58dc7927cd45929da390e24088ece4,
title = "Access cost for asynchronous Byzantine quorum systems",
abstract = "Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we study the cost of accessing quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and argue that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We propose a reformulation of the definition of Byzantine quorum systems that captures the requirement for non-blocking access to quorums in asynchronous systems. We present new Byzantine quorum systems with low asynchronous access cost whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.",
keywords = "Access cost, Asynchronous, Byzantine failures, Distributed systems, Fault tolerance, Quorum",
author = "Rida Bazzi",
year = "2001",
month = "1",
language = "English (US)",
volume = "14",
pages = "41--48",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Access cost for asynchronous Byzantine quorum systems

AU - Bazzi, Rida

PY - 2001/1

Y1 - 2001/1

N2 - Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we study the cost of accessing quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and argue that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We propose a reformulation of the definition of Byzantine quorum systems that captures the requirement for non-blocking access to quorums in asynchronous systems. We present new Byzantine quorum systems with low asynchronous access cost whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.

AB - Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we study the cost of accessing quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and argue that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We propose a reformulation of the definition of Byzantine quorum systems that captures the requirement for non-blocking access to quorums in asynchronous systems. We present new Byzantine quorum systems with low asynchronous access cost whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.

KW - Access cost

KW - Asynchronous

KW - Byzantine failures

KW - Distributed systems

KW - Fault tolerance

KW - Quorum

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

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

M3 - Article

AN - SCOPUS:0034881333

VL - 14

SP - 41

EP - 48

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 1

ER -