Similarity Caching: Theory and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Similarity Caching: Theory and Algorithms

Abstract

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
report.pdf (547.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02411268 , version 1 (14-12-2019)
hal-02411268 , version 2 (23-01-2020)

Identifiers

  • HAL Id : hal-02411268 , version 2

Cite

Michele Garetto, Emilio Leonardi, Giovanni Neglia. Similarity Caching: Theory and Algorithms. IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, Apr 2020, Beijing, China. ⟨hal-02411268v2⟩
243 View
364 Download

Share

Gmail Facebook X LinkedIn More