Making BFT Protocols Really Adaptive

@article{Bahsoun2015MakingBP,
  title={Making BFT Protocols Really Adaptive},
  author={Jean Paul Bahsoun and Rachid Guerraoui and Ali Shoker},
  journal={2015 IEEE International Parallel and Distributed Processing Symposium},
  year={2015},
  pages={904-913}
}
Many state-machine Byzantine Fault Tolerant (BFT) protocols have been introduced so far. Each protocol addressed a different subset of conditions and use-cases. However, if the underlying conditions of a service span different subsets, choosing a single protocol will likely not be a best fit. This yields robustness and performance issues which may be even worse in services that exhibit fluctuating conditions and workloads. In this paper, we reconcile existing state-machine BFT protocols in a… Expand
Adaptive BFT protocols
Byzantine fault-tolerant (BFT) protocols have been proposed mostly as a means to support the execution of highly-resilient services, i.e., of services that keep their availability, integrity, andExpand
Supr: Adaptive Byzantine Fault-Tolerant Replication
TLDR
This article introduces Supr, a novel method for effortlessly combining multiple replication protocols into adaptive BFT solutions, which accommodate to a much wider spectrum of environment conditions than the existing BFT systems. Expand
Policy-Based Adaptation of a Byzantine Fault Tolerant Distributed Graph Database
TLDR
This paper explores a different alternative that consists in specifying not only the system configuration, but also the fault-handling behaviour, and how the system adapts to changes in the workload, in a policy language that is processed externally to the managed system. Expand
A Comparison of Message Exchange Patterns in BFT Protocols
TLDR
This paper focuses on the impact of different combinations of cryptographic primitives and the message exchange pattern used to collect and disseminate votes, a key aspect for performance and scalability of BFT protocols. Expand
EPIC: Efficient Asynchronous BFT with Adaptive Security
  • Chao Liu, Sisi Duan, Haibin Zhang
  • Computer Science
  • 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
  • 2020
TLDR
It is shown that EPIC is slightly slower for small and medium-sized networks than the most efficient asynchronous BFT protocols with static security, and as the number of replicas is smaller than 46, EPIC's throughput is stable, achieving peak throughput of 8,000--12,500 tx/sec using t2.medium VMs. Expand
Policy-Based Adaptation of Byzantine Fault Tolerant Systems
Malicious attacks, hardware failures or even operator mistakes may cause a system to behave in an arbitrary, and hard to predict manner. Byzantine fault tolerance (BFT) encompasses a number ofExpand
ByTAM : a Byzantine Fault Tolerant Adaptation Manager
Previous systems that support the dynamic adaptation of Byzantine Fault Tolerant (BFT) protocols have important limitations such as: lack of robustness (dependence on central and trustworthyExpand
As Secure as Possible Eventual Consistency: Work in Progress
TLDR
This work in progress paper introduces a new secure highly available protocol for the EC model that assumes a fraction of replicas and any client can be Byzantine, and gives priority to high availability, and thus Byzantine detection is performed off the critical path on a consistent data offset. Expand
Self-stabilizing state machine replication in static and reconfigurable asynchronous message-passing systems
TLDR
This paper presents Byzantine-tolerant SMR, proposed as an alternative to the Proof-of-Work (PoW) paradigm of block ordering in blockchains, which is suggested to overcome the poor performance scalability of PoW and avoid the high energy consumptions. Expand
Contributions To Building Reliable Distributed Systems
TLDR
This manuscript considers two types of faults : Byzantine faults and rational faults in large scale distributed systems and presents the following contributions. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 35 REFERENCES
BFT Protocols Under Fire
TLDR
This work presents a simulation environment for protocols with improved performance under benign conditions that combines a declarative networking system with a robust network simulator and shows that Zyzzyva outperforms protocols like PBFT and Q/U undermost but not all conditions, indicating that one-size-fits-all protocols may be hard if not impossible to design in practice. Expand
Quantitative Evaluation of BFT Protocols
TLDR
HyPerf is presented, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols that estimates the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Expand
The Next 700 BFT Protocols
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowedExpand
Stretching BFT
State-of-the-art BFT protocols remain far from the maximum theoretical throughput. Based on exhaustive evaluation and monitoring of existing BFT protocols, we highlight few impediments to theirExpand
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
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
TLDR
Aardvark can achieve peak performance within 40% of that of the best existing protocol in the authors' tests and provide a significant fraction of that performance when up to f servers and any number of clients are faulty. Expand
Zyzzyva: speculative Byzantine fault tolerance
TLDR
In Zyzzyva, replicas reply to a client's request without first running an expensive three-phase commit protocol to agree on the order to process requests, making BFT replication practical for a broad range of demanding services. 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
Towards Byzantine Resilient Directories
  • Ali Shoker, J. Bahsoun
  • Computer Science
  • 2012 IEEE 11th International Symposium on Network Computing and Applications
  • 2012
TLDR
This approach ensures that OpenLDAP legacy code remains completely intact, and that the integration with BFT is straightforward using APIs, and convey that the additional performance cost of BFT-LDAP is negligible as compared to that of stand-alone Open LDAP. Expand
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
...
1
2
3
4
...