Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, 1997. System Laboratory,

Slides:



Advertisements
Similar presentations
Peer-to-Peer Infrastructure and Applications Andrew Herbert Microsoft Research, Cambridge
Advertisements

A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance Found in: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO.
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Pervasive Web Content Delivery with Efficient Data Reuse Chi-Hung Chi and Cao Yang School of Computing National University of Singapore
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
The Cache Location Problem IEEE/ACM Transactions on Networking, Vol. 8, No. 5, October 2000 P. Krishnan, Danny Raz, Member, IEEE, and Yuval Shavitt, Member,
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
COS 420 Day 15. Agenda Assignment 3 Due Assignment 4 Posted Chap Due April 6 Individual Project Presentations Due IEPREP - Jeff MANETS - Donnie.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
The Effect of Consistency on Cache Response Time John Dilley and HP Laboratories IEEE Network, May-June 2000 Chun-Fu Kung System Laboratory Dept. of Computer.
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.
Chapter 4 IP Multicast Professor Rick Han University of Colorado at Boulder
June, 2002INFOCOM 1 Host Multicast: A Framework for Delivering Multicast to End Users Beichuan Zhang (UCLA) Sugih Jamin (UMich) Lixia Zhang (UCLA)
Java-Based Adaptive Web Caching CS-526 Fall 2002 Semester Project G. Williams.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Collaborative Web Caching Based on Proxy Affinities Jiong Yang, Wei Wang in T. J.Watson Research Center Richard Muntz in Computer Science Department of.
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
Strategies for Implementing Dynamic Load Sharing.
Web Caching Schemes For The Internet – cont. By Jia Wang.
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
Boris Tshibangu. What is a proxy server? A proxy server is a server (a computer system or an application) that acts as an intermediary for requests from.
© 2009 AT&T Intellectual Property. All rights reserved. Multimedia content growth: From IP networks to Medianets Cisco-IEEE ComSoc Webinar. Sept. 23, 2009.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
Infrastructure for Better Quality Internet Access & Web Publishing without Increasing Bandwidth Prof. Chi Chi Hung School of Computing, National University.
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
Module 3: Designing IP Addressing. Module Overview Designing an IPv4 Addressing Scheme Designing DHCP Implementation Designing DHCP Configuration Options.
Chapter 18 IP: Internet Protocol Addresses
Virtual Private Ad Hoc Networking Jeroen Hoebeke, Gerry Holderbeke, Ingrid Moerman, Bard Dhoedt and Piet Demeester 2006 July 15, 2009.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Multicasting Part I© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Internet Real-Time Laboratory Arezu Moghadam and Suman Srinivasan Columbia University in the city of New York 7DS System Design 7DS system is an architecture.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
This paper appears in: Computer Communications and Networks, ICCCN Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1.
Multimedia & Mobile Communications Lab.
MobiQuitous 2007 Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering Wei Gao.
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
HTTP evolution - TCP/IP issues Lecture 4 CM David De Roure
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
The LSAM Proxy Cache - a Multicast Distributed Virtual Cache Joe Touch USC / Information Sciences Institute 元智大學 資訊工程研究所 系統實驗室 陳桂慧
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Using Routing and Remote Access Chapter Five. Exam Objectives in this Chapter:  Plan a routing strategy Identify routing protocols to use in a specified.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Enterprise Computing with Jini Technology Mark Stang and Stephen Whinston Jan / Feb 2001, IT Pro presented by Alex Kotchnev.
CHAPTER 10: DHCP Routing & Switching. Objectives 10.0 Introduction 10.1 Dynamic Host Configuration Protocol v Dynamic Host Configuration Protocol.
Zueyong Zhu† and J. William Atwood‡
Domain Name System (DNS)
Internet Networking recitation #12
Plethora: Infrastructure and System Design
Host Multicast: A Framework for Delivering Multicast to End Users
Overlay Networking Overview.
Dynamic Replica Placement for Scalable Content Delivery
EE 122: Lecture 22 (Overlay Networks)
Presentation transcript:

Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory, Department of Computer Science Yuan-Ze University, Taiwan, Republic of China Kung Chun-Fu 2000/3/1

Outline Introduction The Basic Approach Autoconfiguration of Cache Groups Request Forwarding Summary

Introduction The lessons of twenty-five years of Internet experience teach us that caching is the only way to handle the exponential growth of user demands. Instead of always fetching pages from the originating source, data request can often be more effectively answered by finding “local” copies near consumers. We believe that a multicast-based adaptive caching infrastructure can meet this challenging need.

Introduction(cont.) Given the basic problem is data dissemination to thousands or millions of users, the basic solution ought to be some form of multicast delivery. Benefits of caching include reduced load at origin servers, shortened page fetching delays to end clients, reduced network load which reduces potential congestion.

IP multicast servers two distinguished functions, one being the most efficient way to deliver the same data to multiple receivers, the other being an information discovery vehicle. We multicast page requests in order to locate the nearest cache copy, and multicast page responses in order to efficiently disseminate pages that have common interest. Multicast

G1 G2 G3 G4 G5 G6 G user1 user2 7

The response page will be relayed back to the original client by traversing those cache servers that multicast-forwarded the request earlier. We assume that each cache in the group decides independently which pages to save. Hop-by-hop page forwarding through a chain of unknown caches increase the risk that the data may be corrupted. Page Retrieval

We proposed is a mesh of overlapping groups, rather than a strict hierarchy.It is on the base of this overlapping mesh that each popular page grows its own cache tree. Cache servers cache pages strictly based on the popularity of the demands, a property that enables our design to scale well with large user populations. The cache groups adjust themselves over time according to observed changes in topology, workload, and user population. Hierarchy and Scalability

We believe that self-configuring systems are an essential component for a range of large-scale systems in the Internet. A critical task in building the proposed adaptive caching system is to design this Cache Group Management Protocol. The cache groups must have both adequate size and adequate overlap among the groups. The cache groups must also be able to dynamically adjust to the addition or deletion of caches, routing and load changes, application performance, and tolerance to overhead. Autoconfiguration of Cache Groups

c1 c3 c2 Join Request Join Invitation Group Creation

c1 c3 c2

Each cache in a group multicast Group Messages periodically. The information to be obtained from this exchange includes the group size, the addresses of each cache, and the distance between group members. The group size and distance information will be useful when the workload for a group is too high and thus the current group must split into two. When both the workload and the cache hit ratio on a group is too low, the group may consider merging with a neighboring cache group. Group Maintenance

Request Forwarding The requests should generally be forwarded “toward” the origin server. However, because caches run on hosts rather than routers, they have no information about the topology of the network. One approach is to make the best use of information that caches already have. The other approach is to develop a standard interface to IP routing protocol.

Request Forwarding(cont.) The ideal case would be for exactly one cache in a cache group to volunteer to forward a request. If no caches in the group volunteer to forward the request after a timeout, the cache brought the request to the group can either contact the origin server directly, or randomly select a cache in the group to forward the request.

Summary We believe that as the Internet becomes more global we must have a self-configuring data dissemination system that can scale with it. We also believe that self-configuration is an increasingly- important functionality that will be required by a wide range of Internet systems facing issues of scale.