The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
A Scalable Multi-Layer PBFT Consensus for Blockchain
Open accessAbstract
Practical Byzantine Fault Tolerance (PBFT) consensus mechanism shows a great potential to break the performance bottleneck of the Proof-of-Work (PoW)-based blockchain systems, which typically support only dozens of transactions per second and require minutes to hours for transaction confirmation. However, due to frequent inter-node communications, PBFT mechanism has a poor node scalability and thus it is typically adopted in small networks. To enable PBFT in large systems such as massive Internet of Things (IoT) ecosystems and blockchain, in this article, a scalable multi-layer PBFT-based consensus mechanism is proposed by hierarchically grouping nodes into different layers and limiting the communication within the group. We first propose an optimal double-layer PBFT and show that the communication complexity is significantly reduced. Specifically, we prove that when the nodes are evenly distributed within the sub-groups in the second layer, the communication complexity is minimized. The security threshold is analyzed based on faulty probability determined (FPD) and faulty number determined (FND) models, respectively. We also provide a practical protocol for the proposed double-layer PBFT system. Finally, the results are extended to arbitrary-layer PBFT systems with communication complexity and security analysis. Simulation results verify the effectiveness of the analytical results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
Bitcoin: A Peer-to-Peer Electronic Cash System
Squarepants, S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3977007 · Cited by 11,148
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Blockchain technology and its relationships to sustainable supply chain management
Saberi, S., Kouhizadeh, M., Sarkis, J., & Shen, L. (2019) · International Journal of Production Research · doi:10.1080/00207543.2018.1533261 · Cited by 4,118
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
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · USENIX Annual Technical Conference · Cited by 3,398
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Mathematical Statistics and Data Analysis
Rabinowitz, L. (1989) · Technometrics · doi:10.1080/00401706.1989.10488573 · Cited by 3,116
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
IoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488 · cited 1×
“…in other applications such as blockchain-enabled scenarios with massive IoT devices connection, where scalability is a bottleneck but not latency, multi-layer PBFT provides a solution with greatly improved node scalability while protecting the system from malicious attacks [22], [23], [24].”
BackgroundA Secure Sharding Protocol For Open Blockchains
Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., & Saxena, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978389 · Cited by 1,428
A Privacy-Preserving and Transparent Certification System for Digital Credentials
Saramago, R. Q., Meling, H., & Jehl, L. N. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2022.9 · Cited by 1,171
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 · cited 1×
“Unlike the public blockchain, the private and consortium blockchains prefer to adopt lighter consensus protocols such as PBFT, Paxos [7] and Raft [8], [9] to reduce the amount of computational power and improve the transaction through-put [10].”
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
Towards an Optimized BlockChain for IoT
Dorri, A., Kanhere, S. S., & Jurdak, R. (2017) · Proceedings of the Second International Conference on Internet-of-Things Design and Implementation · doi:10.1145/3054977.3055003 · Cited by 752
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
An Introduction to Probability Theory and Its Applications
Samuels, S. M. (1973) · Technometrics · doi:10.1080/00401706.1973.10489056 · Cited by 503
Casper the Friendly Finality Gadget
Schwarz-Schilling, C., Saleh, F., Thiery, T., Pan, J., Shah, N., & Monnot, B. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.aft.2023.30 · Cited by 405
When internet of things meets blockchain: Challenges in distributed consensus
Cao, B., Li, Y., Zhang, L., Zhang, L., Mumtaz, S., Zhou, Z., & Peng, M. (2019) · IEEE Network · doi:10.1109/mnet.2019.1900002 · Cited by 332
Self-citationApplications of Blockchain Technology beyond Cryptocurrency
Miraz, M. H., & Ali, M. (2018) · Annals of Emerging Technologies in Computing · doi:10.33166/aetic.2018.01.001 · Cited by 302
Mathematical Statistics and Data Analysis.
Leonard, T., & Rice, J. A. (1989) · Journal of the American Statistical Association · doi:10.2307/2289973 · Cited by 269
Sun, Y., Zhang, L., Feng, G., Yang, B., Cao, B., & Imran, M. A. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2905743 · Cited by 246
Self-citationGuerraoui, 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
Blockchain Consensus Protocols in the Wild (Keynote Talk)
Cachin, C., & Vukolić, M. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.disc.2017.1 · Cited by 114
On the Viable Area of Wireless Practical Byzantine Fault Tolerance (PBFT) Blockchain Networks
Onireti, O., Zhang, L., & Imran, M. A. (2019) · Globecom · doi:10.1109/globecom38437.2019.9013778 · Cited by 71
Self-citationScalable practical byzantine fault tolerance with short-lived signature schemes
Fan, X. (2018) · Computer Science and Software Engineering · Cited by 25
Dispel: Byzantine SMR with Distributed PipeliningPreprint
Voron, G., & Gramoli, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.10367 · Cited by 22
Cited by
What is Semantic Communication? A View on Conveying Meaning in the Era of Machine Intelligence
Lan, Q., Wen, D., Zhang, Z., Zeng, Q., Chen, X., Popovski, P., & Huang, K. (2021) · Journal of Communications and Information Networks · doi:10.23919/jcin.2021.9663101 · Cited by 255
M., P., Bourouis, S., Ahmed, A. N., M., V., K.G.S., V., Alhakami, W., & Hamdi, M. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.05.014 · Cited by 108
Secure and Personalized Edge Computing Services in 6G Heterogeneous Vehicular Networks
Hui, Y., Cheng, N., Su, Z., Huang, Y., Zhao, P., Luan, T. H., & Li, C. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3065970 · Cited by 76
Navigating blockchain’s twin challenges: scalability and regulatory compliance
Mohammed Abdul, S. S. (2024) · Blockchains · doi:10.3390/blockchains2030013 · Cited by 54
Metadata
- Authors
- Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. A.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2021-05-01
- Volume
- 32
- Issue
- 5
- Pages
- 1146-1160
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W3108722340
- Cited by
- 442
- References
- 29
- FWCI
- 45.56
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.