DocumentCode
2406671
Title
Cooperative Regenerating Codes for Distributed Storage Systems
Author
Shum, Kenneth W.
Author_Institution
Inst. of Network Coding, Chinese Univ. of Hong Kong, Shatin, China
fYear
2011
fDate
5-9 June 2011
Firstpage
1
Lastpage
5
Abstract
When there are multiple storage node failures in distributed storage system, regenerating them individually is suboptimal as far as repair bandwidth minimization is concerned. The tradeoff between storage and repair bandwidth is derived in the case where data exchange among the newcomers is enabled. The tradeoff curve with cooperation is strictly better than the one without cooperation. An explicit construction of cooperative regenerating code is given.
Keywords
codes; distributed processing; electronic data interchange; storage management; cooperative regenerating codes; data exchange; distributed storage system; repair bandwidth minimization; Bandwidth; Encoding; IEEE Communications Society; Maintenance engineering; Network coding; Peer to peer computing; Silicon;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2011 IEEE International Conference on
Conference_Location
Kyoto
ISSN
1550-3607
Print_ISBN
978-1-61284-232-5
Electronic_ISBN
1550-3607
Type
conf
DOI
10.1109/icc.2011.5962548
Filename
5962548
Link To Document