On the data persistency of replicated erasure codes in distributed storage systems

TL;DR

This paper analyzes the data persistency of replicated erasure codes in distributed storage, providing formulas for expected data durability under node failures for both random and symmetric distribution strategies.

Contribution

It introduces a comprehensive analysis of data persistency for replicated erasure codes, deriving formulas for both random and symmetric distribution strategies.

Findings

Closed-form formulas for data persistency under node failures

Asymptotic analysis of data durability in distributed storage

Comparison of random and symmetric distribution strategies

Abstract

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.