The Load and Availability of Byzantine Quorum Systems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
preprint of a paper to appear in the SIAM Journal of Computing

Keywords

Distributed, Parallel, and Cluster Computing, Cryptography and Security, C.2.4;C.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33275

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9908011
 http://arxiv.org/abs/cs/9908011

Collections

arXiv