Research on Optimization Model of Storage Capacity Based on the Consortium Blockchain

  • Xiaotian Wei
  • Jiahua Chen
  • Zhihuai LiEmail author
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 517)


To solve the problem of increasing nodes data in blockchain, we propose an optimization model of storage capacity based on the consortium blockchain (OMSCCB). We have divided blockchain network into groups by the characteristics of partial decentralization of the consortium blockchain in the OMSCCB. In each group, the full node is selected according to the hardware performance and the accumulated reliability evaluation of the node. The full node is responsible for storing the blockchain data, and other ordinary nodes segment storage of the blockchain data according to the consistent hashing. And then, we have designed a replacement strategy of full node to ensure that the OMSCCB can resume normal operation when the network is attacked. The experimental results show that the storage cost of the system can be reduced effectively, and the reliability of the system can be guaranteed at the same time.


OMSCCB Full node Segment storage Consistent hashing Consortium blockchain 


  1. 1.
    Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. J. Gen. Philos. Sci. (2008)Google Scholar
  2. 2.
    Azaria, A., Ekblaw, A., Vieira, T., et al.: MedRec: using blockchain for medical data access and permission management. In: International Conference on Open and Big Data. IEEE (2016)Google Scholar
  3. 3.
    Xu, T.: Research on the Development and significance of “Blockchain+" education. J. Distance Educ. 35(02), 19–28 (2017)Google Scholar
  4. 4.
    Conoscenti, M., Vetr, A., Martin, J.C.D.: Blockchain for the Internet of Things: a systematic literature review. In: Computer Systems and Applications. IEEE (2017)Google Scholar
  5. 5.
    Jia, D., Xin, J., Wang, W., et al.: Storage capacity scalable model for blockchain (in chinese). J. Front. Comput. Sci. Technol. (2017)Google Scholar
  6. 6.
    Bruce, J.D.: Purely P2P crypto-currency with finite mini-blockchain (2013)Google Scholar
  7. 7.
    The Bitcoin Lighting Network.
  8. 8.
    Karger, D., Lehman, E., Leighton, T., et al.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 654–663. ACM (1997)Google Scholar
  9. 9.
    Ziyan, B.A., Jun, W.U., Yan, M.A.: The optimization for consistent hash based on virtual node (in chinese). Comput. Eng. Softw. (2014)Google Scholar
  10. 10.
    Pei, X., Wang, Y., Ma, X., Xu, F.: A decentralized redundancy generation scheme for codes with locality in distributed storage systems. Concurr. Comput. Pract. Exp. (2017)Google Scholar
  11. 11.
    Courtois, N.T., Grajek, M., Naik, R.: Optimizing SHA256 in bitcoin mining. Springer, Berlin, Heidelberg (2014)Google Scholar
  12. 12.
    Cachin, C.: Architecture of the Hyperledger blockchain fabric. In: Workshop on Distributed Cryptocurrencies and Consensus Ledgers (2016)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Information CollegeDalian Maritime UniversityDalianChina

Personalised recommendations