Efficient Storage Schemes for Desired Service Rate Regions

10/23/2020
by   Fatemeh Kazemi, et al.
0

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) (or a lower bound on 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 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 the service rate region covering R.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2023

The Service Rate Region Polytope

We investigate the properties of a family of polytopes that naturally ar...
research
01/24/2020

A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes

Service rate is an important, recently introduced, performance metric as...
research
09/03/2020

Service Rate Region: A New Aspect of Coded Distributed System Design

Erasure coding has been recently employed as a powerful method to mitiga...
research
01/08/2019

Service Rate Region of Content Access from Erasure Coded Storage

We consider storage systems in which K files are stored over N nodes. A ...
research
02/08/2021

Distributed Storage Allocations for Optimal Service Rates

Redundant storage maintains the performance of distributed systems under...
research
02/18/2020

Repair rate lower bounds for distributed storage

One of the primary objectives of a distributed storage system is to reli...
research
05/16/2018

Integrated Bounds for Disintegrated Storage

We point out a somewhat surprising similarity between non-authenticated ...

Please sign up or login with your details

Forgot password? Click here to reset