Reliability of k-out-of-n Data Storage System with Deterministic Parallel and Serial Repair

TL;DR

This paper analyzes the reliability of k-out-of-n data storage systems with deterministic repair times, comparing serial and parallel repair models and showing their mean time of data loss is similar under certain conditions.

Contribution

It derives the Laplace Stieltjes transform of data loss probability for deterministic repair models and compares serial and parallel repair effects.

Findings

Mean time of data loss is similar for both repair models when failure rate is much lower than repair rate.

Laplace Stieltjes transform of data loss probability is obtained for deterministic repair times.

Results differ from exponential repair models, highlighting the impact of repair time assumptions.

Abstract

In this paper, we find the Laplace Stieltjes transform of the probability of data loss for the k-out-of-n distributed storage system with deterministic repair times. We consider two repair models, namely the serial and parallel repair. We show that for failure rate much lower than the repair rate, mean time of data loss for the two models is the same unlike the case for exponential repair models.