An Improved Gossip Algorithm Based on Semi-Distributed Blockchain Network

Abstract

With the continuous development of blockchain technology, more and more blockchain projects use semi-distributed P2P network structures. Although original gossip algorithm can be devoted to data synchronization in semi-distributed blockchain network, it can not be well applied to actual network environment. Since the probability of selecting a target node during data synchronization is fixed, it is inevitable that a message can be sent to a duplicate node. It will not only cause a lot of redundant messages, but also bring inefficient data synchronization. To address this problem, this paper proposes an improved HNA-Gossip algorithm which can reduce the probability of selecting duplicate nodes to send messages by recording historical node information dynamically. The simulation results show that, compared with the original gossip algorithm, various aspects of HNA-Gossip algorithm perform better.