Update-Efficient Regenerating Codes with Minimum Per-Node Storage

TL;DR

This paper introduces a new encoding scheme for MSR regenerating codes that leverages Reed-Solomon codes to minimize update complexity and improve error correction in distributed storage systems.

Contribution

It generalizes previous work by integrating Reed-Solomon codes into MSR code encoding, offering better error correction and lower node access during data reconstruction.

Findings

MSR codes with minimal update complexity achieved.

Enhanced error correction capability demonstrated.

Reduced node accesses during data reconstruction.

Abstract

Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose a new encoding scheme for [n,d] error- correcting MSR codes that generalizes our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the [n,{\alpha}] Reed-Solomon (RS) code can be integrated into the encoding matrix. Hence, MSR codes with the least update complexity can be found. An efficient decoding scheme is also proposed that utilizes the [n,{\alpha}] RS code to perform data reconstruction. The proposed decoding scheme has better error correction capability and incurs the least number of node accesses when errors are present.