On the service capacity region of accessing erasure coded content
- 1 October 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 17-24
Abstract
Cloud storage systems generally add redundancy in storing content files such that K files are replicated or erasure coded and stored on N > K nodes. In addition to providing reliability against failures, the redundant copies can be used to serve a larger volume of content access requests. A request for one of the files can be either be sent to a systematic node, or one of the repair groups. In this paper, we seek to maximize the service capacity region, that is, the set of request arrival rates for the K files that can be supported by a coded storage system. We explore two aspects of this problem: 1) for a given erasure code, how to optimally split incoming requests between systematic nodes and repair groups, and 2) choosing an underlying erasure code that maximizes the achievable service capacity region. In particular, we consider MDS and Simplex codes. Our analysis demonstrates that erasure coding makes the system more robust to skews in file popularity than simply replicating a file at multiple servers, and that coding and replication together can make the capacity region larger than either alone.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Bounds on the Size of Locally Recoverable CodesIEEE Transactions on Information Theory, 2015
- When do the availability codes make the stored data more available?2015
- Reducing Latency via Redundant RequestsACM SIGMETRICS Performance Evaluation Review, 2015
- Analyzing the download time of availability codes2015
- Repair Locality With Multiple Erasure ToleranceIEEE Transactions on Information Theory, 2014
- The MDS queue: Analysing the latency performance of erasure codes2014
- Bounds on locally recoverable codes with multiple recovering sets2014
- Locality and availability in distributed storage2014
- FAST CLOUD: Pushing the Envelope on Delay Performance of Cloud Storage With CodingIEEE/ACM Transactions on Networking, 2013
- Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems2007