Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913212800172032 |
|---|---|
| author | Yang, Yumeng Cai, Han Tang, Xiaohu |
| author_facet | Yang, Yumeng Cai, Han Tang, Xiaohu |
| contents | In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's ability to repair a small number of erasures within each rack by locality and efficiently handling a rack erasure with a small repair bandwidth. By employing the regenerating coding technique, we construct a family of array codes with $(r,u-r+1)$-locality, where the $u$ nodes of each repair set are systematically organized into a rack. When the number of failures is less than $u - r + 1$, these failures can be repaired without counting the system bandwidth. In cases where the number of failures exceeds the locality, the failed nodes within a single rack can be recovered with optimal cross-rack bandwidth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15308 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model Yang, Yumeng Cai, Han Tang, Xiaohu Information Theory In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's ability to repair a small number of erasures within each rack by locality and efficiently handling a rack erasure with a small repair bandwidth. By employing the regenerating coding technique, we construct a family of array codes with $(r,u-r+1)$-locality, where the $u$ nodes of each repair set are systematically organized into a rack. When the number of failures is less than $u - r + 1$, these failures can be repaired without counting the system bandwidth. In cases where the number of failures exceeds the locality, the failed nodes within a single rack can be recovered with optimal cross-rack bandwidth. |
| title | Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.15308 |