An Empirical Evaluation of Wide-Area Internet Bottlenecks

Slides:



Advertisements
Similar presentations
Aditya Akella An Empirical Evaluation of Wide-Area Internet Bottlenecks Aditya Akella with Srinivasan Seshan and Anees Shaikh IMC 2003.
Advertisements

A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
1 Internet Path Inflation Xenofontas Dimitropoulos.
1 Modeling and Taming Parallel TCP on the Wide Area Network Dong Lu,Yi Qiao Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.
BGP Inefficiencies Supplemental slides 02/14/2007 Aditya Akella.
Measurement in the Internet. Outline Internet topology Bandwidth estimation Tomography Workload characterization Routing dynamics.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
Introduction 1-1 Lecture 3 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides.
Quantifying the Causes of Path Inflation Neil Spring, Ratul Mahajan, and Thomas Anderson Presented by Luv Kohli COMP November 24, 2003.
Issues with Inferring Internet Topological Attributes Lisa Amini ab, Anees Shaikh a, Henning Schulzrinne b a IBM T.J. Watson Research Center b Columbia.
Mar 1, 2004 Multi-path Routing CSE 525 Course Presentation Dhanashri Kelkar Department of Computer Science and Engineering OGI School of Science and Engineering.
Resilient Overlay Networks By David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT RON Paper from ACM Oct Advanced Operating.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
N. Hu (CMU)L. Li (Bell labs) Z. M. Mao. (U. Michigan) P. Steenkiste (CMU) J. Wang (AT&T) Infocom 2005 Presented By Mohammad Malli PhD student seminar Planete.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
© 2006 Andreas Haeberlen, MPI-SWS 1 Monarch: A Tool to Emulate Transport Protocol Flows over the Internet at Large Andreas Haeberlen MPI-SWS / Rice University.
June 11, 2002 Abilene Route Quality Control Initiative Aaron D. Britt Guy Almes Route Optimization.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Accelerating Peer-to-Peer Networks for Video Streaming
Lecture 13 – Network Mapping
Chapter 3 TCP and IP Chapter 3 TCP and IP.
Confluent vs. Splittable Flows
CS 3700 Networks and Distributed Systems
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Monitoring Persistently Congested Internet Links
Lec # 22 Data Communication Muhammad Waseem Iqbal.
CS 381 Introduction to computer networks
Content Distribution Networks
CS 5565 Network Architecture and Protocols
Aditya Akella Thesis Oral June 22, 2005
Empirically Characterizing the Buffer Behaviour of Real Devices
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
A Comparison of Overlay Routing and Multihoming Route Control
Rohit Kapoor, Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
CS590B/690B Detecting Network Interference
Measuring Service in Multi-Class Networks
ISP and Egress Path Selection for Multihomed Networks
Measured Impact of Crooked Traceroute
CS 4700 / CS 5700 Network Fundamentals
Department of Computer and IT Engineering University of Kurdistan
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
CS 3700 Networks and Distributed Systems
Inferring Queue Sizes in Access Networks by Active Measurement
AMP: A Better Multipath TCP for Data Center Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Ling-Jyh Chen, Mario Gerla Computer Science Department, UCLA
Inter-domain Routing Outline Homework #3 solutions
CS 3700 Networks and Distributed Systems
Measuring Load-Balanced Paths in the Internet
Backbone Networks Mike Freedman COS 461: Computer Networks
Modeling and Taming Parallel TCP on the Wide Area Network
Performance Evaluation of Computer Networks
BGP Interactions Jennifer Rexford
Performance Evaluation of Computer Networks
EE 122: Differentiated Services
pathChirp Efficient Available Bandwidth Estimation
A Comparison of Overlay Routing and Multihoming Route Control
Network Layer: Internet Inter-Domain Routing
pathChirp Efficient Available Bandwidth Estimation
Authors: Jinliang Fan and Mostafa H. Ammar
Research Issues in Middleware (Bhaskar)
Ram Dantu University of North Texas,
Ram Dantu University of North Texas,
Presentation transcript:

