Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing

Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 work focuses on the trade-off 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 multinode 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 languageEnglish (US)
JournalIEEE Transactions on Information Theory
DOIs
StateAccepted/In press - Sep 19 2018

Fingerprint

Repair
communication
Communication
entropy
Bandwidth
Entropy

Keywords

  • centralized multi-node regeneration
  • Codes for distributed storage
  • communication efficient secret sharing
  • cooperative regenerating codes
  • regenerating codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing. / Rawat, Ankit Singh; Koyluoglu, Onur Ozan; Vishwanath, Sriram.

In: IEEE Transactions on Information Theory, 19.09.2018.

Research output: Contribution to journalArticle

@article{6af4496047984435a26a01830c036b6b,
title = "Centralized Repair of Multiple Node Failures with Applications to Communication Efficient Secret Sharing",
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 work focuses on the trade-off 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 multinode 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.",
keywords = "centralized multi-node regeneration, Codes for distributed storage, communication efficient secret sharing, cooperative regenerating codes, regenerating codes",
author = "Rawat, {Ankit Singh} and Koyluoglu, {Onur Ozan} and Sriram Vishwanath",
year = "2018",
month = "9",
day = "19",
doi = "10.1109/TIT.2018.2871451",
language = "English (US)",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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

PY - 2018/9/19

Y1 - 2018/9/19

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 work focuses on the trade-off 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 multinode 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 work focuses on the trade-off 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 multinode 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 - centralized multi-node regeneration

KW - Codes for distributed storage

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

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

ER -