Catalog Dynamics: Impact of Content Publishing and Perishing on the Performance of a LRU Cache
| Autor: | Yannick Carlinet, Felipe Olmos, Bruno Kauffmann, Alain Simonian |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
FOS: Computer and information sciences
60 62P30 C.4 Computer science G.3 Computer Science - Networking and Internet Architecture FOS: Mathematics C.2 D.2.8 Cache algorithms TRACE (psycholinguistics) Networking and Internet Architecture (cs.NI) Computer Science - Performance SIMPLE (military communications protocol) business.industry Orange (software) Probability (math.PR) Process (computing) Performance (cs.PF) Publishing Content (measure theory) The Internet business Mathematics - Probability Computer network |
| Zdroj: | International Teletraffic Congress |
| DOI: | 10.48550/arxiv.1403.5479 |
| Popis: | 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. Comment: 13 Pages, 9 figures. Full version of the article submitted to the ITC 2014 conference. Small corrections in the appendix from the previous version |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|