Abstract
AbstractBlockchain is a kind of decentralized distributed ledger technology. Consensus algorithm is one of the main technologies of blockchain. Its efficiency and security directly affect the overall performance of the blockchain systems. Nowadays, Practical Byzantine Fault Tolerance (PBFT) algorithm is widely applied in the consortium blockchain systems. However, this consensus algorithm cannot identify and remove Byzantine nodes in time. In order to address these problems, this paper proposes an Optimized Practical Byzantine Fault Tolerant (OPBFT) consensus algorithm. It contains an improved reputation model that evaluates the node’s credibility for different behaviors of the nodes during the consensus process, and integrates byzantine detection and degradation mechanisms to reduce the probability of malicious nodes becoming consensus nodes and solve the problem of increased transaction delay caused by it; Simultaneously, it adopts an optimized consistency protocol to reduce communication overhead and improve consensus efficiency. Finally, the argumentation and analysis are carried out from the aspects of communication overhead, throughput, delay and security.KeywordsBlockchainConsensus algorithmOptimized consistency protocolReputation model
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
