Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache Kyungbaek Kim and Daeyeon Park. Korea Advances Institute of Science and Technology (KAIST)

Slides:



Advertisements
Similar presentations
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Advertisements

ARC: A self-tuning, low overhead Replacement Cache
Online Algorithm Huaping Wang Apr.21
Cache Replacement Algorithm Outline Exiting document replacement algorithm Squids cache replacement algorithm Ideal Problem.
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.
ULC: An Unified Placement and Replacement Protocol in Multi-level Storage Systems Song Jiang and Xiaodong Zhang College of William and Mary.
A Survey of Web Cache Replacement Strategies Stefan Podlipnig, Laszlo Boszormenyl University Klagenfurt ACM Computing Surveys, December 2003 Presenter:
ARC: A SELF-TUNING, LOW OVERHEAD REPLACEMENT CACHE
Outperforming LRU with an Adaptive Replacement Cache Algorithm Nimrod megiddo Dharmendra S. Modha IBM Almaden Research Center.
Latency-sensitive hashing for collaborative Web caching Presented by: Xin Qi Yong Yang 09/04/2002.
Cache Memory By JIA HUANG. "Computer Science has only three ideas: cache, hash, trash.“ - Greg Ganger, CMU.
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.
Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet R. Rejaie, H. Yu, M. Handley, D. Estrin.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
1 Virtual Private Caches ISCA’07 Kyle J. Nesbit, James Laudon, James E. Smith Presenter: Yan Li.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.
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.
Performance Evaluation of IPv6 Packet Classification with Caching Author: Kai-Yuan Ho, Yaw-Chung Chen Publisher: ChinaCom 2008 Presenter: Chen-Yu Chaug.
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.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
SAIU: An Efficient Cache Replacement Policy for Wireless On-demand Broadcasts Jianliang Xu, Qinglong Hu, Dik Lun Department of Computer Science in HK University.
Efficiently Maintaining Stock Portfolios Up-To-Date On The Web Prashant Shenoy Manish Bhide Krithi Ramamritham 2002 IEEE E-Commerce System Proceedings.
A Hybrid Caching Strategy for Streaming Media Files Jussara M. Almeida Derek L. Eager Mary K. Vernon University of Wisconsin-Madison University of Saskatchewan.
A Case for Delay-conscious Caching of Web Documents Peter Scheuermann, Junho Shim, Radek Vingralek Department of Electrical and Computer Engineering Northwestern.
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.
1 Ekow J. Otoo Frank Olken Arie Shoshani Adaptive File Caching in Distributed Systems.
Authors: Tong Li, Dan Baumberger, David A. Koufaty, and Scott Hahn [Systems Technology Lab, Intel Corporation] Source: 2007 ACM/IEEE conference on Supercomputing.
Hybrid Prefetching for WWW Proxy Servers Yui-Wen Horng, Wen-Jou Lin, Hsing Mei Department of Computer Science and Information Engineering Fu Jen Catholic.
1 Design and Performance of a Web Server Accelerator Eric Levy-Abegnoli, Arun Iyengar, Junehwa Song, and Daniel Dias INFOCOM ‘99.
1 Cache Me If You Can. NUS.SOC.CS5248 OOI WEI TSANG 2 You Are Here Network Encoder Sender Middlebox Receiver Decoder.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
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)
Design and Analysis of Advanced Replacement Policies for WWW Caching Kai Cheng, Yusuke Yokota, Yahiko Kambayashi Department of Social Informatics Graduate.
An Effective Disk Caching Algorithm in Data Grid Why Disk Caching in Data Grids?  It takes a long latency (up to several minutes) to load data from a.
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
Fast BVH Construction on GPUs (Eurographics 2009) Park, Soonchan KAIST (Korea Advanced Institute of Science and Technology)
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,
Project 2 Presentations CS554 – Designs for Software and Systems Team HAND – Seokin Hong, Gieil Lee, Jesung Kim, Yebin Lee Department of Computer Science,
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.
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
Client Cache Management Improving the broadcast for one probability access distribution will hurt the performance of other clients with different access.
An Overview of Proxy Caching Algorithms Haifeng Wang.
Evaluating Content Management Technique for Web Proxy Cache M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich and T. Jin MinSu Shin.
Transforming Policies into Mechanisms with Infokernel Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Nathan C. Burnett, Timothy E. Denehy, Thomas J.
Web Proxy Caching: The Devil is in the Details Ramon Caceres, Fred Douglis, Anja Feldmann Young-Ho Suh Network Computing Lab. KAIST Proceedings of the.
Proxy Caching for Peer-to-Peer Live Streaming The International Journal of Computer Networks, 2010 Ke Xu, Ming Zhang, Mingjiang Ye Dept. of Computer Science,
On Caching Search Engine Query Results Evangelos Markatos Evangelos Markatoshttp://archvlsi.ics.forth.gr/OS/os.html Computer Architecture and VLSI Systems.
Adaptive Configuration of a Web Caching Hierarchy Pranav A. Desai Jaspal Subhlok Presented by: Pranav A. Desai.
Clustered Web Server Model
Memory Management for Scalable Web Data Servers
Kalyan Boggavarapu Lehigh University
ECE-752 Zheng Zheng, Anuj Gadiyar
Evaluating Proxy Caching Algorithms in Mobile Environments
Zipf-Distributions & Caching
Web Proxy Caching Model
Dong Hyun Kang, Changwoo Min, Young Ik Eom
Presentation transcript:

Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache Kyungbaek Kim and Daeyeon Park. Korea Advances Institute of Science and Technology (KAIST) Eighth International Conference on Parallel and Distributed Systems

