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


Share/Save/Bookmark

Khayari el Abdouni, Rachid and Sadre, Ramin and Haverkort, Boudewijn R. (2002) A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies. In: 13th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools, TOOLS, September 2-5, 2003, Urbana, IL, USA.

[img]
Preview
PDF
350Kb
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.
Item Type:Conference or Workshop Item
Copyright:© 2002 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/46038
Official URL:http://dx.doi.org/10.1007/b12028
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 213933