Cooperative Regenerating Codes
From MaRDI portal
Abstract: One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simultaneously and cooperatively, further reduction of repair traffic is made possible. A closed-form expression of the optimal tradeoff between the repair traffic and the amount of storage in each node for cooperative repair is given. We show that the points on the tradeoff curve can be achieved by linear cooperative regenerating codes, with an explicit bound on the required finite field size. The proof relies on a max-flow-min-cut-type theorem for submodular flow from combinatorial optimization. Two families of explicit constructions are given.
Cited in
(12)- Self-repairing codes
- Co-orthogonal codes
- On applications of orbit codes to storage
- Construction of minimum bandwidth regenerating codes with combinatorial design
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Cooperative Multi-Sender Index Coding
- scientific article; zbMATH DE number 897548 (Why is no real title available?)
- Construction of one special minimum storage regenerating code when α=2
- Multilinear algebra for distributed storage
- Codes for Distributed Storage
- A class of minimum storage cooperative regenerating codes with low access property
- Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
This page was built for publication: Cooperative Regenerating Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346250)
