Rack-Aware MSR Codes with Multiple Erasure Tolerance

2021/09/17 by Wang, Jiaojiao, Zheng, Dabin, Li, Shenghua
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2109.08302

Abstract

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. The authors in~\citeChen-Barg2019 and~\citeZhou-Zhang2021 provided explicit constructions of MSRR codes for all parameters to repair a single failed node. This paper generalizes the results in~\citeChen-Barg2019 to the case of multiple node failures. We propose a class of MDS array codes and scalar Reed-Solomon (RS) codes, and show that these codes have optimal repair bandwidth and error resilient capability for multiple node failures in the rack-aware storage model. Besides, our codes keep the same access level as the low-access constructions in~\citeChen-Barg2019 and~\citeZhou-Zhang2021.

Related

• Rack-aware minimum-storage regenerating codes with optimal access
• Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model
• Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
• Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model
• Update-Efficient Regenerating Codes with Minimum Per-Node Storage