Non-blocking asynchronous byzantine quorum systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we propose a reformulation of the definition of Byzantine quorum systems. Our reformulation captures the requirement for non-blocking access to quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and we show 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 also show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We present new quorum systems with low asynchronous access cost and 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)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages109-122
Number of pages14
Volume1693
ISBN (Print)3540665315, 9783540665311
Publication statusPublished - 1999
Event13th International Symposium on Distributed Computing, DISC 1999 - Bratislava, Slovakia
Duration: Sep 27 1999Sep 29 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1693
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th International Symposium on Distributed Computing, DISC 1999
CountrySlovakia
CityBratislava
Period9/27/999/29/99

    Fingerprint

Keywords

  • Access cost
  • Asynchronous
  • Byzantine
  • Distributed
  • Failures
  • Quorum
  • Tolerance

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bazzi, R. (1999). Non-blocking asynchronous byzantine quorum systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1693, pp. 109-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1693). Springer Verlag.