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

Abstract : 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 paper 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 [1] 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-01956307
Contributor : Giovanni Neglia <>
Submitted on : Saturday, December 15, 2018 - 12:47:49 PM
Last modification on : Tuesday, December 18, 2018 - 1:23:14 AM
Long-term archiving on : Saturday, March 16, 2019 - 1:43:49 PM

File

1804.01895(2).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01956307, version 1

Collections

Citation

Emilio Leonardi, Giovanni Neglia. Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles. IEEE Journal on Selected Areas in Communications, Institute of Electrical and Electronics Engineers, 2018, 36 (6), pp.1276-1285. ⟨hal-01956307⟩

Share

Metrics

Record views

57

Files downloads

160