Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

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.

[1]  T. Ho,et al.  On Linear Network Coding , 2010 .

[2]  Soroush Akhlaghi,et al.  Cost-bandwidth tradeoff in distributed storage systems , 2010, Comput. Commun..

[3]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[4]  Kannan Ramchandran,et al.  Explicit construction of optimal exact regenerating codes for distributed storage , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Kannan Ramchandran,et al.  Exact-Repair MDS Code Construction Using Interference Alignment , 2011, IEEE Transactions on Information Theory.

[6]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[7]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[8]  Alexandros G. Dimakis,et al.  Distributed Storage Allocations , 2010, IEEE Transactions on Information Theory.

[9]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[10]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.