Topics: Information and content centric network
Authors: Giovanni Neglia (INRIA Sophia Antipolis Mediterranee, France); Damiano Carra (University of Verona, Italy); Mingdong Feng and Vaishnav Janardhan (Akamai Technologies, USA); Pietro Michiardi (EURECOM, France); Dimitra Tsigkari (Inria Sophia Antipolis Mditerrane, France)
Presenter bio: Damiano Carra received his MSc in Telecommunication Engineering from Politecnico di Milano, and his Ph.D. in Computer Science from University of Trento. He is currently an Assistant Professor in the Computer Science Department at University of Verona. His research interests include modeling and performance evaluation of large distributed systems.
Abstract: Most of the caching algorithms are oblivious to requests' timescale, but
caching systems are capacity constrained and in practical cases the hit
rate may be limited by the cache's impossibility to serve requests fast
enough. In particular the hard-disk access time can be the key factor
capping cache performances.
In this paper, we present a new cache replacement policy that takes
of a hierarchical caching architecture, and in particular of access-time
difference between memory and disk.
Our policy is optimal when requests follow the independent reference
and significantly reduces the hard-disk load, as shown also by our