Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi V. Ribeiro S. Sarvotham A. Keshavarz.

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

Helping TCP Work at Gbps Cheng Jin the FAST project at Caltech
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
Edge-based Network Modeling and Inference
Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts control and improve performance detect changes of network state.
pathChirp Efficient Available Bandwidth Estimation
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
Cheng Jin David Wei Steven Low FAST TCP: design and experiments.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Modeling, Simulation and Measurements of Queuing Delay under Long-tail Internet Traffic Michele Garetto Politecnico di Torino, Italy Don Towsley University.
Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.
CUBIC : A New TCP-Friendly High-Speed TCP Variant Injong Rhee, Lisong Xu Member, IEEE v 0.2.
CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
TCP Stability and Resource Allocation: Part II. Issues with TCP Round-trip bias Instability under large bandwidth-delay product Transient performance.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
Metrics for Performance Evaluation Nelson Fonseca State University of Campinas.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
TCP Congestion Control
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi V. Ribeiro S. Sarvotham A. Keshavarz.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Sharing Information across Congestion Windows CSE222A Project Presentation March 15, 2005 Apurva Sharma.
Multiscale Traffic Processing Techniques for Network Inference and Control Richard Baraniuk Edward Knightly Robert Nowak Rolf Riedi Rice University INCITE.
Comparison of Public End-to-End Bandwidth Estimation tools on High-Speed Links Alok Shriram, Margaret Murray, Young Hyun, Nevil Brownlee, Andre Broido,
DoE SciDAC high-performance networking research project: INCITE INCITE.rice.edu 2004 Technical Challenges INCITE R. Baraniuk, E. Knightly, R. Nowak, R.
Interacting Network Elements: Chaos and Congestion Propagation Gábor Vattay Department of Physics of Complex Systems Eötvös University, Budapest, Hungary.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
1 Network Emulation Mihai Ivanovici Dr. Razvan Beuran Dr. Neil Davies.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Optimal Sampling Strategies for Multiscale Stochastic Processes Vinay Ribeiro Rolf Riedi, Rich Baraniuk (Rice University)
Hybrid Modeling of TCP Congestion Control João P. Hespanha, Stephan Bohacek, Katia Obraczka, Junsoo Lee University of Southern California.
PathChirp Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
Rice University, SPiN Group spin.rice.edu Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R.
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
Introduction Jiří Navrátil SLAC. Rice University Richard Baraniuk, Edward Knightly, Robert Nowak, Rudolf Riedi Xin Wang, Yolanda Tsang, Shriram Sarvotham,
Rice University, SPiN Group spin.rice.edu Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R.
Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
TCP Westwood: Efficient Transport for High-speed wired/wireless Networks 2008.
DoE SciDAC high-performance networking research project: INCITE INCITE.rice.edu 2004 Technical Challenges INCITE R. Baraniuk, E. Knightly, R. Nowak, R.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
INCITE: Traffic Processing Techniques for Network Inference and Control Effort 1: Chirp Probing Objective : Reduced complexity, multiscale link models.
Murari Sridharan Windows TCP/IP Networking, Microsoft Corp. (Collaborators: Kun Tan, Jingmin Song, MSRA & Qian Zhang, HKUST)
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
PathChirp & STAB Measuring Available Bandwidth and Locating Bottlenecks in Packet Networks Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University spin.rice.edu.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
Masaki Hirabaru (NICT) and Jin Tanaka (KDDI) Impact of Bottleneck Queue on Long Distant TCP Transfer August 25, 2005 NOC-Network Engineering Session Advanced.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
Impact of New CC on Cross Traffic
ECE 599: Multimedia Networking Thinh Nguyen
File Transfer Issues with TCP Acceleration with FileCatalyst
Richard Baraniuk Edward Knightly Robert Nowak Rolf Riedi
The Transport Layer Chapter 6.
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi V. Ribeiro S. Sarvotham A. Keshavarz R. King NMS PI meeting Monterey November 2004 SPiN Signal Processing in Networking

Rice University spin.rice.edu Spatio-Temporal Available Bandwidth Estimation On-line localization of the tight link in a path Effort 1

Rice University spin.rice.edu Key Definitions Available bandwidth: left-over capacity on link Tight link: link with least available bandwidth Goal: locate tight link in space and over time using end-to-end probing

Rice University spin.rice.edu Applications Network monitoring - locating hot spots Network aware applications - Server selection - Route selection Science: where do Internet tight links occur and why?

Rice University spin.rice.edu Methodology Path available bandwidth Sub-path available bandwidth Methodology: For m>tight link, A[1,m] remains constant

Rice University spin.rice.edu Packet Tailgating Packet train contains: –Large packets stressing, with m hops life time –Small packets tailgating, full life time Purpose: –Large packets “measure” bandwidth via their delay –Small packets transport this timing information to the receiver

Rice University spin.rice.edu Lite-probing: pathChirp real world tool –Queuing delay  cross traffic –Averaged excursions  available resources Light weight –Probe at various rates simultaneously …converges in a handful of RTTs Departure pattern Queuing against departure Methodology Number of chirps  12 chirps Real world experiments Estimation against true x-traffic Internet experiment

Rice University spin.rice.edu Bandwidth: a Probabilistic entity Available bandwidth depends on temporary congestion level of potential tight links UIUC – Rice Probability of being tight link Estimates taken 10 mins apart REAL WORLD EXPERIMENTS UIUC (J. Hou)– Rice Available sub-path bandwidth space time avail

