Monitoring Persistently Congested Internet Links Leiwen (Karl) Deng Aleksandar Kuzmanovic Northwestern University

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

pathChirp Efficient Available Bandwidth Estimation
A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
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.
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Aleksandar Kuzmanovic and Edward W. Knightly Rice Networks Group Measuring Service in Multi-Class Networks.
Path Optimization in Computer Networks Roman Ciloci.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
End-to-End Routing Behavior in the Internet Vern Paxson Presented by Zhichun Li.
CapProbe: A Simple and Accurate Capacity Estimation Technique Kapoor et al., SIGCOMM ‘04.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
Passive Inference of Path Correlation Lili Wang, James N. Griffioen, Kenneth L. Calvert, Sherlia Shi Laboratory for Advanced Networking University of Kentucky.
Traffic Engineering With Traditional IP Routing Protocols
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
1 Network Tomography Venkat Padmanabhan Lili Qiu MSR Tab Meeting 22 Oct 2001.
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
PAM A Measurement Study of Internet Delay Asymmetry Abhinav PathakPurdue University Himabindu PuchaPurdue University Ying ZhangUniversity of Michigan.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
1 End-to-End Detection of Shared Bottlenecks Sridhar Machiraju and Weidong Cui Sahara Winter Retreat 2003.
Network Tomography through End- End Multicast Measurements D. Towsley U. Massachusetts collaborators: R. Caceres, N. Duffield, F. Lo Presti (AT&T) T. Bu,
Measurement and Monitoring Nick Feamster Georgia Tech.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
Diagnosing Spatio-Temporal Internet Congestion Properties Leiwen Deng Aleksandar Kuzmanovic EECS Department Northwestern University
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
What Lies Beneath: Understanding Internet Congestion Leiwen Deng Aleksandar Kuzmanovic Northwestern University Bruce Davie, Cisco Systems
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.
Inline Path Characteristic Estimation to Improve TCP Performance in High Bandwidth-Delay Networks HIDEyuki Shimonishi Takayuki Hama Tutomu Murase Cesar.
Computer Science 1 Characterizing Link Properties Using “Loss-pairs” Jun Liu (joint work with Prof. Mark Crovella)
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
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.
Network Planète Chadi Barakat
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
1 Tomography with Available Bandwidth Alok Shriram Jasleen Kaur Department of Computer Science University of North Carolina at Chapel Hill The UNIVERSITY.
Measurement and Modeling of Packet Loss in the Internet Maya Yajnik.
1 Seminar / Summer Semester 2000 Internet Connectivity Christian A. Plattner,
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
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.
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.)
PathChirp Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
A Bandwidth Estimation Method for IP Version 6 Networks Marshall Crocker Department of Electrical and Computer Engineering Mississippi State University.
Rice University, SPiN Group spin.rice.edu Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R.
End-to-End Routing Behavior in the Internet Vern Paxson Presented by Sankalp Kohli and Patrick Wong.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
Measuring packet forwarding behavior in a production network Lars Landmark.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Monitoring Persistently Congested Internet Links
Monitoring Network Bias
Measuring Service in Multi-Class Networks
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
COS 561: Advanced Computer Networks
Congestion Control (from Chapter 05)
Lecture 26: Internet Topology CS 765: Complex Networks.
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
pathChirp Efficient Available Bandwidth Estimation
Congestion Control (from Chapter 05)
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

Monitoring Persistently Congested Internet Links Leiwen (Karl) Deng Aleksandar Kuzmanovic Northwestern University

Karl Deng Monitoring Persistently Congested Internet Links 2 Objective New probing methods that can improve measurement observability for core congestion Pong – a tool specialized in measuring a subset of non-edge links exhibiting repetitive congestion –Can reveal systematic problems such as routing pathologies, poorly-engineered network policies, or non-cooperative inter-AS relationships Lightweight: monitoring in addition to on- demand measuring –A building block of a large scale triggered monitoring system for Internet congestion

Karl Deng Monitoring Persistently Congested Internet Links 3 Repetitive Congestion We focus on locating and monitoring non-edge links that exhibit repetitive congestion –Queuing delay as congestion indicator –Queue building-up repetitively happens on time scales of one or more minutes.

Karl Deng Monitoring Persistently Congested Internet Links 4 Methodology Highlights Coordinated probing –Probe from both endpoints of a path –Combine end-to-end probes with (TTL limited) probes to intermediate routers Infer underlying path topology conditions –Implicit inference –Based on measured queuing delays on different probing paths Use statistics over longer time scales Quantify measurement accuracy –Link measurability score

Karl Deng Monitoring Persistently Congested Internet Links 5 SD Probe f s d b f (“forward”) probeb (“backward”) probe s (“source”) probe d (“destination”) probe,,, A Simplified Case – Symmetric Path Coordinated Probing

