DC-PBFT: A PBFT Consensus Algorithm Based on Grouping Mode According to Delay Clustering
Abstract
ut. To address these, we propose DC-PBFT, a modified PBFT algorithm based on a clustering model and an improved k-means clus tering approach. We analyze the challenges in applying PBFT, then use enhanced k-means clustering to group nodes based on com munication delay, optimizing clustering and the consensus process. The improved algorithm effectively reduces consensus latency, i ncreases
throughput, and lowers communication costs. Experimental results show that DC-PBFT enhances efficiency and stability, improving
key performance metrics.
Keywords
Full Text:
PDFReferences
[1] S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, White Paper, 2008. [Online]. Available: http://www.bitcoin.org/ bitcoin. pdf
[2] L. Zhang, Y. Xie, Y. Zheng, W. Xue, X. Zheng, X, Xu, The challenges and countermeasures of blockchain in finance and economics,
Systems Research and Behavioral Science, vol. 37, no. 4, pp. 691-698, 2020
[3] Q. Wang, X. Zhu, Y. Ni, L.Gu and H. Zhu, Blockchain for the IoT and industrial IoT: A review, Internet of Things, vol. 10, pp.
100081, 2020
[4] M. P. McBee and C. Wilcox, Blockchain technology: principles and applications in medical imaging, Journal of digital imaging, vol.
33, no. 3, pp. 726-734, 2020
[5] J. Xu, C. Wang and X. Jia, A survey of blockchain consensus protocols, ACM Computing Surveys, vol. 55, no. 13s, pp. 1-35, 2023
[6] W. Li, et al. A scalable multi-layer PBFT consensus for blockchain, IEEE Transactions on Parallel and Distributed Systems, vol. 32,
no. 5, pp. 1146-1160, 2020
[7] J. Liu, W. Feng, M. Huang, S. Feng, Y. Zhang, Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios, Sensors, vol. 23, no. 21, pp. 8903, 2023
[8] M. Castro, B. Liskov, Practical byzantine fault tolerance, in OsDI 1999, pp. 173-186
[9] H. Sukhwani, et al. Performance modeling of PBFT consensus process for permissioned blockchain network, in 2017 IEEE 36th
symposium on reliable distributed systems, 2017, pp. 253-255
[10] X. Fan, Scalable practical byzantine fault tolerance with short-lived signature schemes, in Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering, 2018, pp. 245-256
[11] R. B. Othmen, W. Abbessi, S. Ouni, W. Badreddine and G. Dequen, Simulation Of Optimized Cluster Based PBFT Blockchain Validation Process, in 2023 IEEE Symposium on Computers and Communications, 2023, pp. 1317-1322
[12] G. Yuan, L.Feng, J. Ning and X. Yang, Improvement of practical byzantine fault tolerant consensus algorithm for blockchain, in 2021
IEEE 3rd International Conference on Frontiers Technology of Information and Computer, 2021, pp. 182-187
[13] Y. Tu, Y. Chen, T. Li, X. Ren and X. Ping, PBFT improvement scheme based on reputation voting, J. Appl. Sci, vol. 39, pp 79-89, 2021
[14] H. Luo, ULS-PBFT: An ultra-low storage overhead PBFT consensus for blockchain, Blockchain: Research and Applications, vol. 4,
no. 4, pp. 100155, 2023
[15] G. Gueta, et al. SBFT: A scalable and decentralized trust infrastructure, in 2019 49th Annual IEEE/IFIP international conference on
dependable systems and networks, 2019, pp. 568-580
DOI: http://dx.doi.org/10.70711/frim.v2i10.5420
Refbacks
- There are currently no refbacks.
