Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.

Slides:



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

Semantic Data Caching and Replacement. Outline Motivation Client Caching Architecture Model of Semantic Caching Simulations and Results Conclusion and.
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:
A Preliminary Attempt ECEn 670 Semester Project Wei Dang Jacob Frogget Poisson Processes and Maximum Likelihood Estimator for Cache Replacement.
ARC: A SELF-TUNING, LOW OVERHEAD REPLACEMENT CACHE
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 10: Virtual Memory Background Demand Paging Process Creation Page Replacement.
Module 10: Virtual Memory Background Demand Paging Performance of Demand Paging Page Replacement Page-Replacement Algorithms Allocation of Frames Thrashing.
Latency-sensitive hashing for collaborative Web caching Presented by: Xin Qi Yong Yang 09/04/2002.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
CS 104 Introduction to Computer Science and Graphics Problems
Improving Proxy Cache Performance: Analysis of Three Replacement Policies John Dilley and Martin Arlitt IEEE internet computing volume3 Nov-Dec 1999 Chun-Fu.
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.
Differentiated Multimedia Web Services Using Quality Aware Transcoding S. Chandra, C.Schlatter Ellis and A.Vahdat InfoCom 2000, IEEE Journal on Selected.
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.
Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache Kyungbaek Kim and Daeyeon Park. Korea Advances Institute of Science and Technology (KAIST)
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
By Ravi Shankar Dubasi Sivani Kavuri A Popularity-Based Prediction Model for Web Prefetching.
1 Ekow J. Otoo Frank Olken Arie Shoshani Adaptive File Caching in Distributed Systems.
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Hybrid Prefetching for WWW Proxy Servers Yui-Wen Horng, Wen-Jou Lin, Hsing Mei Department of Computer Science and Information Engineering Fu Jen Catholic.
M i SMob i S Mob i Store - Mobile i nternet File Storage Platform Chetna Kaur.
Infrastructure for Better Quality Internet Access & Web Publishing without Increasing Bandwidth Prof. Chi Chi Hung School of Computing, National University.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
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.
Search Engine Caching Rank-preserving two-level caching for scalable search engines, Paricia Correia Saraiva et al, September 2001
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Chapter Twelve Memory Organization
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.
Exploiting Gray-Box Knowledge of Buffer Cache Management Nathan C. Burnett, John Bent, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau University of.
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
Abdullah Aldahami ( ) March 23, Introduction 2. Background 3. Simulation Techniques a.Experimental Settings b.Model Description c.Methodology.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Evaluating Content Management Techniques for Web Proxy Caches Martin Arlitt, Ludmila Cherkasova, John Dilley, Rich Friedrich and Tai Jin Proceeding on.
Functions of a Web Warehouse Kai Cheng, Yahiko Kambayashi, Seok Tae Lee Graduate School of Informatics, Kyoto University, Japan and Mukesh Mohania Western.
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
1 Hidra: History Based Dynamic Resource Allocation For Server Clusters Jayanth Gummaraju 1 and Yoshio Turner 2 1 Stanford University, CA, USA 2 Hewlett-Packard.
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.
1 CMP-MSI.07 CARES/SNU A Reusability-Aware Cache Memory Sharing Technique for High Performance CMPs with Private Caches Sungjune Youn, Hyunhee Kim and.
Evaluating Content Management Technique for Web Proxy Cache M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich and T. Jin MinSu Shin.
1 COMP 431 Internet Services & Protocols HTTP Persistence & Web Caching Jasleen Kaur February 11, 2016.
Video Caching in Radio Access network: Impact on Delay and Capacity
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
On Caching Search Engine Query Results Evangelos Markatos Evangelos Markatoshttp://archvlsi.ics.forth.gr/OS/os.html Computer Architecture and VLSI Systems.
Clustered Web Server Model
Memory Management.
University of Maryland College Park
CE 454 Computer Architecture
The Impact of Replacement Granularity on Video Caching
Semantic Data Caching and Replacement
Qiyuan Xing, Jing Wang, Yue Li, Yanbo Han
Cache Memory Presentation I
Memory Management for Scalable Web Data Servers
Auburn University COMP7500 Advanced Operating Systems I/O-Aware Load Balancing Techniques (2) Dr. Xiao Qin Auburn University.
Module 9: Virtual Memory
5: Virtual Memory Background Demand Paging
Group Based Management of Distributed File Caches
LHD: Improving Cache Hit Rate By Maximizing Hit Density
Contents Memory types & memory hierarchy Virtual memory (VM)
Web Proxy Caching Model
Module 9: Virtual Memory
Overview Problem Solution CPU vs Memory performance imbalance
Presentation transcript:

Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN

Outline of the Presentation Introduction –Localizing Web Contents –Why Content Management –Contributions of Our Work Multicache-Based Content Management Content Management Scheme for LRU-SP Experimental Evaluation Concluding Remarks

Web Caching For Localizing Web Contents World Wide Content Access/Delivery –Bandwidth Constraints –“Hot-Spot” Servers –Inherent Latency (200  300ms) Web Caching For Localizing Web Contents –Reduce Network Traffic –Distribute Server Load –Reduce Response Times –Can We Expect More ?

