Explicit Construction of Minimum Bandwidth Rack-Aware Regenerating Codes

TL;DR

This paper presents the first explicit construction of rack-aware regenerating codes with minimum repair bandwidth, applicable to all parameters, with low sub-packetization and practical finite field sizes, including a systematic code transformation.

Contribution

It introduces the first explicit, universally applicable construction of minimum bandwidth rack-aware regenerating codes with low sub-packetization and practical finite field sizes.

Findings

Achieves minimum cross-rack repair bandwidth equal to storage size per node.

Applicable to all admissible parameters with the lowest sub-packetization level.

Finite field sizes are comparable to the number of storage nodes, enhancing practicality.

Abstract

In large data centers, storage nodes are organized in racks, and the cross-rack transmission dominates the bandwidth cost. For the repair of single node failures, codes achieving the tradeoff between the storage redundancy and cross-rack repair bandwidth are called rack-aware regenerating codes (RRCs). In this work, we give the first explicit construction of RRCs with the minimum repair bandwidth (i.e., the cross-rack bandwidth equals the storage size per node). Our construction applies to all admissible parameters and has the lowest sub-packetization level. Moreover, the underlying finite fields are of size comparable to the number of storage nodes, which makes our codes more implementable in practice. Finally, for the convenience of practical use, we also establish a transformation to convert our codes into systematic codes.