Centralized repair of multiple node failures

Ankit Singh Rawat; Onur Ozan Koyluoglu; Sriram Vishwanath

doi:10.1109/ISIT.2016.7541450

Centralized repair of multiple node failures

Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

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 this 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 are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for 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.

Original language	English (US)
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1003-1007
Number of pages	5
Volume	2016-August
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541450
State	Published - Aug 10 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016

Other

Other	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country	Spain
City	Barcelona
Period	7/10/16 → 7/15/16

Keywords

centralized multi-node regeneration
Codes for distributed storage
regenerating codes

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2016.7541450

Fingerprint Dive into the research topics of 'Centralized repair of multiple node failures'. Together they form a unique fingerprint.

Cite this

Centralized repair of multiple node failures. / Rawat, Ankit Singh; Koyluoglu, Onur Ozan; Vishwanath, Sriram.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. p. 1003-1007 7541450.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rawat, AS, Koyluoglu, OO & Vishwanath, S 2016, Centralized repair of multiple node failures. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. vol. 2016-August, 7541450, Institute of Electrical and Electronics Engineers Inc., pp. 1003-1007, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541450

@inproceedings{297cac1a61c04cd294dcb2861264c0a5,

title = "Centralized repair of multiple node failures",

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 this 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 are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for 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.",

keywords = "centralized multi-node regeneration, Codes for distributed storage, regenerating codes",

author = "Rawat, {Ankit Singh} and Koyluoglu, {Onur Ozan} and Sriram Vishwanath",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541450",

language = "English (US)",

volume = "2016-August",

pages = "1003--1007",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

}

TY - GEN

T1 - Centralized repair of multiple node failures

AU - Rawat, Ankit Singh

AU - Koyluoglu, Onur Ozan

AU - Vishwanath, Sriram

PY - 2016/8/10

Y1 - 2016/8/10

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 this 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 are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for 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.

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 this 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 are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for 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.

KW - centralized multi-node regeneration

KW - Codes for distributed storage

KW - regenerating codes

UR - http://www.scopus.com/inward/record.url?scp=84985916624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84985916624&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541450

DO - 10.1109/ISIT.2016.7541450

M3 - Conference contribution

AN - SCOPUS:84985916624

VL - 2016-August

SP - 1003

EP - 1007

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -