Rack-Aware MSR Codes With Error Correction Capability for Multiple Erasure Tolerance

被引:3
|
作者
Wang, Jiaojiao [1 ]
Zheng, Dabin [1 ]
Li, Shenghua [2 ]
Tang, Xiaohu [3 ]
机构
[1] Hubei Univ, Fac Math & Stat, Hubei Prov Key Lab Appl Math, Wuhan 430062, Peoples R China
[2] Hubei Univ, Sch Cyber Sci & Technol, Wuhan 430062, Peoples R China
[3] Southwest Jiaotong Univ, CSNMT Int Coop Res Ctr MoST, Informat Coding & Transmiss Key Lab Sichuan Prov, Chengdu 610031, Peoples R China
基金
中国国家自然科学基金;
关键词
Distributed storage; multiple erasure tolerance; MSRR codes; universally error-resilient repair; STORAGE REGENERATING CODES; DISTRIBUTED STORAGE; MDS CODES; OPTIMAL REPAIR; OPTIMAL-ACCESS; CONSTRUCTIONS;
D O I
10.1109/TIT.2023.3289187
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. Some explicit constructions of MSRR codes for all parameters to repair a single failed node have been reported. This paper studies MSRR codes with error-correcting capability for multiple erasure tolerance. First, we propose a general repair model of maximum distance separable (MDS) codes with error-correcting capability for multiple erasure tolerance and derive lower bounds on the number of symbols downloaded and accessed, respectively from helper racks for the purpose of correction and repair. Then, we construct a class of MDS array codes and scalar Reed-Solomon (RS) codes with the optimal repair bandwidth and error resilient capability for multiple node failures. Further, our codes are shown to have the low-access property. In particular, they have the optimal access property for repairing u failed nodes when the dimension of the code is divisible by the rack size u.
引用
收藏
页码:6428 / 6442
页数:15
相关论文
共 50 条
  • [1] Rack-Aware Regenerating Codes With Multiple Erasure Tolerance
    Zhou, Liyang
    Zhang, Zhifang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (07) : 4316 - 4326
  • [2] Rack-aware MSR codes with optimal access
    Chen, Zitan
    2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 19 - 24
  • [3] Explicit constructions of MSR codes for the rack-aware storage model
    Chen, Zitan
    Barg, Alexander
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 226 - 230
  • [4] Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model
    Chen, Zitan
    Barg, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 886 - 899
  • [5] Rack-Aware Cooperative Regenerating Codes
    Gupta, Shreya
    Lalitha, V
    PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 264 - 268
  • [6] Rack-Aware Regenerating Codes for Data Centers
    Hou, Hanxu
    Lee, Patrick P. C.
    Shum, Kenneth W.
    Hu, Yuchong
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) : 4730 - 4745
  • [7] The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage
    Chen, Zitan
    Barg, Alexander
    2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 710 - 714
  • [8] Rack-Aware Regenerating Codes with Fewer Helper Racks
    Zhang, Zhifang
    Zhou, Liyang
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2203 - 2207
  • [9] Generalized Rack-aware Regenerating Codes for Jointly Optimal Node and Rack Repairs
    Hou, Hanxu
    Lee, Patrick P. C.
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2191 - 2196
  • [10] Explicit construction of minimum bandwidth rack-aware regenerating codes
    Zhou, Liyang
    Zhang, Zhifang
    SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (07)