Cache “Less for More” in Information-Centric Networks

Abstract : Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received widespread research interest. In one of the key relevant proposals known as Networking Named Content (NNC), the premise is that leveraging in-network caching to store content in every node it traverses along the delivery path can enhance content delivery. We question such indiscriminate universal caching strategy and investigate whether caching less can actually achieve more. Specifically, we investigate if caching only in a subset of node(s) along the content delivery path can achieve better performance in terms of cache and server hit rates. In this paper, we first study the behavior of NNC’s ubiquitous caching and observe that even naïve random caching at one intermediate node within the delivery path can achieve similar and, under certain conditions, even better caching gain. We propose a centrality-based caching algorithm by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy. Our results suggest that our solution can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.
Type de document :
Communication dans un congrès
Robert Bestak; Lukas Kencl; Li Erran Li; Joerg Widmer; Hao Yin. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. Springer, Lecture Notes in Computer Science, LNCS-7289 (Part I), pp.27-40, 2012, NETWORKING 2012. 〈10.1007/978-3-642-30045-5_3〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01531117
Contributeur : Hal Ifip <>
Soumis le : jeudi 1 juin 2017 - 11:34:53
Dernière modification le : jeudi 1 juin 2017 - 15:00:58
Document(s) archivé(s) le : mercredi 6 septembre 2017 - 18:57:09

Fichier

978-3-642-30045-5_3_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Wei Chai, Diliang He, Ioannis Psaras, George Pavlou. Cache “Less for More” in Information-Centric Networks. Robert Bestak; Lukas Kencl; Li Erran Li; Joerg Widmer; Hao Yin. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. Springer, Lecture Notes in Computer Science, LNCS-7289 (Part I), pp.27-40, 2012, NETWORKING 2012. 〈10.1007/978-3-642-30045-5_3〉. 〈hal-01531117〉

Partager

Métriques

Consultations de la notice

41

Téléchargements de fichiers

73