Achievable schemes and limits for local recovery on a graph

Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publication2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages909-913
Number of pages5
ISBN (Electronic)9781479980093
DOIs
StatePublished - Jan 30 2014
Event2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States
Duration: Sep 30 2014Oct 3 2014

Other

Other2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
CountryUnited States
CityMonticello
Period9/30/1410/3/14

Fingerprint Dive into the research topics of 'Achievable schemes and limits for local recovery on a graph'. Together they form a unique fingerprint.

Cite this