Cooperative Regenerating Codes

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 rather than successively and independently, further reduction of repair traffic is made possib...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2013-11, Vol.59 (11), p.7229-7258
Main Authors: Shum, Kenneth W., Yuchong Hu
Format: Article
Language:English
Subjects:
Applied sciences
Bandwidth
Codes
Coding, codes
Decentralized erasure codes
Distributed databases
distributed storage system
Encoding
Exact sciences and technology
Indexes
Information theory
Information, signal and communications theory
Maintenance engineering
Network coding
Optimization
Peer-to-peer computing
polymatroid
regenerating codes
Signal and communications theory
submodular flow
submodular function
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 rather than successively and independently, 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 from combinatorial optimization for submodular flows. Two families of explicit constructions are given.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2274265