Achievable schemes and limits for local recovery on a graph

Arya Mazumdar

doi:10.1109/ALLERTON.2014.7028551

Achievable schemes and limits for local recovery on a graph

Arya Mazumdar

Electrical and Computer Engineering

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

3 Scopus citations

Abstract

Recently, a graph-theoretic model for a single-failure-recoverable distributed storage system was proposed. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectible to only some, and not all other, nodes. Here we provide bounds and constructive schemes for data storage in such networks. We also impose an additional requirement on the codes for such model - a minimum distance guarantee. The model is further generalized for multiple node failures and cooperative repairs.

Original language	English (US)
Title of host publication	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	909-913
Number of pages	5
ISBN (Electronic)	9781479980093
DOIs	https://doi.org/10.1109/ALLERTON.2014.7028551
State	Published - Jan 30 2014
Event	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States Duration: Sep 30 2014 → Oct 3 2014

Other

Other	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Country/Territory	United States
City	Monticello
Period	9/30/14 → 10/3/14

Publisher link

10.1109/ALLERTON.2014.7028551

Find It

Find It at U of M Libraries

Cite this

Mazumdar, A 2014, Achievable schemes and limits for local recovery on a graph. in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014., 7028551, Institute of Electrical and Electronics Engineers Inc., pp. 909-913, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, Monticello, United States, 9/30/14. https://doi.org/10.1109/ALLERTON.2014.7028551

@inproceedings{641454ae0d28499fa5dceaa7d682130a,

title = "Achievable schemes and limits for local recovery on a graph",

abstract = "Recently, a graph-theoretic model for a single-failure-recoverable distributed storage system was proposed. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectible to only some, and not all other, nodes. Here we provide bounds and constructive schemes for data storage in such networks. We also impose an additional requirement on the codes for such model - a minimum distance guarantee. The model is further generalized for multiple node failures and cooperative repairs.",

author = "Arya Mazumdar",

year = "2014",

month = jan,

day = "30",

doi = "10.1109/ALLERTON.2014.7028551",

language = "English (US)",

pages = "909--913",

booktitle = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014",

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

note = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 ; Conference date: 30-09-2014 Through 03-10-2014",

}

TY - GEN

T1 - Achievable schemes and limits for local recovery on a graph

AU - Mazumdar, Arya

PY - 2014/1/30

Y1 - 2014/1/30

N2 - Recently, a graph-theoretic model for a single-failure-recoverable distributed storage system was proposed. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectible to only some, and not all other, nodes. Here we provide bounds and constructive schemes for data storage in such networks. We also impose an additional requirement on the codes for such model - a minimum distance guarantee. The model is further generalized for multiple node failures and cooperative repairs.

AB - Recently, a graph-theoretic model for a single-failure-recoverable distributed storage system was proposed. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectible to only some, and not all other, nodes. Here we provide bounds and constructive schemes for data storage in such networks. We also impose an additional requirement on the codes for such model - a minimum distance guarantee. The model is further generalized for multiple node failures and cooperative repairs.

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

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

U2 - 10.1109/ALLERTON.2014.7028551

DO - 10.1109/ALLERTON.2014.7028551

M3 - Conference contribution

AN - SCOPUS:84946688071

SP - 909

EP - 913

BT - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Y2 - 30 September 2014 through 3 October 2014

ER -

Achievable schemes and limits for local recovery on a graph

Abstract

Other

Publisher link

Find It

Other files and links

Fingerprint

Cite this