An Empirical Evaluation of Wide-Area Internet Bottlenecks Aditya Akella with Srinivasan Seshan and Anees Shaikh IMC 2003

Wide-Area Bottlenecks Internet Bottlenecks As access technology improves… Non-access or Wide-Area Bottlenecks? Last-mile, slow access links limit transfer bandwidth High-speed “core” Big, fat Pipe(s) Slow, flaky home connection 100Mbps home connection Most bottlenecks are last-mile

Outline Wide-area bottlenecks: definition Measurement methodology Measurement results Discussion of results and summary

Wide-Area Bottlenecks Wide-area bottleneck  where an unconstrained TCP flow sees delays and losses Not the “traditional” bottlenecks  may not be congested Link with the least available bandwidth Very Small ISP Very Small ISP Tiny ISP Unconstrained TCP flow Wide-Area Internet/ High-speed “core” Small ISP Small ISP Small ISP ATT Very Small ISP Sprint UUNet Small ISP Tiny ISP Tiny ISP Small ISP

Characteristics of Wide-Area Bottlenecks Location: Intra-ISP vs. Inter-ISP? Mostly peering links? Available bandwidth: How congested? Bottleneck in large ISPs vs. small ISPs Latency: Intra-POP vs. Inter-POP? Are long-haul links also congested? Small ISP Sprint ATT Small ISP Very Small ISP Tiny ISP UUNet

Outline Wide-area bottlenecks: Questions Measurement methodology Measurement results Discussion of results and summary

Measurement Methodology Ideal goal: measure all wide-area paths, identify bottlenecks The real world: 1. Choose small, representative set of paths Choosing appropriate sources Choosing appropriate destinations Goal: test many ISPs of various sizes 2. Probe these paths  “send traffic, see where queues build” Goal: accurately identify bottlenecks, bottleneck properties

Internet AS Hierarchy Can map size and “reach” of ISPs onto various levels of a 4-tier hierarchy [Subramanian02] Large regional providers Small regional providers tier-3 tier-3 tier-3 tier-3 tier-3 tier-3 tier-4 Large national providers tier-4 tier-2 tier-2 tier-2 tier-3 tier-2 tier-2 tier-1 tier-1 tier-4 tier-4 tier-4 tier-1 tier-1 Very large international providers tier-3 tier-3 tier-1 tier-1 tier-2 tier-2 tier-4 tier-4 tier-4 tier-4 tier-4 tier-4 tier-2 tier-3 tier-3 tier-4 tier-4

Choosing Sources 11 15 5 Sources: 1. Provider diversity 2. Geographic, diversity 3. High-speed connectivity 4. Ability to deploy our tools!  PlanetLab (26 nodes) Example: Provider diversity (26 planetlab sources) tier-3 tier-3 tier-3 tier-3 tier-3 tier-3 tier-4 tier-4 tier-2 tier-2 Tier-1 Tier-2 Tier-3 Tier-4 Total #unique providers 11 15 5 tier-2 tier-3 tier-2 tier-2 tier-1 tier-1 tier-4 tier-4 tier-4 tier-1 tier-1 tier-3 tier-3 tier-1 tier-1 tier-2 tier-2 tier-4 tier-4 tier-4 tier-4 tier-4 tier-4 tier-2 tier-3 tier-3 tier-4 tier-4

Choosing Destinations Destinations: 1. Probe ISPs of various sizes 2. Keep measurements feasible! Paths tested = 26 x 78 = 2028 tier-3 tier-3 tier-3 tier-3 ISPs probed (78 in all) tier-3 tier-3 tier-4 tier-4 tier-2 tier-2 tier-2 tier-3 Tier-1 Tier-2 Tier-3 Tier-4 Total #providers probes 20 18 25 15 Total #providers in Internet 129 897 971 tier-2 tier-2 tier-1 tier-1 tier-4 tier-4 tier-4 tier-1 tier-1 tier-3 tier-3 tier-1 tier-1 tier-2 tier-2 tier-4 tier-4 tier-4 tier-4 tier-4 tier-4 tier-2 tier-3 tier-3 tier-4 tier-4

Measurement Tool: BFind But no control over destination Emulate the whole process from the source! Ideally… source dest Monitor queues, identify where queues build up  bottleneck

Measurement Tool: BFind Round 1 Round 2 Round j Flag #2, keep curent rate for round j+1 force queueing Rate for round 2:1+d Mbps Rate for round 3: 1+2d Mbps 1Mbps Rate controlled UDP stream Round 2: No queueing! Round 1: No queueing! Round j: Queueing on #2! source dest Rounds of Traceroutes If #2 flagged too many times  quit. Identify #2 as bottleneck Report to UDP process Monitor links for queueing BFind functions like TCP: gradually increase send rate until hits bottleneck Can identify key properties of the bottleneck Location, latency, available bandwidth (== send rate of BFind before quitting) Single-ended control Quits after 180s and before send rate hits 50Mbps Bfind validation: wide-area experiments and simulations

Methodology: A Critique Route changes, multipath routing Could interfere with bottleneck identification However, effect not prevalent in measurements Router ICMP generation If high, could artificially inflate traceroute delays Govindan/Paxson show the delay is not high Other issues: Identification of peering links may have some error Route asymmetry could affect delay measurements Results are an empirical snap-shot Trade-off long-term characterization for scale

Outline Wide-area bottlenecks: Questions Measurement methodology Measurement results Discussion of results and summary

Results Found bottlenecks in 900 paths (out of 2028) ~45% of all paths >50% paths had >50Mbps capacity Bfind quit due to 180s limitation on 3% of paths

%bottlenecks %all links %bottlenecks %all links Results: Location Intra-ISP links Inter-ISP links 49% 51% One of the two peering links with 50% chance %bottlenecks %all links %bottlenecks %all links Peering Link Probability of being the bottleneck = 0.25 Intra-ISP Link Tier 4 3% 1% Tier 3 9% 8% Tier 2 12% 13% Tier 1 25% 63% Tier 4 – 4, 3, 2, 1 14% 1% Tier 3 – 3, 2, 1 17% 3% Tier 2 – 2, 1 12% 4% Tier 1 – 1 8% 6% Probability of being the bottleneck = 0.125 One of the four non-peering links with 50% chance

%bottlenecks %all links %bottlenecks %all links Results: Latency Intra-ISP links Inter-ISP links %bottlenecks %all links %bottlenecks %all links High-latency 9% 10% Med-Latency 7% 8% Low-latency 33% 61% High-Latency 12% 1% Med-latency 9% Low-latency 30% 19% Low latency: L< 5ms Medium Latency: 5 ≤ L< 15ms High Latency: L ≥ 15ms

Results: Available Bandwidth Intra-ISP links Inter-ISP links Tier-1 ISPs are the best Tier-3 ISPs have slightly higher available bandwidth than tier-2 Tier-1 –1 peering is the best Peering involving tiers-2,3 similar

Outline Wide-area bottlenecks: Questions Measurement methodology Measurement results Discussion of results and summary

Discussion ISP Selection ISP inter-domain traffic engineering Assumption: tier1  $$$, tier2  $$, tier3  $ Tier-1 providers are best option, provided $$$ Otherwise, probably better off buying connectivity from tier-3 ISP inter-domain traffic engineering ISPs can use information to select exit points into peer networks Also to decide where to deploy peering links and upgrade capacity BGP route selection Use information about prevalence of bottlenecks  much more effective than shortest AS hop Results useful to guide overlay node placement

Summary A classification of wide-area bottlenecks Ownership, latency, available bandwidth Quantify the likelihood of various wide-area links appearing as bottlenecks Add weight to conventional wisdom, mostly (e.g. tier-1 the best) A few surprises (e.g., 50-50 split between inter and intra-ISP links) Results useful to understand relative performance of ISPs of the various tiers of AS hierarchy

Read our paper… But not in the proceedings  Instead, go to… Figures are all messed up Instead, go to… http://www.cs.cmu.edu/~aditya/papers/widearea.pdf