Karl Deng Monitoring Persistently Congested Internet Links 6 SD f s d b ΔfsΔfs ΔfdΔfd Half-path queuing delay Locating Congested Links Tracing Congestion Status Probe ΔdΔd ΔbΔb ΔfΔf ΔsΔs Coordinated Probing

Karl Deng Monitoring Persistently Congested Internet Links 7 Infer Underlying Path Topology Conditions SD f s d b Probe ΔdΔd ΔbΔb ΔfΔf ΔsΔs Condition: Δf +Δb ≈Δs +Δd Path Pattern: 4-p probing scenario

Karl Deng Monitoring Persistently Congested Internet Links 8 S D f s b d Observed by b probe only Paired d probe Congestion Pair up Fsd probing S D f s b No suitable d probes to pair up with this s probe Congestion Fsb probing Probing techniqueCondition 4-p probingΔf +Δb ≈Δs +Δd Δf ≈Δs +ΔdFsd probing Δs ≈Δf +ΔbFsb probing unconditional2-p probing S D f s b d Paired d probe Congestion 4-p probing Pair up ΔfsΔfs ΔfdΔfd Estimates of half-path queuing delay Probe Infer Underlying Path Topology Conditions

Karl Deng Monitoring Persistently Congested Internet Links 9 Probing technique Condition 4-p probing Fsd probing Fsb probing 2-p probing Δf +Δb ≈Δs +Δd Δf ≈Δs +Δd Δs ≈Δf +Δb unconditional max(Δf +Δb, Δs +Δd) QoM 4p = 1 − |(Δf +Δb) − (Δs +Δd)| max(Δf, Δs +Δd) QoM fsd = 1 − |(Δf − (Δs +Δd)| QoM fsb = 1 − |(Δs − (Δf +Δb)| max(Δs, Δf +Δb) Demote Promote (Last resort) Definition of QoM Select Probing Techniques Adjust probing technique online based on quality of measurability (QoM)

Karl Deng Monitoring Persistently Congested Internet Links 10 SD Probe ΔfsΔfs ΔfdΔfd ΔfsΔfs ΔfdΔfd ΔfsΔfs ΔfdΔfd ΔfsΔfs ΔfsΔfs ΔfdΔfd ΔfdΔfd Probe all nodes simultaneously Locating Congested Links Perform coordinated probing for all intermediate nodes

Karl Deng Monitoring Persistently Congested Internet Links 11 Correlate probes to neighboring nodes SD Probe Switch Point Approach Congested link is identified Congestion Locating Congested Links

Karl Deng Monitoring Persistently Congested Internet Links 12 SD Link C (Identified congested link) Link C Congestion Status Time Congestion Use fast rate end-to-end probing Tracing Congestion Status f f f f f f f f f f f f f f f

Karl Deng Monitoring Persistently Congested Internet Links s on/off 0.71s on/off 0.53s on/off 0.47s on/off0.83s on/off Topology: 12 nodes (PCs), 11 links Link: 100Mbps, 2ms Cross traffic: Each consists of 3 parallel TCP flows, 50% time on and 50% time off. Build multiple bottlenecks: Cross traffics are added to corresponding links concurrently. Emulab Experiment Example

Karl Deng Monitoring Persistently Congested Internet Links s on/off 0.71s on/off 0.53s on/off At the Beginning Emulab Experiment Example

Karl Deng Monitoring Persistently Congested Internet Links s on/off 0.71s on/off 0.53s on/off 0.47s on/off0.83s on/off After adding backward bottlenecks Emulab Experiment Example

Karl Deng Monitoring Persistently Congested Internet Links s on/off 0.71s on/off 0.53s on/off s on/off0.63s on/off After adding two more forward bottlenecks Emulab Experiment Example

Karl Deng Monitoring Persistently Congested Internet Links 17 Optimizing Pong in the Internet Set queuing delay threshold –Based on distribution of queuing delay samples Tune other parameters based on experiments on the PlanetLab Minimize measurement errors –Detect and react to anomalies (clock skews, router alterations, ICMP queuing, etc) –Use instantaneous quality of measurement value as sample weight Quantify measurement quality –Help select vantage points

Karl Deng Monitoring Persistently Congested Internet Links 18 Quantify Measurement Quality Help select vantage points Link measurability score 1.Probing technique and quality of measurability 2.Queuing delay threshold quality 3.Observability score Congestion observed on a less frequently congested link can be blurred by a much more frequently congested link on the same path.

Karl Deng Monitoring Persistently Congested Internet Links 19 Conclusion Pong – a tool specialized in measuring a subset of non-edge links exhibiting repetitive congestion Coordinated probing Infer underlying path topology conditions Select probing techniques online –Quality of measurability Quantify measurement quality –Link measurability score

Karl Deng Monitoring Persistently Congested Internet Links 20 Thank you! Questions?