IAPRepair improves erasure-coded storage repair speed with in-network aggregation
IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System
Distributed, Parallel, and Cluster Computing
Summary
Erasure-coded storage keeps data safe with less extra space than full copies, but fixing lost data pieces needs lots of data moving between computers. Previous methods either wait for failures or separate tasks like moving and rebuilding data, causing delays. The authors created IAPRepair, a system that plans repairs ahead, balances data loads, and uses special network switches to combine data during repair. This approach reduces network traffic and speeds up repair times by nearly half compared to current methods. Their tests show it works well across various setups and network conditions.
What this means in practice
- •For cloud storage operators: Speed up data repair in distributed erasure-coded storage systems to improve fault tolerance without increasing bandwidth costs.
- •For data center network engineers: Deploy programmable switches to perform in-network aggregation and reduce network load during storage repair processes.
Authors
Lei Liu, Yong Wang, Junqi Chen, Yangfan Liang, Qian He, Baokang Zhao
Abstract
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.