Rice University spin.rice.edu STAB: Spatio Temporal available Bandwidth STAB detects new tight link and reduced available bandwidth around 250 secs into simulation ns2 Simulation setting: Double web farm in ns2 (420 clients, 40 servers) Estimate Truth

Rice University spin.rice.edu GUI: ease of configuration Running on windows Instrumental for distribution and transfer

Rice University spin.rice.edu GUI in action See Demo

Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts detect changes of network state Effort 2

Rice University spin.rice.edu Bursts and Dominance Connection level separation: –Detrimental bursts caused by the ONE strongest connection –….called Alpha connections Origin of Alpha: –High rate  today from small RTT (round trip time) –Not congestion controlled Beta connections: –All the rest –Well controlled Overall traffic Residual traffic Beta 1 Strongest connection Alpha = + Mean 99%

Rice University spin.rice.edu Burst Model Alpha traffic = High rate ON-OFF source –bottleneck at the receiver (TCP advertised window)  Rate determined by RTT –Current state of measured traffic Analysis: Queues will explode with TCP’s ability to achieve large rates (HSTCP, BIC) Beta (top) + Alpha Variable Service Rate Queue-tail Weibull (as for self-similar traffic) unless rate of alpha traffic larger than available bandwidth and duration of alpha ON period heavy tailed

Rice University spin.rice.edu Free parameters TotalAlphaBeta Duration - Rate Duration - Size Size - Rate X Beta users: rate determines file size Alpha users are “free”

Scheme RD: Rate Duration independent Scheme SD: Size Duration independent Scheme SR: Size Rate independent Total Alpha Beta Real Trace SIMULATION

Rice University spin.rice.edu Network-User Driven Traffic model Mixture fit of alpha-beta Alpha: free to choose files  RATE DISTRIBUTIONS Beta: patience factor  FILE SIZE DISTRIBUTIONS RAPID PERFORMANCE ASSESSMENT TCP Control: manages only BETA traffic effectively  Congestion and admission control Original trace (Bellcore) Alpha (SR) + Beta (RD)

Rice University spin.rice.edu Effort 3 Model based Protocols

Rice University spin.rice.edu Prediction and what if scenarios High-performance protocols pushed –HSTCP –STCP –XCP –FAST-TCP –BI-TCP RTT bias –alpha-beta differentiation between flows more pronounced for STCP and HSTCP (which have large RTT bias). Need for RTT-fair high-performance TCP

Rice University spin.rice.edu TCP Africa Hybrid  two modes –Fast mode: (absence of congestion) Rapid, opportunistic increase of window (rate) –Slow mode: (presence of congestion) Linear (slow) increase in congestion avoidance –Congestion inference: Current average RTT – minimal RTT (Vegas-type) Adaptive and Fair Rapid Increase Congestion Avoidance

Rice University spin.rice.edu TCP Africa Hybrid  two modes –Fast mode: (absence of congestion) Rapid, opportunistic increase of window (rate) –Slow mode: (presence of congestion) Linear (slow) increase in congestion avoidance –Congestion inference: Current average RTT – minimal RTT (Vegas-type) Induces LOSSES infrequently (like Reno) Combines aggressiveness of HSTCP with reliability and low loss induction of Reno

Rice University spin.rice.edu RTT Fairness Against peers with different RTT HSTCP: low RTT overwhelms Africa: RTT bias is comparable to Reno

Rice University spin.rice.edu Safety Degrade performance of other flows …as compared to normal conditions ns2 sim: Reno over 100Mbps link …and with 1 Gbps HSTCP poor Africa acceptable HSTCP poor Africa acceptable

Rice University spin.rice.edu Impact and Transfer

Rice University spin.rice.edu Software STAB pathChirp Alpha-Beta decomposition User Interface on Windows (GUI) –80% completed Free, available at spin.rice.edu

Rice University spin.rice.edu Publications Enable transition to DoD contractors –Note and understand –Write own code IEEE Internet Computing Magazine –pathChirp and STAB Computer Networks –Special issue on LRD traffic –Alpha-Beta / Network-User driven traffic model IEEE Signal Processing –special issue on SPiN IEEE SP Magazine –Special issue on Complexity in Networking –Network modeling, MWM, role of multifractal scaling InfoCom 2005 –TCP Africa

Rice University spin.rice.edu Tech Transfer and Integration GUI: Pathchirp Running on Windows Raytheon: Doug Fowler discussing transitions pathChirp Sensor networks: Steve Beck (BAE Austin) Hitachi – David Diep makes pathChirp IPv4 and IPv6 compatible Computer Sciences Corporation (DoD contractor) –Steve Tsang uses MWM for DSN VoIP User Interface GridLab Project (Verstoep) – Deployed pathChirp for Grid computing measurements SPAWAR (consulted Phuong Nguyen) J9 (consulted Jasom Boyer) GaTech (Riley-Fujimoto) – On-line pathChirp inference in integrated demo to detect UDP storms UC Riverside (Faloutsos) – On-line Traffic estimation / demystify LRD UIUC (Hou) and ISI (Heidemann) – Integration of probing schemes into network – simulators JavaSim and ns-2 SLAC (Cottrell) – Large scale monitoring using pathChirp

Rice University spin.rice.edu Ongoing work pathChirp: chirp-web –Tight links on high speed networks –Anomaly detection through chirp-web : Network/user-driven traffic model –Through simulation and measurements assess impact of protocols, applications, clientele, end- host server –Parameters from network and user specifications High-speed protocols and congestion control –continue to integrate advanced modeling/probing techniques into new protocols