Efficient storage schemes for desired service rate regions

Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson

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

2 Scopus citations


A major concern in cloud/edge storage systems is serving a large number of users simultaneously. The service rate region is introduced recently as an important performance metric for coded distributed systems, which is defined as the set of all data access requests that can be simultaneously handled by the system. This paper studies the problem of designing a coded distributed storage system storing k files where a desired service rate region R of the system is given and the goal is 1) to determine the minimum number of storage nodes n(R) for serving all demand vectors inside the set R and 2) to design the most storage-efficient redundancy scheme with the service rate region covering the set R. Towards this goal, we propose three general lower bounds for n(R). Also, for k = 2, we characterize n(R), i.e., we show that the proposed lower bounds are tight, via designing a novel storage-efficient redundancy scheme with n(R) storage nodes and service rate region covering R.

Original languageEnglish (US)
Title of host publication2020 IEEE Information Theory Workshop, ITW 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728159621
StatePublished - Apr 11 2021
Event2020 IEEE Information Theory Workshop, ITW 2020 - Virtual, Riva del Garda, Italy
Duration: Apr 11 2021Apr 15 2021

Publication series

Name2020 IEEE Information Theory Workshop, ITW 2020


Conference2020 IEEE Information Theory Workshop, ITW 2020
CityVirtual, Riva del Garda

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Information Systems
  • Signal Processing
  • Software
  • Theoretical Computer Science


Dive into the research topics of 'Efficient storage schemes for desired service rate regions'. Together they form a unique fingerprint.

Cite this