Repairing with Zero Skip Cost

TL;DR

This paper introduces a new metric called skip cost to measure repair latency in helper nodes and provides explicit constructions of codes with zero skip cost to optimize repair efficiency.

Contribution

It presents explicit constructions of zigzag and fractional repetition codes that achieve zero skip cost, improving repair latency metrics.

Findings

Skip cost effectively quantifies repair latency.

Explicit code constructions achieve zero skip cost.

Codes improve repair efficiency in distributed storage.

Abstract

To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur zero skip cost