Metraipolis › archive › dc_fb46d4a07585

IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System — arXiv:2610.11114

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11114
License (as archived)
CC0-1.0
Archived
2026-10-09T06:13:55.103Z
SHA-256 of the archived text
0a13f98c8c33bcf24ef3d451a0281f77bb4b8fc8bc6294f237e14a44baa04793
Stable URL of this page
https://metraipolis.com/documento/dc_fb46d4a07585

How to cite

IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System — arXiv:2610.11114 — arXiv (en), https://arxiv.org/abs/2610.11114 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb46d4a07585 (Metraipolis archive dc_fb46d4a07585, sha256 0a13f98c8c33bcf24ef3d451a0281f77bb4b8fc8bc6294f237e14a44baa04793)
BibTeX
@misc{dcfb46d4a07585,
  title = {IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System — arXiv:2610.11114},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11114},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb46d4a07585; sha256 0a13f98c8c33bcf24ef3d451a0281f77bb4b8fc8bc6294f237e14a44baa04793},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11114. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Erasure-coded storage provides fault tolerance with substantially lower storage overhead than full replication, but repairing lost or at-risk blocks requires intensive cross-node data transfer. Existing reactive repair schemes start only after a failure, while proactive schemes can move data before failure but commonly treat migration, reconstruction, and network aggregation as loosely coupled operations. As a result, receiver?side bottlenecks, heterogeneous available bandwidth, and limited programmable-switch state continue to constrain repair paral?lelism. This paper presents IAPRepair, an in-network aggre?gation enhanced proactive repair framework for erasure-coded storage. IAPRepair jointly constructs each repair batch, assigns reconstruction providers and replacement nodes according to normalized transmission loads, schedules migration around the remaining receive capacity, and selectively enables in-network aggregation for reconstruction blocks that would otherwise over?load healthy nodes. The selective design reduces receiver-side traffic while retaining migration parallelism and respecting a configurable switch-resource budget. We implement IAPRepair with a Tofino programmable switch and 16 storage nodes, and evaluate it using both a prototype testbed and large-scale simu?lations. Across coding parameters, block sizes, node populations, and multiple STF-node scenarios, IAPRepair reduces repair time by at least 47.83% compared with the evaluated state-of-the-art methods. The results demonstrate that coordinating proactive repair decisions with in-network processing is an effective way to improve repair efficiency under bandwidth heterogeneity.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.11114 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:47:30.190Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).