Service rate region of content access from erasure coded storage

Sarah E. Anderson, Ann Johnston, Gauri Joshi, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider storage systems in which K files are stored over N nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file f k arrive at rate λ k , and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a 3-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file K given λ1, . . ., λK−1 in a general K-file case.

Original languageEnglish (US)
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538635995
DOIs
StatePublished - Jan 15 2019
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: Nov 25 2018Nov 29 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018

Conference

Conference2018 IEEE Information Theory Workshop, ITW 2018
CountryChina
CityGuangzhou
Period11/25/1811/29/18

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this

Anderson, S. E., Johnston, A., Joshi, G., Matthews, G. L., Mayer, C., & Soljanin, E. (2019). Service rate region of content access from erasure coded storage. In 2018 IEEE Information Theory Workshop, ITW 2018 [8613504] (2018 IEEE Information Theory Workshop, ITW 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2018.8613504
Anderson, Sarah E. ; Johnston, Ann ; Joshi, Gauri ; Matthews, Gretchen L. ; Mayer, Carolyn ; Soljanin, Emina. / Service rate region of content access from erasure coded storage. 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. (2018 IEEE Information Theory Workshop, ITW 2018).
@inproceedings{a880aa6100e14a2b9a7c1e878ec72119,
title = "Service rate region of content access from erasure coded storage",
abstract = "We consider storage systems in which K files are stored over N nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file f k arrive at rate λ k , and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a 3-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file K given λ1, . . ., λK−1 in a general K-file case.",
author = "Anderson, {Sarah E.} and Ann Johnston and Gauri Joshi and Matthews, {Gretchen L.} and Carolyn Mayer and Emina Soljanin",
year = "2019",
month = "1",
day = "15",
doi = "10.1109/ITW.2018.8613504",
language = "English (US)",
series = "2018 IEEE Information Theory Workshop, ITW 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",
address = "United States",

}

Anderson, SE, Johnston, A, Joshi, G, Matthews, GL, Mayer, C & Soljanin, E 2019, Service rate region of content access from erasure coded storage. in 2018 IEEE Information Theory Workshop, ITW 2018., 8613504, 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc., 2018 IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, 11/25/18. https://doi.org/10.1109/ITW.2018.8613504

Service rate region of content access from erasure coded storage. / Anderson, Sarah E.; Johnston, Ann; Joshi, Gauri; Matthews, Gretchen L.; Mayer, Carolyn; Soljanin, Emina.

2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. 8613504 (2018 IEEE Information Theory Workshop, ITW 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Service rate region of content access from erasure coded storage

AU - Anderson, Sarah E.

AU - Johnston, Ann

AU - Joshi, Gauri

AU - Matthews, Gretchen L.

AU - Mayer, Carolyn

AU - Soljanin, Emina

PY - 2019/1/15

Y1 - 2019/1/15

N2 - We consider storage systems in which K files are stored over N nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file f k arrive at rate λ k , and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a 3-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file K given λ1, . . ., λK−1 in a general K-file case.

AB - We consider storage systems in which K files are stored over N nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file f k arrive at rate λ k , and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a 3-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file K given λ1, . . ., λK−1 in a general K-file case.

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

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

U2 - 10.1109/ITW.2018.8613504

DO - 10.1109/ITW.2018.8613504

M3 - Conference contribution

AN - SCOPUS:85062064938

T3 - 2018 IEEE Information Theory Workshop, ITW 2018

BT - 2018 IEEE Information Theory Workshop, ITW 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Anderson SE, Johnston A, Joshi G, Matthews GL, Mayer C, Soljanin E. Service rate region of content access from erasure coded storage. In 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc. 2019. 8613504. (2018 IEEE Information Theory Workshop, ITW 2018). https://doi.org/10.1109/ITW.2018.8613504