ACM Home Page
Please provide us with feedback. Feedback
A performance investigation of web caching architectures
Full text PdfPdf (205 KB)
Source C3S2E; Vol. 290 archive
Proceedings of the 2008 C3S2E conference table of contents
Montreal, Quebec, Canada
SESSION: Distributed computing table of contents
Pages 205-213  
Year of Publication: 2008
ISBN:978-1-60558-101-9
Authors
R. T. Hurley  Trent University, Peterborough, ON Canada
B. Y. Li  Land Software Engineering Centre, Ottawa, ON, Canada
Sponsors
: ACM International Conference Proceedings Series
Concordia University : Concordia University
: BytePress
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 87,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1370256.1370291
What is a DOI?

ABSTRACT

Web caching has been recognized as an effective approach to improve performance by storing frequently-accessed documents from originating servers at storage sites "closer" to requesting clients in order to reduce the load on the network bandwidth which in turn can reduce user response time. In this paper, we examine the performance of various architectures for cache cooperation in a web environment. The architectures under consideration include: distributed, hierarchical, and a hybrid of the two. A hierarchical web caching architecture utilizes a series of caches placed at different levels of the network (i.e. client, institutional, regional, and national) and user requests are satisfied at the lowest level possible (the first one that stores the desired document). Distributed web caching incorporates multiple cooperating caches all at the same level. The hybrid approach chosen in this paper contains a hierarchy of distributed caches in the hopes of exploiting advantages from both distributed and hierarchical caching. Using simulation as the tool, we compare the performance (mean response time, overall cache hit rates) of these architectures under a variety of different scenarios in an attempt to identify the conditions under which each is beneficial.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Hurley, R. T., W. Feng, and B. Y. Li, "An Analytical Comparison of Distributed and Hierarchical Web-Caching Architectures", Proceedings of the ISCA 18th International Conference on Computers and Their Applications, pp. 291--295, Honolulu, Hawaii, USA (March 26--28, 2003).
 
3
 
4
 
5
 
6
V. Valloppillil and K. W. Ross, "Cache Array Routing Protocol v1.0", http://ds.internic.neet/internet-drafts/draft-vinod-carp-v1-03.txt
 
7
D. Povey and J. Harrison, "A Distributed Internet Cache", Proceedings of the 20th Australian Computer Science Conference, February 1997.
8
 
9
A. Rousskov and D. Wessels, "Cache Digest", Proceedings of 3rd International WWW Caching Workshop, June 1998.
 
10
 
11
Hurley, R. T. and W. Feng, "The Adverse Effects of Large Files in a File Migration System", Proceedings of the 17th International Conference on Computers and Their Applications", pp. 192--197, San Francisco, CA, USA (Apr. 6--8, 2002).
12
 
13
B. Li, "An Investigation of Partition Caching in the World Wide Web", Master's Thesis, Trent University, 2002.