MiB: Asynchronous BFT with More Replicas

by   Chao Liu, et al.

State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as HoneyBadgerBFT, BEAT, and Dumbo, have shown a performance comparable to partially synchronous BFT protocols. This paper studies two practical directions in asynchronous BFT. First, while all these asynchronous BFT protocols assume optimal resilience with 3f+1 replicas (where f is an upper bound on the number of Byzantine replicas), it is interesting to ask whether more efficient protocols are possible if relaxing the resilience level. Second, these recent BFT protocols evaluate their performance under failure-free scenarios. It is unclear if these protocols indeed perform well during failures and attacks. This work first studies asynchronous BFT with suboptimal resilience using 5f+1 and 7f+1 replicas. We present MiB, a novel and efficient asynchronous BFT framework using new distributed system constructions as building blocks. MiB consists of two main BFT instances and five other variants. As another contribution, we systematically design experiments for asynchronous BFT protocols with failures and evaluate their performance in various failure scenarios. We report interesting findings, showing asynchronous BFT indeed performs consistently well during various failure scenarios. In particular, via a five-continent deployment on Amazon EC2 using 140 replicas, we show the MiB instances have lower latency and much higher throughput than their asynchronous BFT counterparts.


page 1

page 2


Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization

This paper studies the good-case latency of unauthenticated Byzantine fa...

A Resilient AWGR and Server Based PON Data Centre Architecture

This paper studies the resilience of an AWGR and server based PON DCN ar...

Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience

The celebrated result of Fischer, Lynch and Paterson is the fundamental ...

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication

With the emergence of cross-organization attack-prone byzantine fault-to...

LogPlayer: Fault-tolerant Exactly-once Delivery using gRPC Asynchronous Streaming

In this paper, we present the design of our LogPlayer that is a componen...

Physics-inspired Ising Computing with Ring Oscillator Activated p-bits

The nearing end of Moore's Law has been driving the development of domai...

Power-saving Asynchronous Quorum-based Protocols for Maximal Neighbour Discovery

The discovery of neighbouring active nodes is one of the most challengin...

Please sign up or login with your details

Forgot password? Click here to reset