A significant amount of research on using erasure coding for distributed storage has focused on reducing the amount of data that needs to be transferred to replace failed nodes. This continues to be an active topic as the introduction of faster storage devices looks to put an even greater strain on the network. However, with a few notable exceptions, most published work assumes a flat, static network topology between the nodes of the system. We propose a general framework to find the lowest cost feasible repairs in a more realistic, heterogeneous and dynamic network, and examine how the number of repair strategies to consider can be reduced for three distinct erasure codes. We devote a significant part of the paper to determining the set of feasible repairs for random linear network coding (RLNC) and describe a system of efficient checks using techniques from the arsenal of dynamic programming. Our solution involves decomposing the problem into smaller steps, memorizing, and then reusing intermediate results. All computationally intensive operations are performed prior to the failure of a node to ensure that the repair can start with minimal delay, based on up-to-date network information. We show that all three codes benefit from being network aware and find that the extra computations required for RLNC can be reduced to a viable level for a wide range of parameter values.

+More

repair strategies static network topology erasure coding distributed storage random linear network coding rlnc dynamic programming repairs

Má,rton SiposJosh GahmNarayan VenkatDave Oran,.Network-Aware Feasible Repairs for Erasure-Coded Storage. 26 (3),1404-1417.

Má,rton SiposJosh GahmNarayan VenkatDave Oran,"Network-Aware Feasible Repairs for Erasure-Coded Storage" 26

Má,rton SiposJosh GahmNarayan VenkatDave Oran,"Network-Aware Feasible Repairs for Erasure-Coded Storage"