Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
1999-08-12
Computer Science
Distributed, Parallel, and Cluster Computing
preprint of a paper to appear in the SIAM Journal of Computing
Scientific paper
Replicated services accessed via {\em quorums} enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, $b$-masking quorum systems, whose intersections contain at least $2b+1$ servers, have been proposed to construct replicated services tolerant of $b$ arbitrary (Byzantine) server failures. In this paper we consider a hybrid fault model allowing benign failures in addition to the Byzantine ones. We present four novel constructions for $b$-masking quorum systems in this model, each of which has optimal {\em load} (the probability of access of the busiest server) or optimal availability (probability of some quorum surviving failures). To show optimality we also prove lower bounds on the load and availability of any $b$-masking quorum system in this model.
Malkhi Dahlia
Reiter Michael
Wool Avishai
No associations
LandOfFree
The Load and Availability of Byzantine Quorum Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Load and Availability of Byzantine Quorum Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Load and Availability of Byzantine Quorum Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-662829