@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",
month = jan,
day = "1",
doi = "10.1007/11864219_31",
language = "English (US)",
isbn = "3540446249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "443--458",
booktitle = "Distributed Computing - 20th International Symposium, DISC 2006, Proceedings",
note = "20th International Symposium on Distributed Computing, DISC 2006 ; Conference date: 18-09-2006 Through 20-09-2006",
}