一种高效读写分布式存储代码的捎带设计框架
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
摘要：
我们提出了一个新的“捎带”框架设计分布式存储代码，是有效的数据读取和下载过程中需要节点修复。我们通过构建显式代码的类来说明这个框架的强大功能，这些代码需要在三个重要设置的所有现有解决方案中读取和下载最小的数据进行修复：（a）满足最大距离可分离（MDS）、高速率和具有少量子条带的约束的代码，这是出于在数据中心中实现的实际考虑而产生的，（b）对于存在二进制MDS码的所有参数的二进制MDS码，（c）具有最小修复局部性的MDS码。此外，我们采用这个框架，使有效的修复奇偶校验节点在现有的代码，最初构建的解决只有系统节点的修复。我们框架背后的基本思想是采用现有代码的多个实例，并将一个实例的数据精心设计的函数添加到另一个实例中。根据代码参数的选择，修复期间数据读取的典型节省为25%至50%。
英文摘要：
We present a new 'piggybacking' framework for designing distributed storage codes that are efficient in data-read and download required during node-repair. We illustrate the power of this framework by constructing classes of explicit codes that entail the smallest data-read and download for repair among all existing solutions for three important settings: (a) codes meeting the constraints of being Maximum-Distance-Separable (MDS), high-rate and having a small number of substripes, arising out of practical considerations for implementation in data centers, (b) binary MDS codes for all parameters where binary MDS codes exist, (c) MDS codes with the smallest repair-locality. In addition, we employ this framework to enable efficient repair of parity nodes in existing codes that were originally constructed to address the repair of only the systematic nodes. The basic idea behind our framework is to take multiple instances of existing codes and add carefully designed functions of the data of one instance to the other. Typical savings in data-read during repair is 25% to 50% depending on the choice of the code parameters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
