Abstract
This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth efficient repair of a single-failed node. This paper focuses on the tradeoff between the amount of data stored and repair bandwidth in the CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multi-node repair (MBMR) operating points. The tightness of these bounds is analyzed via code constructions. The MSMR point is characterized by codes achieving this point under functional repair for the general set of CMR parameters, as well as with codes enabling exact repair for certain CMR parameters. The MBMR point, on the other hand, is characterized with exact repair codes for all CMR parameters for systems that satisfy a certain entropy accumulation property. Finally, the model proposed here is utilized for the secret sharing problem, where the codes for the multi-node repair problem are used to construct communication efficient secret sharing schemes with the property of bandwidth efficient share repair.
| Original language | English (US) |
|---|---|
| Article number | 8469091 |
| Pages (from-to) | 7529-7550 |
| Number of pages | 22 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 64 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2018 |
Keywords
- Codes for distributed storage
- centralized multi-node regeneration
- communication efficient secret sharing
- cooperative regenerating codes
- regenerating codes
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences