research-article

Caching on the World Wide Web

Authors:

Charu Aggarwal,

Philip S. YuAuthors Info & Claims

IEEE Transactions on Knowledge and Data Engineering, Volume 11, Issue 1

Pages 94 - 107

https://doi.org/10.1109/69.755618

Published: 01 January 1999 Publication History

Abstract

With the recent explosion in usage of the World Wide Web, the problem of caching Web objects has gained considerable importance. Caching on the Web differs from traditional caching in several ways. The nonhomogeneity of the object sizes is probably the most important such difference. In this paper, we give an overview of caching policies designed specifically for Web objects and provide a new algorithm of our own. This new algorithm can be regarded as a generalization of the standard LRU algorithm. We examine the performance of this and other Web caching algorithms via event- and trace-driven simulation.

References

[1]

M. Abrams C. Standridge G. Abdulla S. Williams and E. Fox, "Caching Proxies: Limitations and Potentials," Proc. Fourth Int'l World Wide Web Conf., Boston, 1995.

[2]

M. Abrams S. Williams G. Abdulla S. Patel R. Ribler and E.A. Fox, "Multimedia Traffic Analysis Using CHITRA95," Multimedia, pp. 267-276, 1995.

Digital Library

[3]

C.C. Aggarwal J.L. Wolf P.S. Yu and M. Epelman, "On Caching Policies for Web Objects," IBM Research Report, 1997.

[4]

R.K. Ahuja T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, N.J.: Prentice Hall, 1993.

Digital Library

[5]

M.F. Arlitt, "A Performance Study of Internet Web Servers," master's thesis, Computer Science Dept., Univ. of Saskatchewan, Saskatoon, Saskatchewan, Canada, May 1996.

[6]

M.F. Arlitt and C.L. Williamson, "Web Server Workload Characterization: The Search for Invariants," Proc. ACM SIGMETRICS, Philadelphia, Apr. 1996.

Digital Library

[7]

J.-C. Bolot and P. Hoschka, "Performance Engineering of the zWorld Wide Web," WWW J., vol. 1, no. 3, pp. 185-195, Summer 1996.

[8]

H. Braun and K. Claffy, "Web Traffic Characterization: An Assessment of the Impact of Caching Documents from NCSA's Web Server," Proc. Second Int'l World Wide Web Conf., Chicago, 1994.

[9]

S.J. Caughey D.B. Ingham and M.C. Little, "Flexible Open Caching for the Web," Proc. Sixth Int'l World Wide Web Conf., 1998.

Digital Library

[10]

A. Chankhunthod P.B. Danzig C. Neerdaels M.F. Schwartz and K.J. Worrell, "A Hierarchical Internet Object Cache," Technical Report 95-611, Computer Science Dept., Univ. of Southern California, Los Angeles, 1996.

[11]

G. Copeland W. Alexander E. Boughter and T. Keller, "Data Placement in Bubba," Proc. ACM SIGMOD, pp. 99-108, 1988.

Digital Library

[12]

C.R. Cunha A. Bestavros and M.E. Crovella, "Characteristics of WWW Client-Based Traces," Technical Report TR-95-010, Computer Science Dept., Boston Univ., July 1995.

Digital Library

[13]

P.B. Danzig M.F. Schwarz and R.S. Hall, "A Case for Caching File Objects Outside Internetworks," Proc. ACM SIGCOMM, pp. 239-248, Sept. 1993.

Digital Library

[14]

S. Glassman, "A Caching Relay for the World Wide Web," Proc. First Int'l World Wide Web Conf., Geneva, 1994.

Digital Library

[15]

T. Johnson and D. Shasha, "2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm," Proc. 20th VLDB Conf., Santiago, Chile, 1994.

Digital Library

[16]

D. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading Mass., 1973.

[17]

A. Luotonen and K. Altis, "World Wide Web Proxies," Proc. First Int'l World Wide Web Conf., Geneva, 1994; also in ISDN Systems, vol. 27, no. 2, 1994.

Digital Library

[18]

E. Markatos, "Main Memory Caching of Web Documents," Computer Networks and ISDN Systems, vol. 28, pp. 893-905, 1996.

Digital Library

[19]

R. Malpani J. Lorch and D. Berger, "Making World Wide Web Caching Servers Cooperate," Proc. Fourth Int'l World-Wide Web Conf., pp. 107-117, Boston, 1995.

[20]

E.J. O'Neil P.E. O'Neil and G. Weikum, "The LRU-K Page Replacement Algorithm for Database Disk Buffering," Proc. ACM SIGMOD, Washington, D.C., 1993.

Digital Library

[21]

V.N. Padmanabhan and J.C. Mogul, "Improving HTTP Latency," Computer Networks and ISDN Systems, vol. 28, nos. 1 and 2, pp. 25-35, 1996.

Digital Library

[22]

J. Pitkow and M. Recker, "A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns," GVU Technical Report No. VU-GIT-94-39; also Proc. Second Int'l World Wide Conf., Chicago, 1994.

[23]

P. Scheuermann J. Shim and R. Vingralek, "A Case for Delay-Conscious Caching of Web Documents," Proc. Sixth Int'l World Wide Web Conf., 1998.

Digital Library

