On the Performance of General Cache Networks

Abstract : The performance evaluation of cache networks has gain a huge attention due to content-oriented delivery technologies. If general network topologies are more realistic than hierarchical networks widely studied in the literature, their analysis is significantly challenging. Existing models mainly focus on trees where content custodians are located at the root and the one-way child-to-parent request forwarding schema is common. In this paper, we consider complex and irregular networks where requests may flow possibly in opposite directions from/to several sources/destinations. Moreover , we assume that caches may run one of Time-To-Live (TTL)-based policies recently introduced for content-centric networks and modern Domain Name System [5]. We then derive an analytical framework and a polynomial-time algorithm that approximate accurately performance metrics of arbitrary graph-based and heterogeneous TTL-based cache networks. Simulations show that our simplified methodology may accurately predict metrics of interest on networks of caches running popular replacement algorithms (e.g. LRU, FIFO, or Random) without restricting its scope of application to this interesting use case. Unlike existing approaches, ours scales as network and content catalog sizes increase.
Type de document :
Communication dans un congrès
ValueTools , Dec 2014, Bratislava, Slovakia
Liste complète des métadonnées

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

Contributeur : Philippe Nain <>
Soumis le : mercredi 10 février 2016 - 22:14:33
Dernière modification le : vendredi 20 mai 2016 - 16:35:33
Document(s) archivé(s) le : samedi 12 novembre 2016 - 17:05:58


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01272503, version 1


Nicaise Choungmo Fofack, M Dehghan, D Towsley, M Badov, Dennis L. Goeckel. On the Performance of General Cache Networks. ValueTools , Dec 2014, Bratislava, Slovakia. 〈hal-01272503〉



Consultations de la notice


Téléchargements de fichiers