The Measured Access Characteristics of World-Wide-Web Client Proxy Caches Bradley M. Duska, David Marwood, and Michael J. Feeley Department of Computer.

Slides:



Advertisements
Similar presentations
Very simple to create with each dot representing a data value. Best for non continuous data but can be made for and quantitative data 2004 US Womens Soccer.
Advertisements

Connective Fault Tolerance in Multiple-Bus System Hung-Kuei Ku and John P. Hayes IEEE Transactions on parallel and distributed System, VOL. 8, NO. 6, June.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Stem and Leaf Display Stem and Leaf displays are an “in between” a table and a graph – They contain two columns: – The left column contains the first digit.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
An Analysis of Internet Content Delivery Systems Stefan Saroiu, Krishna P. Gommadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy Proceedings of.
Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
Web Caching Robert Grimm New York University. Before We Get Started  Interoperability testing  Type theory 101.
Towards a Better Understanding of Web Resources and Server Responses for Improved Caching Craig E. Wills and Mikhail Mikhailov Computer Science Department.
Internet Cache Pollution Attacks and Countermeasures Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, and Yan Chen Electrical Engineering and Computer Science.
Frequency Distributions Chapter 3 Homework: 1, 2, 3, 12.
Differentiated Multimedia Web Services Using Quality Aware Transcoding S. Chandra, C.Schlatter Ellis and A.Vahdat InfoCom 2000, IEEE Journal on Selected.
Web Caching Robert Grimm New York University. Before We Get Started  Illustrating Results  Type Theory 101.
Proxy Caching the Estimates Page Load Delays Roland P. Wooster and Marc Abrams Network Research Group, Computer Science Department, Virginia Tech 元智大學.
A Case for Delay-conscious Caching of Web Documents Peter Scheuermann, Junho Shim, Radek Vingralek Department of Electrical and Computer Engineering Northwestern.
1Bloom Filters Lookup questions: Does item “ x ” exist in a set or multiset? Data set may be very big or expensive to access. Filter lookup questions with.
A Simulation Study of the PWM Strategy for Inverters
Web Caching Schemes For The Internet – cont. By Jia Wang.
Evaluating Content Management Techniques for Web Proxy Caches Martin Arlitt, Ludmila Cherkasova, John Dilley, Rich Friedrich and Tai Jin Hewlett-Packard.
The Medusa Proxy A Tool For Exploring User- Perceived Web Performance Mimika Koletsou and Geoffrey M. Voelker University of California, San Diego Proceeding.
Chapter 2 CREATING AND USING FREQUENCY DISTRIBUTIONS.
1 Copyright © 2011, Elsevier Inc. All rights Reserved. Appendix B Authors: John Hennessy & David Patterson.
Web Caching and Content Delivery. Caching for a Better Web Performance is a major concern in the Web Proxy caching is the most widely used method to improve.
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
© 2005 The McGraw-Hill Companies, Inc., All Rights Reserved. Chapter 12 Describing Data.
ITEC6310 Research Methods in Information Technology Instructor: Prof. Z. Yang Course Website: c6310.htm Office:
1 Chapter 6: Proxy Server in Internet and Intranet Designs Designs That Include Proxy Server Essential Proxy Server Design Concepts Data Protection in.
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
Have out your calculator and your notes! The four C’s: Clear, Concise, Complete, Context.
Chapter 2 Frequency Distributions
Web Caching and Content Distribution: A View From the Interior Syam Gadde Jeff Chase Duke University Michael Rabinovich AT&T Labs - Research.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Categorical vs. Quantitative…
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Section 2-2 Frequency Distributions.
ICP and the Squid Web Cache Duanc Wessels k Claffy August 13, 1997 元智大學系統實驗室 宮春富 2000/01/26.
Histograms Lecture 14 Sec Tue, Sep 26, 2006.
Statistics : Statistical Inference Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University 1.
Intelligent Space 國立台灣大學資訊工程研究所 智慧型空間實驗室 Service Behavior Consistency in the OSGi Platform Authors Y.Qin, H.Hao,L.Jun, G.Jidong and L.Jian Proceedings.
Central Tendency & Dispersion
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Computer Science Lecture 14, page 1 CS677: Distributed OS Last Class: Concurrency Control Concurrency control –Two phase locks –Time stamps Intro to Replication.
On The Cooperation of Web Clients and Proxy Caches Yiu Fai Sit, Francis C.M. Lau, Cho-Li Wang Department of Computer Science The University of Hong Kong.
The LSAM Proxy Cache - a Multicast Distributed Virtual Cache Joe Touch USC / Information Sciences Institute 元智大學 資訊工程研究所 系統實驗室 陳桂慧
CFTP - A Caching FTP Server Mark Russell and Tim Hopkins Computing Laboratory University of Kent Canterbury, CT2 7NF Kent, UK 元智大學 資訊工程研究所 系統實驗室 陳桂慧.
Hot Systems, Volkmar Uhlig
A Flexible Interleaved Memory Design for Generalized Low Conflict Memory Access Laurence S.Kaplan BBN Advanced Computers Inc. Cambridge,MA Distributed.
Ad insertion at proxies to improve cache hit rates Amit Gupta and Geoffrey baehr, Sun Microsystems Laboratories 901 San Antonio Road Palo Alto,CA
Cache Digest Alex Rousskov Duane Wessels National Laboratory for Applied Network Research April 17, 1998 元智大學 資訊工程研究所 系統實驗室 陳桂慧 February 9, 1999.
Copyright © Cengage Learning. All rights reserved. 5 Joint Probability Distributions and Random Samples.
Statistical Fundamentals: Using Microsoft Excel for Univariate and Bivariate Analysis Alfred P. Rovai Charts Overview PowerPoint Prepared by Alfred P.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
Improving the WWW: Caching or Multicast? Pablo RodriguezErnst W. BiersackKeith W. Ross Institut EURECOM 2229, route des Cretes. BP , Sophia Antipolis.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Chapter 2 Frequency Distributions PowerPoint Lecture Slides Essentials of Statistics for the Behavioral Sciences Seventh Edition by Frederick J Gravetter.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
A large-scale study of the evolution of Web pages D. Fetterly, M. Manasse, M. Najork and L. Wiener SPE Vol.34 No.2 pages , Feb Apr
Adaptive Configuration of a Web Caching Hierarchy Pranav A. Desai Jaspal Subhlok Presented by: Pranav A. Desai.
Memory Hierarchy Ideal memory is fast, large, and inexpensive
Load Weighting and Priority
Copyright © 2011, Elsevier Inc. All rights Reserved.
On the Scale and Performance of Cooperative Web Proxy Caching
CHAPTER 7 Sampling Distributions
Web Proxy Caching Model
Lecture 1: Bloom Filters
Displaying the Order in a Group of Numbers Using Tables and Graphs
Presentation transcript:

