Skip to Main content Skip to Navigation
New interface
Reports (Research report)

An approximate analysis of heterogeneous and general cache networks

Abstract : 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].
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Nicaise Eric Choungmo Fofack Connect in order to contact the contributor
Submitted on : Tuesday, April 8, 2014 - 3:07:14 PM
Last modification on : Friday, November 18, 2022 - 9:28:34 AM
Long-term archiving on: : Tuesday, July 8, 2014 - 11:50:25 AM


Files produced by the author(s)


  • HAL Id : hal-00975339, version 1



Nicaise Choungmo Fofack, Don Towsley, Misha Badov, Mostafa Dehghan, Dennis L. Goeckel. An approximate analysis of heterogeneous and general cache networks. [Research Report] RR-8516, Inria. 2014, pp.36. ⟨hal-00975339⟩



Record views


Files downloads