Balancing Repair Bandwidth and Sub-Packetization in Erasure-Coded Storage via Elastic Transformation
Refereed conference paper presented and published in conference proceedings

Altmetrics Information

Other information
AbstractErasure coding provides high fault-tolerant storage with significantly low redundancy overhead, at the expense of high repair bandwidth. While there exist access-optimal codes that theoretically minimize both the repair bandwidth and the amount of disk reads, they also incur a high sub-packetization level, thereby leading to non-sequential I/Os and degrading repair performance. We propose elastic transformation, a framework that transforms any base code into a new code with smaller repair bandwidth for all or a subset of nodes, such that it can be configured with a wide range of sub-packetization levels to limit the non-sequential I/O overhead. We prove the fault tolerance of elastic transformation and model numerically the repair performance with respect to a sub-packetization level. We further prototype and evaluate elastic transformation atop HDFS, and show how it reduces the single-block repair time of the base codes and access-optimal codes in a real network setting.
All Author(s) ListKaicheng Tang, Keyun Cheng, Helen H. W. Chan, Xiaolu Li, Patrick P. C. Lee, Yuchong Hu, Jie Li, Ting-Yi Wu
Name of ConferenceIEEE Conference on Computer Communications
Start Date of Conference17/05/2023
End Date of Conference20/05/2023
Place of ConferenceNew York City, NY
Country/Region of ConferenceUnited States of America
Proceedings TitleIEEE INFOCOM 2023 - IEEE Conference on Computer Communications
LanguagesEnglish-United States

Last updated on 2024-30-01 at 11:07