11 citations · 11 across the 1 of their papers we have counts for
3 papers
math.PR2015
Cache Miss Estimation for Non-Stationary Request Processes
Felipe Olmos, Carl Graham, Alain Simonian
The aim of the paper is to evaluate the miss probability of a Least Recently Used (LRU) cache, when it is offered a non-stationary request process given by a Poisson cluster point…
cs.NI2015
An Inverse Problem Approach for Content Popularity Estimation
Felipe Olmos, Bruno Kauffmann
The Internet increasingly focuses on content, as exemplified by the now popular Information Centric Networking paradigm. This means, in particular, that estimating content populari…
cs.NI2014★ 11 cited
Catalog Dynamics: Impact of Content Publishing and Perishing on the Performance of a LRU Cache
Felipe Olmos, Bruno Kauffmann, Alain Simonian +1
The Internet heavily relies on Content Distribution Networks and transparent caches to cope with the ever-increasing traffic demand of users. Content, however, is essentially versa…