分布式存储系统中新型可修复喷泉码构造  

Novel construction of repairable fountain code in distributed storage systems

作　　者：周安安 易本顺[1] 刘羽升 罗来干 ZHOU Anan;YI Benshun;LIU Yusheng;LUO Laigan(School of Electronic Information,Wuhan University,Wuhan 430072,China)

机构地区：[1]武汉大学电子信息学院,湖北武汉430072

出　　处：《系统工程与电子技术》2022年第1期285-291,共7页Systems Engineering and Electronics

基　　金：国家自然科学基金(61371125);湖北省教育厅科学技术研究计划青年人才项目(Q20201902)资助课题。

摘　　要：为了缓解可修复喷泉码(repairable fountain codes, RFC)编码包传输需消耗大量带宽资源的难题,提出了一种基于改进压缩列存储算法的新型RFC构造方法(RFC based on improved compressed column storage, ICCS-RFC)。对于ICCS-RFC方案,编码包的邻域信息被建模为序列,并以生成矩阵的列为单位进行无损压缩。在保留可修复喷泉码性能的前提下,该方案可以有效减少故障节点修复和源文件恢复所需的传输数据量。此外,还提出了一种新的性能指标——有效吞吐量来分析ICCS-RFC方案的性能。理论分析和仿真结果验证了该方案的优越性能,表明该方法能够显著降低有效吞吐量,尤其是对于单故障节点修复的情况。In order to alleviate the large consumption of the bandwidth resource during the encoding packet transmission for repairable fountain codes(RFC), a novel construction of RFC based on improved compressed column storage algorithm(ICCS-RFC) is proposed. For the ICCS-RFC scheme, the neighbor information of coded packets is modeled as sequence and compressed losslessly by taking the columns of the generator matrix as unit. In the scenario of keeping the advantages of RFC, the scheme effectively reduces the amount of data transmitted of repairing the failed nodes and downloading the source file. In addition, a new performance evaluation index, named effective throughput, is proposed to analyze the performance of ICCS-RFC scheme. Theoretical analysis and simulation results verify the superiority of the proposed scheme, which can significantly improve the effectiveness of transmission and reduce the effective throughput, especially for repairing the single failure.

关 键 词：可修复喷泉码 生成矩阵 压缩列存储 有效吞吐量 

分 类 号：TN911.22[电子电信—通信与信息系统]