DW-LRC: A Dynamic Wide-stripe LRC Codes for Blockchain Data Under Malicious Node Scenarios.

Mizhipeng Zhang,Chentao Wu,Jie Li,Minyi Guo

International Conference on Parallel and Distributed Systems(2023)

引用 0|浏览0
暂无评分
摘要
Blockchain is a decentralized digital ledger system that can be used in many fields. However, the traditional approach of storing blockchain data (full repliction) incurs expensive storage costs. As a result, researchers have proposed erasure coding methods to reduce storage costs. Existing erasure coding methods are all based on RS codes. Since blockchain systems typically have a large number of nodes, it is necessary to use wide-stripe RS codes to store blocks, which results in significant overhead during the recovery processes. Because widestripe RS codes require accessing a large number of nodes for decoding, this means significant network and I/O cost.To solve the above problem, we propose DW-LRC, which is a dynamic wide-stripe Local Reconstruction Code (LRC) based methods in permissioned blockchain systems. DW-LRC predicts malicious nodes using node reputation, and then selects an appropriate variant of LRC code to lower storage and recovery costs compared to traditional erasure coding. To demonstrate the effectiveness of DW-LRC, we conduct several experiments on the open source blockchain software tendermint. The results show that, compared to the state-of-the-art erasure coding methods, DW-LRC reduced the average recovery latency by 36.4% and improved the block access throughput by 32.3%.
更多
查看译文
关键词
Blockchain,Storage,Erasure Coding,Consensus,Replication
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要