Jiagui Xie
ABSTRACT
With the rapid growth of blockchain data, the storage cost of maintaining the full node of a blockchain is getting higher and higher. This has led to the gradual weakening of the decentralization of the blockchain, increasing the risk of 51% attacks on the blockchain system. Based on DHT, we propose a blockchain storage expansion mechanism, using the Kademlia protocol to assign unique ID for every node in the blockchain network, and divide the entire node into several node clusters according to certain rules, each node cluster stores a complete blockchain data, and the nodes in the cluster only need to store a small part of the blockchain data. At the same time, in order to reduce the storage pressure of the nodes in the cluster, a dynamic reorganization mechanism is proposed, and the cluster scale will be dynamically adjusted according to the storage capacity of the nodes in the cluster. Finally, we established an experimental simulation model based on Colored Petri Nets, and verified the superiority of our proposed scheme by comparing it with the other two storage schemes.
- Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008). Available online: https://bitcoin.org/bitcoin.pdf (accessed on 11 June 2021).Google Scholar
- Wood G. Ethereum: A secure decentralised generalised transaction ledger. 2015. Available online: http://gavwood.com/Paper.pdf (accessed on 11 June 2021).Google Scholar
- G , Rauchs M . 2017 Global Cryptocurrency Benchmarking Study. Social Science Electronic Publishing, 2017.Google Scholar
- Androulaki E , Manevich Y , Muralidharan S , Hyperledger fabric: a distributed operating system for permissioned blockchains.In the Thirteenth EuroSys Conference. 2018.Google ScholarDigital Library
- Bitcoin.org. 2018. Simplifed Payment Verifcation (SPV). Available online: https://bitcoin.org/en/developer-guide#simplifed-payment-verifcation-spv. (accessed on 26 May 2021).Google Scholar
- Rhea S C . Handling Churn in a DHT (Awarded Best Paper!). Usenix Technical Conference. USENIX, 2004.Google Scholar
- Petar Maymounkov and David Mazières. 2002. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. (2002), 53–65.Google Scholar
- F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. 2001. Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings Eighth Workshop on Hot Topics in Operating Systems. IEEE Comput. Soc, Elmau, Germany, 81–86.Google ScholarDigital Library
- Perard D, Lacan J, Bachy Y, Detchart J. Erasure code-based low storage blockchain node. In: Proc. of the 2018 IEEE Int'l Conf. on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData). 2018. 1622-1627.Google ScholarCross Ref
- Chen H, WangYJ. SSChain: A full sharding protocol for public blockchain without data migration overhead. Pervasive and Mobile Computing, 2019,59:1-15.Google ScholarDigital Library
- Abe R, Suzuki S, Murai J. Mitigating bitcoin node storage size by DHT. In: Proc. of the Asian Internet Engineering Conf. 2018. 17-23.Google ScholarDigital Library
- Jensen, K. , and L. M. Kristensen . Coloured Petri Nets: Modelling and Validation of Concurrent Systems. Springer, 2009.Google ScholarCross Ref
Index Terms
- Research on Blockchain Storage Extension Based on DHT
Recommendations
Research on Improved Blockchain Broadcasting Mechanism Based on DHT
ICBDT '21: Proceedings of the 4th International Conference on Big Data TechnologiesIn order to solve the problem of low transaction throughput in blockchain cryptocurrencies, many researches start from the consensus mechanism, while few researches on the broadcast mechanism of blockchain. Therefore, we propose an improved blockchain ...
Mitigating Bitcoin Node Storage Size By DHT
AINTEC '18: Proceedings of the 14th Asian Internet Engineering ConferenceA type of Bitcoin node called "Full Node" has to hold the entire of historical transaction data called "Blockchain" to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for ...
Peer Clustering for the InterPlanetary File System
FIRA '23: Proceedings of the 2nd ACM SIGCOMM Workshop on Future of Internet Routing & AddressingDistributed Hash Tables (DHT) are once again attracting research interest, 20 years after their inception, as a promising solution for scalable and decentralized content storage. A prominent example is the InterPlanetary File System (IPFS), a ...
Comments