A Class of MSR Codes for Clustered Distributed Storage

Jy Yong Sohn; Beongjun Choi; Jaekyun Moon

doi:10.1109/ISIT.2018.8437458

A Class of MSR Codes for Clustered Distributed Storage

Jy Yong Sohn, Beongjun Choi, Jaekyun Moon

Department of Applied Statistics

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

Abstract

Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: \epsilon=0 and \epsilon=1/(n-k), where \epsilon is the ratio of the available cross- and intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth allowing minimum storage overhead. For the \epsilon=0 case, two types of locally repairable codes are proven to achieve the MSR point. As for \epsilon=1/(n-k), MDS codes achieve the MSR points for n=Lk, where L is the number of clusters.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2366-2370
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437458
Publication status	Published - 2018 Aug 15
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 2018 Jun 17 → 2018 Jun 22

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-June
ISSN (Print)	2157-8095

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	18/6/17 → 18/6/22

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2018.8437458

Cite this

Sohn, J. Y., Choi, B., & Moon, J. (2018). A Class of MSR Codes for Clustered Distributed Storage. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 2366-2370). [8437458] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437458

@inproceedings{87f5f0fa2e0b438eaeb6d2f28b2fc907,

title = "A Class of MSR Codes for Clustered Distributed Storage",

abstract = "Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: \epsilon=0 and \epsilon=1/(n-k), where \epsilon is the ratio of the available cross- and intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth allowing minimum storage overhead. For the \epsilon=0 case, two types of locally repairable codes are proven to achieve the MSR point. As for \epsilon=1/(n-k), MDS codes achieve the MSR points for n=Lk, where L is the number of clusters.",

author = "Sohn, {Jy Yong} and Beongjun Choi and Jaekyun Moon",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437458",

language = "English",

isbn = "9781538647806",

series = "IEEE International Symposium on Information Theory - Proceedings",

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

pages = "2366--2370",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

address = "United States",

}

Sohn, JY, Choi, B & Moon, J 2018, A Class of MSR Codes for Clustered Distributed Storage. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437458, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 2366-2370, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 18/6/17. https://doi.org/10.1109/ISIT.2018.8437458

A Class of MSR Codes for Clustered Distributed Storage. / Sohn, Jy Yong; Choi, Beongjun; Moon, Jaekyun.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 2366-2370 8437458 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

TY - GEN

T1 - A Class of MSR Codes for Clustered Distributed Storage

AU - Sohn, Jy Yong

AU - Choi, Beongjun

AU - Moon, Jaekyun

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: \epsilon=0 and \epsilon=1/(n-k), where \epsilon is the ratio of the available cross- and intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth allowing minimum storage overhead. For the \epsilon=0 case, two types of locally repairable codes are proven to achieve the MSR point. As for \epsilon=1/(n-k), MDS codes achieve the MSR points for n=Lk, where L is the number of clusters.

AB - Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: \epsilon=0 and \epsilon=1/(n-k), where \epsilon is the ratio of the available cross- and intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth allowing minimum storage overhead. For the \epsilon=0 case, two types of locally repairable codes are proven to achieve the MSR point. As for \epsilon=1/(n-k), MDS codes achieve the MSR points for n=Lk, where L is the number of clusters.

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

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

U2 - 10.1109/ISIT.2018.8437458

DO - 10.1109/ISIT.2018.8437458

M3 - Conference contribution

AN - SCOPUS:85052459258

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2366

EP - 2370

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

A Class of MSR Codes for Clustered Distributed Storage

Abstract

Publication series

Conference

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this