arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4734cs.ITcs.DMmath.IT
收藏

基于图和设计的最优分数重复码

Optimal Fractional Repetition Codes based on Graphs and Designs

Natalia Silberstein, Tuvi Etzion

摘要:

分数重复(FR)码是用于分布式存储系统的一类码,其允许具有最小修复带宽的未编码精确修复。然而,与最小带宽再生(MBR)码相反,在MBR码中,特定大小的可用节点的随机集合用于节点修复,FR码的修复是基于表的。与MBR代码相比,这通常允许存储更多的数据。在这项工作中,我们考虑分数重复容量的界限,这是可以使用FR码存储的数据的最大量。最佳FR码,达到这些界限。这些FR码的结构是基于组合设计和家庭的定期和birregular图。给定参数的FR码的这些构造在图论中提出了一些有趣的问题。本文对这些问题及其解决方法进行了讨论。此外,基于FR码和批码之间的联系,我们提出了一类新的DSS码族,即分数重复批码,它同时具有批码和FR码的性质.这些是DSS的第一个代码,它允许未编码的高效精确修复和负载均衡,可以由几个用户并行执行。还讨论了与FR码有关的其他概念。

英文摘要:

Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where a random set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based. This usually allows to store more data compared to MBR codes. In this work, we consider bounds on the fractional repetition capacity, which is the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain these bounds are presented. The constructions of these FR codes are based on combinatorial designs and on families of regular and biregular graphs. These constructions of FR codes for given parameters raise some interesting questions in graph theory. These questions and some of their solutions are discussed in this paper. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, namely fractional repetition batch codes, which have the properties of batch codes and FR codes simultaneously. These are the first codes for DSS which allow for uncoded efficient exact repairs and load balancing which can be performed by several users in parallel. Other concepts related to FR codes are also discussed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