DocumentCode
3072218
Title
Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration
Author
Yu, Quan ; Shum, Kenneth W. ; Sung, Chi Wan
Author_Institution
Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong, China
fYear
2011
fDate
5-9 Dec. 2011
Firstpage
1
Lastpage
5
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.
Keywords
flow graphs; linear programming; network coding; coding scheme; data storage cost; distributed storage systems; information flow graph; linear programming problem; protocol; repair consideration; repair-bandwidth; Distributed databases; Linear programming; Maintenance engineering; Minimization; Network coding; Peer to peer computing; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location
Houston, TX, USA
ISSN
1930-529X
Print_ISBN
978-1-4244-9266-4
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2011.6133729
Filename
6133729
Link To Document