Cache Policies for Linear Utility Maximization

Abstract : Cache policies to minimize the content retrieval cost have been studied through competitive analysis when the miss costs are additive and the sequence of content requests is arbitrary. More recently, a cache utility maximization problem has been introduced, where contents have stationary popular-ities and utilities are strictly concave in the hit rates. This paper bridges the two formulations, considering linear costs and content popularities. We show that minimizing the retrieval cost corresponds to solving an online knapsack problem, and we propose new dynamic policies inspired by simulated an-nealing, including DYNQLRU, a variant of QLRU. We prove that DYNQLRUasymptotic converges to the optimum under the characteristic time approximation. In a real scenario, popularities vary over time and their estimation is very difficult. DYNQLRU does not require popularity estimation, and our realistic, trace-driven evaluation shows that it significantly outperforms state-of-the-art policies, with up to 45% cost reduction.
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/hal-01956319
Contributor : Giovanni Neglia <>
Submitted on : Saturday, December 15, 2018 - 1:23:11 PM
Last modification on : Tuesday, December 18, 2018 - 10:10:22 AM
Long-term archiving on : Saturday, March 16, 2019 - 1:57:16 PM

File

neglia18ton(4).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01956319, version 1

Collections

Citation

Giovanni Neglia, Damiano Carra, Pietro Michiardi. Cache Policies for Linear Utility Maximization. IEEE/ACM Transactions on Networking, IEEE/ACM, 2018, 26 (1), pp.302-313. ⟨hal-01956319⟩

Share

Metrics

Record views

59

Files downloads

130