A Network Measurement Architecture for Adaptive Networked Applications Mark Stemm* Randy H. Katz Computer Science Division University of California at.

Slides:



Advertisements
Similar presentations
The Internet and the Web
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
ICS 434 Advanced Database Systems
The Effects of Wide-Area Conditions on WWW Server Performance Erich Nahum, Marcel Rosu, Srini Seshan, Jussara Almeida IBM T.J. Watson Research Center,
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
Ýmir Vigfússon IBM Research Haifa Labs Ken Birman Cornell University Qi Huang Cornell University Deepak Nataraj Cornell University.
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.
Latency-sensitive hashing for collaborative Web caching Presented by: Xin Qi Yong Yang 09/04/2002.
An Empirical Study of Real Audio Traffic A. Mena and J. Heidemann USC/Information Sciences Institute In Proceedings of IEEE Infocom Tel-Aviv, Israel March.
CStream: Neighborhood Bandwidth Aggregation For Better Video Streaming Thangam Vedagiri Seenivasan Advisor: Mark Claypool Reader: Robert Kinicki 1 M.S.
Leveraging IP for Sensor Network Deployment Simon Duquennoy, Niklas Wirstrom, Nicolas Tsiftes, Adam Dunkels Swedish Institute of Computer Science Presenter.
Notes to the presenter. I would like to thank Jim Waldo, Jon Bostrom, and Dennis Govoni. They helped me put this presentation together for the field.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
15-441: Computer Networking Lecture 26: Networking Future.
Resource Management – a Solution for Providing QoS over IP Tudor Dumitraş, Frances Jen-Fung Ning and Humayun Latif.
Game Server Selection for Multiple Players Steven Gargolinski Christopher St. Pierre Mark Claypool Computer Science Department Worcester Polytechnic Institute.
Peer-to-Peer 3D Streaming ACM Multimedia 2007 submission Presenter: Shun-Yun Hu ( 胡舜元 ) Adaptive Computing and Network Lab Dept. of CSIE,
On the Constancy of Internet Path Properties Yin Zhang, Nick Duffield AT&T Labs Vern Paxson, Scott Shenker ACIRI Internet Measurement Workshop 2001 Presented.
Naming in Wireless Sensor Networks. 2 Sensor Naming  Exploiting application-specific naming and in- network processing for building efficient scalable.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
1 Action Breakout Session Anil, AP, Nina Bhatti, Charles Berdnall, Joe Hellerstein, Wei Hu, Anthony Joseph, Randy Katz, Li, Machi Mukund Kimmo Raatikanen,
Collaborative Web Caching Based on Proxy Affinities Jiong Yang, Wei Wang in T. J.Watson Research Center Richard Muntz in Computer Science Department of.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
Differentiated Multimedia Web Services Using Quality Aware Transcoding S. Chandra, C.Schlatter Ellis and A.Vahdat InfoCom 2000, IEEE Journal on Selected.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
1 Web Content Delivery Reading: Section and COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Ioannis Avramopoulos Instructor:
A Prediction-based Real-time Scheduling Advisor Peter A. Dinda Prescience Lab Department of Computer Science Northwestern University
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Windows Internet Connection Sharing Dave Eitelbach Program Manager Networking And Communications Microsoft Corporation.
SEO and what it means to you. Short for search engine optimization, the process of increasing the amount of visitors to a Web site by ranking high in the.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Csi315csi315 Client/Server Models. Client/Server Environment LAN or WAN Server Data Berson, Fig 1.4, p.8 clients network.
Mar 1, 2004 Multi-path Routing CSE 525 Course Presentation Dhanashri Kelkar Department of Computer Science and Engineering OGI School of Science and Engineering.
Aditya Akella The Performance Benefits of Multihoming Aditya Akella CMU With Bruce Maggs, Srini Seshan, Anees Shaikh and Ramesh Sitaraman.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
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,
Increasing Web Server Throughput with Network Interface Data Caching October 9, 2002 Hyong-youb Kim, Vijay S. Pai, and Scott Rixner Rice Computer Architecture.
L-24 Adaptive Applications 1. State of the Art – Manual Adaptation Objective: automating adaptation ? CaliforniaNew York 2.
 Cachet Technologies 1998 Cachet Technologies Technology Overview February 1998.
DotSlash – or how to deal with 15 minutes of fame Weibin Zhao Henning Schulzrinne Columbia University CATT/WICAT Annual Research Review November 14, 2003.
Managing Web Server Performance with AutoTune Agents by Y. Diao, J. L. Hellerstein, S. Parekh, J. P. Bigus Presented by Changha Lee.
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
Adaptive Content-Aware Scaling for Improved Video Streaming. Avanish Tripathi Advisor: Mark Claypool Reader: Bob Kinicki.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
MiddleMan: A Video Caching Proxy Server NOSSDAV 2000 Brian Smith Department of Computer Science Cornell University Ithaca, NY Soam Acharya Inktomi Corporation.
1 COMP 431 Internet Services & Protocols HTTP Persistence & Web Caching Jasleen Kaur February 11, 2016.
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.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
Adaptive Configuration of a Web Caching Hierarchy Pranav A. Desai Jaspal Subhlok Presented by: Pranav A. Desai.
Lecture 13 – Network Mapping
Architecture and Algorithms for an IEEE 802
DNS-sly: Avoiding Censorship through Network Complexity
WSRec: A Collaborative Filtering Based Web Service Recommender System
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Game Server Selection for Multiple Players
Monkey See, Monkey Do A Tool for TCP Tracing and Replaying
Performance Evaluation of Computer Networks
Performance Evaluation of Computer Networks
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Presentation transcript:

A Network Measurement Architecture for Adaptive Networked Applications Mark Stemm* Randy H. Katz Computer Science Division University of California at Berkeley *FastForward Networks, Inc. San Francisco, CA Srinivasan Seshan IBM T.J. Watson Research Labs Hawthorne, NY

The Problem Predict in advance network performance (e.g., available bandwidth, latency, packet loss probability) to distant network sites Internet ???

Why Does It Matter? Apps that could use this: –Mirror site selection (Harvest, Mirrored FTP/Web sites) –Fidelity adaptation (CMU Odyssey, UCB TranSend, Low graphics WWW sites) –Network state feedback ? vs. Click here or here to download

Internet SPAND (Shared Passive Network Performance Discovery) Client Performance Server Shared: clients use past knowledge of nearby clients Passive, App-Specific: app-to-app traffic used to measure performance Gateway Local Admin Domain Data Perf. Reports Perf Query/ Response

Advantages of SPAND Shared Measurements –Clients pool individual measurements to obtain more up-to-date information Passive Measurements –No new measurement traffic introduced into network Application-Specific Measurements –More likely to measure what the client really cares about than network-level measurements

SPAND Architecture Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server

SPAND Architecture (Modified) Clients: –Make Performance Reports to Performance Servers –Send Performance Requests to Performance Servers Performance Servers: –Receive reports from clients, –Aggregate/post-process reports –Respond to requests with Performance Responses Packet Capture Host: –Snoops on local traffic, –Makes Performance Reports on behalf of unmodified clients

SPAND Architecture Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server

Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server SPAND Architecture

Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server

SPAND Architecture Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server

SPAND Architecture Client Packet Capture Host Client Data Perf. Reports Perf Query/ Response Internet Performance Server

LookingGlass: Web Mirror Selection 3 Sub-Problems: –Mechanisms for Mirror Advertisement How does client discover the mirrors? –Metrics for Mirror Ranking How does client determine “best” mirror? –Algorithm for Mirror Selection Given a ranking, how does client choose mirror? ? Problem: –Client choose among mirror locations replicating same content

Current Solution and Its Problems Mechanisms for Mirror Advertisements: –Manually created list of sites on web page –Admin must update list every time mirror is added/deleted Metrics for Mirror Ranking: –Usually none, perhaps hints such as geographic location Algorithm for Mirror Selection: –Currently made by user (pick “best”) –Often leads to hotspots (pick first in list)

Our Solution: LookingGlass Mechanisms for Mirror Advertisements: –Transparent way to notify clients of mirrors –Distributed algorithm to disseminate mirror information between mirror sites Metrics for Mirror Ranking: –SPAND’s Web Page download metric used to rank mirrors Algorithm for Mirror Selection: –Randomly select with weights in proportion to ranking

Experimental Methodology Trace analysis and implementation CMU Trace consists of series of rounds –In each, client downloads identical web object from Mars Rover mirror sites M1 M2 Mn 3 sec 4 sec 5 sec......

Experimental Methodology M1 M2 Mn 3 sec 4 sec 5 sec Best Possible LookingGlass For each round, compare (via ratio) min download time with download time for: –What LookingGlass would pick –Hop count “closest”-to-client mirror –Two hosts in same general geographic area as client –Randomly selected mirror –Primary mirror site (“select first in list”)

Results

Conclusions SPAND: an architecture that facilitates adaptive networked applications Advantages/challenges of design choices in SPAND LookingGlass: Web Mirror Selection tool that uses SPAND SPAND source code available: –

Outline of Talk Design Choices –Advantages/Challenges of Shared, Passive, Applications-specific performance measurements SPAND Architecture –Components of SPAND –Component Interactions LookingGlass: Web Mirror Selection –Best case: 40x improvement in download time –Average case: 4x improvement

Key Design Choices in SPAND Measurements are Shared –Hosts share performance information via per-domain repository Measurements are Passive –Application-to-application traffic is used to measure network performance Measurements are Application-Specific –When possible, measure application response time, not bandwidth, latency, hop count, etc.

Challenges of SPAND 3 Components of Noise: –Net Noise: inherent variability in net state –Sharing Noise: inappropriate sharing of measurements between hosts (i.e., modem and LAN users) –Temporal Noise: using old out-of-date measurements to indicate current performance Shared measurements add Sharing Noise, Passive measurements add Temporal Noise Noise decreases confidence in results Noise 200 kbits/sec kbits/sec +

Challenges of SPAND How much Net/Sharing/Temporal Noise? –Net Noise: order of mag (2-4x) differences –Sharing Noise: very small additional differences –Temporal Noise: small additional differences for short time scales (i.e., < 1 hour) Experiments in paper quantify in detail 200 kbits/sec Network Noise kbits/sec + Temporal Noise + Sharing Noise +