TTL approximations of the cache replacement algorithms LRU(m) and h-LRU
Authors:
- Nicolas GastNGNicolas Gast
- Benny Van HoudtBHBenny Van Houdt
- 1 December 2017
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 117, 33-57
Abstract
No abstract availableKeywords
Funding Information
- eu (600708)
This publication has 8 references indexed in Scilit:
- LRU Cache under Stationary RequestsACM SIGMETRICS Performance Evaluation Review, 2017
- Exact analysis of TTL cache networksPerformance Evaluation, 2014
- Performance evaluation of hierarchical TTL-based cache networksComputer Networks, 2014
- Check before storingACM SIGCOMM Computer Communication Review, 2013
- A minimal representation of Markov arrival processes and a moments matching methodPerformance Evaluation, 2007
- Least-recently-used caching with dependent requestsTheoretical Computer Science, 2004
- Hierarchical Web caching systems: modeling, design and experimental resultsIEEE Journal on Selected Areas in Communications, 2002
- Asymptotic miss ratios over independent referencesJournal of Computer and System Sciences, 1977