Academic
Publications
Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems

Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems,10.1109/ISIT.2011.6033778,Kenneth W. Shum,Yuchong Hu

Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems   (Citations: 1)
BibTex | RIS | RefWorks Download
In order to provide high data reliability, we distribute data with redundancy to the nodes in a storage network in such a way that the data can be retrieved even if some of the storage nodes are not available. When the storage network becomes larger, node failure becomes more frequent, and it is not uncommon to see two or more node failures at the same time. We exploit the opportunity of repairing the failed nodes cooperatively, and investigate a repair mechanism in which the new storage nodes can exchange data among themselves. A lower bound on the repair-bandwidth for cooperative repair is derived and an explicit construction of a family of exact-regenerating codes matching this lower bound on the repair-bandwidth is presented.
Conference: IEEE International Symposium on Information Theory - ISIT , vol. abs/1102.1, pp. 1442-1446, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In [7], regenerating codes under MBCR is considered, but no proof of existence of generic MBCR codes is given...
    • ...A cut-based lower bound on the repair-bandwidth from [7] is stated...
    • ...The sum of F (e) over all edges terminating at T is called the value of F with respect to T. By considering some specific cut through the information flow graph, the following upper bound on the value of a flow is established in [7] (and independently in [6])...

    Kenneth W. Shumet al. Existence of Minimum-Repair-Bandwidth Cooperative Regenerating Codes

Sort by: