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

by   Seyed Ali Saberali, et al.

We investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used for delivery. We apply this algorithm to all user demands regardless of their request probabilities. This allows for coding among the files that have different request probabilities but makes the allocation of memory to different files challenging during the content placement phase. As our main contribution, we analytically characterize the optimal placement strategy that minimizes the expected delivery rate under a storage capacity constraint. It is shown that the optimal placement follows either a two or a three group strategy, where a set of less popular files are not cached at all and the files within each of the other sets are allocated identical amounts of storage as if they had the same request probabilities. We show that for a finite set of storage capacities, that we call the base-cases of the problem, the two group strategy is always optimal. For other storage capacities, optimal placement is achieved by memory sharing between certain base-cases and the resulting placement either follows a two or a three group strategy depending on the corresponding base-cases used. We derive a polynomial time algorithm that determines the base-cases of the problem given the number of caches and popularity distribution of files. Given the base-cases of the problem, the optimal memory allocation parameters for any storage capacity are derived analytically.



page 1

page 2

page 3

page 4


The Optimal Memory-Rate Trade-off for the Non-uniform Centralized Caching Problem with Two Files under Uncoded Placement

We propose a novel caching strategy for the problem of centralized coded...

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands

Despite significant progress in the caching literature concerning the wo...

On the Optimality of Ali-Niesen Decentralized Coded Caching Scheme With and Without Error Correction

The decentralized coded caching was introduced in [M. A. Maddah-Ali and ...

An Index Coding Approach to Caching with Uncoded Cache Placement

Caching is an efficient way to reduce network traffic congestion during ...

Coded Caching in a Multi-Server System with Random Topology

Cache-aided content delivery is studied in a multi-server system with K ...

Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching Networks

Coded caching techniques have received significant attention lately due ...

Content Placement in Cache Networks Using Graph-Coloring

Small cell densification is one of the effective ideas addressing the de...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.