Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

2011/07/28 by Yu, Quan, Shum, Kenneth W., Sung, Chi Wan
#Distributed #FOS: Computer and information sciences #Information Theory (cs.IT) #Parallel #and Cluster Computing (cs.DC)

paper · doi:10.48550/arxiv.1107.5645

Abstract

In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established.

Related

• A realistic distributed storage system that minimizes data storage and\n repair bandwidth
• Tradeoff for Heterogeneous Distributed Storage Systems between Storage\n and Repair Cost
• Distributed storage algorithms with optimal tradeoffs
• Cost-Bandwidth Tradeoff In Distributed Storage Systems
• New Codes and Inner Bounds for Exact Repair in Distributed Storage\n Systems