A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings

Rachid Khayari el Abdouni, R. Sadre, Boudewijn R.H.M. Haverkort, P. Kemper (Editor), W.H. Sanders (Editor)

Research output: Other contribution

Abstract

In this paper we study and analyze the in uence of caching stategies on the performance of WWW proxies. We propose a new strategy called class-based LRU that works recency-based as well as size-based, with the ultimate aim to obtain a well-balanced mixture between large and small documents in the cache, and hence, good performance for both small and large object requests. We show that for class-based LRU good results are obtained for both the hit rate and the byte hit rate, if the size of the classes and the corresponding document size ranges are well choosen. The latter is achieved by using a Bayesian decision rule and a characterisation of the requested object-size distribution using the EM-algorithm. Furthermore, the overhead to implement class-based LRU is comparable to that of LRU and does not depend on the number of cached objects.
Original languageEnglish
Number of pages18
Place of PublicationIllinois, USA
DOIs
Publication statusPublished - 2 Sep 2003
Externally publishedYes

Keywords

  • IR-46038
  • METIS-213933

Fingerprint Dive into the research topics of 'A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings'. Together they form a unique fingerprint.

  • Cite this

    Khayari el Abdouni, R., Sadre, R., Haverkort, B. R. H. M., Kemper, P. (Ed.), & Sanders, W. H. (Ed.) (2003, Sep 2). A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings. Illinois, USA. https://doi.org/10.1007/b12028