2014/03/21 by Felipe Olmos, Olmos, Felipe, Bruno Kauffmann +6
Computer Science · Mathematics · #60 #62P30 #C.2 #C.4 #Caching and Content Delivery #D.2.8 #FOS: Computer and information sciences #FOS: Mathematics #G.3 #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Peer-to-Peer Network Technologies #Performance (cs.PF) #Probability (math.PR) #acm:60 #acm:62P30 #cs.NI #cs.PF #math.PR #msc:60 #msc:62P30
paper · pdf · doi:10.48550/arxiv.1403.5479
13 Pages, 9 figures. Full version of the article submitted to the ITC 2014 conference. Small corrections in the appendix from the previous version
openalex publication_date 2014/03/21 · arxiv created 2014/09/11 · arxiv updated 2014/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 versatile: once published at a given time, its popularity vanishes over time. All requests for a given document are then concentrated between the publishing time and an effective perishing time. In this paper, we propose a new model for the arrival of content requests, which takes into account the dynamical nature of the content catalog. Based on two large traffic traces collected on the Orange network, we use the semi-experimental method and determine invariants of the content request process. This allows us to define a simple mathematical model for content requests; by extending the so-called "Che approximation", we then compute the performance of a LRU cache fed with such a request process, expressed by its hit ratio. We numerically validate the good accuracy of our model by comparison to trace-based simulation.