Cooperative Regenerating Codes for Distributed Storage Systems

Details Cooperative Regenerating Codes for Distributed Storage Systems Cooperative Regenerating Codes for Distributed Storage Systems

2011-01-27

arxiv.org/abs/1101.5257v2

Computer Science

Information Theory

5 pages, 7 figures, to appear in Proc. IEEE ICC, 2011

Scientific paper

When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-bandwidth minimization is concerned. If data exchange among the newcomers is enabled, we can get a better tradeoff between repair bandwidth and the storage per node. An explicit and optimal construction of cooperative regenerating code is illustrated.

Affiliated with

Also associated with

No associations

Rating

Cooperative Regenerating Codes for Distributed Storage Systems 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 Cooperative Regenerating Codes for Distributed Storage Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperative Regenerating Codes for Distributed Storage Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545278