Dahlia Malkhi
Michael Reiter
Rebecca N. Wright
ABSTRACT
No abstract available.
Index Terms
- Probabilistic Byzantine quorum systems
Recommendations
Probabilistic opaque quorum systems
DISC'07: Proceedings of the 21st international conference on Distributed ComputingByzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b+1 servers (where b is the maximum number of faults ...
Write Markers for Probabilistic Quorum Systems
OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed SystemsProbabilistic 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 ...
Synchronous Byzantine quorum systems
Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate ...
Comments