Characteristics and Implications Traditional Caching Web CachingImplications Process Oriented Human-User Oriented User Preferences System-LevelApplication-Level Semantic Information Data Block BasedDocument-Based Varying Sizes, Types Memory-BasedDisk-Based Persistent Storage, Large Size,

Limitations of Current Caching Schemes Document Managed As Physical Unit, Not Semantic Unit. Only Physical Properties Being Used Less Organized, Less Structured Only Support Simple Control Logic Beyond Simple Priority Queues, Towards Sophisticated Content Management

Content Management Basic Features –Larger Cache Space –Sophisticated Control Logic More Challenging –Sophisticated Replacement Policies With User-Oriented Performance Metrics Document Managed as Semantic Unit

Contributions of This Work A Multicache Architecture for Implementing Sophisticated Content Management A Study of Content Management for LRU-SP Simulations to Compare LRU-SP Against Others

Previous Work Classifications (Cache Data ) –LRV, LNC-W3-U, etc. Segmentation (Cache Space) –Segmented FIFO, FBR, 2Q etc. Features –Differentiating Data With Different Properties Shortages: – No Sophisticated Category – No Semantic-Based Classification

Managing LFU Contents in Multiple Priority Queues 2 1 >2 B(8)C(6)D(3) A(10)E(2)F(2) F(1)G(1)H(1) Hit Outs First In First Out Order References A(10) B(8)C(6) D(3) E(2) F(2) F(1)G(1) H(1)

Basics of Cache Space –Limit Storage Space Contents –Objects Selected for Caching Policies –Replacement Policies Constraints –Special Conditions Space Contents Policies Constraints Space

Constraints for Cache Admission Constraints –Define Conditions for Objects Eligible For Caching e.g. (size < 2MB) && !(Source = local) Freshness Constraints –Define Conditions for Objects Fresh Enough For Re- Use e.g. (Type = news) && (Last-Modified < 1week) Miscellaneous Constraints e.g. (Time= end-of-day)  (Total-Size< 95%*Cache- Size)

Multicache Architecture SUBCACHE CENTRAL ROUTER CENTRAL ROUTER Client WWW Web Cache With Multiple Subcaches JUDGE CONSTRAINTS CKB IN-CACHE Request/Response Cache Knowledge Base

Components of the Architecture Central Router – Control and Mediate the Cache Cache Knowledge Base (CKB) –A Set of Rule Based To Allocate Objects R1. Allocate(X, 1):-url(X, U), match(U, *.jp),content(X, baseball) Subcaches –Keep Objects With Special Characteristics Cache Judge –Make Final Decisions From A Set of Eviction Candidates

Central Router services each request. Suppose current request is for document p; 1.Locating p by In-cache Index 2.If p is not in cache, download p; i.Validate Constraints, if false, loop; ii.Fire rules in CKB, let subcache ID = K ; iii.While no enough space in subcache K for p –Subcache K selects an eviction ; – If space sharing, other subcaches do same; –Judge assesses the eviction candidates; –Purge the victim; iv. Cache p in subcache K 3.If p is in subcache, do i) - iv) re-cache p. The Procedural Description

Content Management for LRU-SP LRU (Least Recently Used) –Primarily Designed for Equal Sized Objects, and Only Recency of Reference In Use Extended LRUs –Size-Adjusted LRU (SzLRU) –Segmented LRU (SgLRU) LRU-SP (Size-Adjusted and Popularity-Aware LRU) –Make SzLRU Aware of Popularity Degree

Probability of Re-Reference As a Function of Current Reference Times

Cost -To-Size Ratio Model An Object A In Cache Saves Cost nref * (1/atime) –nref is the frequency of reference –atime is the time since last access, (1/atime) is the dynamic frequency of A When Put In Cache, It Takes Up Space size –Cost-to-size ratio = nref /(size*atime) The Object With Least Ratio Is Least Beneficial One

Content Management of LRU-SP CKB Rule: –Allocate(X, log(size/nref)):-Size(X, size), Freq(X, nref) Subcaches –Least Recently Used (LRU) Judge –Find the One With Largest (size*atime)/nref –The Larger and Older and Colder, the Fast An Object Will Be Purged

Multicache Architecture for LRU-SP LRU Subcache ① LRU Subcache ② LRU Subcache ③ CKB Hits A, B A B C Judge a b c Ca Computational Complexity O(1)

Predicted Results A higher Hit Rate is expectable for LRU-SP, because it utilizes three indicators to document popularity. However, higher Hit Rates are usually at the cost of lower Byte Hit Rates, given a similar popularity, because smaller documents contribute less to bytes of hit data.

Experiment Results Better Than Expected * *

Results & Explanations LRU-SP really obtained a much higher Hit Rate than SzLRU, SgLRU and LRV. LRU-SP also obtained a high Byte Hit Rate, especially when cache space exceeds 3% of total required space. Really Popular Objects Are Saved, So Both Hit Rate and Byte Hit Rate are Improved. LRU-SP only incurs O(1) time complexity in content management.

Concluding Remarks Multicahe-Based Architecture Has Proved Well- Performed In Balancing High Performance and Low Overhead Possible To Incorporate Semantic Information as Well as User Preference In Caching It Can Work With General Database Systems to Support Web Information Integration. (Future Work)

Thank You ! And Welcome To