Optimization of Caching Devices with Geometric Constraints - Archive ouverte HAL Access content directly
Journal Articles Performance Evaluation Year : 2017

Optimization of Caching Devices with Geometric Constraints

(1) , (2) , (2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
R1_PEVA-D-16-00025.pdf (330.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01671840 , version 1 (04-01-2018)

Identifiers

Cite

Konstantin Avrachenkov, Xinwei Bai, Jasper Goseling. Optimization of Caching Devices with Geometric Constraints. Performance Evaluation, 2017, 113, pp.68 - 82. ⟨10.1016/j.peva.2017.05.001⟩. ⟨hal-01671840⟩
161 View
140 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More