Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. J. Gen. Philos. Sci. (2008)
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)
Xu, T.: Research on the Development and significance of “Blockchain+" education. J. Distance Educ. 35(02), 19–28 (2017)
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)
Jia, D., Xin, J., Wang, W., et al.: Storage capacity scalable model for blockchain (in chinese). J. Front. Comput. Sci. Technol. (2017)
Bruce, J.D.: Purely P2P crypto-currency with finite mini-blockchain (2013)
The Bitcoin Lighting Network. http://lightning.network
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)
Ziyan, B.A., Jun, W.U., Yan, M.A.: The optimization for consistent hash based on virtual node (in chinese). Comput. Eng. Softw. (2014)
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)
Courtois, N.T., Grajek, M., Naik, R.: Optimizing SHA256 in bitcoin mining. Springer, Berlin, Heidelberg (2014)
Cachin, C.: Architecture of the Hyperledger blockchain fabric. In: Workshop on Distributed Cryptocurrencies and Consensus Ledgers (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wei, X., Chen, J., Li, Z. (2020). Research on Optimization Model of Storage Capacity Based on the Consortium Blockchain. In: Liang, Q., Liu, X., Na, Z., Wang, W., Mu, J., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2018. Lecture Notes in Electrical Engineering, vol 517. Springer, Singapore. https://doi.org/10.1007/978-981-13-6508-9_111
Download citation
DOI: https://doi.org/10.1007/978-981-13-6508-9_111
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6507-2
Online ISBN: 978-981-13-6508-9
eBook Packages: EngineeringEngineering (R0)