This paper studies the fundamental problem of data persistency for a general family of redundancy schemes in distributed storage systems, called replicated erasure codes. Namely, we analyze two strategies of replicated erasure codes distribution: random and symmetric. For both strategies we derive closed analytical and asymptotic formulas for expected data persistency despite nodes failure.

翻译：本文研究分布式储存系统中一般冗余计划(称为复制的消除代码)的数据持久性基本问题。 也就是说,我们分析了两种重复消蚀代码分布战略:随机和对称。 对于这两种战略,我们都会得出封闭式分析和无干扰公式,用于尽管节点失败,但预期的数据持久性。