Computer Science – Information Theory
Scientific paper
2011-02-08
Computer Science
Information Theory
5 pages, 4 figures, presented at IEEE ISIT 2011
Scientific paper
In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data repair performance in distributed storage. Most of the studies on regenerating codes focus on the single-failure recovery, but it is not uncommon to see two or more node failures at the same time in large storage networks. To exploit the opportunity of repairing multiple failed nodes simultaneously, a cooperative repair mechanism, in the sense that the nodes to be repaired can exchange data among themselves, is investigated. A lower bound on the repair-bandwidth for cooperative repair is derived and a construction of a family of exact cooperative regenerating codes matching this lower bound is presented.
Hu Yuchong
Shum Kenneth W.
No associations
LandOfFree
Exact Minimum-Repair-Bandwidth 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 Exact Minimum-Repair-Bandwidth 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 Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-502454