The recent evolution of the Internet towards ``Information-centric'' transfer modes has renewed the interest in characterizing multi-cache systems, in which requests not satisfied by a cache are forwarded to other caches. In this work, we characterize the traffic statistics of the output (miss) stream, via a simple but accurate approximate analysis for LRU caches feeded by general ``renewal'' traffic patterns. In turn, we exploit such output stream traffic pattern to analyze the performance of the subsequent cache stage, and so on. The computational efficiency of our model, joint with its ability to handle traffic patterns beyond the traditional independent reference model, permits simple and tractable assessment of cache hierarchies
Concerns regarding the scalability of the inter-domain routing have encouraged researchers to start ...
The need to distribute massive quantities of multimedia content to multiple users has increased trem...
International audienceThe modeling and analysis of an LRU cache is extremely challenging as exact re...
The recent evolution of the Internet towards ``Information-centric'' transfer modes has renewed the ...
Abstract—The Internet heavily relies on Content Distribution Networks and transparent caches to cope...
In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cac...
Least Recently Used (LRU) is a very popular caching replacement policy. It is very easy to implement...
In many networked applications, independent caching agents cooperate by servicing each other's miss ...
Abstract — In many networked applications, independent caching agents cooperate by servicing each ot...
International audienceComputer system and network performance can be significantly improved by cachi...
We present a method to extract a time series (Number of Active Requests (NAR)) from web cache logs w...
Concerns regarding the scalability of the interdomain routing have encouraged researchers to start e...
International audienceComputer system and network performance can be significantly improved by cachi...
International audienceFor applications in worst-case execution time analysis and in security, it is ...
Concerns regarding the scalability of the inter-domain routing have encouraged researchers to start ...
The need to distribute massive quantities of multimedia content to multiple users has increased trem...
International audienceThe modeling and analysis of an LRU cache is extremely challenging as exact re...
The recent evolution of the Internet towards ``Information-centric'' transfer modes has renewed the ...
Abstract—The Internet heavily relies on Content Distribution Networks and transparent caches to cope...
In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cac...
Least Recently Used (LRU) is a very popular caching replacement policy. It is very easy to implement...
In many networked applications, independent caching agents cooperate by servicing each other's miss ...
Abstract — In many networked applications, independent caching agents cooperate by servicing each ot...
International audienceComputer system and network performance can be significantly improved by cachi...
We present a method to extract a time series (Number of Active Requests (NAR)) from web cache logs w...
Concerns regarding the scalability of the interdomain routing have encouraged researchers to start e...
International audienceComputer system and network performance can be significantly improved by cachi...
International audienceFor applications in worst-case execution time analysis and in security, it is ...
Concerns regarding the scalability of the inter-domain routing have encouraged researchers to start ...
The need to distribute massive quantities of multimedia content to multiple users has increased trem...
International audienceThe modeling and analysis of an LRU cache is extremely challenging as exact re...