On the availability of non-strict quorum systems

Amitanand Aiyer, Lorenzo Alvizi, Rida Bazzi

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

25 Citations (Scopus)

Abstract

Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing system availability while at the same time tolerating a malicious scheduler and guaranteeing an upper bound on the staleness of data. We characterize the conditions under which this increase is possible and show that it depends on the ratio of the write frequency to the servers' failure frequency. For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages48-62
Number of pages15
Volume3724 LNCS
DOIs
StatePublished - 2005
Event19th International Conference on Distributed Computing, DISC 2005 - Cracow, Poland
Duration: Sep 26 2005Sep 29 2005

Publication series

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

Other

Other19th International Conference on Distributed Computing, DISC 2005
CountryPoland
CityCracow
Period9/26/059/29/05

Fingerprint

Quorum
Availability
Scheduler
Servers
Server
Atomicity
High Availability
Network protocols
Upper bound

ASJC Scopus subject areas

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

Cite this

Aiyer, A., Alvizi, L., & Bazzi, R. (2005). On the availability of non-strict quorum systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3724 LNCS, pp. 48-62). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3724 LNCS). https://doi.org/10.1007/11561927_6

On the availability of non-strict quorum systems. / Aiyer, Amitanand; Alvizi, Lorenzo; Bazzi, Rida.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3724 LNCS 2005. p. 48-62 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3724 LNCS).

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

Aiyer, A, Alvizi, L & Bazzi, R 2005, On the availability of non-strict quorum systems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3724 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3724 LNCS, pp. 48-62, 19th International Conference on Distributed Computing, DISC 2005, Cracow, Poland, 9/26/05. https://doi.org/10.1007/11561927_6
Aiyer A, Alvizi L, Bazzi R. On the availability of non-strict quorum systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3724 LNCS. 2005. p. 48-62. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11561927_6
Aiyer, Amitanand ; Alvizi, Lorenzo ; Bazzi, Rida. / On the availability of non-strict quorum systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3724 LNCS 2005. pp. 48-62 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{151b7f97743e4775aa2827dabe1bd8ed,
title = "On the availability of non-strict quorum systems",
abstract = "Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing system availability while at the same time tolerating a malicious scheduler and guaranteeing an upper bound on the staleness of data. We characterize the conditions under which this increase is possible and show that it depends on the ratio of the write frequency to the servers' failure frequency. For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.",
author = "Amitanand Aiyer and Lorenzo Alvizi and Rida Bazzi",
year = "2005",
doi = "10.1007/11561927_6",
language = "English (US)",
isbn = "3540291636",
volume = "3724 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "48--62",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On the availability of non-strict quorum systems

AU - Aiyer, Amitanand

AU - Alvizi, Lorenzo

AU - Bazzi, Rida

PY - 2005

Y1 - 2005

N2 - Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing system availability while at the same time tolerating a malicious scheduler and guaranteeing an upper bound on the staleness of data. We characterize the conditions under which this increase is possible and show that it depends on the ratio of the write frequency to the servers' failure frequency. For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.

AB - Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing system availability while at the same time tolerating a malicious scheduler and guaranteeing an upper bound on the staleness of data. We characterize the conditions under which this increase is possible and show that it depends on the ratio of the write frequency to the servers' failure frequency. For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.

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

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

U2 - 10.1007/11561927_6

DO - 10.1007/11561927_6

M3 - Conference contribution

SN - 3540291636

SN - 9783540291633

VL - 3724 LNCS

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

SP - 48

EP - 62

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

ER -