2021•arXiv (Cornell University)Open access
On the data persistency of replicated erasure codes in distributed storage systems
Roy Friedman, Rafał Kapelko, Karol Marchwicki
Open full text 0 citations
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.
Open-access reader