Content placement in networks of similarity caches - Archive ouverte HAL Access content directly
Journal Articles Computer Networks Year : 2021

Content placement in networks of similarity caches

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

Abstract

Similarity caching systems have recently attracted the attention of the scientific community, as they can be profitably used in many application contexts, like multimedia retrieval, advertising, object recognition, recommender systems and online content-match applications. In such systems, a user request for an object , which is not in the cache, can be (partially) satisfied by a similar stored object ’, at the cost of a loss of user utility. In this paper we make a first step into the novel area of similarity caching networks, where requests can be forwarded along a path of caches to get the best efficiency–accuracy tradeoff. The offline problem of content placement can be easily shown to be NP-hard, while different polynomial algorithms can be devised to approach the optimal solution in discrete cases. As the content space grows large, we propose a continuous problem formulation whose solution exhibits a simple structure in a class of tree topologies. We verify our findings using synthetic and realistic request traces.
Fichier principal
Vignette du fichier
comnet_preprint.pdf (8.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

Michele Garetto, Emilio Leonardi, Giovanni Neglia. Content placement in networks of similarity caches. Computer Networks, 2021, 201, pp.108570. ⟨10.1016/j.comnet.2021.108570⟩. ⟨hal-03499870⟩
49 View
25 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More