A Novel Improved Gossip Algorithm for Blockchain Network

Abstract

In blockchain (BC) systems, increasing throughput is a key concern. A number of enhancements and a novel gossip algorithm are proposed to address this problem, but they are inherently constrained by the underlying peer-to-peer (P2P) network’s message synchronization latency. There are still some issues with the gossip algorithms that are in use today, including low throughput, high latency, energy waste, and increased network communication requirements. In order to lower delivery latency and increase transaction throughput for BC systems, a highly efficient BC gossip algorithm is essential. The distributed ledger, known as the BC, is used to centrally store all activities and transactions. Public blockchains such as Bitcoin highlight decentralization, which raises communication costs and requires high throughput. The purpose of the partial decentralization is to boost consortium BC’s effectiveness. Although the high communication overhead slows down scalability, the consensus techniques used in consortium BC have addressed a number of limitations. Therefore, the joint-graph based delegated practical byzantine fault tolerance (JG-DPBFT) consensus mechanism is used for the hyperledger fabric BC technology. The improved gossip algorithm (IGA) is utilized to complete information communication and consensus authentication. The JG-DPBFT protocol is implemented using NS-3, and the performance is evaluated by comparing it with existing methods. As a result, the experimental outcomes proved that the JG-DPBFT has attained better throughput and latency than the prevailing methods.