The Measured Access Characteristics of World-Wide-Web Client Proxy Caches Bradley M. Duska, David Marwood, and Michael J. Feeley Department of Computer Science University of British Columbia 元智大學 資訊工程研究所 系統實驗室 陳桂慧 SPA (Squid Proxy Analysis)

Outline Key issues for cache design Analysis –Cache size and hit rate –Request rate and hit rate –Web cache coherence protocol –Sharing –Implications for cache design Summary

Key Issues for Cache Design Cache size and cache hit rate –what hit rate can we expect how does hit rate depend on the number of clients connected to the cache and how does the number of clients affect cache size Configuration of cache hierarchy –Does a cache hierarchy make sense how many clients should be connected to each level, how many levels should there be, and how should higher-levels of the hierarchy be connected to each other? Cache coherence –causing unnecessary cache misses? Sharing –how much sharing is there; –does sharing increase with the number of clients; and –how does sharing within a group of clients compare to sharing among unrelated clients?

Analysis TraceCollection Period Number of Client ID Request Maximum Simulated Clients Preserved (Millions) Cache Size (GBs) HAN Jun 17 - Jul 7, full period KOR Apr 20 - May 10, full period DEC Aug 29 - Sep 18, ,663 full period unlimited GMCC Jun 4 - Jun 26, full period AU Jun 4 - Jun 24, one day UU May 1 - May 21, full period NLANR Jun 3 - Jun 27, one day Table : Summary of proxy-server access traces.

