CLEC:Combination Locality Based Erasure Code for Permissioned Blockchain Storage  

作　　者：Jiabin Wu Boai Yang Yang Liu Fang Liu Nong Xiao Shuo Li 

机构地区：[1]National University of Defense Technology,Changsha,410073,China [2]Hunan University,Changsha,410082,China [3]Sun Yat-sen University,Guangzhou,510275,China [4]The University of Edinburgh,Edinburgh,EH89BT,The United Kingdom

出　　处：《Computers, Materials & Continua》2022年第12期5137-5150,共14页计算机、材料和连续体（英文）

基　　金：This work is supported by The National Key Research and Development Program of China(2019YFB1804502).

摘　　要：Building a new decentralized domain name system based on blockchain technology is helping to solve problems,such as load imbalance and over-dependence on the trust of the central node.However,in the existing blockchain storage system,the storage overhead is very high due to its fullreplication data storage mechanism.The total storage consumption for each block is up to O(n)with n nodes.Erasure code applied to blockchains can significantly reduce the storage overhead,but also greatly lower the read performance.In this study,we propose a novel coding scheme for blockchain storage,Combination Locality based Erasure Code for Permissioned blockchain storage(CLEC).CLEC uses erasure code,parity locality,and topology locality in blockchain storage,greatly reducing reading latency and repair time.In CLEC,the storage consumption per block can be reduced to O(1),and the repair penalty can also be lowered to O(1).Experiments in an open-source permissioned blockchain Tendermint show that CLEC has a maximum repair speed of 6 times and a read speed of nearly 1.7 times with storage overhead of only 1.17 times compared to the current work,a great improvement in reading performance and repair performance with slightly increased storage overhead via implementation.

关 键 词：CLEC blockchain erasure code delay circle read performance THROUGHPUT repair performance 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]