计算机科学

计算机科学 ›› 2023, Vol. 50 ›› Issue (10): 350-361.doi: 10.11896/jsjkx.220800193

• 信息安全 • 上一篇    下一篇

一种基于纠删码的区块链账本分组存储优化方法

张玉书1, 何晓彤1, 肖祥立1, 朱友文1, 王良民2   

  1. 1 南京航空航天大学计算机科学与技术学院 南京211106
    2 东南大学网络空间安全学院 南京211189
  • 收稿日期:2022-08-22 修回日期:2022-12-04 出版日期:2023-10-10 发布日期:2023-10-10
  • 通讯作者: 张玉书(yushu@nuaa.edu.cn)
  • 基金资助:
    国家重点研发计划(2020YFB1005500)

Grouping Storage Optimization Method for Blockchain Ledger Based on Erasure Code

ZHANG Yushu1, HE Xiaotong1, XIAO Xiangli1, ZHU Youwen1, WANG Liangming2   

  1. 1 College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China
    2 School of Cyber Science and Engineering,Southeast University,Nanjing 211189,China
  • Received:2022-08-22 Revised:2022-12-04 Online:2023-10-10 Published:2023-10-10
  • About author:ZHANG Yushu,born in 1987,Ph.D,professor,Ph.D supervisor,is a member of China Computer Federation.His main research interests include blockchain,multimedia information security and artificial intelligence.
  • Supported by:
    National Key Research and Development Program of China(2020YFB1005500).

PDF (PC)

1825

摘要： 传统区块链系统采用全副本冗余的存储方式,每个节点存储相同的账本,使得区块链的存储负担非常大。目前,相关的区块链存储优化方法能够降低数据存储开销,但仍存在可扩展性差和可用性低的问题。为此,提出了一种基于纠删码的区块链账本分组存储优化方法。该方法引入一种新的区块链节点——分组存储(Grouping Storage,GS)节点,来解决上述问题。区块链账本的主要存储开销位于区块文件中,GS节点采用纠删码对区块文件编码,并以组为单位存储编码后的区块文件,如此,每个组织维持相同的账本,极大地降低了区块链的存储开销且提高了区块链的可用性。针对联盟链的存储扩展,基于GS节点对超级账本文件系统进行改进,重新设计了其存储、恢复和同步区块文件流程,使得本方案能够在实际的区块链架构上工作。最后,理论分析和实验结果表明,所提出的GS节点在存储开销方面取得了显著的进步,且具有较好的可扩展性和可用性。

关键词: 区块链, 存储优化, 纠删码, 超级账本, 分组储存

Abstract: The traditional blockchain system adopts the full copy redundant storage mode and each node stores the same ledger,so the blockchain storage burden is very large.At present,the relevant blockchain storage optimization methods can reduce the data storage overhead,but still have the problems of poor scalability and low availability.Thus,this paper proposes a grouping storage optimization method for blockchain ledger based on erasure code.This method introduces a new blockchain node,i.e.,grouping storage(GS) node,to solve the above problems.Since the blockchain ledger storage cost is mainly in the block file,the GS node uses the erasure code to encode the block file,and stores the encoded block file in groups.In this way,each organization maintains the same ledger,which greatly reduces the storage overhead of the blockchain and improves the availability of the blockchain.For the storage expansion of the consortium blockchain,this paper improves and expands the file system of hyperle-dger fabric based on the GS node,and redesigns its process of storing,recovering,and synchronizing block files,which enables the scheme to work on the actual blockchain architecture.Finally,theoretical analysis and experimental results show that the proposed GS node has made significant progress in storage overhead,and performs well in scalability and availability.

Key words: Blockchain, Storage optimization, Erasure code, Hyperledger fabric, Grouping storage

中图分类号: 

  • TP311
