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

2 Scopus citations

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