Evaluating Content Management Technique for Web Proxy Cache M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich and T. Jin 20005166 MinSu Shin.

Slides:



Advertisements
Similar presentations
Cache Replacement Algorithm Outline Exiting document replacement algorithm Squids cache replacement algorithm Ideal Problem.
Advertisements

The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms (ACM SIGMETRIC 05 ) ACM International Conference on Measurement & Modeling.
Cost-Based Cache Replacement and Server Selection for Multimedia Proxy Across Wireless Internet Qian Zhang Zhe Xiang Wenwu Zhu Lixin Gao IEEE Transactions.
A Survey of Web Cache Replacement Strategies Stefan Podlipnig, Laszlo Boszormenyl University Klagenfurt ACM Computing Surveys, December 2003 Presenter:
Bypass and Insertion Algorithms for Exclusive Last-level Caches
Differentiated Multimedia Web Services Using Quality Aware Transcoding Surendar Chandra, Carla Schlatter Ellis and Amin Vahdat Department of Computer Science,
ARC: A SELF-TUNING, LOW OVERHEAD REPLACEMENT CACHE
A KTEC Center of Excellence 1 Cooperative Caching for Chip Multiprocessors Jichuan Chang and Gurindar S. Sohi University of Wisconsin-Madison.
Outperforming LRU with an Adaptive Replacement Cache Algorithm Nimrod megiddo Dharmendra S. Modha IBM Almaden Research Center.
Qinqing Gan Torsten Suel Improved Techniques for Result Caching in Web Search Engines Presenter: Arghyadip ● Konark.
October 15, 2002MASCOTS WebTraff: A GUI for Web Proxy Cache Workload Modeling and Analysis Nayden Markatchev Carey Williamson Department of Computer.
Cache Memory By JIA HUANG. "Computer Science has only three ideas: cache, hash, trash.“ - Greg Ganger, CMU.
Cloud Download : Using Cloud Utilities to Achieve High-quality Content Distribution for Unpopular Videos Yan Huang, Tencent Research, Shanghai, China Zhenhua.
Caching Strategies in Transcoding-Enabled Proxy System for Streaming Media Distribution Networks Bo Shen Sung-Ju Lee Sujoy Basu IEEE Transactions On Multimedia,
What should you Cache? A Global Analysis on YouTube Related Video Caching Dilip Kumar Krishnappa, Michael Zink and Carsten Griwodz NOSSDAV 2013.
Memory System Characterization of Big Data Workloads
1 11 Web Caching Web Protocols and Practice. 2 Topics Web Protocols and Practice WEB CACHING  Cache Definition  Goals of Web Caching  Motivations for.
1 CPSC : Project Brainstorming Session Carey Williamson Department of Computer Science University of Calgary.
Performance Evaluation of Web Proxy Cache Replacement Policies Orit Brimer Ravit krayif Sigal ishay.
1 On Filter Effects in Web Caching Hierarchies Carey Williamson Department of Computer Science University of Calgary.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
1 Simulation Evaluation of a Heterogeneous Web Proxy Caching Hierarchy Mudashiru Busari Carey Williamson University of Saskatchewan University of Calgary.
1 Simultaneous Distribution Control and Privacy Protection for Proxy based Media Distribution George Mason University Songqing Chen (George Mason University)
Web Cache Behavior The Laboratory of Computer Communication and Networking Submitted by: Lena Vardit Liraz
Improving Proxy Cache Performance: Analysis of Three Replacement Policies John Dilley and Martin Arlitt IEEE internet computing volume3 Nov-Dec 1999 Chun-Fu.
Web Caching Robert Grimm New York University. Before We Get Started  Interoperability testing  Type theory 101.
Submitting: Barak Pinhas Gil Fiss Laurent Levy
Internet Cache Pollution Attacks and Countermeasures Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, and Yan Chen Electrical Engineering and Computer Science.
Web Caching Robert Grimm New York University. Before We Get Started  Illustrating Results  Type Theory 101.
A Hybrid Caching Strategy for Streaming Media Files Jussara M. Almeida Derek L. Eager Mary K. Vernon University of Wisconsin-Madison University of Saskatchewan.
Web Caching Schemes For The Internet – cont. By Jia Wang.
Cost-Aware WWW Proxy Caching Algorithms Pei Cao University of Wisconsin-Madison Sandy Irani University of California-Irvine Proceedings of the USENIX Symposium.
Evaluating Content Management Techniques for Web Proxy Caches Martin Arlitt, Ludmila Cherkasova, John Dilley, Rich Friedrich and Tai Jin Hewlett-Packard.
Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache Kyungbaek Kim and Daeyeon Park. Korea Advances Institute of Science and Technology (KAIST)
1 Design and Performance of a Web Server Accelerator Eric Levy-Abegnoli, Arun Iyengar, Junehwa Song, and Daniel Dias INFOCOM ‘99.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
CPSC 531: Experiment Design1 CPSC 531: Experiment Design and Performance Evaluation Instructor: Anirban Mahanti Office: ICT 745
1 Towards Cinematic Internet Video-on-Demand Bin Cheng, Lex Stein, Hai Jin and Zheng Zhang HUST and MSRA Huazhong University of Science & Technology Microsoft.
Segment-Based Proxy Caching of Multimedia Streams Authors: Kun-Lung Wu, Philip S. Yu, and Joel L. Wolf IBM T.J. Watson Research Center Proceedings of The.
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Qingqing Gan Torsten Suel CSE Department Polytechnic Institute of NYU Improved Techniques for Result Caching in Web Search Engines.
Design and Analysis of Advanced Replacement Policies for WWW Caching Kai Cheng, Yusuke Yokota, Yahiko Kambayashi Department of Social Informatics Graduate.
Chapter 21 Virtual Memoey: Policies Chien-Chung Shen CIS, UD
Proxy Cache and YOU By Stuart H. Schwartz. What is cache anyway? The general idea of cache is simple… Buffer data from a slow, large source within a (usually)
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
1/22 Workshop MODCS 2012 Performability Analysis of Virtualized Web Cache Servers Msc Candidate: Erico Augusto Cavalcanti Guedes Advisor: Paulo Romero.
System Software Lab 1 Enhancement and Validation of Squid ’ s Cache Replacement Policy John Delley Martin Arlitt Stephane Perret WCW99 김 재 섭 EECS System.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments IEEE Infocom, 1999 Anja Feldmann et.al. AT&T Research Lab 발표자 : 임 민 열, DB lab,
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
Evaluating Content Management Techniques for Web Proxy Caches Martin Arlitt, Ludmila Cherkasova, John Dilley, Rich Friedrich and Tai Jin Proceeding on.
Hot Systems, Volkmar Uhlig
An Overview of Proxy Caching Algorithms Haifeng Wang.
MiddleMan: A Video Caching Proxy Server NOSSDAV 2000 Brian Smith Department of Computer Science Cornell University Ithaca, NY Soam Acharya Inktomi Corporation.
Overview on Web Caching COSC 513 Class Presentation Instructor: Prof. M. Anvari Student name: Wei Wei ID:
Modeling and Caching of P2P Traffic Osama Saleh Thesis Defense and Seminar 21 November 2006.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
PACMan: Coordinated Memory Caching for Parallel Jobs Ganesh Ananthanarayanan, Ali Ghodsi, Andrew Wang, Dhruba Borthakur, Srikanth Kandula, Scott Shenker,
Taeho Kgil, Trevor Mudge Advanced Computer Architecture Laboratory The University of Michigan Ann Arbor, USA CASES’06.
1 On the Sensitivity of Web Proxy Cache Performance to Workload Characteristics Mudashiru Busari Carey Williamson Department of Computer Science University.
Clustered Web Server Model
Memory COMPUTER ARCHITECTURE
PA an Coordinated Memory Caching for Parallel Jobs
An Analysis of Facebook photo Caching
Distributed Systems CS
CDA 5155 Caches.
Web Proxy Caching Model
Presentation transcript:

