Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles

04/05/2018
by   Emilio Leonardi, et al.
0

We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS). In order to optimize the overall performance of the system in such scenario, where a significant fraction of the users is covered by several BSs, a tight coordination among nearby caches is needed. To this end, this pape introduces a class of simple and fully distributed caching policies, which require neither direct communication among BSs, nor a priori knowledge of content popularity. Furthermore, we propose a novel approximate analytical methodology to assess the performance of interacting caches under such policies. Our approach builds upon the well known characteristic time approximation and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios. Both synthetic and trace-driven results show that the our caching policies achieve excellent performance (in some cases provably optimal). They outperform state-of-the-art dynamic policies for interacting caches, and, in some cases, also the greedy content placement, which is known to be the best performing polynomial algorithm under static and perfectly-known content popularity profiles.

READ FULL TEXT
research
12/21/2019

A Swiss Army Knife for Dynamic Caching in Small Cell Networks

We consider a dense cellular network, in which a limited-size cache is a...
research
02/19/2020

Dynamic Coded Caching in Wireless Networks

We consider distributed and dynamic caching of coded content at small ba...
research
10/26/2017

Optimal Geographical Caching in Heterogeneous Cellular Networks with Nonhomogeneous Helpers

We investigate optimal geographical caching in heterogeneous cellular ne...
research
01/14/2021

Cocktail Edge Caching: Ride Dynamic Trends of Content Popularity with Ensemble Learning

Edge caching will play a critical role in facilitating the emerging cont...
research
01/12/2020

The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity

In this paper, we design dynamic probabilistic caching for the scenario ...
research
12/13/2016

Spatial multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps

This article introduces a novel family of decentralised caching policies...
research
05/17/2018

Caching With Time-Varying Popularity Profiles: A Learning-Theoretic Perspective

Content caching at the small-cell base stations (sBSs) in a heterogeneou...

Please sign up or login with your details

Forgot password? Click here to reset