Rack-aware MSR Codes With a Small Sub-packetization Level
Year: 2026
Type: article
Abstract: In practical data centers, storage nodes are organized and distributed across different racks, where the communication cost between racks is significantly more expensive than that within a single rack. The concept of rack-aware minimum-storage regenerating (MSR) codes has recently been proposed to address this architectural challenge. However, explicit constructions of high-rate rack-aware MSR codes in the literature tend to suffer from large sub-packetization levels. For an {(n,k,N), (n, k, d),u, q} rack-aware MSR code with subpacketization levelNand finite field sizeq, thennodes are uniformly distributed overnracks (each containingunodes), satisfyingk=ku+u*withk= ⌊k/u⌋ ≥ 1 and 0 ≤u*u, wheredis the repair degree withk≤dn. In this paper, we propose a new high-rate rack-aware MSR codeCwith subpacketization levelN=s⌈n/(u−u*+1)⌉, wheres=d−k+1, and field sizeqscaling linearly ass+3/2n. Consequently, our new rack-aware MSR code outperforms existing ones in terms of either the sub-packetization level or the finite field size.
Authors: Yi Liu, Jie Li, Xiaohu Tang
Institutions: Southwest Jiaotong University, City University of Hong Kong
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,645
OpenAlex ID: W7224344134