Antiquity: exploiting a secure log for wide-area distributed storage
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Large-scale byzantine fault tolerance: safe but not always live
HotDep'07 Proceedings of the 3rd workshop on on Hot Topics in System Dependability
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Zyzzyva: speculative Byzantine fault tolerance
Communications of the ACM - Remembering Jim Gray
Diverse replication for single-machine Byzantine-fault tolerance
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
How to Solve Consensus in the Smallest Window of Synchrony
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Evita raced: metacompilation for declarative networks
Proceedings of the VLDB Endowment
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Design and implementation of a Byzantine fault tolerance framework for Web services
Journal of Systems and Software
Making Byzantine fault tolerant systems tolerate Byzantine faults
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Zeno: eventually consistent Byzantine-fault tolerance
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
The Design of Finite State Machine for Asynchronous Replication Protocol
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Proceedings of the 5th European conference on Computer systems
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable byzantine computation
ACM SIGACT News
Prophecy: using history for high-throughput fault tolerance
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
HotDep'10 Proceedings of the Sixth international conference on Hot topics in system dependability
ZZ and the art of practical BFT execution
Proceedings of the sixth conference on Computer systems
Paxos replicated state machines as the basis of a high-performance data store
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
State machine replication with byzantine faults
Replication
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Towards network-on-chip agreement protocols
Proceedings of the tenth ACM international conference on Embedded software
All about Eve: execute-verify replication for multi-core servers
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
On the practicality of practical Byzantine fault tolerance
Proceedings of the 13th International Middleware Conference
Augustus: scalable and robust storage for cloud applications
Proceedings of the 8th ACM European Conference on Computer Systems
Hash-based Byzantine fault tolerant agreement with enhanced view consistency
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, and a quorum-based approach, such as Q/U, in which clients contact replicas directly to optimistically execute operations. Both approaches have shortcomings: the quadratic cost of inter-replica communication is unnecessary when there is no contention, and Q/U requires a large number of replicas and performs poorly under contention. We present HQ, a hybrid Byzantine-fault-tolerant state machine replication protocol that overcomes these problems. HQ employs a lightweight quorum-based protocol when there is no contention, but uses BFT to resolve contention when it arises. Furthermore, HQ uses only 3f+1 replicas to tolerate f faults, providing optimal resilience to node failures. We implemented a prototype of HQ, and we compare its performance to BFT and Q/U analytically and experimentally. Additionally, in this work we use a new implementation of BFT designed to scale as the number of faults increases. Our results show that both HQ and our new implementation of BFT scale as f increases; additionally our hybrid approach of using BFT to handle contention works well.