State Machine Replication for the Masses with BFT-SMART
By Alysson Neves Bessani, João Sousa, Eduardo Adílio Pelinson Alchieri. 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2014
661 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/249f4f06759ff3f720d9ee44019e03f8ca55e00c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Marko Vukolic
- Elaine Shi
- Rafael Pass
- Christian Cachin
- Srinivasan Keshav
- Lukasz Golab
- Steven Lee
- Christian Gorenflo
In Electrical and Electronic Engineering
- Marko Vukolic
- Elaine Shi
- Christian Cachin
- Rafael Pass
- Alberto Sonnino
- George Danezis
- Mustafa Al-Bassam
- Shehar Bano
In Hardware and Architecture
- Marko Vukolic
- Elaine Shi
- Christian Cachin
- Srinivasan Keshav
- Lukasz Golab
- Steven Lee
- Christian Gorenflo
- Rafael Pass
Citations in the corpus
- Chainspace: A Sharded Smart Contracts Platform (2017, methodology): “For BFT consensus, we use the BFT-SMART [2] Java library—one of the very few maintained open source libraries for BFT.”
- A Scalable Multi-Layer PBFT Consensus for Blockchain (2020, methodology): “BFT-SMART is so far the most popular open-source library for BFT-SMR application based on Java, filling the gap between the literature work and practical implementation [29].”
- HotStuff: BFT Consensus with Linearity and Responsiveness (2019, methodology): “PBFT has been deployed in several systems, including BFT-SMaRt [13].”
- Distributed SDN Control: Survey, Taxonomy, and Challenges (2018, methodology): “This variant of a traditional passive replication system relies on an external data store that is implemented using a modern active Replicated State Machine (RSM) built with a Paxoslike protocol (BFT-SMaRt [71]) to ensure fault-tolerance and strong consistency.”
- The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication (2015, positive): “In contrast, modern BFT protocols have been confirmed to sustain tens of thousands of transactions with practically network-speed latencies, not only as prototypes (e.g., [35, 12, 3]) but also as practical systems [5].”
- The Honey Badger of BFT Protocols (2016, methodology): “[22] initiated a recent line of work [4, 6, 10, 21, 22, 50] by advocating improvement of the worst-case performance, providing service quality guarantees even when the system is under attack — even if this comes at the expense of performance in the optimistic case.”
- Blockchain's adoption in IoT: The challenges, and a way forward (2019, background): “As far as TX throughput is confirmed, BFT-based protocols can sustain tens of thousands of TXs with practically network-speed latencies [127].”
- Blockchain Consensus Protocols in the Wild (2017, methodology): “This matches the throughput expected from BFT-SMaRt [9] and similar results in the research literature on BFT protocols [5].”
- A Survey about Consensus Algorithms Used in Blockchain (2018, background): “, “State machine replication for the masses with BFT-SMART,” in Proceedings of 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Atlanta, GA, 2014, with the permission of IEEE [72].”
- Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, positive): “For example, Vertical Paxos [16] and BFT-SMART [8] allow nodes to be reconfigured in a dynamic fashion.”
- A Comprehensive Review of Blockchain Consensus Mechanisms (2021, background): “One of the most important features of BFT-Smart is its evolution over time since its introduction in 2007, based on feedback on the applicability of this mechanism in transaction processing engines and application-level firewalls [219].”
- FastFabric: Scaling Hyperledger Fabric to 20,000 Transactions per Second (2019, methodology): “Sousa et al [3] study the use of the well-known BFT-SMART [15] implementation as a part of Fabric and shows that, using this implementation within a single datacenter, a throughput of up to 30,000 transactions/second is achievable.”
- SoK: Consensus in the Age of Blockchains (2017, methodology): “, in the context of open group participation is still an open research problem. 2) Exploiting advances in hardware and cryptography: The most mature current implementation of BFT is the Java BFTSmart [30] library with message complexity O(N2) in the 12 size of the quorum N. However, Byzcoin [84] use”
- A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges (2019, background): “(PoA) [78], Proof of Retrievability [79], Proof of Burn [80], Proof of Activity [81], Proof of Space [82], Proof of Trust [83], Proof of Luck [84], BFT-SMART [85] and ScalableBFT [86].”
- A Vademecum on Blockchain Technologies: When, Which, and How (2019, methodology): “tralized), for a distributed crash-tolerant implementation using RAFT [61], and for distributing it using the open-source BFT-SMaRt toolkit [153], an open-source Java-based library implementing robust BFT state machine replication.”
- SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “We note that Souse et al [68] use an implementation of PBFT called BFT-SMaRt [20].”
- A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform (2017, methodology): “1 This service is based on the well-know BFT-SMART state machine replication/consensus library [5], and its extension for WANs [6].”
- Hyperledger fabric: a distributed operating system for permissioned blockchains (2018, methodology): “It has been implemented with Apache Kafka/ZooKeeper ( http://kafka.apache. org/ ) and with BFT-SMaRt [3].”
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus (2021, background): “Byzantine consensus protocols [15, 19, 21] and the state machine replication paradigm [13] for building reliable distributed systems have been studied for over 40 years.”