Technical Program

Paper Detail

Paper IDM.1.3
Paper Title Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization
Authors Hanxu Hou, Dongguan University of Technology, China; Patrick P. C. Lee, The Chinese University of Hong Kong, China; Yunghsiang S. Han, Dongguan University of Technology, China
Session M.1: Codes for Distributed Storage I
Presentation Lecture
Track Coding for Storage and Memories
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract Modern data centers often organize storage nodes in racks, in which the cross-rack communication cost is typically much higher than the intra-rack communication cost. Rack-aware regenerating codes have recently been proposed to achieve the optimal trade-off between storage redundancy and cross-rack repair bandwidth, subject to the condition that the original data can be reconstructed from a sufficient number of any non-failed nodes. In this paper, we present a coding framework that transforms any minimum-storage regenerating (MSR) code to a minimum-storage rack-aware regenerating (MSRR) code, such that the cross-rack repair bandwidth is minimized subject to the minimum storage redundancy. To this end, we can construct a family of exact-repair constructions for the MSRR codes for {\em all admissible parameters}. Furthermore, our constructions achieve low sub-packetization, which is critical for mitigating the I/O overhead during repair.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!