Blockchain sharding storage scheme based on concatenated coding
Traditional blockchain faces the challenge of storage scalability. Existing research has reduced the storage overhead of blockchain based on erasure coding theory, but it brings high computational and communication spending during the decoding and recovery of blocks. To solve these problems, a block...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-07-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024114/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539203542810624 |
|---|---|
| author | TIAN Youliang HUANG Yuqing WANG Shuai |
| author_facet | TIAN Youliang HUANG Yuqing WANG Shuai |
| author_sort | TIAN Youliang |
| collection | DOAJ |
| description | Traditional blockchain faces the challenge of storage scalability. Existing research has reduced the storage overhead of blockchain based on erasure coding theory, but it brings high computational and communication spending during the decoding and recovery of blocks. To solve these problems, a blockchain sharding storage scheme based on concatenated coding was proposed. By adding a pre-coding layer to improve the existing rateless erasure code, a decoding complexity of <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mi>Ο</mi><mfenced separators="|"><mrow><mi>n</mi></mrow></mfenced></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/52928E18-61BE-4fdf-9821-64E0CE2DAEC9-M002.jpg"><?fx-imagestate width="6.94266701" height="3.21733332"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/52928E18-61BE-4fdf-9821-64E0CE2DAEC9-M002c.jpg"><?fx-imagestate width="6.94266701" height="3.21733332"?></graphic></alternatives></inline-formula> was achieved. Considering the communication delay skew between nodes during the decoding process, a delay-sensitive sharding algorithm based on Metis was proposed, which cut down the communication expenditure in the decoding process by delaying weights to determine the shard ownership of nodes. Simulation results show that the proposed scheme not only ensures the reliability of blockchain data, but also has lower computational and communication cost compared to traditional schemes. |
| format | Article |
| id | doaj-art-72205958fcf443efb4f0d2142445a9c2 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-07-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-72205958fcf443efb4f0d2142445a9c22025-01-14T07:24:38ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-07-014515917067384516Blockchain sharding storage scheme based on concatenated codingTIAN YouliangHUANG YuqingWANG ShuaiTraditional blockchain faces the challenge of storage scalability. Existing research has reduced the storage overhead of blockchain based on erasure coding theory, but it brings high computational and communication spending during the decoding and recovery of blocks. To solve these problems, a blockchain sharding storage scheme based on concatenated coding was proposed. By adding a pre-coding layer to improve the existing rateless erasure code, a decoding complexity of <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mi>Ο</mi><mfenced separators="|"><mrow><mi>n</mi></mrow></mfenced></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/52928E18-61BE-4fdf-9821-64E0CE2DAEC9-M002.jpg"><?fx-imagestate width="6.94266701" height="3.21733332"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/52928E18-61BE-4fdf-9821-64E0CE2DAEC9-M002c.jpg"><?fx-imagestate width="6.94266701" height="3.21733332"?></graphic></alternatives></inline-formula> was achieved. Considering the communication delay skew between nodes during the decoding process, a delay-sensitive sharding algorithm based on Metis was proposed, which cut down the communication expenditure in the decoding process by delaying weights to determine the shard ownership of nodes. Simulation results show that the proposed scheme not only ensures the reliability of blockchain data, but also has lower computational and communication cost compared to traditional schemes.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024114/blockchainstorage scalabilityerasure codingsharding technology |
| spellingShingle | TIAN Youliang HUANG Yuqing WANG Shuai Blockchain sharding storage scheme based on concatenated coding Tongxin xuebao blockchain storage scalability erasure coding sharding technology |
| title | Blockchain sharding storage scheme based on concatenated coding |
| title_full | Blockchain sharding storage scheme based on concatenated coding |
| title_fullStr | Blockchain sharding storage scheme based on concatenated coding |
| title_full_unstemmed | Blockchain sharding storage scheme based on concatenated coding |
| title_short | Blockchain sharding storage scheme based on concatenated coding |
| title_sort | blockchain sharding storage scheme based on concatenated coding |
| topic | blockchain storage scalability erasure coding sharding technology |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024114/ |
| work_keys_str_mv | AT tianyouliang blockchainshardingstorageschemebasedonconcatenatedcoding AT huangyuqing blockchainshardingstorageschemebasedonconcatenatedcoding AT wangshuai blockchainshardingstorageschemebasedonconcatenatedcoding |