Abstract
In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.
Highlights
Blockchain is a new decentralized distributed system that uses cryptography, consensus mechanism, peer-to-peer communication, and other technologies to ensure the consistency and effectiveness of data across a network [1]
The first contribution is to propose a consensus mechanism combining delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT), which can rapidly deal with malicious witness nodes and shorten the time of block verification
(1) Witness node election process The nodes in the blockchain system are elected through the DPoS consensus mechanism, and nodes with superior performance in production blocks and high votes are selected as candidate nodes
Summary
Blockchain is a new decentralized distributed system that uses cryptography, consensus mechanism, peer-to-peer communication, and other technologies to ensure the consistency and effectiveness of data across a network [1]. In order to meet performance requirements of commercial applications, Zhang [8] proposed a concurrent Byzantine fault tolerant algorithm model based on actor, which improves the transaction processing speed of the blockchain system. Schwartz [11] proposed the ripple protocol consensus algorithm (RPCA) consensus mechanism, which was combined with the Byzantine general problem. The first contribution is to propose a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. The third contribution is to analyze the performance of the consensus mechanism combining DPoS and PBFT by using the M/PH/1 queuing model and to evaluate the performance of the improved practical Byzantine fault-tolerant consensus mechanism from the steady-state conditions and key performance measure of the system.
Sign-in/Register to view highlights & summary 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.
