The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary
Open accessAbstract
Most Byzantine fault-tolerant state machine replication (BFT) algorithms have a primary replica that is in charge of ordering the clients requests. Recently it was shown that this dependence allows a faulty primary to degrade the performance of the system to a small fraction of what the environment allows. In this paper we present Spinning, a novel BFT algorithm that mitigates such performance attacks by changing the primary after every batch of pending requests is accepted for execution. This novel mode of operation deals with those attacks at a much lower cost than previous solutions, maintaining a throughput equal or better to the algorithm that is usually consider to be the baseline in the area, Castro and Liskov's PBFT.
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
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
Cited by
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
State Machine Replication for the Masses with BFT-SMART
Bessani, A., Sousa, J., & Alchieri, E. E. P. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.43 · Cited by 567
Self-citationA Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
RBFT: Redundant Byzantine Fault Tolerance
Aublin, P.-L., Mokhtar, S. B., & Quema, V. (2013) · 2013 IEEE 33rd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2013.53 · Cited by 279
Dumbo: Faster Asynchronous BFT Protocols
Guo, B., Lu, Z., Tang, Q., Xu, J., & Zhang, Z. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417262 · Cited by 278
Metadata
- Authors
- Veronese, G. S., Correia, M., Bessani, A. N., & Lung, L. C.
- Venue
- 2009 28th IEEE International Symposium on Reliable Distributed Systems
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 135-144
- ISSN
- 1060-9857 (ISSN-L)
- OpenAlex
- W2103178123
- Cited by
- 164
- References
- 1
- FWCI
- 6.48
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary. https://app.cochat.ai/papers/10.1109/srds.2009.36
- The paper
- Veronese, G. S., Correia, M., Bessani, A. N., & Lung, L. C. (2009). Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary. 2009 28th IEEE International Symposium on Reliable Distributed Systems. https://doi.org/10.1109/srds.2009.36
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.