Corpus ID: 8645709

HQ replication: a hybrid quorum protocol for byzantine fault tolerance

@inproceedings{Cowling2006HQRA,
  title={HQ replication: a hybrid quorum protocol for byzantine fault tolerance},
  author={James A. Cowling and Daniel S. Myers and Barbara Liskov and Rodrigo Seromenho Miragaia Rodrigues and Liuba Shrira},
  booktitle={OSDI '06},
  year={2006}
}
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 un-necessary when there is no contention, and Q/U requires a… Expand
HQ Replication: Properties and Optimizations
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 aExpand
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
TLDR
This paper presents an efficient implementation of LBTS, a linearizable Byzantine fault-tolerant tuple space that uses a novel Byzantine quorum systems replication technique and is linearizable and wait-free, showing interesting performance gains when compared to a similar construction based on state machine replication. Expand
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
TLDR
An extension to existing BFT architectures is proposed that increases performance for the default number of replicas by optimizing the resource utilization of their execution stages, and shows that with each replica executing only a part of all requests, the overall performance of a Byzantine fault-tolerant NFS can be almost doubled. Expand
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
TLDR
This paper presents an efficient implementation of LBTS, a linearizable Byzantine fault-tolerant tuple space that uses a novel Byzantine quorum systems replication technique and is linearizable and wait-free, showing interesting performance gains when compared to a similar construction based on state machine replication. Expand
Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas
TLDR
This paper shows, perhaps surprisingly, that fast Byzantine agreement despite f failures is practically attainable using only b − 1 additional replicas, which is independent of the number of crashes tolerated. Expand
Development and Evaluation of CheapBFT: An Efficient Byzantine Fault Tolerant Protocol
With the growth of computer services in Internet, the availability and integrity of these services, and the consequence which their failures might bear, becomes more evident. Inconsistent responsesExpand
A High-Throughput Byzantine Fault-Tolerant Protocol
TLDR
The goal of this thesis is to evaluate the actual impact of these scalability impediments, and to offer a solution for a high-throughput BFT protocol in the case in which the network itself is the bottleneck, by developing Ring, a new BFT Protocol which circumvents the aforementioned impediments. Expand
Contributions to Building Efficient and Robust State-Machine Replication Protocols
TLDR
Aliph is a new BFT protocol that outperforms previous BFT protocols both in terms of latency and throughput and is presented as a new abstraction to simplify the design, proof and implementation of SMR protocols. Expand
hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt theExpand
EFS: Efficient and Fault-Scalable Byzantine Fault Tolerant Systems Against Faulty Clients
TLDR
EFS is a hybrid BFT system consisting of an efficient and fault scalable quorum protocol for the contention-free case and a fast agreement protocol to resolve contention in a fault-scalable manner that demonstrates robust fault tolerance. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
HQ Replication: Properties and Optimizations
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 aExpand
Fault-scalable Byzantine fault-tolerant services
TLDR
The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services that provide better throughput and fault- scalability than replicated state machines using agreement-based protocols. Expand
Separating agreement from execution for byzantine fault tolerant services
TLDR
A new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests is described, which reduces replication costs and allows a general privacy firewall architecture to protect confidentiality through replication. Expand
Byzantine quorum systems
TLDR
This paper considers the arbitrary (Byzantine) failure of data repositories and presents the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and demonstrates quorum systems over n servers with a load of O(\frac{1}{\sqrt{n}})$, thus meeting the lower bound on load for benignly fault-tolerant quorum Systems. Expand
Practical byzantine fault tolerance and proactive recovery
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS. Expand
Nested objects in a Byzantine quorum-replicated system
  • Charles P. Fry, M. Reiter
  • Computer Science
  • Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004.
  • 2004
TLDR
This paper presents a framework that supports nested method invocations among Byzantine fault-tolerant, replicated objects that are accessed via quorum systems, and details the implementation of a new quorum-based authorization technique and a novel method invocation protocol that ensure the linearizability and failure atomicity of nested method Invocations despite Byzantine client and server replica failures. Expand
Byzantine Clients Rendered Harmless
TLDR
This paper describes the first protocols to handle all problems caused by Byzantine clients, which ensure that bad clients cannot interfere with good clients and provide correct semantics despite server failures. Expand
Fast Byzantine Consensus
TLDR
This work presents the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case and shows a parameterized version of the protocol that is safe despite f Byzantine failures and guarantees two-step execution despite some number of failures. Expand
Backoff protocols for distributed mutual exclusion and ordering
TLDR
This protocol is adaptive in that the expected amortized system response time is a function only of the number of clients currently contending and is independent of the maximum number of processes that might contend. Expand
The Rampart Toolkit for Building High-Integrity Services
  • M. Reiter
  • Computer Science
  • Dagstuhl Seminar on Distributed Systems
  • 1994
TLDR
A brief overview of Rampart is given, focusing primarily on its protocol architecture, and its performance in the prototype implementation and ongoing work is sketched. Expand
...
1
2
3
...