Similarity Caching: Theory and Algorithms - Archive ouverte HAL Access content directly
Journal Articles IEEE/ACM Transactions on Networking Year : 2021

Similarity Caching: Theory and Algorithms

(1) , (2) , (3)


This paper focuses on similarity caching systems, in which a user request for an object o that is not in the cache can be (partially) satisfied by a similar stored object o', at the cost of a loss of user utility. Similarity caching systems can be effectively employed in several application areas, like multimedia retrieval, recommender systems, genome study, and machine learning training/serving. However, despite their relevance, the behavior of such systems is far from being well understood. In this paper, we provide a first comprehensive analysis of similarity caching in the offline, adversarial, and stochastic settings. We show that similarity caching raises significant new challenges, for which we propose the first dynamic policies with some optimality guarantees. We evaluate the performance of our schemes under both synthetic and real request traces.
Fichier principal
Vignette du fichier
1912.03888 (1).pdf (712.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03498773 , version 1 (21-12-2021)



Giovanni Neglia, Michele Garetto, Emilio Leonardi. Similarity Caching: Theory and Algorithms. IEEE/ACM Transactions on Networking, 2021, pp.1-12. ⟨10.1109/TNET.2021.3126368⟩. ⟨hal-03498773⟩
64 View
50 Download



Gmail Facebook Twitter LinkedIn More