【Author】
Na, Yanhe; Wen, Zhan; Fang, Jie; Tang, Yin; Li, Yingxiang
【Abstract】The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent disadvantage of inadequate fault tolerance. The typically derived PBFT algorithms focus on reducing communication complexity at the cost of diminished system security or fault tolerance. In this paper, Dual-Primary-Node derived Practical Byzantine Fault Tolerance (DPNPBFT) is proposed to achieve the best balance of the above three performances. First, DPNPBFT selects dual master nodes based on the idea of power separation. The two master nodes check balance and supervise each other to avoid excessive centralization as a single master node system. It also reduces the communication complexity of the replica node, which only communicates with the master node. Furthermore, we designed the architecture of DPNPBFT to get a practical 49% fault tolerance rate, and it is close to the current mainstream Proof of Work and Proof of Stake algorithms. Experimental results demonstrate that DPNPBFT has O(N) level communication complexity and excellent anti-host node malicious performance. The Transactions Per Second of DPNPBFT is stable at 1700. It proves DPNPBFT has the best performance balance and excellent comprehensive performance for large-scale Internet of Things application scenarios.
【Keywords】Complexity theory; Consensus algorithm; Fault tolerant systems; Fault tolerance; Blockchains; Security; Internet of Things; Blockchain; PBFT; consensus algorithm; communication complexity
【标题】一种基于权力分离的双主节点衍生PBFT区块链共识算法DPNPBFT
【摘要】实用的拜占庭容错(PBFT)共识算法具有许多优点，使得PBFT得到了广泛的应用。然而，由于其高通信复杂性，PBFT不适合大规模节点场景，并且它还具有明显的容错能力不足的缺点。典型的衍生PBFT算法集中于以降低系统安全性或容错性为代价来降低通信复杂度。本文提出了双主节点衍生的实用拜占庭容错(DPNPBFT)来实现上述三种性能的最佳平衡。首先，DPNPBFT基于权力分离的思想选择双主节点。两个主节点检查平衡并相互监督，以避免作为单个主节点系统的过度集中。它还降低了副本节点的通信复杂度，副本节点只与主节点通信。此外，我们设计了DPNPBFT的体系结构，得到了49%的实际容错率，接近当前主流的工作证明和利益证明算法。实验结果表明，DPNPBFT具有O(N)级通信复杂度和良好的抗主机节点恶意性能。DPNPBFT的每秒事务数稳定在1700。证明了DPNPBFT在大规模物联网应用场景中具有最佳的性能平衡和优异的综合性能。
评论