Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914059977228288 |
|---|---|
| author | Zhao, Hengming Wu, Dianhua Cheng, Minquan |
| author_facet | Zhao, Hengming Wu, Dianhua Cheng, Minquan |
| contents | The rack-aware storage model improves repair efficiency by exploiting locality within racks to minimize cross-rack traffic in a distributed storage system. While the partially cooperative repair model presents a solution for multiple node failures that reduces the need to exchange data with all other host racks (defined as racks containing failed nodes), thus enhancing system flexibility. In this paper, we focus on rack-aware minimum storage partially cooperative regenerating (MSPCR) codes for repairing multiple node failures. We first derive the lower bound on the repair bandwidth for rack-aware MSPCR codes using extremal combinatorics, and then explicitly construct the first class of (asymptotically) optimal repair schemes for rack-aware MSPCR codes with a sub-packetization level of $(\bar{s}+\bar{h}-δ)\bar{s}^{\bar{n}}$, which is smaller than that of the known rack-aware minimum-storage cooperative regenerating (MSCR) codes when $δ\geq 2$. By utilizing the grouping technique, we explicitly construct the second class of (asymptotically) optimal repair schemes for rack-aware MSPCR codes with a sub-packetization level of $2^{\bar{n}}$. In particular, when $δ=1$, our second codes reduce to rack-aware MSCR codes, while achieving an $(\bar{h}+1)$-fold reduction in sub-packetization level compared to the known rack-aware MSCR codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_18335 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes Zhao, Hengming Wu, Dianhua Cheng, Minquan Information Theory The rack-aware storage model improves repair efficiency by exploiting locality within racks to minimize cross-rack traffic in a distributed storage system. While the partially cooperative repair model presents a solution for multiple node failures that reduces the need to exchange data with all other host racks (defined as racks containing failed nodes), thus enhancing system flexibility. In this paper, we focus on rack-aware minimum storage partially cooperative regenerating (MSPCR) codes for repairing multiple node failures. We first derive the lower bound on the repair bandwidth for rack-aware MSPCR codes using extremal combinatorics, and then explicitly construct the first class of (asymptotically) optimal repair schemes for rack-aware MSPCR codes with a sub-packetization level of $(\bar{s}+\bar{h}-δ)\bar{s}^{\bar{n}}$, which is smaller than that of the known rack-aware minimum-storage cooperative regenerating (MSCR) codes when $δ\geq 2$. By utilizing the grouping technique, we explicitly construct the second class of (asymptotically) optimal repair schemes for rack-aware MSPCR codes with a sub-packetization level of $2^{\bar{n}}$. In particular, when $δ=1$, our second codes reduce to rack-aware MSCR codes, while achieving an $(\bar{h}+1)$-fold reduction in sub-packetization level compared to the known rack-aware MSCR codes. |
| title | Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2504.18335 |