Deterministic Regenerating Codes for Distributed Storage Yunnan
Deterministic Regenerating Codes for Distributed Storage Yunnan
复制标题
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
A. Dimakis;K. Ramchandran
中科院分区：
文献类型：
--
作者：
A. Dimakis;K. Ramchandran
众所周知，可以在存储系统中使用擦除编码，以在防止故障的同时有效地存储数据。通常，擦除法规的设计集中在冗余和可靠性之间的权衡。在此标准下，最大距离可分离（MDS）代码是最佳的。但是，实用的存储系统要求其他考虑因素。特别是，必须正确维护代码以从节点失败中恢复。 Dimakis等人的先前工作。研究了正确维护擦除代码以减少网络带宽的问题，并在最小维修带宽上建立了基本界限，以维持MDS代码，并表明可以以更高存储为代价来进一步降低维修带宽。在本文中，我们介绍了构建代码的技术，以实现存储效率和维修带宽之间的最佳权衡。
It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability; under this criterion, an Maximum Distance Separable (MDS) code is optimal. However, practical storage systems call for additional considerations. In particular, the codes must be properly maintained to recover from node failures. Previous work by Dimakis et al. studied the problem of properly maintaining erasure codes to reduce the incurred network bandwidth, established fundamental bounds on the minimum repair bandwidth for maintaining MDS codes, and showed that the repair bandwidth can be reduced further at the cost of higher storage. In this paper we present techniques for constructing codes that achieve the optimal tradeoffs between storage efficiency and repair bandwidth.