Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion
Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion
复制标题
DOI：
10.1109/isit54713.2023.10206604
复制
发表时间：
2023-06
期刊：
影响因子：
--
通讯作者：
Francisco Maturana;K. V. Rashmi
中科院分区：
文献类型：
--
作者：
Francisco Maturana;K. V. Rashmi
擦除码通常用于分布式存储系统中，以便以低存储开销防止故障和不可用。经典擦除码（如里德-所罗门码）的一个重要缺点是修复故障的成本很高。局部可修复码（LRC）以较高的存储开销为代价降低了修复成本。在实践中，LRC的参数是根据几个因素来选择的，例如故障率、工作负载和预算约束。然而，编码数据存储很长一段时间，在此期间，这些因素可能会发生变化，因此理想参数可能会发生变化。改变编码数据上的代码参数的过程称为代码转换。代码转换的默认方法是读取所有数据，重新编码，然后写回，这可能非常昂贵。为了解决这个问题，我们提出了一种新的建设技术，设计LRC，可以执行代码转换的成本比默认的方法。我们应用这种技术来设计代码的几个代码转换的情况下，这是实际利益。
Erasure codes are typically used in distributed storage systems in order to protect against failures and unavailabilities with low storage overhead. An important disadvantage of classic erasure codes (such as Reed-Solomon codes) is the high cost of repairing failures. Locally repairable codes (LRCs) reduce the repair cost at the cost of higher storage overhead. In practice, the parameters of LRCs are chosen based on several factors, such as failure rates, workloads, and budget constraints. However, encoded data is stored for long periods of time, and during that time these factors can vary, and thus the ideal parameters can change. The process of changing the code parameters on encoded data is called code conversion. The default approach to code conversion is to read all data, re-encode it, and write it back, which can be prohibitively expensive. To address this problem, we propose a new construction technique for designing LRCs that can perform code conversion at a lower cost than the default approach. We apply this technique to design codes for several code conversion scenarios which are of practical interest.