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

07/27/2021
by   Roy Friedman, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset