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 contributionOther research output

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

Fingerprint

World Wide Web

Keywords

  • IR-46038
  • METIS-213933

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
Khayari el Abdouni, Rachid ; Sadre, R. ; Haverkort, Boudewijn R.H.M. ; Kemper, P. (Editor) ; Sanders, W.H. (Editor). / A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings. 2003. Illinois, USA. 18 p.
@misc{b196acc842ab4d5b97afbd22e3a92ca5,
title = "A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings",
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.",
keywords = "IR-46038, METIS-213933",
author = "{Khayari el Abdouni}, Rachid and R. Sadre and Haverkort, {Boudewijn R.H.M.} and P. Kemper and W.H. Sanders",
year = "2003",
month = "9",
day = "2",
doi = "10.1007/b12028",
language = "English",
isbn = "3-540-40814-2",
type = "Other",

}

Khayari el Abdouni, R, Sadre, R, Haverkort, BRHM, Kemper, P (ed.) & Sanders, WH (ed.) 2003, A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings. Illinois, USA. https://doi.org/10.1007/b12028

A Class-Based Least-Recently-Used Caching Algorithm for WWW Proxies Proceedings. / Khayari el Abdouni, Rachid; Sadre, R.; Haverkort, Boudewijn R.H.M.; Kemper, P. (Editor); Sanders, W.H. (Editor).

18 p. Illinois, USA. 2003, .

Research output: Other contributionOther research output

TY - GEN

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

AU - Khayari el Abdouni, Rachid

AU - Sadre, R.

AU - Haverkort, Boudewijn R.H.M.

A2 - Kemper, P.

A2 - Sanders, W.H.

PY - 2003/9/2

Y1 - 2003/9/2

N2 - 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.

AB - 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.

KW - IR-46038

KW - METIS-213933

U2 - 10.1007/b12028

DO - 10.1007/b12028

M3 - Other contribution

SN - 3-540-40814-2

CY - Illinois, USA

ER -