Tradeoff for Heterogeneous Distributed Storage Systems between Storage and Repair Cost

TL;DR

This paper analyzes the fundamental tradeoff between storage and repair costs in heterogeneous distributed storage systems with flexible reconstruction and repair options, using min-cut bounds and linear programming.

Contribution

It introduces a model for heterogeneous DSSs with dynamic repair bandwidth and storage, and proves the tightness of min-cut bounds for these systems.

Findings

Derived tight min-cut bounds for heterogeneous DSSs.

Formulated the tradeoff as a bi-objective linear programming problem.

Validated the bounds' tightness for arbitrary DSS configurations.

Abstract

In this paper, we consider heterogeneous distributed storage systems (DSSs) having flexible reconstruction degree, where each node in the system has dynamic repair bandwidth and dynamic storage capacity. In particular, a data collector can reconstruct the file at time $t$ using some arbitrary nodes in the system and for a node failure the system can be repaired by some set of arbitrary nodes. Using $min$-$cut$ bound, we investigate the fundamental tradeoff between storage and repair cost for our model of heterogeneous DSS. In particular, the problem is formulated as bi-objective optimization linear programing problem. For an arbitrary DSS, it is shown that the calculated $min$-$cut$ bound is tight.