Byzantine容错
一致性算法
计算机科学
共识
块链
节点(物理)
算法
一致共识
分布式计算
投票
量子拜占庭协议
容错
过程(计算)
延迟(音频)
架空(工程)
多智能体系统
人工智能
计算机安全
工程类
电信
政治
操作系统
结构工程
法学
政治学
作者
GuiChun Yuan,LiuPing Feng,Jing Ning,XiaoYu Yang
标识
DOI:10.1109/icftic54370.2021.9647347
摘要
The PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm widely used in alliance blockchain, but there are some problems of high communication overhead and high latency. Therefore, the original PBFT consensus algorithm is improved in the paper. Firstly, the voting mechanism is introduced for the original PBFT algorithm. The nodes are divided into two classes: consensus node and ordinary node. The primary node is selected from the consensus nodes to lead the consensus process to ensure the reliability of the consensus results. Secondly, the consensus process of PBFT algorithm was optimized. The consensus process is simplified into three phases, which reduces the algorithm complexity and improves the consensus efficiency. The experiment shows that our improved PBFT algorithm has better performance than the original PBFT algorithm in communication overhead and consensus delay.
科研通智能强力驱动
Strongly Powered by AbleSci AI