A Framework for Evaluating BFT
Loading...
Links to Files
Author/Creator ORCID
Date
2022-05-03
Type of Work
Department
Program
Citation of Original Publication
J. R. Clavin et al., "A Framework for Evaluating BFT," 2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS), 2021, pp. 193-200, doi: 10.1109/ICPADS53394.2021.00030.
Rights
This work was written as part of one of the author's official duties as an Employee of the United States Government and is therefore a work of the United States Government. In accordance with 17 U.S.C. 105, no copyright protection is available for such works under U.S. Law.
Public Domain Mark 1.0
Public Domain Mark 1.0
Subjects
Abstract
We present a framework for evaluating the performance of Byzantine fault-tolerant (BFT) protocols theoretically.
Our motivation is to identify protocols suitable for a particular
power grid application. In this application, replicas are located in
a LAN network where latency is the priority. To fully understand
the performance of BFT, we provide a generic approach that
quantifies the performance of BFT protocols based on the number
of cryptographic operations under five different scenarios (in the
presence of failures and without failures).
We present the performance of three representative BFT
protocols: PBFT, Prime, and SBFT. To validate our framework,
we also evaluate the protocols experimentally in the CloudLab
testbed. Our experimental results match the findings predicted
by the framework. Although a variety of factors may affect the
performance of the protocols, our framework can be used as a
valuable reference to understand the performance of BFT.