Low-access repair of Reed-Solomon codes in rack-aware storage
Jiaojiao Wang, Zitan Chen · 2023
We study the problem of repairing Reed-Solomon codes with low-access complexity in the rack-aware storage model that allows collective information processing in the nodes that share the same rack. Building on recent work of the access complexity for the rack-aware storage model, we derive a lower bound on the amount of information accessed for repairing multiple failed nodes within a single rack from any number of helper racks. Further, we construct a family of Reed-Solomon codes that only require accessing a relatively small number of symbols to repair failed nodes in a single rack. In particular, for certain code parameters, our construction attains the bound on the access complexity with equality and thus has optimal access.