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

Rachid Khayari el Abdouni, R. Sadre, Boudewijn R.H.M. Haverkort

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    40 Downloads (Pure)


    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 languageUndefined
    Title of host publication13th Intl. Conference on Modelling Techniques and Tools for Computer Performance Evaluation
    EditorsP. Kemper, W.H. Sanders
    Place of PublicationIllinois, USA
    Number of pages18
    Publication statusPublished - 2 Sep 2003

    Publication series

    NameLecture Notes in Computer Science 2794
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    • IR-46038
    • METIS-213933

    Cite this