Cache hit rate for each trace as a function of cache size 44.7% for 14GB 41.1% for 20GB 42.1% for 100GB Cache byte hit rate for each trace as a function of cache size Cache Size and Hit Rate Ideal cache size - 2GB ~ 10GB

Request Rate and Hit Rate Higher request rate causes more sharing and increase the number of hits an object receivers before it expires.

The shape of some of the lines has changed due to the variety in the per-client request rates from different traces. The differences between these two graphs suggest that while client-count information is interesting, request rate is a better metric of cache performance.

Web Cache Coherence Protocols consistency misses unchanged miss is a request for an expired but unmodified cached object. => coherence protocol requires an if-modified-since request to the object's server to verify that the object is still valid and to update its expiry time. changed miss is a request for a cached object that had changed at the Web server. Cache size↑=> capacity miss rate↓, but consistency miss rate↑

Sharing sharing is high and increases with client population and request rate sharing rate is more closely correlated with request rate than hit rate was, e.g. DEC locality hits do not increase with request rate adding a new client to a cache turns some of the misses of other clients into hits but does not change locality hits into shared hits.

Sharing (2) the shared request rate is much higher than the shared hit rate, because not all requests to shared objects are hits. while a very large portion of accesses are to shared objects (71% for DEC), only a small portion of objects are shared (23% for DEC) the ratio of object count ≒ request count, thought the actual sharing is lower for the smaller client populations. the percentage of objects that are requested by multiple clients the percentage of requests that ask for one these shared objects.

Sharing (3) This figure indicates the number of shared requests that hit in the simulated cache. In most cases, roughly half of the requests are hits The remainder of these requests are misses due to –first-time accesses, –consistency misses, –and some capacity misses.

A point on a line indicates the number of objects that are requested by the specified number of hosts. Important features. –most objects are accessed by a small number of hosts; –the distributions appear tail heavy, as has been observed by Cunha et al. –the object-popularity pattern for all traces is similar, though traces with higher reference counts have more widely shared objects, as expected. Histogram showing the distribution of Web object popularity => y-axis : a log-scale of the number of objects => x-axis : the number of hosts that request each object.

This figure graphs the normalized request rate for objects as a function of the number of hosts that share them. A host's per-object request rate is mostly independent of an object's popularity, though very popular objects are requested at a higher rate;

the portion of (requests that ask for shared objects) >> (objects that are shared) we see that this gap widens as we look at sharing across more of the traces a surprisingly large number of requests (16%) ask for objects that are globally shared among all six traces; recall, however, that not all of these requests will be cache hits. Inter-trace sharing among HAN, KOR, GMCC, AU, UU, and NLANR. Shows percent of shared URLs and requests for those URLs for sharing between a given number of six traces.

Inter-trace sharing among HAN, KOR, GMCC, and UU. Divides sharing into –Narrow sharing, objects shared by less than ten distinct hosts –Wide sharing, objects shared by at least ten hosts. Web sharing tends to be bimodal. the one-trace bars on the far left of the figure show that sharing requests are divided almost evenly between narrowly- and widely-shared objects, while there are many more narrowly-shared objects than widely-shared objects. widely-shared objects are also globally shared, while narrowly shared objects are almost exclusively locally shared.

Summary Second-level cache hit rates vary from 24% to 45%; –a higher request rate yields a higher hit rate. –the NLANR third-level cache has a lower hit rate of 19% due to the expected filtering of locality and sharing from the request stream by lower-level caches. Ideal cache sizes ranged from 2 to 10 GBs, –depending on client population size. Using the Squid and CERN cache coherence protocol, –2% to 7% of requests are consistency misses to up-to-date cached objects, requests that would otherwise be hits.

Summary (2) 85% of cache hits are due to sharing between clients. –Sharing hit rates range from 20% to 38%; a higher request rate yields more sharing. Requests for shared objects account for up to 71% of all requests; –but, only 15% to 24% of requested objects are shared –only half of these requests are hits due to first-time requests and consistency misses Sharing is bimodal. –Requests for shared objects are divided evenly between objects that are narrowly shared and those that are shared by many clients; – widely shared objects also tend to be shared by clients from unrelated traces