Coded Caching in a Multi-Server System with Random Topology

12/02/2017
by   Nitish Mital, et al.
0

Cache-aided content delivery is studied in a multi-server system with K users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any ρ servers out of a total of P servers. Thanks to the availability of multiple servers, which model small base stations with limited storage capacity, user demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to a single server serving all the users simultaneously. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery; and it is shown that the achievable average sum delivery rate is comparable to that achieved by a single server, while the gap between the two depends on ρ, the available redundancy across servers. It is also shown that the gap can be reduced by increasing the storage capacity at the SBSs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2020

Coded Caching in Multi-server System with Random Topology

Cache-aided content delivery is studied in a multi-server system with P ...
research
03/20/2018

On Multi-Server Coded Caching in the Low Memory Regime

In this paper we determine the delivery time for a multi-server coded ca...
research
07/04/2017

Sequential Checking: Reallocation-Free Data-Distribution Algorithm for Scale-out Storage

Using tape or optical devices for scale-out storage is one option for st...
research
07/09/2019

Analysing Censorship Circumvention with VPNs via DNS Cache Snooping

Anecdotal evidence suggests an increasing number of people are turning t...
research
12/01/2018

Sunstar: A Cost-effective Multi-Server Solution for Reliable Video Delivery

In spite of much progress and many advances, cost-effective, high-qualit...
research
02/27/2018

On Coded Caching with Heterogeneous Distortion Requirements

This paper considers heterogeneous coded caching where the users have un...
research
04/03/2018

Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands

We investigate the problem of coded caching for nonuniform demands when ...

Please sign up or login with your details

Forgot password? Click here to reset