Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Load and Availability of Byzantine Quorum Systems
SIAM Journal on Computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault Detection for Byzantine Quorum Systems
IEEE Transactions on Parallel and Distributed Systems
Information and Computation
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Distributed Computing
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
IEEE Transactions on Dependable and Secure Computing
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Distributed Computing - Special issue: PODC 04
Randomized Shared Queues Applied to Distributed Optimization Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probability for a system with enough replicas. However, the masking and opaque types of probabilistic quorum systems are hampered in that their optimal load--a best-case measure of the work done by the busiest replica, and an indicator of scalability--is little better than that of strict quorum systems. In this paper we present a variant of probabilistic quorum systems that uses write markers in order to limit the extent to which Byzantine-faulty servers act together. Our masking and opaque probabilistic quorum systems have asymptotically better load than the bounds proven for previous masking and opaque quorum systems. Moreover, the new masking and opaque probabilistic quorum systems can tolerate an additional 24% and 17% of faulty replicas, respectively, compared with probabilistic quorum systems without write markers.