Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.

Slides:



Advertisements
Similar presentations
Router Internals CS 4251: Computer Networking II Nick Feamster Fall 2008.
Advertisements

Ningning HuCarnegie Mellon University1 Locating Internet Bottlenecks Ningning Hu (CMU) Li Erran Li (Bell Lab) Zhuoqing Morley Mao (U. Mich) Peter Steenkiste.
Ningning HuCarnegie Mellon University1 Improving TCP Startup Performance using Active Measurements Ningning Hu, Peter Steenkiste Carnegie Mellon University.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
1 Locating Internet Bottlenecks: Algorithms, Measurement, and Implications Ningning Hu (CMU) Li Erran Li (Bell Lab) Zhuoqing Morley Mao (U. Mich) Peter.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
User-level Internet Path Diagnosis Ratul Mahajan, Neil Spring, David Wetherall and Thomas Anderson Designed by Yao Zhao.
1 BGP Anomaly Detection in an ISP Jian Wu (U. Michigan) Z. Morley Mao (U. Michigan) Jennifer Rexford (Princeton) Jia Wang (AT&T Labs)
Detecting Traffic Differentiation in Backbone ISPs with NetPolice Ying Zhang Zhuoqing Morley Mao Ming Zhang.
1 Ossama Younis and Sonia Fahmy Department of Computer Sciences Purdue University For slides, technical report, and implementation, please see:
1 Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network Jian Wu (University of Michigan) Z. Morley Mao (University.
Traffic Engineering With Traditional IP Routing Protocols
University of Massachusetts at Amherst 1 Flooding Attacks by Exploiting Persistent Forwarding Loops Jianhong Xia, Lixin Gao and Teng Fei University of.
1 Modeling and Taming Parallel TCP on the Wide Area Network Dong Lu,Yi Qiao Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.
1 Controlling High Bandwidth Aggregates in the Network.
Introduction. Overview of Pushback. Architecture of router. Pushback mechanism. Conclusion. Pushback: Remedy for DDoS attack.
Effects and Implications of File Size/Service Time Correlation on Web Server Scheduling Policies Dong Lu* + Peter Dinda* Yi Qiao* Huanyuan Sheng* *Northwestern.
A Measurement Framework for Pin-Pointing Routing Changes Renata Teixeira (UC San Diego) with Jennifer Rexford (AT&T)
Monitoring Persistently Congested Internet Links Leiwen (Karl) Deng Aleksandar Kuzmanovic Northwestern University
Performance Optimization of VoIP Using an Overlay Network Raj Kumar Rajendran Samrat Ganguly Rauf Izmailov Dan Rubenstein Mentor(s): Project: Grid Networking.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
WBest: a Bandwidth Estimation Tool for IEEE Wireless Networks Presented by Feng Li Mingzhe Li, Mark Claypool, and.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
User-level Internet Path Diagnosis R. Mahajan, N. Spring, D. Wetherall and T. Anderson.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
SAVE: Source Address Validity Enforcement Jun Li, Jelena Mirković, Mengqiu Wang, Peter Reiher and Lixia Zhang UCLA USENIX Work-In Progress Session Washington.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
End-to-End Issues. Route Diversity  Load balancing o Per packet splitting o Per flow splitting  Spill over  Route change o Failure o policy  Route.
Presentation Date : 7 Sep Evaluation and Characterization of Available Bandwidth Probing Techniques Ningning Hu, Department of Computer Science,
Inline Path Characteristic Estimation to Improve TCP Performance in High Bandwidth-Delay Networks HIDEyuki Shimonishi Takayuki Hama Tutomu Murase Cesar.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.
A Machine Learning-based Approach for Estimating Available Bandwidth Ling-Jyh Chen 1, Cheng-Fu Chou 2 and Bo-Chun Wang 2 1 Academia Sinica 2 National Taiwan.
Tomo-gravity Yin ZhangMatthew Roughan Nick DuffieldAlbert Greenberg “A Northern NJ Research Lab” ACM.
Low-Rate TCP-Targeted DoS Attack Disrupts Internet Routing
On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
2005/10/211 A Survey on Physical Network Topology Estimation October 21, 2005 Chikayama-Taura Lab. Tatsuya Shirai.
On AS-Level Path Inference Jia Wang (AT&T Labs Research) Joint work with Z. Morley Mao (University of Michigan, Ann Arbor) Lili Qiu (University of Texas,
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
Detection of Routing Loops and Analysis of Its Causes Sue Moon Dept. of Computer Science KAIST Joint work with Urs Hengartner, Ashwin Sridharan, Richard.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
R-BGP: Staying Connected in a Connected World Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
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.)
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
BGP Routing Stability of Popular Destinations Jennifer Rexford, Jia Wang, Zhen Xiao, and Yin Zhang AT&T Labs—Research Florham Park, NJ All flaps are not.
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
1 Effective Diagnosis of Routing Disruptions from End Systems Ying Zhang Z. Morley Mao Ming Zhang.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
The Impact of False Sharing on Shared Congestion Management Srinivasa Aditya Akella Joint work with Srini Seshan and Hari Balakrishnan 28 Feb, 2001.
Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.
Aditya Akella The Impact of False Sharing on Shared Congestion Management Aditya Akella with Srinivasan Seshan and Hari Balakrishnan.
1 On the Impact of Route Monitor Selection Ying Zhang* Zheng Zhang # Z. Morley Mao* Y. Charlie Hu # Bruce M. Maggs ^ University of Michigan* Purdue University.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
BGP Routing Stability of Popular Destinations
Jian Wu (University of Michigan)
Avoiding traceroute anomalies with Paris Traceroute
Modeling and Taming Parallel TCP on the Wide Area Network
Presentation transcript:

Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley Mao (U. Mich) Peter Steenkiste (CMU) Jia Wang (AT&T)

Ningning HuCarnegie Mellon University2 Motivation Recent research progress on active probing makes it possible to locate bandwidth bottlenecks 1.How persistent are the Internet bottlenecks? Important for measurement frequency 2.What relationship exists between bottleneck and packet loss and queuing delay? Useful for congestion identification 3.Are bottlenecks shared by end users within the same prefix? Useful for path bandwidth inference 4.What causes intra-AS bottlenecks? Important for traffic engineering

Ningning HuCarnegie Mellon University3 Pathneck Bottleneck Bottleneck Link: the link with the smallest available bandwidth on a network path Bottleneck Router: the downstream router of a bottleneck link Pathneck An active probing tool that can detect Internet bottleneck location effectively and efficiently For details, please refer to “Locating Internet Bottlenecks: Algorithms, Measurements, and Implications” [SIGCOMM’04] Source code: Pathneck output used in this work Bottleneck link location Route

Ningning HuCarnegie Mellon University4 Data collection Probing Source: a CMU host Destinations: 960 diverse IP addresses 10 continuous probings for each destination (1.5 minutes) Repeat for 38 days (for persistence study) Limitations Pathneck can not cover the last hop 960 << # of Internet paths S D D D D D D D cmu 960 Internet Destinations Day-1 Day-2 Day-38 …

Ningning HuCarnegie Mellon University5 Outline 1.How persistent are the Internet bottlenecks? Route persistence Bottleneck persistence 2.What relationship is between bottleneck and packet loss and queuing delay? 3.Are bottlenecks shared by end users within the same prefix? 4.What causes intra-AS bottlenecks?

Ningning HuCarnegie Mellon University6 Terminology Consider both AS-level route and location- level route Day 1 Day 2 Day 3 Day 8 Day 4 Day 5 Day 6 Day 7 Day 9 probing set (persistent) probing not persistent

Ningning HuCarnegie Mellon University7 Route Persistence Route change is very common and must be considered for bottleneck persistence analysis Consistent with the results from Zhang, et. al. [IMW-01] on route persistence AS level Location level

Ningning HuCarnegie Mellon University8 Bottleneck Persistence Persistence of a bottleneck router Bottleneck Persistence of a path Max(Persist(R)) for all bottleneck router R Two views: 1.End-to-end view ― per (src, dst) pair Includes the impact of route change 2.Route-based view ― per route Removes the impact of route change Persist(R) = # of persistent probing sets R is bottleneck # of persistent probing sets R appears

Ningning HuCarnegie Mellon University9 Bottleneck Persistence 1.Bottleneck persistence in route-based view is higher than end-to-end view 2.AS-level bottleneck persistence is very similar to that from location level 3.20% bottlenecks have perfect persistence in end-to-end view, and 30% for route-based view

Ningning HuCarnegie Mellon University10 Outline 1.How persistent are the Internet bottlenecks? 2.What relationship exists between bottleneck and packet loss and queuing delay? 3.Are bottlenecks shared by end users within the same prefix? 4.What causes intra-AS bottlenecks?

Ningning HuCarnegie Mellon University11 Motivation Possible congestion indication Large queuing delay Packet loss Bottleneck They do not always occur together Packet scheduling algorithm  large queuing delay Traffic burstiness or RED  packet loss Small link capacity  bottleneck Bottleneck  ?  link loss | large link delay

Ningning HuCarnegie Mellon University12 Method Collected on the same set of 960 paths, but independent measurements 1.Detect bottleneck location using Pathneck 2.Detect loss location using Tulip Only use the forward path results 3.Detect link queuing delay using Tulip medianRTT – minRTT [ Tulip was developed in University of Washington, SOSP’03 ] Our analysis is based on the 382 paths for which both bottleneck location and packet loss are detected

Ningning HuCarnegie Mellon University13 Bottleneck  Packet Loss Perfectly correlated 30% |Dist| <= 2 60%

Ningning HuCarnegie Mellon University14 Bottleneck  Link Delay 3% non-bottlenecks have delay > 5ms 15% bottlenecks have delay > 5ms

Ningning HuCarnegie Mellon University15 More Results 1.How persistent are the Internet bottlenecks? 2.What relationship exists between bottleneck and packet loss and queuing delay? 3.Are bottlenecks shared by end users within the same prefix? 4.What causes intra-AS bottlenecks? There is not much sharing within common clusterWe observe clear correlation with link load, while observing no clear relationship with link capacity, router CPU load, and memory usage.

Ningning HuCarnegie Mellon University16 Related Work Persistence of Internet path properties Zhang [IMW-01], Paxson [TR-2000], Labovitz [TON-1998, Infocom-1999] Congestion points sharing Katabi [TR-2001], Rubenstein [Sigmetrics-2000] Correlation among Internet path properties Paxson [1996] Correlation between router and link properties Agarwal [PAM 2004]

Ningning HuCarnegie Mellon University17 Conclusion Only 20-30% Internet bottlenecks have perfect persistence Application should be ready for bottleneck location change Bottleneck locations have a fairly strong (60%) correlation with packet loss locations Bottleneck and loss detections should be used together for congestion detection End users within common cluster share bottlenecks only with a low probabilityh End user can not assume common bottlenecks We observe evidence of a correlation between bottleneck and link loads Network engineers should focus on traffic load to eliminate bottlenecks