Service Rate Region: A New Aspect of Coded Distributed System Design
- 4 October 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (12) , 7940-7963
Abstract
Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objects can flexibly handle skews in the request rates. Coding can help boost the service rate region , that is, increase the overall volume of data access requests that the system can handle. This paper aims to postulate the service rate region as an important consideration in the design of erasure-coded distributed systems. We highlight several open problems that can be grouped into two broad threads: 1) characterizing the service rate region of a given code and finding the optimal request allocation, and 2) designing the underlying erasure code for a given service rate region. As contributions along the first thread, we find the rate regions of maximum-distance-separable, locally repairable, and simplex codes. We show the effectiveness of hybrid codes that combine replication and erasure coding in terms of code design. We also discover fundamental connections between multi-set batch codes and the problem of maximizing the service rate region.Keywords
All Related Versions
Funding Information
- National Science Foundation (NSF) CAREER Award (CCF-2045694)
- NSF (CIF-1717314)
This publication has 72 references indexed in Scilit:
- On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage SystemsIEEE Journal on Selected Areas in Communications, 2014
- Large matchings in uniform hypergraphs and the conjectures of Erdős and SamuelsJournal of Combinatorial Theory, Series A, 2012
- Private information retrievalCommunications of the ACM, 2010
- Job replication on multiserver systemsAdvances in Applied Probability, 2009
- Combinatorial batch codesAdvances in Mathematics of Communications, 2009
- On codes meeting the Griesmer boundDiscrete Mathematics, 2003
- Geometric approach to higher weightsIEEE Transactions on Information Theory, 1995
- Approximate analysis of fork/join synchronization in parallel queuesIEEE Transactions on Computers, 1988
- A case for redundant arrays of inexpensive disks (RAID)ACM SIGMOD Record, 1988
- Two Parallel Queues Created by Arrivals with Two Demands ISIAM Journal on Applied Mathematics, 1984