Simulation Of Optimized Cluster Based PBFT Blockchain Validation Process

Abstract

Recently, blockchain technology has emerged as a revolutionary innovation with its distributed ledger feature that allows applications to store and transmit data in a secure, transparent, and immutable manner. One of the main ideas of blockchain technology is the consensus mechanism for reaching an agreement on the state of the distributed ledger. In this context, Practical Byzantine Fault Tolerance (PBFT) is one of the most popular algorithms. However, it has a high communication overhead and poor scalability. To overcome these limits, this paper presents the effectiveness of our algorithm Random Cluster PBFT (RC-PBFT) through an evaluation of its performance under various network conditions. Our algorithm runs on randomly selected clusters, and the results are then broadcast on the blockchain network. The effectiveness of RC-PBFT is demonstrated by implementations on the NS-3 network simulator, and the tests performed show that our approach achieves significant improvements compared to the original PBFT algorithm.