arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.08230cs.ITmath.IT
收藏

分布式存储网络中的灵活分数重复码

Flexible Fractional Repetition Codes for Distributed Storage Networks

Imad Ahmad, Chih-Chun Wang

摘要:

考虑以下分布式存储网络的基本问题:给定任意$(n,k,d)$值,是否存在一个智能助手选择方案(假设无限的内存和计算能力),可以严格提高存储带宽(SB)的权衡。Ahmad等人通过证明对于$(n,k,d)$值的子集,没有辅助选择方案可以改善S-B权衡,并且对于不在该子集中的$(n,k,d)$,称为家庭辅助选择(FHS)的新方案可以严格地改善S-B权衡而不是盲辅助选择方案来回答这个问题。尽管如此,FHS的分析是通过最小切割分析完成的,没有实际的代码结构。这项工作填补了纯粹的最小割分析和实际的代码建设配对FHS与现有的分数重复(FR)代码的一个新的,广义的版本之间的差距。具体而言,现有的FR码是精确修复码,其允许高度期望的通过转移修复属性,但其独特的构造将应用限制为$(n,k,d)$值的受限集合。相比之下,我们的新构造,称为灵活的分数重复码,可以应用于任意$(n,k,d)$,同时保留FR码的大部分实际好处,即,允许小的修复带宽、精确修复和几乎可通过传输修复。

英文摘要:

Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly improve the storage-bandwidth (S-B) tradeoff. Ahmad et al. 18' answered this question by proving that for a subset of $(n,k,d)$ values, no helper selection scheme can ever improve the S-B tradeoff, and for the $(n,k,d)$ not in that subset, a new scheme called family helper selection (FHS) can strictly improve the S-B tradeoff over a blind helper selection scheme. Nonetheless, the analysis of FHS is done by a min-cut analysis with no actual code construction. This work fills this gap between pure min-cut analysis and actual code construction by pairing FHS with a new, generalized version of the existing fractional repetition (FR) codes. Specifically, existing FR codes are exact-repair codes that admit the highly-desirable repair-by-transfer property, but its unique construction limits the application to a restricted set of $(n,k,d)$ values. In contrast, our new construction, termed flexible fractional repetition codes, can be applied to arbitrary $(n,k,d)$ while retaining most of the practical benefits of FR codes, i.e., admitting small repair bandwidth, being exact-repair, and being almost repairable-by-transfer.

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

↑