Optimization of caching devices with geometric constraints

Konstantin Avrachenkov, Xinwei Bai, Jasper Goseling

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)
23 Downloads (Pure)


It has been recently advocated that in large communication systems it is beneficial both for the users and for the network as a whole to store content closer to users. One particular implementation of such an approach is to co-locate caches with wireless base stations. In this paper we study geographically distributed caching of a fixed collection of files. We model cache placement with the help of stochastic geometry and optimize the allocation of storage capacity among files in order to minimize the cache miss probability. We consider both per cache capacity constraints as well as an average capacity constraint over all caches. The case of per cache capacity constraints can be efficiently solved using dynamic programming, whereas the case of the average constraint leads to a convex optimization problem. We demonstrate that the average constraint leads to significantly smaller cache miss probability. Finally, we suggest a simple LRU-based policy for geographically distributed caching and show that its performance is close to the optimal.
Original languageEnglish
Pages (from-to)68-82
JournalPerformance evaluation
Publication statusPublished - 15 May 2017


  • Caching
  • Wireless networks
  • Stochastic geometry
  • 2023 OA procedure


Dive into the research topics of 'Optimization of caching devices with geometric constraints'. Together they form a unique fingerprint.

Cite this