Improve PBFT Based on Hash Ring

Wang Zhong,Mengxing Huang,Siling Feng,Xiandong Zheng,Wenlong Feng,Mariusz Glabowski

doi:10.1155/2021/7327372

Wang Zhong, Mengxing Huang + Show 4 more

Open Access

https://doi.org/10.1155/2021/7327372

Copy DOI

Abstract

Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR-PBFT algorithm is proposed. First, the HR-PBFT algorithm uses a hash ring to group nodes, which ensures the randomness and fairness of the grouping. Then, a dual-view mechanism is used in the consensus process, where the first layer node maintains the primary view and the second layer node maintains the secondary view to ensure the proper operation of the algorithm. Finally, the Byzantine node determination mechanism is introduced to evaluate the node status according to the node behavior in the consensus process, improve the reliability of primary node selection, and reduce the frequency of view changes. The experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused by the increase in the number of nodes in the network and prevent frequent view changes.

Highlights

Since the birth of Bitcoin [1], digital cryptocurrency has developed rapidly, and its underlying blockchain technology has been widely studied by scholars
An optimization scheme based on hash ring is proposed to solve the problem that the communication complexity increases rapidly with the increase of the number of nodes in the consensus process of the traditional practical Byzantine algorithm and the Byzantine nodes are elected as primary nodes leading to consensus failure and frequent view switching
A dual-view mechanism is used in the consensus process, where the first layer nodes maintain the primary view and the second layer nodes maintain the secondary view to ensure the normal operation of the algorithm

Summary

Introduction

Since the birth of Bitcoin [1], digital cryptocurrency has developed rapidly, and its underlying blockchain technology has been widely studied by scholars. In method 1, a grouping approach is used, based on node attributes (node hardware performance, network communication capability, geographic location, etc.) divided into several groups by clustering algorithms, with intragroup consensus first and intergroup consensus. In [5], an improved PBFT consensus mechanism based on K-medoids is proposed to perform intragroup consensus and intergroup consensus by clustering and hierarchical division of the characteristics of large-scale network nodes. In method 4, using a simplified PBFT three-stage protocol, the paper [12] simplifies the three-stage consensus of PBFT to two-stage consensus, which reduces the communication overhead and improves the consensus efficiency These improved algorithms optimize the traditional PBFT algorithm to some extent, there are problems: grouping according to the node attributes, human intervention is large, and the grouping can be controlled by adjusting node attributes. The third section presents the experimental comparison and analysis with the traditional PBFT algorithm, and the fourth section is the conclusion of this paper

Design of HR-PBFT Consensus Algorithm

A3 B0 B1 B2 B3 C0 C1 C2 C3 D0 D1 D2 D3

Analysis and Experiment

Conclusions