Skip to main content

A Blockchain Consensus for Message Queue Based on Byzantine Fault Tolerance

  • Conference paper
  • First Online:
Economics of Grids, Clouds, Systems, and Services (GECON 2020)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12441))

  • 383 Accesses

Abstract

Blockchain technology is developing rapidly, and many companies that develop and apply blockchain technology have gradually risen. Most companies choose to use the consortium blockchain. Because the consortium blockchain is for small-scale groups or institutions, identity authentication is required to join the consortium blockchains. Therefore, security can be guaranteed to a certain extent. Blockchain is often considered as a distributed accounting system. An important mechanism to ensure the stable operation of this accounting system is to ensure consistency among the distributed ledgers. The consensus mechanism in the blockchain is the algorithm that accomplishes this function. To improve throughput, many consortium blockchains use message queues as the consensus algorithm. However, the message queue consensus cannot tolerate malicious nodes. Aiming at this problem, this paper designs and implements a consensus for message queue based on Byzantine fault tolerance, which improves and combines message queue and PBFT. Moreover, it is verified through experiments that the consensus algorithm can reach the general level of TPS. The system can still operate normally when malicious nodes appear within the tolerable range, which has certain robustness and efficiency.

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

Access this chapter

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

Notes

  1. 1.

    What is Hyperledger Fabric, [Online]. Available: https://hyperledgerfabric.readthedocs.io/en/latest/blockchain.html#what-is-hyperledgerfabric.

  2. 2.

    Hyperledger Fabric Glossary, [Online]. Available: http://hyperledgerdocs.readthedocs.io/en/latest/glossary.html.

  3. 3.

    The Ordering Service, [Online]. Available: https://hyperledger-fabric.readthedocs.io/en/latest/orderer/ordering_service.html#raft.

  4. 4.

    Consensus agreement-RAFT & PBFT [Online]. Available: https://www.cnblogs.com/helloworldcode/p/11094099.html, last accessed 2020/05/05.

  5. 5.

    Kafka documentation, [Online]. Available: https://kafka.apache.org/documentation/.

  6. 6.

    Zookeeper documentation, [Online]. Available: https://zookeeper.apache.org/doc/.

  7. 7.

    Bringing up a Kafka-based Ordering Service, [Online]. Available: https://hyperledger-fabric.readthedocs.io/en/latest/kafka.html.

References

  1. Chen, W., Xu, Z., Shi, S., Zhao, Y., Zhao, J.: A survey of blockchain applications in different domains (2019). arXiv:1911.02013 [cs.CR]

  2. Cao, Z.: A consensus mechanism suitable for alliance chains. Cyberspace Secur. 10(01), 100–105 (2019)

    Google Scholar 

  3. Fang, W., Wang, Z., Song, H., et al.: A blockchain-oriented optimized PBFT consensus algorithm. J. Beijing Jiaotong Univ. 43(05), 58–64 (2019)

    Google Scholar 

  4. Fatourou, P.: The distributed computing column. Inform. Econ. J. 17(4), 109–122 (2013)

    Google Scholar 

  5. Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm (2014)

    Google Scholar 

  6. Duan, J., Karve, A., Sreedhar, V., et al.: Service management of blockchain networks. In: 2018 IEEE 11th International Conference on Cloud Computing (CLOUD). IEEE Computer Society (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiahui Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Zhao, J., Song, X., Liu, Y., Wu, Q. (2020). A Blockchain Consensus for Message Queue Based on Byzantine Fault Tolerance. In: Djemame, K., Altmann, J., Bañares, J.Á., Agmon Ben-Yehuda, O., Stankovski, V., Tuffin, B. (eds) Economics of Grids, Clouds, Systems, and Services. GECON 2020. Lecture Notes in Computer Science(), vol 12441. Springer, Cham. https://doi.org/10.1007/978-3-030-63058-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63058-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63057-7

  • Online ISBN: 978-3-030-63058-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics