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.

Slides:



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

Router Internals CS 4251: Computer Networking II Nick Feamster Fall 2008.
Ningning HuCarnegie Mellon University1 Locating Internet Bottlenecks Ningning Hu (CMU) Li Erran Li (Bell Lab) Zhuoqing Morley Mao (U. Mich) Peter Steenkiste.
A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Pathload A measurement tool for end-to-end available bandwidth Manish Jain, Univ-Delaware Constantinos Dovrolis, Univ-Delaware Sigcomm 02.
Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
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.
CS 408 Computer Networks Congestion Control (from Chapter 05)
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:
University of Massachusetts at Amherst 1 Flooding Attacks by Exploiting Persistent Forwarding Loops Jianhong Xia, Lixin Gao and Teng Fei University of.
1 A Suite of Schemes for User-level Network Diagnosis without Infrastructure Yao Zhao, Yan Chen Lab for Internet and Security Technology, Northwestern.
Monitoring Persistently Congested Internet Links Leiwen (Karl) Deng Aleksandar Kuzmanovic Northwestern University
WBest: a Bandwidth Estimation Tool for IEEE Wireless Networks Presented by Feng Li Mingzhe Li, Mark Claypool, and.
1 End-to-End Detection of Shared Bottlenecks Sridhar Machiraju and Weidong Cui Sahara Winter Retreat 2003.
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.
Bandwidth Measurements Jeng Lung WebTP Meeting 10/25/99.
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
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.
Detecting Shared Congestion of Flows Via End- to-end Measurement Dan Rubenstein Jim Kurose Don Towsley Computer Networks Research Group.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
IP-UDP-RTP Computer Networking (In Chap 3, 4, 7) 건국대학교 인터넷미디어공학부 임 창 훈.
IP/ICMP Translation Algorithm (IIT) Xing Li, Congxiao Bao, Fred Baker
1 ICMP – Using Ping and Trace CCNA Semester
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.
Internet Control Message Protocol ICMP. ICMP has two major purposes: –To report erroneous conditions –To diagnose network problems ICMP has two major.
Low-Rate TCP-Targeted DoS Attack Disrupts Internet Routing
Problem Statement Map of OSU Routers Gopi Krishna Tummala Rupam Kundu Graduate Students The Ohio State University.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 4. Active Monitoring Techniques.
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,
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
1 Flow Identification Assume you want to guarantee some type of quality of service (minimum bandwidth, maximum end-to-end delay) to a user Before you do.
1 Internet Control Message Protocol (ICMP) Used to send error and control messages. It is a necessary part of the TCP/IP suite. It is above the IP module.
CS4550 Computer Networks II IP : internet protocol, part 2 : packet formats, routing, routing tables, ICMP read feit chapter 6.
Internet Performance Measurements and Measurement Techniques Jim Kurose Department of Computer Science University of Massachusetts/Amherst
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,
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.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
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,
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
1 Effective Diagnosis of Routing Disruptions from End Systems Ying Zhang Z. Morley Mao Ming Zhang.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Proposal Presentation Inferring Geographic proximity of the Internet Node using a Compound Metric M. Kamran Nishat.
ECE 544 Protocol Design Project 2016 Chengyao Wen Hua Deng Xiaoyu Duan.
Aditya Akella The Impact of False Sharing on Shared Congestion Management Aditya Akella with Srinivasan Seshan and Hari Balakrishnan.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
© 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.
ROUTING.
Monitoring Persistently Congested Internet Links
Avoiding traceroute anomalies with Paris Traceroute
Detection of Routing Loops and Analysis of Its Causes
Network Core and QoS.
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Distributed Systems CS
An Empirical Evaluation of Wide-Area Internet Bottlenecks
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Network Core and QoS.
Distributed Systems CS
Presentation transcript:

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 Project A Measurement Study of Internet Bottlenecks

November 28, Goals Recently, many active probing tools have been developed for measuring and locating bandwidth bottlenecks, but Q1. How persistent are the Internet bottlenecks? –Important for measurement frequency Q2. Are bottlenecks shared by end users within the same prefix? –Useful for path bandwidth inference Q3. What relationship exists between bottleneck and packet loss and queuing delay? –Useful for congestion identification Q4. What relationship exists between bottleneck and router and link properties? –Important for traffic engineering

November 28, Related Work Persistence of Internet path properties –Zhang [IMW-01], Paxson [TR-2000], Labovitz [TON-1998, Infocom-1999] loss, delay, pkt ordering,.. The persistence of the bottleneck location does not considered Congestion points sharing –Katabi [TR-2001], Rubenstein [Sigmetrics-2000] Flows-based study and not e2e paths-based Correlation among Internet path properties –Paxson [1996] e2e level and not at the location level Correlation between router and link properties –Agarwal [PAM 2004]

November 28, Data collection Probing –Source: a CMU host –Destinations: 960 IP addresses –10 continuous probings for each destination (1.5 minutes) Repeat for 38 days (for persistence study) S D D D D D D D CMU 960 Internet Destinations Day-1 Day-2 Day-38 …

November 28, Pathneck An active probing tool that can detect Internet bottleneck location –For details, refer to “Locating Internet Bottlenecks: Algorithms, Measurements, and Implications” [SIGCOMM’04] –Source code: Pathneck characteristics –Low overhead (i.e., in order of 10s-100s KB) –Single-end control (sender only) Pathneck output used in this work –Bottleneck link location –Route

November 28, Recursive Packet Train (RPT) in Pathneck Load packets 60 pkts, 500 B TTL 255 measurement packets measurement packets 30 pkts, 60 B Load packets are used to measure available bandwidth Measurement packets are used to obtain location information UDP packets

November 28, Gap value RouterSender Packet train Time axis

November 28, RouterSender Drop m. packet Send ICMP Gap value

November 28, RouterSender Drop m. packet Send ICMP Recv ICMP Gap value

November 28, RouterSender Drop m. packet Send ICMP Recv ICMP Drop m. packet Send ICMP Gap value

November 28, RouterSender Drop m. packet Send ICMP Recv ICMP Drop m. packet Send ICMP Recv ICMP Gap value RPT probing is repeated 10 times for each pair of nodes

November 28, Terminology Persistent probing set is the probing set where all n probings follow the same route

November 28, 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 over 9 days

November 28, Bottleneck Persistence Persistence of a bottleneck R Bottleneck Persistence of a path Max(Persist(R)) for all bottlenecks 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

November 28, 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

November 28, Results summary Only 20-30% Internet bottlenecks have perfect persistence –Application should be ready for bottleneck location change Bottleneck locations have a strong (60%) correlation with packet loss locations (2 hops away) –Bottleneck and loss detections should be used together for congestion detection Only less than 10 % of the destinations in a prefix cluster share a bottleneck more than half of the time –End users can not assume common bottlenecks Bottleneck has no clear relationship with link capacity, router CPU load, and memory usage A clear correlation between bottlenecks and link loads –Network engineers should focus on traffic load to eliminate bottlenecks

November 28, Limitations Interesting study but.. How much the obtained statistics are representative for the whole Internet, since –the few sources used for probing are a CMU node, 8 Planetlab nodes, and 13 RON nodes –the number of probed destinations are 960 <<< # of Internet paths Pathneck limitations –Load pkts are larger than what the firewalls permit only forward the 60 byte UDP packets –Anyway, Pathneck is not able to measure the pkt train length on the last link due to ICMP rate limiting theoricaly, the destination must send a ‘destination port unreachable’ for each pkt

November 28, Thank you for your listening

November 28, Backup

November 28, Bottleneck vs. loss | delay 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

November 28, Trace 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 ] The analysis is based on the 382 paths for which both bottleneck location and packet loss are detected

November 28, Bottleneck  Packet Loss

November 28, Bottleneck  Queueing Delay