PBFT Consensus Algorithm Based on Reputation Value Voting and Random Number Election
Compared with Raft and Paxos, the original consensus algorithm, i.e., the Practical Byzantine Fault Tolerant(PBFT) algorithm, is mainly aimed at malicious nodes in a distributed system used to send error messages to other nodes, disturbing the normal operation of the entire system.This algorithm fun...
Uloženo v:
| Vydáno v: | Ji suan ji gong cheng Ročník 48; číslo 6; s. 42 - 49,56 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | čínština angličtina |
| Vydáno: |
Editorial Office of Computer Engineering
01.06.2022
|
| Témata: | |
| ISSN: | 1000-3428 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Compared with Raft and Paxos, the original consensus algorithm, i.e., the Practical Byzantine Fault Tolerant(PBFT) algorithm, is mainly aimed at malicious nodes in a distributed system used to send error messages to other nodes, disturbing the normal operation of the entire system.This algorithm fundamentally solves the Byzantine problem of the system.However, the PBFT algorithm itself has the problem of a low consensus efficiency caused by an arbitrary primary node election.Meanwhile, existing improved algorithms generally have problems of a high communication complexity and centralization tendency.Aiming at these problems, an improved consensus algorithm, RN-VPBFT, is proposed based on reputation value voting and random number election.First, by adding supervision nodes, the algorithm realizes a decentralization of rights and an information transfer and ensures the safe operation of the system.A random parameter is then introduced during the process of voting to determine the initial reputation value, and thus the reputation value is no longer the only criterion for selecting the master node.All nodes that meet certain conditions have an equal chance to be selected as the master node.This can reduce the trend of system centralization.Finally, the algorithm establishes the dynamic reputation model of the nodes to distinguish between honest and malicious nodes in the system, simplify the consistency protocol of the consensus algorithm, and reduce the communication complexity of the entire algorithm.Experimental results show that, compared with the original PBFT algorithm and the existing improved PBFT algorithm based on reputation voting, the RN-VPBFT algorithm can reduce the communication complexity from O(N2) to O(N).The final difference in reputation of all honesty nodes is only 0.02, which is almost negligible.Therefore, the proposed algorithm has a lower communication complexity and better decentralization. |
|---|---|
| AbstractList | Compared with Raft and Paxos, the original consensus algorithm, i.e., the Practical Byzantine Fault Tolerant(PBFT) algorithm, is mainly aimed at malicious nodes in a distributed system used to send error messages to other nodes, disturbing the normal operation of the entire system.This algorithm fundamentally solves the Byzantine problem of the system.However, the PBFT algorithm itself has the problem of a low consensus efficiency caused by an arbitrary primary node election.Meanwhile, existing improved algorithms generally have problems of a high communication complexity and centralization tendency.Aiming at these problems, an improved consensus algorithm, RN-VPBFT, is proposed based on reputation value voting and random number election.First, by adding supervision nodes, the algorithm realizes a decentralization of rights and an information transfer and ensures the safe operation of the system.A random parameter is then introduced during the process of voting to determine the initial reputation value, and thus the reputation value is no longer the only criterion for selecting the master node.All nodes that meet certain conditions have an equal chance to be selected as the master node.This can reduce the trend of system centralization.Finally, the algorithm establishes the dynamic reputation model of the nodes to distinguish between honest and malicious nodes in the system, simplify the consistency protocol of the consensus algorithm, and reduce the communication complexity of the entire algorithm.Experimental results show that, compared with the original PBFT algorithm and the existing improved PBFT algorithm based on reputation voting, the RN-VPBFT algorithm can reduce the communication complexity from O(N2) to O(N).The final difference in reputation of all honesty nodes is only 0.02, which is almost negligible.Therefore, the proposed algorithm has a lower communication complexity and better decentralization. |
| Author | CHEN Runyu, WANG Lunwen, ZHU Rangang |
| Author_xml | – sequence: 1 fullname: CHEN Runyu, WANG Lunwen, ZHU Rangang organization: Institute of Electronic Countermeasure, National University of Defense Technology, Hefei 230037, China |
| BookMark | eNo9jMtuwjAURL2gUoH2H9wPSHodP2IvAUGLhNoKUbbRJbFpUGKjOFn075s-1M3M6GhmZmTig7eEPDBImVG5frykdYw-ZQCQcJHpFEBxA2JCpv_slsxivACILAOYksPbcnOgq-Cj9XGIdNGcQ1f3Hy1dYrQVDZ7u7XXosa_HeMRmsPQY-tqfKfqK7kcJLX0Z2pPt6Lqx5Xfvjtw4bKK9__M5ed-sD6vnZPf6tF0tdknFuOoTnVUZchRGSZczhVY4yTHXuS4dQm6EBMtKK7h0TDrgxqIEmTsmxg2C4XOy_f2tAl6Ka1e32H0WAeviB4TuXGDX12VjC43OMTTjUyUEU1ZnwnHOtNLZyWiG_Avc0mB1 |
| ContentType | Journal Article |
| DBID | DOA |
| DOI | 10.19678/j.issn.1000-3428.0063904 |
| DatabaseName | DOAJ: Directory of Open Access Journals |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 49,56 |
| ExternalDocumentID | oai_doaj_org_article_8aff1a95f1d4416e824f3318682b981a |
| GroupedDBID | -0Y 5XA 5XJ 92H 92I ABJNI ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CUBFJ CW9 GROUPED_DOAJ TCJ TGT U1G U5S |
| ID | FETCH-LOGICAL-d136t-82d2a3a4965f716ae4f53a7878cfa079450e1ce435f15f039ea5057f14a49a093 |
| IEDL.DBID | DOA |
| ISSN | 1000-3428 |
| IngestDate | Mon Nov 03 22:00:19 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | Chinese English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-d136t-82d2a3a4965f716ae4f53a7878cfa079450e1ce435f15f039ea5057f14a49a093 |
| OpenAccessLink | https://doaj.org/article/8aff1a95f1d4416e824f3318682b981a |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_8aff1a95f1d4416e824f3318682b981a |
| PublicationCentury | 2000 |
| PublicationDate | 2022-06-01 |
| PublicationDateYYYYMMDD | 2022-06-01 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-06-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Ji suan ji gong cheng |
| PublicationYear | 2022 |
| Publisher | Editorial Office of Computer Engineering |
| Publisher_xml | – name: Editorial Office of Computer Engineering |
| SSID | ssj0042200 |
| Score | 2.1982183 |
| Snippet | Compared with Raft and Paxos, the original consensus algorithm, i.e., the Practical Byzantine Fault Tolerant(PBFT) algorithm, is mainly aimed at malicious... |
| SourceID | doaj |
| SourceType | Open Website |
| StartPage | 42 |
| SubjectTerms | blockchain|consensus algorithm|practical byzantine fault tolerant(pbft) algorithm|reputation value voting|random number election |
| Title | PBFT Consensus Algorithm Based on Reputation Value Voting and Random Number Election |
| URI | https://doaj.org/article/8aff1a95f1d4416e824f3318682b981a |
| Volume | 48 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals issn: 1000-3428 databaseCode: DOA dateStart: 20160101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.doaj.org/ omitProxy: false ssIdentifier: ssj0042200 providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SRPQgPvFNBK_b5tkmx1ZaPEgpUktvS7pJfNDuSh_-fidJlXry4mUPWRKWGTLzzWbyfQjdFUJaS2WRaaEmoUDhGaBWlXHuPPPUWh2PC0aPrX5fjcd6sCH1FXrCEj1wMlxDGe-p0RLmQeZuOsWE5zyQvLOJVjRCI9LS38VUisGCMZJ4CAhEGUDYO-g23syD0Nx4j9ur_vOuHtM0Eb9Y-2N66R2g_TUuxO30PYdoy5VHaG-DLfAYDQed3hAHhc0gT7HA7elLBaX96wx3IBVZXJUY4PQqna3jkZmuHB5Voa0Zm9LiJ3hUM9yPEiC4O409WOUJeu51h_cP2VoUIbOUN5eZYpYZbgLNu4daxzjhJTew7VThDRhCSOJo4QAFeSo94dqZUIN4KmCOIZqfolpZle4MYaMdl4aIgjoqXDOoG0jtmOewKudsco46wSD5R-K9yAMTdRwA_-Rr_-R_-efiPxa5RLssXDuIfz-uUG05X7lrtF18Lt8W85vo-i9SDK8y |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=PBFT+Consensus+Algorithm+Based+on+Reputation+Value+Voting+and+Random+Number+Election&rft.jtitle=Ji+suan+ji+gong+cheng&rft.au=CHEN+Runyu%2C+WANG+Lunwen%2C+ZHU+Rangang&rft.date=2022-06-01&rft.pub=Editorial+Office+of+Computer+Engineering&rft.issn=1000-3428&rft.volume=48&rft.issue=6&rft.spage=42&rft.epage=49%2C56&rft_id=info:doi/10.19678%2Fj.issn.1000-3428.0063904&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_8aff1a95f1d4416e824f3318682b981a |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1000-3428&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1000-3428&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1000-3428&client=summon |