The Practical Byzantine Fault Tolerant(PBFT) consensus algorithm that is applied to alliance chains has poor efficiency for consensus node selection and multi-node consensus. Therefore, a multi-storey practical Byzantine optimized consensus algorithm called MS-PBFT is proposed. The nodes are grouped according to their respective organizations, and the nodes in each group are divided into primary and secondary network layers. An integration mechanism is introduced to assign initial points and reputation values to each node based on its performance and performance in the system to monitor the behavior of the node during the consensus process. Nodes are classified based on initial points and reputation values and added to different levels, improving the selection method of upper level nodes and master nodes and adding an impeachment mechanism to timely replace leaders who are offline or have malicious behavior, which ensures the reliability of nodes and improves consensus efficiency. Achieving local consensus at the secondary network layer and achieving global consensus at the primary network layer reduces the communication complexity of nodes. Experimental results show that compared to the DGPBFT, PBFT, and RAFT algorithms, the MS-PBFT algorithm can improve data throughput and reduce consensus latency.Using the proposed node election mechanism, the consensus success rate of nodes can reach 98.6%, and the consensus efficiency is improved by an average of 33% compared to the PBFT algorithm.
Practical Byzantine Fault Tolerance(PBFT) algorithm,