摘要

Node recovery is a challenging task in erasure-coded storage systems, which involves a considerable amount of network resources. The efficacy of failure recovery is measured by various metrics, such as repair bandwidth and computational complexity. This letter focuses on fractional repetition (FR) codes, which are a family of codes that provide uncoded exact repairs with minimum repair bandwidth. We consider the usage of FR codes in dynamic storage systems, where the system parameters can vary over time. Specifically, we introduce adaptive fractional repetition codes that can effectively adapt to system changes. The proposed codes allow update of systems without the need for frequent reconfigurations. Moreover, explicit code constructions for both homogeneous and heterogeneous storage systems are presented.