The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
State Machine Replication for the Masses with BFT-SMART
Open accessAbstract
The last fifteen years have seen an impressive amount of work on protocols for Byzantine fault-tolerant (BFT) state machine replication (SMR). However, there is still a need for practical and reliable software libraries implementing this technique. BFT-SMART is an open-source Java-based library implementing robust BFT state machine replication. Some of the key features of this library that distinguishes it from similar works (e.g., PBFT and UpRight) are improved reliability, modularity as a first-class property, multicore-awareness, reconfiguration support and a flexible programming interface. When compared to other SMR libraries, BFT-SMART achieves better performance and is able to withstand a number of real-world faults that previous implementations cannot.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
SEDA: an architecture for well-conditioned, scalable internet services
Welsh, M., Culler, D., & Brewer, E. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502057 · Cited by 834
Paxos made live: an engineering perspective
Chandra, T. D., Griesemer, R., & Redstone, J. (2007) · Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing · doi:10.1145/1281100.1281103 · Cited by 619
Making Byzantine fault tolerant systems tolerate Byzantine faults
Clement, A., Wong, E. L., Alvisi, L., Dahlin, M., & Marchetti, M. (2009) · Networked Systems Design and Implementation · Cited by 522
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
Efficient Byzantine Fault-Tolerance
Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.221 · Cited by 337
Self-citationZyzzyva: Speculative Byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2009) · ACM Transactions on Computer Systems · doi:10.1145/1658357.1658358 · Cited by 292
Clement, A., Kapritsos, M., Lee, S., Wang, Y., Alvisi, L., Dahlin, M., & Riche, T. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629602 · Cited by 247
Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755950 · Cited by 219
CheapBFT: resource-efficient byzantine fault tolerance
Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Mohammadi, S. V., Schröder-Preikschat, W., & Stengel, K. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168866 · Cited by 197
Prime: Byzantine Replication under Attack
Amir, Y., Coan, B., Kirsch, J., & Lane, J. (2011) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2010.70 · Cited by 192
Toward a cloud computing research agenda
Birman, K., Chockler, G., & van Renesse, R. (2009) · ACM SIGACT News · doi:10.1145/1556154.1556172 · Cited by 186
Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary
Veronese, G. S., Correia, M., Bessani, A. N., & Lung, L. C. (2009) · 2009 28th IEEE International Symposium on Reliable Distributed Systems · doi:10.1109/srds.2009.36 · Cited by 164
Self-citationThe byzantine empire in the intercloud
Vukolić, M. (2010) · ACM SIGACT News · doi:10.1145/1855118.1855137 · Cited by 120
From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
Sousa, J., & Bessani, A. (2012) · European Dependable Computing Conference · doi:10.1109/edcc.2012.32 · Cited by 114
Self-citationDepSpace: a byzantine fault-tolerant coordination service
Bessani, A., Alchieri, E., Correia, M. P., & Fraga, J. S. (2008) · European Conference on Computer Systems · doi:10.1145/1352592.1352610 · Cited by 100
Self-citationByzantine replication under attack
Amir, Y., Coan, B., Kirsch, J., & Lane, J. W. (2008) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2008.4630088 · Cited by 100
On the efficiency of durable state machine replication
Bessani, A., dos Santos, M. H., Felix, J., Neves, N., & Correia, M. P. (2013) · USENIX Annual Technical Conference · Cited by 91
Self-citationAnalysis of operating system diversity for intrusion tolerance
Garcia, M., Bessani, A., Gashi, I., Neves, N., & Obelheiro, R. R. (2013) · Software Practice and Experience · doi:10.1002/spe.2180 · Cited by 87
Self-citationEfficient middleware for byzantine fault tolerant database replication
Garcia, R., Rodrigues, R., & Preguiça, N. (2011) · European Conference on Computer Systems · doi:10.1145/1966445.1966456 · Cited by 67
Practical Hardening of Crash-Tolerant Systems ∗
Correia, M. P., Ferro, D. G., Junqueira, F., & Serafini, M. (2012) · Cited by 47
dBug: Systematic Evaluation of Distributed Systems
Šimša, J., Bryant, R. E., & Gibson, G. A. (2018) · Figshare · doi:10.1184/r1/6604631 · Cited by 30
Reconfiguring Replicated Atomic Storage: A Tutorial
Aguilera, M. K., Keidar, I., Malkhi, D., Martin, J., & Shraer, A. (2013) · Cited by 24
Experiences with Fault-Injection in a Byzantine Fault-Tolerant Protocol
Martins, R., Gandhi, R., Narasimhan, P., Pertet, S. M., Casimiro, A., Kreutz, D., & Veríssimo, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45065-5_3 · Cited by 19
From Byzantine fault tolerance to intrusion tolerance (a position paper)
Bessani, A. (2011) · International Conference on Dependable Systems and Networks workshops · doi:10.1109/dsnw.2011.5958857 · Cited by 18
Self-citation
Cited by
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051
“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].”
HotStuff: BFT Consensus with Linearity and Responsiveness
Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331591 · Cited by 1,028
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges
Xie, J., Tang, H., Huang, T., Yu, F. R., Xie, R., Liu, J., & Liu, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2899617 · Cited by 764
Metadata
- Authors
- Bessani, A., Sousa, J., & Alchieri, E. E. P.
- Venue
- 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
- Publisher
- IEEE
- Published
- 2014-06
- Pages
- 355-362
- OpenAlex
- W2110880385
- Cited by
- 567
- References
- 26
- FWCI
- 15.90
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.