Skip to main content
SpringerLink
Log in

Optimization Scheme of Consensus Mechanism Based on Practical Byzantine Fault Tolerance Algorithm

  • Conference paper
  • First Online:
Blockchain Technology and Application (CBCC 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1176))

Included in the following conference series:

Abstract

Blockchain was first proposed in 2009, it is a kind of distributed ledger system with peer-to-peer network, which has drawn wide spread attention because of its characteristics such as decentralization, security and credibility. The consensus algorithm of the blockchain is a mechanism for achieving agreement among the nodes in the blockchain. How to reach consensus quickly and effectively is the core issue of the blockchain. Byzantine nodes are invalid or malicious nodes in the blockchain. This paper considers the actual situation of Byzantine nodes in the blockchain. For the problem that the classical PBFT algorithm has too much communication spending and cannot dynamically follow the change of consensus nodes, an improved PBFT algorithm in this paper is proposed. In the improved Practical Byzantine consensus algorithm (IMP-PBFT), the convergence speed of the consensus process is effectively improved under the condition of the fault tolerance rate. The experiment proves the accuracy and effectiveness of the improved PBFT algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system [J/OL] (2008)

    Google Scholar 

  2. Ethereum [EB/OL] (2017). https://www.ethereum.org/

  3. Hyperledger [EB/OL] (2017). https://www.hyperledger.org/

  4. EOS [EB/OL] (2018). https://eos.io/

  5. Vasin, P.: Blockchain’s proof-of-stake protocol v2 [J/OL] (2014)

    Google Scholar 

  6. Larimer, D.: Delegated proof-of-stake white paper [EB/OL]

    Google Scholar 

  7. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)

    Article  Google Scholar 

  8. Castro, M.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Program. Lang. Syst. (TOCS) 20(4), 398–461 (2002)

    Article  Google Scholar 

  9. Sun, J., Yan, J., Zhang, K.Z.K.: Blcokchain-based sharing services: what blockchain technology can contribute to smart cities. Financ. Innov. 2, 1–9 (2016)

    Article  Google Scholar 

  10. Happe, A., Krenn, S., Lorunser, T.: PBFT and secret-shring in storage settings. In: Twenty-Fourth International Workshop on Security Protocols (2016)

    Google Scholar 

  11. Lamport, L.: Seminal research document related to the field of Byzantine fault tolerance (1982)

    Google Scholar 

  12. Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998)

    Article  Google Scholar 

  13. Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1995)

    Article  MathSciNet  Google Scholar 

  14. Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle tree representation and traversal. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 314–326. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36563-X_21

    Chapter  Google Scholar 

  15. Swan, M.: Blockchain: Blueprint for a New Economy. O’Really Media, Sebastopol (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China

    Zhipeng Gao & Lulin Yang

Authors
  1. Zhipeng Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lulin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhipeng Gao .

Editor information

Editors and Affiliations

  1. Fudan University, Shanghai, China

    Xueming Si

  2. Huazhong University of Science and Technology, Wuhan, China

    Hai Jin

  3. Chinese Academy of Sciences, Beijing, China

    Yi Sun

  4. Central University of Finance and Economics, Beijing, China

    Jianming Zhu

  5. Central University of Finance and Economics, Beijing, China

    Liehuang Zhu

  6. Harbin University of Science and Technology, Harbin, China

    Xianhua Song

  7. National Academy of Guo Ding, Harbin, China

    Zeguang Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gao, Z., Yang, L. (2020). Optimization Scheme of Consensus Mechanism Based on Practical Byzantine Fault Tolerance Algorithm. In: Si, X., et al. Blockchain Technology and Application. CBCC 2019. Communications in Computer and Information Science, vol 1176. Springer, Singapore. https://doi.org/10.1007/978-981-15-3278-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3278-8_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3277-1

  • Online ISBN: 978-981-15-3278-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation