Optimal Geographic Caching in Cellular Networks with Linear Content Coding

Jocelyne Elias 1, 2 Bartłomiej Błaszczyszyn 1
1 DYOGENE - Dynamics of Geometric Networks
Inria de Paris, CNRS - Centre National de la Recherche Scientifique : UMR 8548, DI-ENS - Département d'informatique de l'École normale supérieure
Abstract : We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a special form monotone sub-modular set function maximization. Using dynamic programming, we find a deterministic solving the problem. We also consider two natural greedy caching policies. We evaluate our policies considering two popular stochastic geometric coverage models: the Boolean one and the Signal-to-Interference-and-Noise-Ratio one, assuming Zipf popularity distribution. Our numerical results show that the proposed deterministic policies are in general not worst than some randomized policy considered in the literature and can further improve the total hit probability in the moderately high coverage regime.
Complete list of metadatas

https://hal.inria.fr/hal-01505881
Contributor : Bartlomiej Blaszczyszyn <>
Submitted on : Tuesday, April 11, 2017 - 9:27:01 PM
Last modification on : Thursday, April 11, 2019 - 4:02:18 PM

Identifiers

  • HAL Id : hal-01505881, version 1

Collections

Citation

Jocelyne Elias, Bartłomiej Błaszczyszyn. Optimal Geographic Caching in Cellular Networks with Linear Content Coding. CCDWN 2017 : 2nd Content Caching and Delivery in Wireless Networks Workshop (co-located with WiOpt 2017), May 2017, Paris, France. ⟨hal-01505881⟩

Share

Metrics

Record views

329