Network codes designed specifically for distributed storage systems have the
potential to provide dramatically higher storage efficiency for the same
availability. One main challenge in the design of such codes is the exact
repair problem: if a node storing encoded information fails, in order to
maintain the same level of reliability we need to create encoded information at
a new node. One of the main open problems in this emerging area has been the
design of simple coding schemes that allow exact and low cost repair of failed
nodes and have high data rates. In particular, all prior known explicit
constructions have data rates bounded by 1/2.
In this paper we introduce the first family of distributed storage codes that
have simple look-up repair and can achieve arbitrarily high rates. Our
constructions are very simple to implement and perform exact repair by simple
XORing of packets. We experimentally evaluate the proposed codes in a realistic
cloud storage simulator and show significant benefits in both performance and
reliability compared to replication and standard Reed-Solomon codes.

论文提出了一种针对分布式存储系统的编码方案，可以实现简单查找修复且具有任意高数据传输速率，并在云存储模拟中实验验证表明，相较于复制和标准的 Reed-Solomon 编码，该编码方案在性能和可靠性方面具有显著优势。