Evaluating Content Management Technique for Web Proxy Cache M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich and T. Jin MinSu Shin

Contents Introduction Data collection and Reduction Key Workload Characteristics Experimental Design Simulation Results Virtual caches Conclusion and Critique

Introduction How effective are current proxy cache replacement policies for real workload? What new replacement policies? Performance metrics Hit rate : how many times hit? Byte hit rate : how many bytes hit?

Data Collection Access logs from ISP Jan 3 rd, 1997 ~ May 31 st,1997 Backbone ISP Proxy Server

Workload Characteristics Cacheable Object 92% of all requests were for cacheable objects

Workload Characteristics Object Set Size 16 million unique cacheable objects 389GB : too much? Object Sizes Most of the requested objects are small Largest : 148MB video Large number of small object vs. small number of large object

Workload Characteristics Recency of Reference 1/3 : within one hour 2/3 : within 24 hour Frequency of Reference 60% of the distinct objects were requested only single time Discriminate against one-timers Turnover Objects that were once popular are no longer requested

Cache Replacement policies Least-Recently-Used (LRU) Consider only single workload characteristic SIZE – replace the largest object Some of the small object that never be accessed again – how? LFU (least frequently used) LFU-Aging

Cache Replacement policies GreedyDual-Size (GD-Size) Replace the object with the lowest utility GD-Size(1) : maximize hit rate GD-Size(packet) : best byte-hit rate C : cost associated with bringing object i to cache S : object size L : running age factor, replace object f, L = K f

Suggested Policies GDSF (GreedyDual-Size with Frequency) GD-Size not consider frequency LFU-Dynamic Aging LFU with inflation factor L

Performance

Virtual Cache Logical partition into N virtual caches Virtual caches have different management policies LFU-DAGDSF-Hits New access evicted replacement High byte hit rate + High hit rate reinserted

Performance of Virtual cache

VC1 has more impact on total performance

Conclusion and Critique Good policy Investigate various policies Suggest some effective method Virtual server is key idea? Not Good Not counting operation complexity Not original idea about workload characteristic