Corpus ID: 237491887

On the Optimal Load-Memory Tradeoff of Coded Caching for Location-Based Content

  title={On the Optimal Load-Memory Tradeoff of Coded Caching for Location-Based Content},
  author={Kai Wan and Minquan Cheng and Mari Kobayashi and G. Caire},
  • Kai Wan, Minquan Cheng, +1 author G. Caire
  • Published 13 September 2021
  • Computer Science, Mathematics
  • ArXiv
Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen significantly speeds up communication efficiency by transmitting multicast messages simultaneously useful to multiple users, while in the conventional uncoded caching framework, the uncached part of each user’s request is unicasted. Most prior works on coded caching are… Expand
1 Citations

Figures from this paper

Fundamental Limits of Combinatorial Multi-Access Caching
This work identifies the fundamental limits of Multi-Access Coded Caching where each user is connected to multiple caches in a manner that follows a generalized combinatorial topology with a novel information-theoretic converse that establishes the exact optimal performance under the assumption of uncoded placement. Expand


Coded Caching for Multi-level Popularity and Access
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
Cooperative Edge Caching With Location-Based and Popular Contents for Vehicular Networks
An ant colony optimization-based algorithm is devised to solve the problem and achieve a near-optimal solution to the cooperative edge caching scheme, which allows vehicles to fetch one content from multiple caching servers cooperatively. Expand
An Index Coding Approach to Caching With Uncoded Cache Placement
This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. Expand
Coded Caching with Heterogeneous User Profiles
  • Su Wang, B. Peleato
  • Computer Science
  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
This paper proposes and compares the peak rate of three coded caching schemes when the end users can be classified into distinct groups with different distribution of demands, and ignores the similarities between user profiles. Expand
Mobility-Aware Coded Storage and Delivery
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
Fundamental limits of caching
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
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
This work shows that the uncoded optimum file assignment is NP-hard, and develops a greedy strategy that is provably within a factor 2 of the optimum, and provides an efficient algorithm achieving a provably better approximation ratio of 1-1/d d, where d is the maximum number of helpers a user can be connected to. Expand
On Coded Caching for Two Users with Overlapping Demand Sets
This paper provides a complete characterization of the uniform-average-rate capacity when the sets overlap in just one file and shows that such capacity can be achieved with selfish and uncoded prefetching, and provides explicitPrefetching schemes that achieve those capacities. Expand
FemtoCaching: Wireless video content delivery through distributed caching helpers
The theoretical contribution of this paper lies in formalizing the distributed caching problem, showing that this problem is NP-hard, and presenting approximation algorithms that lie within a constant factor of the theoretical optimum. Expand
Optimal Content Prefetching in NDN Vehicle-to-Infrastructure Scenario
This paper shows how one of the ICN architectures, i.e., Named Data Networking (NDN), with content prefetching can maximize the probability that a user retrieves the desired content in a vehicle-to-infrastructure scenario. Expand