Byzantine and multi-writer k-quorums

Amitanand S. Aiyer, Lorenzo Alvisi, Rida Bazzi

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

4 Citations (Scopus)

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages443-458
Number of pages16
Volume4167 LNCS
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

Other20th International Symposium on Distributed Computing, DISC 2006
CountrySweden
CityStockholm
Period9/18/069/20/06

Fingerprint

Quorum
Network protocols
High Availability
Scheduler
Expand
Computer systems
Servers
Server
Direction compound
Availability
Lower bound

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Aiyer, A. S., Alvisi, L., & Bazzi, R. (2006). Byzantine and multi-writer k-quorums. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4167 LNCS, pp. 443-458). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS).

Byzantine and multi-writer k-quorums. / Aiyer, Amitanand S.; Alvisi, Lorenzo; Bazzi, Rida.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS 2006. p. 443-458 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS).

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

Aiyer, AS, Alvisi, L & Bazzi, R 2006, Byzantine and multi-writer k-quorums. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4167 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4167 LNCS, pp. 443-458, 20th International Symposium on Distributed Computing, DISC 2006, Stockholm, Sweden, 9/18/06.
Aiyer AS, Alvisi L, Bazzi R. Byzantine and multi-writer k-quorums. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS. 2006. p. 443-458. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Aiyer, Amitanand S. ; Alvisi, Lorenzo ; Bazzi, Rida. / Byzantine and multi-writer k-quorums. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS 2006. pp. 443-458 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{76daf5e466fd4652b2457b74883fe453,
title = "Byzantine and multi-writer k-quorums",
abstract = "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).",
author = "Aiyer, {Amitanand S.} and Lorenzo Alvisi and Rida Bazzi",
year = "2006",
language = "English (US)",
isbn = "3540446249",
volume = "4167 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "443--458",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Byzantine and multi-writer k-quorums

AU - Aiyer, Amitanand S.

AU - Alvisi, Lorenzo

AU - Bazzi, Rida

PY - 2006

Y1 - 2006

N2 - 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).

AB - 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).

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

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

M3 - Conference contribution

AN - SCOPUS:33845194606

SN - 3540446249

SN - 9783540446248

VL - 4167 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 443

EP - 458

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -