TY - JOUR
T1 - Centralized repair of multiple node failures with applications to communication efficient secret sharing
AU - Rawat, Ankit Singh
AU - Koyluoglu, Onur Ozan
AU - Vishwanath, Sriram
N1 - Funding Information:
Manuscript received April 13, 2016; revised May 14, 2018; accepted August 13, 2018. Date of publication September 20, 2018; date of current version November 20, 2018. O. O. Koyluoglu was supported by NSF under Grant CCF-CIF-1748585 and Grant CNS-TWC-1748692. S. Vishwanath was supported by NSF under Grant CNS-1731754 and Grant 1834320. This paper was presented in part at the 2016 IEEE International Symposium on Information Theory.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/12
Y1 - 2018/12
N2 - 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.
AB - 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.
KW - Codes for distributed storage
KW - centralized multi-node regeneration
KW - communication efficient secret sharing
KW - cooperative regenerating codes
KW - regenerating codes
UR - http://www.scopus.com/inward/record.url?scp=85053607140&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85053607140&partnerID=8YFLogxK
U2 - 10.1109/TIT.2018.2871451
DO - 10.1109/TIT.2018.2871451
M3 - Article
AN - SCOPUS:85053607140
VL - 64
SP - 7529
EP - 7550
JO - IRE Professional Group on Information Theory
JF - IRE Professional Group on Information Theory
SN - 0018-9448
IS - 12
M1 - 8469091
ER -