| 引用本文: | 杨红志,王静,李瞳,张洁薇,刘向阳.扩展子条带的piggybacking编码构造[J].哈尔滨工业大学学报,2025,57(9):46.DOI:10.11918/202406007 |
| YANG Hongzhi,WANG Jing,LI Tong,ZHANG Jiewei,LIU Xiangyang.Construction of substripe-added piggybacking codes[J].Journal of Harbin Institute of Technology,2025,57(9):46.DOI:10.11918/202406007 |
|
| |
|
|
| 本文已被：浏览 2523次 下载 356次 |
码上扫一扫！ |
|
|
| 扩展子条带的piggybacking编码构造 |
|
杨红志1,王静1,李瞳1,张洁薇1,刘向阳2
|
|
(1.长安大学 信息工程学院,西安 710018;2.西北工业大学 电子信息学院,西安 710129)
|
|
| 摘要: |
| 为解决现有piggybacking编码存在的修复度大、校验节点修复带宽高以及无法实现多节点快速修复等问题,提出一种扩展子条带的piggybacking编码(substripe-added piggybacking,SAP)构造方案。SAP构造在最大距离可分(maximum distance separable,MDS)码的基础上扩展子条带,将信息节点数据块分区均匀嵌入,校验节点数据块循环移位放置。通过理论推导,确定SAP信息节点和校验节点平均修复带宽率、平均修复度率。最后,将SAP与RSR-I、RSR-II和OOP就存储开销、修复带宽开销和修复度3个方面进行对比。结果表明:与RSR-I、RSR-II和OOP相比,扩展子条带的piggybacking编码不仅实现了修复度最优,而且在保证信息节点修复带宽开销较低的同时,明显降低了校验节点的修复带宽开销,且能快速修复多校验节点故障,明显改善了多校验节点故障修复带宽过高的不足。本文提出的SAP编码显著提升了piggybacking编码的数据恢复效率,尤其针对多校验节点故障,给出了一种快速修复算法,为piggybacking编码的优化提供了有效方案。 |
| 关键词: 分布式存储 最大距离可分码 piggybacking编码 修复度 修复带宽 |
| DOI：10.11918/202406007 |
| 分类号:TN911 |
| 文献标识码:A |
| 基金项目:国家自然科学基金(62001059)；陕西省重点研发计划(2024GY-YBXM-068) |
|
| Construction of substripe-added piggybacking codes |
|
YANG Hongzhi1,WANG Jing1,LI Tong1,ZHANG Jiewei1,LIU Xiangyang2
|
|
(1.School of Information Engineering, Chang′an University, Xi′an 710018, China; 2.School of Electronics and Information, Northwestern Polytechnical University, Xi′an 710129, China)
|
| Abstract: |
| To address the issues of large repair degree, high repair bandwidth of parity nodes, and the inability to achieve fast repair of multiple nodes in existing piggybacking codes, a construction scheme of substripe-added piggybacking (SAP) codes is proposed in this paper. Based on maximum distance separable (MDS) codes, the proposed SAP codes extend the substripe, embed the data blocks of the information nodes by region regularly, and place the data blocks of the parity nodes using cyclic shifts. Through theoretical derivations, the average repair bandwidth rates and average repair degree rates of information nodes and parity nodes in SAP are determined. Finally, SAP is compared with RSR-I, RSR-II, and OOP in terms of three aspects: storage overhead, repair bandwidth overhead, and repair degree. The results show that, compared with RSR-I, RSR-II, and OOP, the SAP coding scheme not only achieves optimal repair degree but also significantly reduces parity node repair bandwidth while maintaining low information node repair bandwidth. Additionally, it enables rapid repair of multiple parity node failures, effectively addressing the issue of excessively high repair bandwidth in multiple parity node failures. The SAP coding proposed in this paper significantly improves the data recovery efficiency of piggybacking codes. In particular, a fast repair algorithm is provided to address multiple parity node failures, offering an effective approach for optimizing the piggybacking codes. |
| Key words: distributed storage maximum distance separable (MDS) codes piggybacking codes repair degree repair bandwidth |
|
|
|
|
