Abstract

Caching has been recognized as one of the most important techniques to reduce Internet bandwidth in the WWW. Different caching algorithms have been developed to achieve this task. These caching algorithms have been developed for specific contexts and show different performance values depending on their application domains. This is caused by the fact that each caching algorithm rates document characteristics more important than others. In this paper we compare the performance of well-known caching strategies with respect to different document types. For this purpose, we use trace-driven simulation and consider the resulting hit rates as well as the byte hit rates for different extracted traces.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call