Probabilistic quorum systems

Dahlia Malkhi; Michael K. Reiter; Avishai Wool; Rebecca N. Wright

doi:10.1006/inco.2001.3054

Probabilistic quorum systems

Dahlia Malkhi^*, Michael K. Reiter, Avishai Wool, Rebecca N. Wright

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques.

Original language	English
Pages (from-to)	184-206
Number of pages	23
Journal	Information and Computation
Volume	170
Issue number	2
DOIs	https://doi.org/10.1006/inco.2001.3054
State	Published - 1 Nov 2001
Externally published	Yes

Access to Document

10.1006/inco.2001.3054

Cite this

@article{3d04ace3a7054382ad6cb1ff12367d04,

title = "Probabilistic quorum systems",

abstract = "We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques.",

author = "Dahlia Malkhi and Reiter, {Michael K.} and Avishai Wool and Wright, {Rebecca N.}",

year = "2001",

month = nov,

day = "1",

doi = "10.1006/inco.2001.3054",

language = "אנגלית",

volume = "170",

pages = "184--206",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - Probabilistic quorum systems

AU - Malkhi, Dahlia

AU - Reiter, Michael K.

AU - Wool, Avishai

AU - Wright, Rebecca N.

PY - 2001/11/1

Y1 - 2001/11/1

N2 - We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques.

AB - We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques.

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

U2 - 10.1006/inco.2001.3054

DO - 10.1006/inco.2001.3054

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035526664

SN - 0890-5401

VL - 170

SP - 184

EP - 206

JO - Information and Computation

JF - Information and Computation

IS - 2

ER -

Probabilistic quorum systems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this