Reversing The Meaning of Node Connectivity for Content Placement in Networks of Caches - Archive ouverte HAL
Communication Dans Un Congrès Année : 2020

Reversing The Meaning of Node Connectivity for Content Placement in Networks of Caches

Résumé

It is a widely accepted heuristic in content caching to place the most popular content at the nodes that are the best connected. The other common heuristic is somewhat contradictory, as it places the most popular content at the edge, at the caching nodes nearest the users. We contend that neither policy is best suited for caching content in a network and propose a simple alternative that places the most popular content at the least connected node. Namely, we populate content first at the nodes that have the lowest graph centrality over the network topology. Here, we provide an analytical study of this policy over some simple topologies that are tractable, namely regular grids and trees. Our mathematical results demonstrate that placing popular content at the least connected nodes outperforms the aforementioned alternatives in typical conditions.
Fichier principal
Vignette du fichier
preprint_reversing.pdf (475.88 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04137686 , version 1 (30-06-2023)

Identifiants

Citer

Junaid Ahmed Khan, Cedric Westphal, J.J. Garcia-Luna-Aceves, Yacine Ghamri-Doudane. Reversing The Meaning of Node Connectivity for Content Placement in Networks of Caches. 2020 International Conference on Computing, Networking and Communications (ICNC), Feb 2020, Big Island, France. pp.679-685, ⟨10.1109/ICNC47757.2020.9049716⟩. ⟨hal-04137686⟩

Collections

UNIV-ROCHELLE
6 Consultations
122 Téléchargements

Altmetric

Partager

More