Exact repair for distributed storage systems: Partial characterization via new bounds

Soheil Mohajer; Ravi Tandon

doi:10.1109/ITA.2015.7308977

Exact repair for distributed storage systems: Partial characterization via new bounds

Soheil Mohajer, Ravi Tandon

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

7 Scopus citations

Abstract

The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic lower bounds is provided for the storage-vs-repair bandwidth tradeoff. The bound recovers Tians bound for the (4, 3, 3) system, and hence suffices for exact characterization for this system. Moreover, the bound improves upon the existing lower bounds for the (5, 4, 4) system and also characterizes the partial boundary of optimal exact repair tradeoff.

Original language	English (US)
Title of host publication	2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	130-135
Number of pages	6
ISBN (Electronic)	9781479971954
DOIs	https://doi.org/10.1109/ITA.2015.7308977
State	Published - Oct 27 2015
Externally published	Yes
Event	Information Theory and Applications Workshop, ITA 2015 - San Diego, United States Duration: Feb 1 2015 → Feb 6 2015

Publication series

Name	2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings

Other

Other	Information Theory and Applications Workshop, ITA 2015
Country/Territory	United States
City	San Diego
Period	2/1/15 → 2/6/15

Keywords

5G mobile communication
Bandwidth
Decision support systems
Distributed databases
Maintenance engineering
Silicon
Upper bound

Access

10.1109/ITA.2015.7308977

OpenUrl availability

Full text

Cite this

Mohajer, S., & Tandon, R. (2015). Exact repair for distributed storage systems: Partial characterization via new bounds. In 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings (pp. 130-135). Article 7308977 (2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITA.2015.7308977

Exact repair for distributed storage systems: Partial characterization via new bounds. / Mohajer, Soheil; Tandon, Ravi.
2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc., 2015. p. 130-135 7308977 (2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings).

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

Mohajer, S & Tandon, R 2015, Exact repair for distributed storage systems: Partial characterization via new bounds. in 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings., 7308977, 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 130-135, Information Theory and Applications Workshop, ITA 2015, San Diego, United States, 2/1/15. https://doi.org/10.1109/ITA.2015.7308977

Mohajer S, Tandon R. Exact repair for distributed storage systems: Partial characterization via new bounds. In 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc. 2015. p. 130-135. 7308977. (2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings). doi: 10.1109/ITA.2015.7308977

@inproceedings{4d081e059d3e46bfa890ed111279cb54,

title = "Exact repair for distributed storage systems: Partial characterization via new bounds",

abstract = "The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic lower bounds is provided for the storage-vs-repair bandwidth tradeoff. The bound recovers Tians bound for the (4, 3, 3) system, and hence suffices for exact characterization for this system. Moreover, the bound improves upon the existing lower bounds for the (5, 4, 4) system and also characterizes the partial boundary of optimal exact repair tradeoff.",

keywords = "5G mobile communication, Bandwidth, Decision support systems, Distributed databases, Maintenance engineering, Silicon, Upper bound",

author = "Soheil Mohajer and Ravi Tandon",

year = "2015",

month = oct,

day = "27",

doi = "10.1109/ITA.2015.7308977",

language = "English (US)",

series = "2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings",

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

pages = "130--135",

booktitle = "2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings",

note = "Information Theory and Applications Workshop, ITA 2015 ; Conference date: 01-02-2015 Through 06-02-2015",

}

TY - GEN

T1 - Exact repair for distributed storage systems

T2 - Information Theory and Applications Workshop, ITA 2015

AU - Mohajer, Soheil

AU - Tandon, Ravi

PY - 2015/10/27

Y1 - 2015/10/27

N2 - The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic lower bounds is provided for the storage-vs-repair bandwidth tradeoff. The bound recovers Tians bound for the (4, 3, 3) system, and hence suffices for exact characterization for this system. Moreover, the bound improves upon the existing lower bounds for the (5, 4, 4) system and also characterizes the partial boundary of optimal exact repair tradeoff.

AB - The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic lower bounds is provided for the storage-vs-repair bandwidth tradeoff. The bound recovers Tians bound for the (4, 3, 3) system, and hence suffices for exact characterization for this system. Moreover, the bound improves upon the existing lower bounds for the (5, 4, 4) system and also characterizes the partial boundary of optimal exact repair tradeoff.

KW - 5G mobile communication

KW - Bandwidth

KW - Decision support systems

KW - Distributed databases

KW - Maintenance engineering

KW - Silicon

KW - Upper bound

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

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

U2 - 10.1109/ITA.2015.7308977

DO - 10.1109/ITA.2015.7308977

M3 - Conference contribution

AN - SCOPUS:84961782009

T3 - 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings

SP - 130

EP - 135

BT - 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 1 February 2015 through 6 February 2015

ER -

Exact repair for distributed storage systems: Partial characterization via new bounds

Abstract

Publication series

Other

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this