Byzantine and multi-writer k-quorums

Amitanand S. Aiyer, Lorenzo Alvisi, Rida Bazzi

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

6 Scopus citations


Single-writer k-quorum protocols achieve high availability without incurring the risk of read operations returning arbitrarily stale values: in particular, they guarantee that, even in the presence of an adversarial scheduler, any read operation will return the value written by one of the last k writes. In this paper, we expand our understanding of k-quorums in two directions: first, we present a single-writer k-quorum protocol that tolerates Byzantine server failures; second, we extend the single-writer k-quorum protocol to a multi-writer solution that applies to both the benign and Byzantine cases. For a system with m writers, we prove a lower bound of ((2m - 1)(k - 1) + 1) on the staleness of any multi-writer protocol built over a single-writer k-quorum system and propose a multi-writer protocol that provides an almost matching staleness bound of ((2m - 1)(k - 1) + m).

Original languageEnglish (US)
Title of host publicationDistributed Computing - 20th International Symposium, DISC 2006, Proceedings
PublisherSpringer Verlag
Number of pages16
ISBN (Print)3540446249, 9783540446248
StatePublished - Jan 1 2006
Event20th International Symposium on Distributed Computing, DISC 2006 - Stockholm, Sweden
Duration: Sep 18 2006Sep 20 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4167 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Symposium on Distributed Computing, DISC 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Byzantine and multi-writer k-quorums'. Together they form a unique fingerprint.

Cite this