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

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Network Layer Delivery Forwarding and Routing
Computer Networks TCP/IP Protocol Suite.
Impact of Background Traffic on Performance of High-speed TCPs
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
Network Monitoring System In CSTNET Long Chun China Science & Technology Network.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Multicast congestion control on many-to- many videoconferencing Xuan Zhang Network Research Center Tsinghua University, China.
Performance Evaluation Methodology & Key Technologies of New Generation Broadband Wireless Access Networking Zhiwei Gao Broadband Wireless Communication.
Improving Internet Availability with Path Splicing Nick Feamster Georgia Tech Joint work with Murtaza Motiwala and Santosh Vempala.
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Multihoming and Multi-path Routing
1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.
Skynet: A Cloud-Hopping Data Transfer Architecture Aleksandar Kuzmanovic
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 Introduction to Transportation Systems. 2 PART I: CONTEXT, CONCEPTS AND CHARACTERIZATI ON.
We need a common denominator to add these fractions.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Local Customization Chapter 2. Local Customization 2-2 Objectives Customization Considerations Types of Data Elements Location for Locally Defined Data.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.
Video Services over Software-Defined Networks
Lecture 11: Algorithms and Time Complexity I Discrete Mathematical Structures: Theory and Applications.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
1 Quality of Service Issues Network design and security Lecture 12.
ABC Technology Project
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
TCP Probe: A TCP with Built-in Path Capacity Estimation Anders Persson, Cesar Marcondes, Ling-Jyh Chen, Li Lao, M. Y. Sanadidi, Mario Gerla Computer Science.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Countering DoS Attacks with Stateless Multipath Overlays Presented by Yan Zhang.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
Chapter 20 Network Layer: Internet Protocol
Determining the Significant Aspects
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
1 Introduction to Network Layer Lesson 09 NETS2150/2850 School of Information Technologies.
RED-PD: RED with Preferential Dropping Ratul Mahajan Sally Floyd David Wetherall.
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Multihoming and Multi-path Routing CS 7260 Nick Feamster January
Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.
Week 1.
We will resume in: 25 Minutes.
On Individual and Aggregate TCP Performance Lili Qiu Yin Zhang Srinivasan Keshav Cornell University 7th International Conference on Network Protocols Toronto,
1 Understanding and Mitigating the Impact of RF Interference on Networks Ramki Gummadi (MIT), David Wetherall (UW) Ben Greenstein (IRS), Srinivasan.
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.
BGP Inefficiencies Supplemental slides 02/14/2007 Aditya Akella.
Measurement in the Internet. Outline Internet topology Bandwidth estimation Tomography Workload characterization Routing dynamics.
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.
Measurement in the Internet Measurement in the Internet Paul Barford University of Wisconsin - Madison Spring, 2001.
© 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.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Aditya Akella Thesis Oral June 22, 2005
A Comparison of Overlay Routing and Multihoming Route Control
An Empirical Evaluation of Wide-Area Internet Bottlenecks
A Comparison of Overlay Routing and Multihoming Route Control
Presentation transcript:

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

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

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

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

Aditya Akella 5 Small ISP Small ISP Sprint ATT Small ISP Very Small ISP Tiny ISP Small ISP Small ISP Tiny ISP Very Small ISP UUNet Small ISP Small ISP Small 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?

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

Aditya Akella 7 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

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

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

Aditya Akella 10 Choosing Destinations tier-1 tier-2 tier-4 tier-1 tier-2 tier-3 tier-2 tier-4 tier-3 tier-4 tier-1 tier-2 tier-3 tier-4 tier-2 Destinations: 1. Probe ISPs of various sizes 2. Keep measurements feasible! Tier-1Tier-2Tier-3Tier-4 Total #providers probes Total #providers in Internet ISPs probed (78 in all) Paths tested = 26 x 78 = 2028

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

Aditya Akella 12 Measurement Tool: BFind source dest Rate controlled UDP stream Rounds of Traceroutes Monitor links for queueing Report to UDP process 1Mbps Round j: Queueing on #2! Rate for round 2:1+ MbpsRate for round 3: 1+2 Mbps Flag #2, keep curent rate for round j+1 force queueing Round 1: No queueing! If #2 flagged too many times quit. Identify #2 as bottleneck Round 2: No queueing! Round 1 Round 2Round j 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

Aditya Akella 13 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

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

Aditya Akella 15 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

Aditya Akella 16 Results: Location Intra-ISP links Inter-ISP links Tier 43%1% Tier 39%8% Tier 212%13% Tier 125%63% Tier 4 – 4, 3, 2, 114%1% Tier 3 – 3, 2, 117%3% Tier 2 – 2, 112%4% Tier 1 – 18%6% %bottlenecks %all links 49% 51% Peering Link Intra-ISP Link One of the two peering links with 50% chance One of the four non-peering links with 50% chance Probability of being the bottleneck = 0.25 Probability of being the bottleneck = 0.125

Aditya Akella 17 Results: Latency Intra-ISP links Inter-ISP links High-latency9%10% Med-Latency7%8% Low-latency33%61% High-Latency12%1% Med-latency9%1% Low-latency30%19% %bottlenecks %all links Low latency: L < 5ms Medium Latency: 5 L< 15ms High Latency: L 15ms

Aditya Akella 18 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

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

Aditya Akella 20 Discussion ISP Selection 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

Aditya Akella 21 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., split between inter and intra-ISP links) Results useful to understand relative performance of ISPs of the various tiers of AS hierarchy

Aditya Akella 22 Read our paper… But not in the proceedings Figures are all messed up Instead, go to…

Aditya Akella 23 Why is this Study Useful? Carrier ISPs (AT&T) Traffic engineering Inter-domain End Networks (Yahoo!) ISP Selection Avoid bad ISPs Improve Performance Route control Good Bad Good peering location? ATT

Aditya Akella 24 Wide-Area Bottlenecks: Related Work Several studies tried to characterize typical flow performance Active measurements Path properties [Paxson], Detour [Savage] Look at factors that could impact typical performance Passive measurements Wide-area performance [Stemm], Origin of flow rates [Zhang] Focus on measuring typical performance Important differences with past work Focus not on true end-to-end paths or typical end-hosts Wide-area or non-access bottlenecks Well-connected, unconstrained hosts Focus not on eventual end-to-end performance Reasons for poor performance Location and properties of the bottlenecks