arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.0800cs.ITmath.IT
收藏

基于秩度量码的分布式存储容错性研究

Error Resilience in Distributed Storage via Rank-Metric Codes

Natalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath

摘要:

本文提出了一种新的编码方案的分布式存储系统中包含的节点具有对抗性错误。在这样的系统中的关键挑战是在节点修复过程期间错误数据从单个损坏的节点传播到系统的其余部分。本文提出了一种基于两种码的级联编码方案:最大秩距离(MRD)码作为外码,最优修复最大距离可分(MDS)阵列码作为内码。考虑到这一点,两种不同类型的对抗性错误被认为是:第一种类型认为对手,可以取代受影响的节点的内容只有一次;而第二种攻击类型认为对手,可以污染数据无限的次数。本文证明了所提出的编码方案达到了一个合适的上界的弹性能力的第一类错误。此外,本文提出的机制,结合这种代码与子空间签名,以实现第二种类型的错误的错误恢复。最后,本文得出结论,提出了一种基于MRD码的最佳局部可修标量码,可以容忍对抗性错误的建设。

英文摘要:

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer code and optimal repair maximal distance separable (MDS) array code as an inner code. Given this, two different types of adversarial errors are considered: the first type considers an adversary that can replace the content of an affected node only once; while the second attack-type considers an adversary that can pollute data an unbounded number of times. This paper proves that the proposed coding scheme attains a suitable upper bound on resilience capacity for the first type of error. Further, the paper presents mechanisms that combine this code with subspace signatures to achieve error resilience for the second type of errors. Finally, the paper concludes by presenting a construction based on MRD codes for optimal locally repairable scalar codes that can tolerate adversarial errors.

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

↑