Outline Introduction Related work Least popularity-per-byte replacement algorithm Performance evaluation Conclusion

Introduction The correlation between the on-line fashion parameters and the object popularity in the proxy cache are weaken because of efficient client caches. It use the long-term measurements of request frequency as popularity value in this paper.

Least popularity-per-byte replacement algorithm (LPPB-R) It is a function-based algorithm. The function of the LPPB-R is to make the popularity per byte of the outgoing objects to be minimum.

Least popularity-per-byte replacement algorithm (LPPB-R) (cont.) How to set the popularity value determines the performance of this LPPB-R algorithm?  Using the reference count directly.  Reference count as the power term of the impact factor

Some other consideration in LPPB-R algorithm Using the multi queues to manage objects to decrease the complexity of calculation. It consider the problem of cache pollution.

Related work The classification of replacement algorithm  Traditional LRU, LFU and FIFO  Key-based LFF and LOG2SIZE  Function-based GDS, Hybrid, LRV, SA-LRU

Least popularity-per-byte replacement algorithm The overview of LPPB-R U(j)=P(j)/S(j) P(j): the popularity value of object j S(j): the size of object j U(j): the popularity value per byte

Getting the popularity value Two model to get the popularity value  P(j)=R(j)/T R(j): the reference count of j T: total requests through the proxy cache  P(j)=1/(ß) R(j), (0<ß<1) ß: impact factor

Managing the objects The LPPB-R has terrible overhead to calculate the utilization values. The operation needs O(k) time. (k is the object number in the cache) It use multi queues to decrease the order of complexity of calculation.

Multi queues The ith queue manages the objects whose size is from 2 i-1 to 2 i -1. Thus, there will be different queues of objects. Where M is the cache size. The objects in each queue i are maintained as a separate LFU list. Decreasing the order of complexity from O(k) to.

Multi Queues (cont.)

Avoiding the cache pollution phenomenon It use LRU list for each LFU list to avoid the cache pollution. Checking the LRU list periodically.

Avoiding the cache pollution phenomenon (cont.)

Performance evaluation The traces are from pb and bo2 proxy server of NLANR.

Performance metrics and algorithms It consider three aspects of web caching benefits hit rate, byte rate and reduced latency It compare the performance of LPPB-R with LRU, LFU, LOG2SIZE, and SA- LRU.

Hit rate in bo2 server

Hit rate in pb server

Byte hit rate in bo2 server

Byte hit rate in pb server

Reduced latency in bo2 server

Reduced latency in pb server

Conclusion If the ß be set to the range from 0.3 to 0.5, LPPB-R will achieves the best hit rate. On the other hand, closer to zero the ß is, better the performance of the cache is in the byte hit rate and reduced latency.