[1]NAKAMOTO S.Bitcoin:A peer-to-peer electronic cash system[J].Decentralized Business Review,2008:37(13):2889-2897.
[2]LI S,SONG B Y,LI D,et al.Composite blockchain associatedevent tracing method for financial activities[J].Computer Science,2022,49(3):346-353.
[3]GUO X,WANG Y Y,FENG T,et al.Blockchain-based role-delegation access control for industrial control system[J].Computer Science,2021,48(9):306-316.
[4]ZHOU H,JIANG H,ZHAO Y,et al.Study on optimal scheduling of power blockchain system for consensus transaction of each unit[J].Computer Science,2022,49(6A):771-776.
[5]ETHERSCAN.Ethereum Full Node Sync(Archive) Chart[EB/OL].https://etherscan.io/chartsync/chainarchive.
[6]PERARD D,LACAN J,BACHY Y,et al.Erasure code-basedlow storage blockchain node[C]//2018 IEEE International Conference 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).IEEE,2018:1622-1627.
[7]WILKINSON S,BOSHEVSKI T,BRANDOFF J,et al.Storj a peer-to-peer cloud storage network [EB/OL].https://www.storj.io/storjv2.pdf.
[8]TRÓN V,FISCHER A,NAGY D A,et al.Swap,swear,andswindle:Incentive system for swarm[EB/OL].https://ethersphere.github.io/swarm-home/ethersphere/orange-papers/1/sw%5E3.pdf.
[9]ZHAO G F,ZHANG M C,ZHOU J H,et al.Research and application of block file storage model based on blockchain system of erasure code[J].Netinfo Security,2019,19(2):28-35.
[10]YIN F R,ZHU C Y,ZHAO B,et al.Erasure code partition sto-rage based on CITA blockchain[J].Journal of East China Normal University(Natural Science),2021(5):48-59.
[11]ANDROULAKI E,BARGER A,BORTNIKOV V,et al.Hy-perledger Fabric:A distributed operating system for permissioned blockchains[C]//Proceedings of the Thirteenth EuroSys Conference.2018:1-15.
[12]BENET J.IPFS-content addressed,versioned,P2P file system[J].arXiv:1407.3561,2014.
[13]SUN X Z,ZHANG X,XIANG F,et al.Survey of storage sca-lability on blockchain[J].Journal of Software,2021,32(1):1-20.
[14]ZHENG Q,LI Y,CHEN P,et al.An innovative IPFS-basedstorage model for blockchain[C]//2018 IEEE/WIC/ACM International Conference on Web Intelligence(WI).IEEE,2018:704-708.
[15]SHARMA P,JINDAL R,BORAH M D.Blockchain technology for cloud storage:A systematic literature review[J].ACM Computing Surveys(CSUR),2020,53(4):1-32.
[16]WANG Y J,XU F L,PEI X Q.Resarch on erasure code-based fault-tolerant technology for distributed storage[J].Chinese Journal of Computers,2017,40(1):236-255.
[17]PLANK J S.A tutorial on Reed-Solomon coding for fault-tole-rance in RAID-like systems[J].Software:Practice and Expe-rience,1997,27(9):995-1012.
[18]TIAN J,DAI Y F.Study on durable peer-to-peer storage techniques[J].Journal of Software,2007(6):1379-1399.
[19]TAN S,JIA Y,HAN W H.Research and development of pro-vable data integrity in cloud storage [J].Chinese Journal of Computers,2015,38(1):164-177.
[20]CAI Z H,LIN J Y,LIU F.Blockchain storage:Technologies and challenges[J].Chinese Journal of Network and Information Security,2020,6(5):11-20.
[21]GALLAGER R.Low-Density Aarity-Check codes [J].IEEETransactions on Information Theory,1962,8(1):21-28.
[22]LIANG T,ZHANG P,LIU C,et al.Efficient encoding of quasi-cyclic low-density parity-check codes[C]//2018 IEEE 3rd Advanced Information Technology,Electronic and Automation Control Conference(IAEAC).IEEE,2018:1189-1193.
[23]NGUYEN T T B,NGUYEN TAN T,LEE H.Efficient QC-LDPC encoder for 5G new radio[J].Electronics,2019,8(6):668.
[24]XIE T,LI B,YANG M,et al.Memory compact high-speed QC-LDPC decoder[C]//2017 IEEE International Conference on Signal Processing,Communications and Computing(ICSPCC).IEEE,2017:1-5.
[25]LIN S,COSTELLO D J.Error control coding,second edition[M].Prentice-Hall,Inc.2004.
[26]BOSE R C.On the construction of balanced incomplete block designs[J].Annals of Eugenics,1939,9(4):353-399.
[27]ZHANG F,MAO X,ZHOU W,et al.Girth-10 LDPC codesbased on 3-D cyclic lattices[J].IEEE Transactions on Vehicular Technology,2008,57(2):1049-1060.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
地址：重庆市渝北区洪湖西路18号    邮编：401121  
电话：023-63500828（编辑部） 023-67039612（会议/专题） 023-67039623（财务/发票）
E-mail：jsjkx12@163.com
本系统由北京玛格泰克科技发展有限公司设计开发