2019 · 16 citations · 5 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsFault ToleranceFault-tolerant SystemsConsensus AlgorithmsConsensus ProtocolsDistributed ConsensusDistributed SynchronizationFault-tolerant CommunicationNetwork Fault ToleranceBlockchain ConsensusCommunication Overhead ReductionConsensus Fault ToleranceConsensus MechanismsFault-tolerant ConsensusFault-tolerant Consensus ProtocolsFault-tolerant CoordinationPractical Byzantine Fault Tolerance
Focused on the problem of master node selection and communication overhead in the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm which applied to the consortium blockchain, this paper proposes an Egalitarian Practical Byzantine Fault Tolerance (ePBFT) consensus algorithm based on the PBFT algorithm. First, the concept of the primary node is diluted, so that each node in the chain is equal and efficient. Secondly, the consensus process is optimized to improve the efficiency of the consensus, the communication overhead is reduced to half of the PBFT in the case of less view changes. The experimental results show that the ePBFT algorithm and the PBFT algorithm are compared in the same environment, and the throughput is improved when the communication overhead and delay are reduced.
5
Leslie Lamport · ACM Transactions on Computer Systems · 1998 · 2.7K citations · Full text
Reaching Agreement in the Presence of Faults
Marshall C. Pease, Robert E. Shostak, Leslie Lamport · Journal of the ACM · 1980 · 2.4K citations · Full text
In search of an understandable consensus algorithm
Diego Ongaro, John K. Ousterhout · 2014 · 1.5K citations