Optimization of Caching Devices with Geometric Constraints

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.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01671840
Contributor : Konstantin Avrachenkov <>
Submitted on : Thursday, January 4, 2018 - 2:49:53 PM
Last modification on : Thursday, January 11, 2018 - 5:04:41 PM
Long-term archiving on : Thursday, May 3, 2018 - 8:24:04 AM

File

R1_PEVA-D-16-00025.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

270

Files downloads

174