Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level

被引：0

作者：

Rui, Jiayi ^{[1
]}

Huang, Qin ^{[1
]}

Han, Yunghsiang S. ^{[2
]}

Wu, Ting-Yi ^{[3
]}

机构：

[1] Beihang Univ, Sch Elect & Informat Engn, Beijing 100191, Peoples R China

[2] Univ Elect Sci & Technol China, Shenzhen Inst Adv Study, Chengdu 610056, Peoples R China

[3] Huawei Technol Co Ltd, Cent Res Inst, Theory Lab, Labs 2012, Shenzhen 518129, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2023年 / 27卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Maintenance engineering; Symbols; Bandwidth; Codes; Industries; Indexes; Generators; Distributed storage system; busy-node repair; optimal access; small sub-packetization; bandwidth;

D O I：

10.1109/LCOMM.2023.3241425

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Maximum distance separable array codes with small sub-packetization level (MDS-SSL) are of practical importance in distributed storage systems. This letter addresses their repair of a single failed node in the case that there exists a busy node during the repair. Additional check relations among codeword symbols excluding those in the busy node are formed to compensate for the absence of information. Then, it allows us to repair the failed node without symbols in the busy node. A lower bound of the busy-node repair bandwidth is derived for (k + 4, k, 4) MDS-SSL codes, consisting of four groups of nodes. It indicates that its achievability requires a cubic constraint among elements in the parity-check matrix. Then, an explicit busy-node repair scheme is proposed to achieve a lower bound in the case of the failed node and the busy node being in different groups.

引用

页码：1080 / 1084

页数：5