[24]

A. Silberschatz and P.B. Galvin, Operating Systems Concepts, fourth ed. Reading, Mass.: Addison-Wesley, 1994.

Digital Library

[25]

N. Smith, "The U.K. National World Wide Web Proxy Cache at HENSA Unix," 1995; URL: http://www.hensa.ac.uk/wwwcache/intro.html.

[26]

S. Williams M. Abrams C.R. Standridge G. Abdulla and E.A. Fox, "Removal Policies in Network Caches for World Wide Web Documents," Proc. ACM SIGCOMM, pp. 293-304, 1996.

Digital Library

[27]

R.P. Wooster and M. Abrams, "Proxy Caching that Estimates Page Load Delays," Proc. Sixth Int'l World Wide Web Conf., 1998.

Digital Library

Cited By

Wang PJiang HLiu YZhao ZZhou KHuang Z(2024)Beyond Belady to Attain a Seemingly Unattainable Byte Miss Ratio for Content Delivery NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.345209635:11(1949-1963)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3452096
Zhao HHan ZYang ZZhang QLi MYang FZhang QLi BYang YQiu LZhang LZhou LFedorova ANarayanan DDi Luna GQuerzoni L(2023)SiloD: A Co-design of Caching and Scheduling for Deep Learning ClustersProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3567499(883-898)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3567499
Chatzopoulos SVergoulis TSkoutas DDalamagas TTryfonopoulos CKarras P(2023)Atrapos: Real-time Evaluation of Metapath Query WorkloadsProceedings of the ACM Web Conference 202310.1145/3543507.3583322(2487-2498)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543507.3583322
Show More Cited By

Index Terms

Caching on the World Wide Web
1. Information systems
  1. Information retrieval
  2. Information storage systems
    1. Storage architectures
      1. Storage network architectures
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Efficient URL caching for world wide web crawling
WWW '03: Proceedings of the 12th international conference on World Wide Web

Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)-(c). However, the size of the web (estimated at over 4 billion pages) and its rate ...
Caching in Web memory hierarchies
SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

Web cache replacement algorithms have received a lot of attention during the past years. Though none of the proposed algorithms deals efficiently with all the particularities of the Web environment, namely, relatively weak temporal locality (due to ...
Caching personalised and database-related dynamic web pages

In recent years, web development is the most important application in internet. Caching related technique improves the web server performance significantly. However, existing caching schemes cannot deal with the dynamic web pages efficiently. Thus, in ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering

IEEE Transactions on Knowledge and Data Engineering Volume 11, Issue 1

January 1999

262 pages

ISSN:1041-4347

Issue’s Table of Contents

Copyright © Copyright © 1999 IEEE. All Rights Reserved.

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 January 1999

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

100
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang PJiang HLiu YZhao ZZhou KHuang Z(2024)Beyond Belady to Attain a Seemingly Unattainable Byte Miss Ratio for Content Delivery NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.345209635:11(1949-1963)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3452096
Zhao HHan ZYang ZZhang QLi MYang FZhang QLi BYang YQiu LZhang LZhou LFedorova ANarayanan DDi Luna GQuerzoni L(2023)SiloD: A Co-design of Caching and Scheduling for Deep Learning ClustersProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3567499(883-898)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3567499
Chatzopoulos SVergoulis TSkoutas DDalamagas TTryfonopoulos CKarras P(2023)Atrapos: Real-time Evaluation of Metapath Query WorkloadsProceedings of the ACM Web Conference 202310.1145/3543507.3583322(2487-2498)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543507.3583322
Mhaisen NIosifidis GLeith D(2023)Online Caching With no Regret: Optimistic Learning via RecommendationsIEEE Transactions on Mobile Computing10.1109/TMC.2023.331794323:5(5949-5965)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1109/TMC.2023.3317943
Liu QZhang Y(2022)Learning to Caching under the Partial-Feedback RegimeProceedings of the 18th International Conference on Network and Service Management10.5555/3581644.3581712(1-9)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.5555/3581644.3581712
Banditwattanawong TMasdisornchote M(2021)On formulation of online algorithm and framework of near-optimally tractable eviction for nonuniform cachesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2020.107332178:COnline publication date: 23-Aug-2021
https://dl.acm.org/doi/10.1016/j.comnet.2020.107332
Song ZBerger DLi KLloyd WBhagwan RPorter G(2020)Learning relaxed Belady for content distribution network cachingProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388281(529-544)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388281
Bhattacharjee RBanerjee SSinha A(2020)Fundamental Limits on the Regret of Online Network-CachingProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33921434:2(1-31)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3392143
Guan YZhang XGuo ZAmsaleg LHuet BLarson MGravier GHung HNgo CTsang Ooi W(2019)CACAProceedings of the 27th ACM International Conference on Multimedia10.1145/3343031.3350890(456-464)Online publication date: 15-Oct-2019
https://dl.acm.org/doi/10.1145/3343031.3350890
Larbi ABouallouche-Medjkoune LAissani D(2018)Improving Cache Effectiveness Based on Cooperative Cache Management in MANETsWireless Personal Communications: An International Journal10.1007/s11277-017-4984-798:3(2497-2519)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s11277-017-4984-7
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents