Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.

Slides:



Advertisements
Similar presentations
1 o Two issues in practice – Scale – Administrative autonomy o Autonomous system (AS) or region o Intra autonomous system routing protocol o Gateway routers.
Advertisements

Jaringan Komputer Lanjut Packet Switching Network.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Multicasting in Mobile Ad-Hoc Networks (MANET)
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
Multihop Federations draft-mrw-abfab-multihop-fed-01.txt Margaret Wasserman
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
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.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Intanagonwiwat, Govindan, Estrin USC, Information Sciences Institute,
Towards a Better Understanding of Web Resources and Server Responses for Improved Caching Craig E. Wills and Mikhail Mikhailov Computer Science Department.
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)
Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory,
Routing and Routing Protocols
CS335 Networking & Network Administration Tuesday, April 20, 2010.
MULTICASTING Network Security.
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Presentation Title Subtitle Author Copyright © 2002 OPNET Technologies, Inc. TM Introduction to IP and Routing.
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Introduction to Dynamic Routing Protocol
Common Devices Used In Computer Networks
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
Networks – Network Architecture Network architecture is specification of design principles (including data formats and procedures) for creating a network.
Router and Routing Basics
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
CCNA 1 Module 10 Routing Fundamentals and Subnets.
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
NetCache Architecture and Deployment Peter Danzig Network Appliance, Santa Clara, CA 元智大學 系統實驗室 陳桂慧
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
Multicast Routing Protocols. The Need for Multicast Routing n Routing based on member information –Whenever a multicast router receives a multicast packet.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
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.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
Yallcast Architecture Overview Paul Francis NTT PF Labs
Multimedia & Mobile Communications Lab.
ICP and the Squid Web Cache Duanc Wessels k Claffy August 13, 1997 元智大學系統實驗室 宮春富 2000/01/26.
Basic Routing Principles V1.2. Objectives Understand the function of router Know the basic conception in routing Know the working principle of router.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Scalable Routing Protocols for
HTTP evolution - TCP/IP issues Lecture 4 CM David De Roure
ICP and the Squid Web Cache Duane Wessels and K. Claffy 산업공학과 조희권.
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 元智大學 資訊工程研究所 系統實驗室 陳桂慧
CFTP - A Caching FTP Server Mark Russell and Tim Hopkins Computing Laboratory University of Kent Canterbury, CT2 7NF Kent, UK 元智大學 資訊工程研究所 系統實驗室 陳桂慧.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
The Measured Access Characteristics of World-Wide-Web Client Proxy Caches Bradley M. Duska, David Marwood, and Michael J. Feeley Department of Computer.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Introduction to Active Directory
Doc.: IEEE /0980r0 Routing and Forwarding Separation August 27, 2004 Tricci So – Nortel Networks Slide 1 Routing and Forwarding Separation Separation.
Cache Digest Alex Rousskov Duane Wessels National Laboratory for Applied Network Research April 17, 1998 元智大學 資訊工程研究所 系統實驗室 陳桂慧 February 9, 1999.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
Improving the WWW: Caching or Multicast? Pablo RodriguezErnst W. BiersackKeith W. Ross Institut EURECOM 2229, route des Cretes. BP , Sophia Antipolis.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Internet Networking recitation #12
Presentation transcript:

Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer Science Department Sally Floyd and Van Jacobson Lawrence Berkeley National Laboratories 元智大學 電機暨資訊工程研究所 系統實驗室 陳桂慧

SQUID system SQUID system, –inter-connected in a manually configured hierarchical tree. –exchanges ICP queries and replies with its "peers”. Improving ways –eliminate the heavy burden placed on system administrators who must coordinate with each other. –less prone to both human error and system administrators' misunderstanding of the issues concerning the performance –address the fact that manual configuration may significantly hinder both the scalability of the system as well as the system's ability to adapt to changing network conditions.

SQUID system (2) Signal, static hierarchy –enhanced to address the potential problem of inefficient routing of web requests. –not necessarily well suited to the unpredictable, roving nature of web hot-spots. –avoid the inordinate amount of delay associated with the 3-way handshake protocol for exchanging ICP messages. Goals - –more scalable, adaptive, efficient, and self-configuring web-caching system.

Adaptive Web Caching System research issues –how to self-organize web caches to establish the different paths of communication among the cache groups in the mesh/hierarchy. –how to forward requests and other information along the most appropriate path. Focus of their work –design a reasonable architecture for an adaptive, scalable web caching system. –determine the most effective direction of evolution from the current web caching infrastructure to our proposed system.

Time Scales three distinct phases –the introduction of adaptive web caching for distributing information and web requests among the cache mesh, –the addition of multicast as a mechanism for both efficient group communication and as a building block for the self-organization of groups, –the introduction of self-organization into the adaptive web caching system to make it completely adaptive and robust.

The initial deployment of adaptive web caching - the routing of information among the cache mesh would be adaptive, but the underlying communication infrastructure among the web caches would not static. –how web caches share and make use of information about the contents of other nearby caches; and –how to best route requests through the manually configured cache mesh Adding multicast to the system –it allows members of a group to communicate and share information efficiently, –it provides the necessary functionality for a scalable, fully distributed algorithm to self-organize the cache servers into overlapping multicast groups.

Adding self-organization to the system - make the whole system scalable, adaptive, and robust. Some of the fundamental underlying research issues, –how to efficiently self-organize the groups to provide good communication paths among the caches in the cache mesh; –how to organize caches separated by some political or resource-constrained boundary (e.g., transoceanic links, network boundaries between secure organizations); and –whether an implicit hierarchy (cache mesh) is adequate or if an explicit hierarchy (a second level cache structure overlaid over a lower level cache mesh) is needed.

Information about the Contents of Nearby Caches Two issues of the exchange of information among caches in a cache mesh. –within a region or local area, caches receiving a request for data check to see if some nearby cache already has the requested contents. –dynamically routes the request to another cache or caches within the cache mesh after the first step has failed. Caches exchange content state periodically with other members of their cache group. –URL whose contents :scheme (e.g., "html"), network location (DNS host name), and following path components.

Forwarding Requests These forwarding mechanisms are used after a cache has decided that none of its nearby caches themselves have the requested contents. We propose that web caches maintain a URL routing table, and use it to decide when to forward a request to another cache in the web caching infrastructure.

Forwarding Requests (2) Information source for the URL routing table –source-based entries URL prefix, an identifier for the cache, and a metric reflecting that cache's average measured delay in seconds to retrieve a request from a matching URL. –content-based entries

Self-Organization Cache Group Management Protocol (CGMP) –let autonomous Web caches organize themselves into multiple, overlapping multicast groups, forming a transport substrate for URL requests and data flow. Design goals –making the entire cache topology group-wise connected, –making the grouping follow and match the topological constraints, –minimize the number of "hops" a URL request must travel upon cache fault.

Self-Organization (2) voting scheme, cache servers periodically send a voting message for each group for which it is a member to a well- known multicast address, at the same time individually deciding which cache groups to join based on the voting announcements received from other cache servers.