Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

Details Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

2011-07-28

arxiv.org/abs/1107.5645v1

Computer Science

Information Theory

5 pages, 4 figures, to appear in Proc. IEEE GLOBECOM, 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413835