Fundamental Limits of Stochastic Caching Networks

by   Adeel Malik, et al.

The work establishes the exact performance limits of stochastic coded caching when users share a bounded number of cache states, and when the association between users and caches, is random. Under the premise that more balanced user-to-cache associations perform better than unbalanced ones, our work provides a statistical analysis of the average performance of such networks, identifying in closed form, the exact optimal average delivery time. To insightfully capture this delay, we derive easy to compute closed-form analytical bounds that prove tight in the limit of a large number Λ of cache states. In the scenario where delivery involves K users, we conclude that the multiplicative performance deterioration due to randomness – as compared to the well-known deterministic uniform case – can be unbounded and can scale as Θ( logΛ/loglogΛ) at K=Θ(Λ), and that this scaling vanishes when K=Ω(ΛlogΛ). To alleviate this adverse effect of cache-load imbalance, we consider various load balancing methods, and show that employing proximity-bounded load balancing with an ability to choose from h neighboring caches, the aforementioned scaling reduces to Θ(log(Λ / h)/loglog(Λ / h)), while when the proximity constraint is removed, the scaling is of a much slower order Θ( loglogΛ). The above analysis is extensively validated numerically.


page 1

page 2

page 3

page 4


Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization

This work studies the K-user broadcast channel with Λ caches, when the a...

Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching

The work identifies the fundamental limits of coded caching when the K r...

Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching

The work explores the fundamental limits of coded caching in heterogeneo...

Coded Caching in Networks with Heterogeneous User Activity

This work elevates coded caching networks from their purely information-...

Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers

Optimal delivery scheme for coded caching problems with small buffer siz...

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching

The original coded caching scenario assumes a content library that is of...

On the Impact of Network Delays on Time-to-Live Caching

We consider Time-to-Live (TTL) caches that tag every object in cache wit...

Please sign up or login with your details

Forgot password? Click here to reset