An approximate analysis of heterogeneous and general cache networks

In this paper, we propose approximate models to assess the performance of a cache network with arbitrary topology where nodes run the Least Recently Used (LRU), First-In First-Out (FIFO), or Random (RND) replacement policies on arbitrary size caches. Our model takes advantage of the notions of cache characteristic time and Time-To-Live (TTL)-based cache to develop a unified framework for approximating metrics of interest of interconnected caches. Our approach is validated through event-driven simulations; and when possible, compared to the existing a-NET model [23].

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00975339
Author Choungmo Fofack, Nicaise, Towsley, Don, Badov, Misha, Dehghan, Mostafa, Goeckel, Dennis L.
Maintainer CCSD
Last Updated May 5, 2026, 16:02 (UTC)
Created May 5, 2026, 16:02 (UTC)
Identifier Report N°: RR-8516
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Models for the performance analysis and the control of networks (MAESTRO) ; Centre Inria d'Université Côte d'Azur ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
creator Choungmo Fofack, Nicaise
date 2014-04-05T00:00:00
harvest_object_id 990d42db-a863-4470-8b00-ba31114b88a5
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-08-26T00:00:00
set_spec type:REPORT