EESMR: Energy Efficient BFT-SMR for the masses

by   Adithya Bhat, et al.

Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we propose a novel SMR protocol that optimizes for the steady state, i.e., when the leader is correct. This is done by reducing the number of required signatures per consensus unit and the communication complexity by order of the number of nodes n compared to the state-of-the-art BFT-SMR solutions. Concretely, we employ the idea that a quorum (collection) of signatures on a proposed value is avoidable during the failure-free runs. Second, we model and analyze the energy efficiency of protocols and argue why the steady-state needs to be optimized. Third, we present an application in the cyber-physical system (CPS) setting, where we consider a partially connected system by optionally leveraging wireless multicasts among neighbors. We analytically determine the parameter ranges for when our proposed protocol offers better energy efficiency than communicating with a baseline protocol utilizing an external trusted node. We present a hypergraph-based network model and generalize previous fault tolerance results to the model. Finally, we demonstrate our approach's practicality by analyzing our protocol's energy efficiency through experiments on a CPS test bed. In particular, we observe as high as 64 compared to the state-of-the-art SMR solution for n=10 settings using BLE.


page 1

page 2

page 3

page 4


A Formally Verified Protocol for Log Replication with Byzantine Fault Tolerance

Byzantine fault tolerant protocols enable state replication in the prese...

FnF-BFT: Exploring Performance Limits of BFT Protocols

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-m...

Scalable Byzantine Fault Tolerance via Partial Decentralization

Byzantine consensus is a critical component in many permissioned Blockch...

Cross-Chain State Machine Replication

This paper considers the classical state machine replication (SMR) probl...

Carnot: A highly Scalable and Responsive BFT Consensus protocol

We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consens...

Fever: Optimal Responsive View Synchronisation

View synchronisation is an important component of many modern Byzantine ...

Leopard: Scaling BFT without Sacrificing Efficiency

With the emergence of large-scale decentralized applications, a scalable...

Please sign up or login with your details

Forgot password? Click here to reset