Presented by Tashana Landray

Slides:



Advertisements
Similar presentations
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Li Fan, Pei Cao and Jussara Almeida University of Wisconsin-Madison Andrei Broder Compaq/DEC.
Advertisements

Brocade: Landmark Routing on Peer to Peer Networks Ben Y. Zhao Yitao Duan, Ling Huang, Anthony Joseph, John Kubiatowicz IPTPS, March 2002.
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Cost-Based Cache Replacement and Server Selection for Multimedia Proxy Across Wireless Internet Qian Zhang Zhe Xiang Wenwu Zhu Lixin Gao IEEE Transactions.
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination Ashok Anand, Archit Gupta, Aditya Akella University of Wisconsin,
Small-world Overlay P2P Network
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Progress Report Wireless Routing By Edward Mulimba.
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.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
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.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Introspective Replica Management Yan Chen, Hakim Weatherspoon, and Dennis Geels Our project developed and evaluated a replica management algorithm suitable.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
Web Caching Schemes For The Internet – cont. By Jia Wang.
1 The Mystery of Cooperative Web Caching 2 b b Web caching : is a process implemented by a caching proxy to improve the efficiency of the web. It reduces.
ICTTA'04Arwa zabian1 On The Latency of BFS Interval Cooperation Web Caching Arwa Zabian Maurizio Bonuccelli Department of Computer Science University of.
Locality-Aware Request Distribution in Cluster-based Network Servers Presented by: Kevin Boos Authors: Vivek S. Pai, Mohit Aron, et al. Rice University.
Web Caching and Content Delivery. Caching for a Better Web Performance is a major concern in the Web Proxy caching is the most widely used method to improve.
New Directions and Half-Baked Ideas in Topology Modeling Ellen W. Zegura College of Computing Georgia Tech.
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
Modeling Internet Topology Kenneth L. Calvert Matthew B. Doar Ellen W. Zegura Presented by Kiran Komaravolu.
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Sharing Information across Congestion Windows CSE222A Project Presentation March 15, 2005 Apurva Sharma.
Floodless in SEATTLE : A Scalable Ethernet ArchiTecTure for Large Enterprises. Changhoon Kim, Matthew Caesar and Jenifer Rexford. Princeton University.
Understanding the Performance of Web Caching System with an Analysis Model and Simulation Xiaosong Hu Nur Zincir-Heywood Sep
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
Dr. Yingwu Zhu Summary Cache : A Scalable Wide- Area Web Cache Sharing Protocol.
Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments IEEE Infocom, 1999 Anja Feldmann et.al. AT&T Research Lab 발표자 : 임 민 열, DB lab,
Hot Systems, Volkmar Uhlig
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
ECE 259 / CPS 221 Advanced Computer Architecture II (Parallel Computer Architecture) Evaluation – Metrics, Simulation, and Workloads Copyright 2004 Daniel.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
Adaptive Configuration of a Web Caching Hierarchy Pranav A. Desai Jaspal Subhlok Presented by: Pranav A. Desai.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Communication Costs in Parallel Machines Dr. Xiao Qin Auburn University
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Architecture and Algorithms for an IEEE 802
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Vivaldi: A Decentralized Network Coordinate System
Implementation of GPU based CCN Router
Memory Management for Scalable Web Data Servers
Internet Networking recitation #12
Plethora: Infrastructure and System Design
ISP and Egress Path Selection for Multihomed Networks
On the Scale and Performance of Cooperative Web Proxy Caching
Mingxing Zhang, Youwei Zhuo (equal contribution),
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
Evaluating Proxy Caching Algorithms in Mobile Environments
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Development & Evaluation of Network Test-beds
Locality Optimizations in Tapestry Sahara/OceanStore Winter Retreat
Dynamic Replica Placement for Scalable Content Delivery
Project proposal Multi-stream and multi-path audio transmission
Simulation for Cache Mesh Design
Brocade: Landmark Routing on Peer to Peer Networks
Presentation transcript:

Presented by Tashana Landray Web Caching Simulator Presented by Tashana Landray Molly Brown, Anna Karlin, Tashana Landray, Hank Levy, Felix Livni, Denise Pinnel, Nitin Sharma, Emin Gun Sirer, Geoff Voelker, Alec Wolman

Outline Why we’re building a simulator What it simulates What results we want

Motivation Several cooperative web caching algorithms have been proposed Harvest/Squid Tewari, Dahlin et. al Zhang et. al Us Difficult to compare benefits and drawbacks

Goal Primary goal to evaluate and compare effectiveness of cooperative web caching algorithms Allow comparison on a variety of metrics hit rates, sharing, latency of requests, bandwidth consumed, etc. Maintain high level of abstraction

Features Simulates a system of proxy caches Implemented as modules that can be plugged in and interchanged Caching algorithms Traffic workloads Network representation

Traffic Workloads Real Traces Synthetic Workloads Existing (e.g. Dec traces) UW Trace (Alec’s talk) Synthetic Workloads Nitin’s talk

Network Topology Use Transit-Stub tool developed at Georgia Tech to create graphs representing arbitrary Internet-like topologies* Precompute routing tables from graphs We do not assign bandwidths or simulate network congestion * Ken Calvert, Matt Doar and Ellen W. Zegura. "Modeling Internet Topology." IEEE Communications Magazine, June 1997.

What we simulate We do (or will) simulate We do NOT simulate Proxy load and server load at highly loaded servers Bandwidth consumed over network links We do NOT simulate Queuing on network links Underlying network protocols

Algorithm Evaluation Results Metrics to compare: Hit rates (Sharing) Average and worst-case latency of requests Breakdown of what contributes to latency Bandwidth consumed on links Overhead of algorithms Extra hops Number of messages sent Proxy and server load

Performance Limitations Scalability Memory requirements biggest bottleneck Can currently run one day of Dec trace through hierarchy of 68 proxies in about 120 MB Representation of cached documents bottleneck can currently store 2 million in 48 MB can be optimized May run with GMS