Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Feng, Wenying; * | Chen, Hua
Affiliations: Department of Computing and Information Systems, Department of Mathematics, Trent University, Peterborough, ON, Canada K9J 7B8
Correspondence: [*] Corresponding author. E-mail: wfeng@trentu.ca.
Abstract: In this paper, the adaptive replacement policy and the pre-fetching technique for Web caching systems are studied with two user request models and their combinations. Performance results from two most commonly used replacement policies: LRU (Least Recently Used) and LFU (Least Frequently Used) are compared. It is shown that LRU performs better for one of the user request models and LFU is on the opposite. The adaptive replacement policy is intelligent in finding the best candidate policy as the user access pattern changes. The learning speed of the system is tested by different switch thresholds.
Keywords: LRU, LFU, web caching, threshold, adaptive learning, pre-fetching
DOI: 10.3233/JCM-2009-0243
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 9, no. s2, pp. S149-S157, 2009
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl