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 publicationDistributed Computing - 13th International Symposium, DISC 1999, Proceedings
EditorsPrasad Jayanti
PublisherSpringer Verlag
Pages109-122
Number of pages14
ISBN (Print)3540665315, 9783540665311
DOIs
StatePublished - Jan 1 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)0302-9743
ISSN (Electronic)1611-3349

Other

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

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Non-blocking asynchronous byzantine quorum systems'. Together they form a unique fingerprint.

Cite this