Abstract

AbstractIn distributed storage systems (DSS), the storage costs and download costs with different storage nodes, in general, can be different. In such heterogeneous storage systems, how to establish a fundamental tradeoff between system storage cost and system repair cost is investigated. We formulate the problem of establishing the tradeoff between system storage cost and system repair cost as a bi‐objective linear programming problem subject to the min‐cut constraint of information flow graphs. We give a tight min‐cut bound for heterogeneous DSSs with general setting. Moreover, we show that the tradeoff between system storage cost and system repair cost of some special heterogeneous DSSs can be established in polynomial time. Copyright © 2014 John Wiley & Sons, Ltd.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call