Uncoded Caching and Cross-Level Coded Delivery for Non-Uniform File Popularity

@article{Ozfatura2018UncodedCA,
  title={Uncoded Caching and Cross-Level Coded Delivery for Non-Uniform File Popularity},
  author={Emre Ozfatura and Deniz G{\"u}nd{\"u}z},
  journal={2018 IEEE International Conference on Communications (ICC)},
  year={2018},
  pages={1-6}
}
  • Emre Ozfatura, Deniz Gündüz
  • Published 4 February 2018
  • Computer Science, Mathematics
  • 2018 IEEE International Conference on Communications (ICC)
Proactive content caching at user devices and coded delivery is studied considering a non-uniform file popularity distribution. A novel centralized uncoded caching and coded delivery scheme, which can be applied to large file libraries, is proposed. The proposed cross-level coded delivery (CLCD) scheme is shown to achieve a lower average delivery rate than the state of art. In the proposed CLCD scheme, the same subpacketization is used for all the files in the library in order to prevent… Expand
The Optimal Memory-Rate Trade-off for the Non-uniform Centralized Caching Problem with Two Files under Uncoded Placement
TLDR
A delivery strategy is proposed which meets a natural extension of the existing converse bounds under uncodes placement to non-uniform demands, thereby establishing the optimal expected memory-rate trade-off for the case of two files with arbitrary popularities under the restriction of uncoded placement. Expand
The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement
TLDR
It is proved that the achievable delivery rate for the case of two files meets this converse, thereby establishing the optimal expected memory-rate trade-off for the cases of <inline-formula> <tex-math notation="LaTeX">$K$ </tex- math></inline- formula> users and two files with arbitrary popularities under uncoded placement. Expand
Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs
  • Shanuja Sasi, B. S. Rajan
  • Computer Science, Mathematics
  • 2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
TLDR
New PDAs are constructed which specify the delivery scheme for a specific class of multi-access coded caching problem based on the concept of PDA and achieve a lower transmission rate with the least sub-packetization level compared to the existing schemes. Expand
Decentralized Coded Caching Scheme With Heterogeneous File Sizes
TLDR
To fully exploit the coded multicasting opportunities in decentralized coded caching system with heterogenous file sizes, a file partitioning and grouping (FPG) scheme is proposed, which outperforms the existing decentralizedcoded caching schemes in the literature. Expand
Mobility-Aware Coded Storage and Delivery
TLDR
It is shown that the proposed scheme provides a significant reduction both in the backhaul load when the cache capacity is sufficiently large, and in the number of sub-files required, which decidedly outperforms state-of-the-art alternatives. Expand
Multi-Transmitter Coded Caching Networks with Transmitter-side Knowledge of File Popularity
TLDR
This work reveals that in the context of coded caching, employing multiple transmitters can be a catalyst in fully exploiting file popularity, as it avoids various asymmetry complications that appear when file popularity is used to alter the receiver-side cache placement. Expand
On the Exact Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement
TLDR
This work proposes an alternate index coding-based placement and delivery scheme for this cache-aided content delivery network, which performs better than the previously proposed strategy and shows that the scheme is exactly optimal under the restriction of uncoded placement. Expand
Augmenting Multiple-Transmitter Coded Caching using Popularity Knowledge at the Transmitters
TLDR
Focusing on the interference channel with cache-enabled transmitters and receivers, it is shown how non-uniform file popularity can be used to accelerate the impact of transmitter-side data redundancy in coded caching. Expand
Audience-Retention-Rate-Aware Caching and Coded Video Delivery With Asynchronous Demands
TLDR
Numerical results validate that the proposed PCD scheme, either with HoCA or HeCA, outperforms conventional uncoded caching as well as the state-of-the-art decentralized caching schemes, which consider only the file popularities, and are designed for synchronous demand arrivals. Expand
Audience-Retention-Rate-Aware Caching and Coded Video Delivery with Asynchronous Demands
Most of the current literature on coded caching focus on a static scenario, in which a fixed number of users synchronously place their requests from a content library, and the performance is measuredExpand
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
Structural Properties of Uncoded Placement Optimization for Coded Delivery
TLDR
An information-theoretic converse bound on the average load under an arbitrary file popularity distribution is presented and an equivalent linear optimization problem with K+1 variables under the uniform file popularity is obtained. Expand
Coded Caching for Multi-level Popularity and Access
TLDR
The derivation of an order-optimal scheme which judiciously shares cache memory among files with different popularities is derived, and new information-theoretic lower bounds are derived, which use a sliding-window entropy inequality, effectively creating a non-cut-set bound. Expand
Coded caching under arbitrary popularity distributions
TLDR
This work first derives a new information-theoretical lower bound on the expected transmission rate of any coded caching schemes, and shows that a simple coded-caching scheme attains an expected Transmission rate that is at most a constant factor away from the lower bound. Expand
Decentralized Caching and Coded Delivery With Distinct Cache Capacities
TLDR
A group-based decentralized caching and coded delivery scheme is proposed, and it is shown to improve upon the state of the art in terms of the minimum required delivery rate when there are more users in the system than files. Expand
An Efficient Delivery Scheme for Coded Caching
TLDR
A novel delivery scheme is designed that builds on a prior scheme for the uniform demand case, but performs better in the non-uniform demand case and is evaluated for different caching policies. Expand
Decentralized coded caching attains order-optimal memory-rate tradeoff
  • M. Maddah-Ali, Urs Niesen
  • Computer Science, Mathematics
  • 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2013
TLDR
This paper proposes an efficient caching scheme, in which the content placement is performed in a decentralized manner, and hence achieves a rate close to the centralized scheme. Expand
Coded Caching With Nonuniform Demands
TLDR
A fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link, and it is proposed and proved that it is close to optimal. Expand
Coded Caching for Wireless Backhaul Networks With Unequal Link Rates
TLDR
A new network coding scheme nested coded modulation (NCM) in the delivery phase and a novel file partition scheme for the placement phase based on unequal cache size allocation that adapts to unequal link rates for increasing broadcast gains are developed. Expand
Centralized Coded Caching with Heterogeneous Cache Sizes
TLDR
This paper proposes an optimization framework for cache placement and delivery schemes which explicitly accounts for the heterogeneity of the cache sizes, and characterize explicitly the optimal caching scheme, for the case where the sum of the users' cache sizes is smaller than or equal to the library size. Expand
Fundamental limits of caching
TLDR
This paper proposes a novel caching approach that can achieve a significantly larger reduction in peak rate compared to previously known caching schemes, and argues that the performance of the proposed scheme is within a constant factor from the information-theoretic optimum for all values of the problem parameters. Expand
...
1
2
3
...