A Tradeoff between the Sub-Packetization Size and the Repair Bandwidth for Reed-Solomon Codes

by   Weiqi Li, et al.

Reed-Solomon (RS) codes are widely used in distributed storage systems. In this paper, we study the repair bandwidth and sub-packetization size of RS codes. The repair bandwidth is defined as the amount of transmitted information from surviving nodes to a failed node. The RS code can be viewed as a polynomial over a finite field GF(q^ℓ) evaluated at a set of points, where ℓ is called the sub-packetization size. Smaller bandwidth reduces the network traffic in distributed storage, and smaller ℓ facilitates the implementation of RS codes with lower complexity. Recently, Guruswami and Wootters proposed a repair method for RS codes when the evaluation points are the entire finite field. While the sub-packization size can be arbitrarily small, the repair bandwidth is higher than the minimum storage regenerating (MSR) bound. Tamo, Ye and Barg achieved the MSR bound but the sub-packetization size grows faster than the exponential function of the number of the evaluation points. In this work, we present code constructions and repair schemes that extend these results to accommodate different sizes of the evaluation points. In other words, we design schemes that provide points in between. These schemes provide a flexible tradeoff between the sub-packetization size and the repair bandwidth. In addition, we generalize our schemes to manage multiple failures.


page 1

page 2

page 3

page 4


On Epsilon-MSCR Codes for Two Erasures

Cooperative regenerating codes are regenerating codes designed to tradeo...

Rack-Aware Cooperative Regenerating Codes

In distributed storage systems, cooperative regenerating codes tradeoff ...

Nonlinear Repair Schemes of Reed-Solomon Codes

The problem of repairing linear codes and, in particular, Reed Solomon (...

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size

The repair problem in distributed storage addresses recovery of the data...

Practical Considerations in Repairing Reed-Solomon Codes

The issue of repairing Reed-Solomon codes currently employed in industry...

Designing Compact Repair Groups for Reed-Solomon Codes

Motivated by the application of Reed-Solomon codes to recently emerging ...

Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Minimum storage regenerating (MSR) codes are MDS codes which allow for r...

Please sign up or login with your details

Forgot password? Click here to reset