Fast and Efficient Web Caching Methods Regarding the Size and Performance Measures per Data Object
| Autor: | Frank Hasslinger, Konstantinos Ntougias, Oliver Hohlfeld, Gerhard Hasslinger |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Hardware_MEMORYSTRUCTURES
business.industry Computer science Quality of service Byte 020206 networking & telecommunications Throughput 02 engineering and technology Object (computer science) Knapsack problem 0202 electrical engineering electronic engineering information engineering Overhead (computing) Paging 020201 artificial intelligence & image processing Cache business Computer network |
| Zdroj: | CAMAD |
| DOI: | 10.1109/camad.2019.8858459 |
| Popis: | Caching methods are developed since 50 years for paging in CPU and database systems, and since 25 years for web caching as main application areas among others. Pages of unique size are usual in CPU caches, whereas web caches are storing data chunks of different size in a widely varying range. We study the impact of different object sizes on the performance and the overhead of web caching. This entails different caching goals, starting from the byte and object hit ratio to a generalized value hit ratio for optimized costs and benefits of caching regarding traffic engineering (TE), reduced delays and other QoS measures. The selection of the cache contents turns out to be crucial for the web cache efficiency with awareness of the size and other properties in a score for each object. We introduce a new class of rank exchange caching methods and show how their performance compares to other strategies with extensions needed to include the size and scores for QoS and TE caching goals. Finally, we derive bounds on the object, byte and value hit ratio for the independent request model (IRM) based on optimum knapsack solutions of the cache content. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|