A framework for semantic reasoning about Byzantine quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Responsive Security for Stored Data
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Beyond one-third faulty replicas in byzantine fault tolerant systems
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Adaptive request batching for byzantine replication
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
Byzantine quorum systems enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of Byzantine quorum systems is their dependence on a static threshold limit on the number of server faults. The correctness of the system is only guaranteed if the actual number of faults is lower than the threshold at all times. However, a threshold chosen for the worst case wastes expensive replication in the common situation where the number of faults averages well below the worst case.In this paper, we present protocols for dynamically raising and lowering the resilience threshold of a quorum-based Byzantine fault-tolerant data service in response to current information on the number of server failures. Using such protocols, a system can operate in an efficient low-threshold mode with relatively small quorums in the absence of faults, increasing and decreasing the quorum size (and thus the tolerance) as faults appear and are dealt with, respectively.