.png){kind=icon}
返回
Code constructions for multi-node exact repair in distributed storage
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-018-9516-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the problem of centralized exact repair of multiple failures in distributed storage. We present constructions that achieve a new set of interior points under exact repair. The constructions build upon the layered code construction by Tian et al., designed for exact repair of single failure. We firstly improve upon the layered construction for general system parameters. Then, we extend the improved construction to support the repair of multiple failures, with varying number of helpers. In particular, for some parameters, we prove the optimality of one point in terms of the storage size and the repair bandwidth for multiple erasures. Finally, considering minimum bandwidth cooperative repair (MBCR) codes as centralized repair codes, we determine explicitly the best achievable region obtained by space-sharing among all known points, including the MBCR point.
Keyword:
regenerating codes
exact repair
multiple failures
interior points
Steiner systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
Effects of Fiber Type and Fiber Volume Content on Frost Resistance of Fiber-Reinforced Concrete in Airport Pavement.png)
ICTE 2011
ICTE 2011IF0
PREAI
分享收藏分享收藏
查看更多内容