Rice University, SPiN Group spin.rice.edu Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R.

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

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
Traffic Dynamics at a Commercial Backbone POP Nina Taft Sprint ATL Co-authors: Supratik Bhattacharyya, Jorjeta Jetcheva, Christophe Diot.
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
Modeling, Simulation and Measurements of Queuing Delay under Long-tail Internet Traffic Michele Garetto Politecnico di Torino, Italy Don Towsley University.
Playback-buffer Equalization for Streaming Media using Stateless Transport Prioritization Dan Tan, HPL, Palo Alto Weidong Cui, UC Berkeley John Apostolopoulos,
Aleksandar Kuzmanovic and Edward W. Knightly Rice Networks Group Measuring Service in Multi-Class Networks.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
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.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
Traffic Characterization Dr. Abdulaziz Almulhem. Almulhem©20012 Agenda Traffic characterization Switching techniques Internetworking, again.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Origins of Long Range Dependence Myths and Legends Aleksandar Kuzmanovic 01/08/2001.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Connection Admission Control Schemes for Self-Similar Traffic Yanping Wang Carey Williamson University of Saskatchewan.
Reduced TCP Window Size for Legacy LAN QoS Niko Färber July 26, 2000.
Investigating Forms of Simulating Web Traffic Yixin Hua Eswin Anzueto Computer Science Department Worcester Polytechnic Institute Worcester, MA.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Internet Traffic Management Prafull Suryawanshi Roll No - 04IT6008.
Draft-constantine-ippm-tcp-throughput-tm-02.txt 1 TCP Throughput Testing Methodology IETF 77 Anaheim Barry Constantine Reinhard.
Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi V. Ribeiro S. Sarvotham A. Keshavarz.
Self-Similarity of Network Traffic Presented by Wei Lu Supervised by Niclas Meier 05/
A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks João P. Hespanha University of Calif. Santa Barbara.
Traffic Modeling.
Internet Traffic Management. Basic Concept of Traffic Need of Traffic Management Measuring Traffic Traffic Control and Management Quality and Pricing.
Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi V. Ribeiro S. Sarvotham A. Keshavarz.
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.
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.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Multiscale Models for Network Traffic Vinay Ribeiro Rolf Riedi, Matt Crouse, Rich Baraniuk Dept. of Electrical Engineering Rice University (Houston, Texas)
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Self-generated Self-similar Traffic Péter Hága Péter Pollner Gábor Simon István Csabai Gábor Vattay.
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.
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.
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE-ACAM Transactions on Networking, 馬儀蔓.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
Doc.: IEEE /1317r0 Submission December 2009 Vinko Erceg, BroadcomSlide 1 Internet Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
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.
DoE SciDAC high-performance networking research project: INCITE INCITE.rice.edu 2004 Technical Challenges INCITE R. Baraniuk, E. Knightly, R. Nowak, R.
INCITE: Traffic Processing Techniques for Network Inference and Control Effort 1: Chirp Probing Objective : Reduced complexity, multiscale link models.
Risk Analysis Workshop April 14, 2004 HT, LRD and MF in teletraffic1 Heavy tails, long memory and multifractals in teletraffic modelling István Maricza.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
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.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
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.
Precision Measurements with the EVERGROW Traffic Observatory Péter Hága István Csabai.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
Notices of the AMS, September Internet traffic Standard Poisson models don’t capture long-range correlations. Poisson Measured “bursty” on all time.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
Queuing Analysis of Tree-Based LRD Traffic Models Vinay J. Ribeiro R. Riedi, M. Crouse, R. Baraniuk.
Measuring Service in Multi-Class Networks
Open Issues in Router Buffer Sizing
Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis
Richard Baraniuk Edward Knightly Robert Nowak Rolf Riedi
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

Rice University, SPiN Group spin.rice.edu Multiscale Traffic Processing Techniques for Network Inference and Control R. Baraniuk R. Nowak E. Knightly R. Riedi X. Wang V. Ribeiro S. Sarvotham Y. Tsang NMS PI meeting Baltimore April 2002 Signal Processing in Networking

Rice University, SPiN Group spin.rice.edu Chirp Probing Effort 1

Rice University, SPiN Group spin.rice.edu Objective : Reduced complexity, multiscale link models with known accuracy Innovative Ideas Multifractal analysis Multiplicative modeling Multiscale queuing Chirps for probing Impact Congestion control Workload balancing at servers Dynamical streaming Pricing on connection basis

Rice University, SPiN Group spin.rice.edu Chirp Probe Cross-Traffic Inference

Rice University, SPiN Group spin.rice.edu New Ideas Probing multiple hops Chirp-Sandwiches to probe routers “down the path” IP-tunneling Monitor packets at intermediate point of path Verification for Chirping and Sandwiches Network calculus (max-plus algebra) Probing buffer at core router Passive inference

Rice University, SPiN Group spin.rice.edu Tech Transfer -Stanford (SLAC) Chirps in PingER as freeware for monitoring -C+ code for sending Chirp Probes -10 Msec precision -Visualization tools for link properties IP tunneling -Infrastructure at Rice ready -CAIDA (chirping as a monitoring tool) -UC Riverside (Demystify Self-similarity) -Sprint Labs (queue-sizes at core routers)

Rice University, SPiN Group spin.rice.edu Connection-level Analysis and Modeling of Network Traffic Effort 2

Rice University, SPiN Group spin.rice.edu Aggregate Traffic at small scales Trace: –Time stamped headers Large scales –Gaussian –LRD (high variability) Small scales –Non-Gaussian –Positive process –Burstiness Objective : –Origins of bursts Auckland Gateway (2000) Aggregate Bytes per time Gaussian: 1% Real traffic: 3% Kurtosis - Gaussian : 3 - Real traffic: 5.8 Mean 99% Gaussian: 1% Real traffic: 3%

Rice University, SPiN Group spin.rice.edu ON/OFF model –Superposition of sources –Connection level model Explains large scale variability: –LRD, Gaussian –Cause: Costumers –Heavy tailed file sizes !! Bursts in the ON/OFF framework Small scale bursts: – Non-Gaussianity – Conspiracy of sources ?? – Flash crowds ?? (dramatic increase of active sources)

Rice University, SPiN Group spin.rice.edu Non-Gaussianity: A Conspiracy? The number of active connections is close to Gaussian; provides no indication of bursts in the load Indication for: - No conspiracy of sources - No flash crowds Load: Bytes per 500 ms Number of active connections Mean 99% Mean 99%

Rice University, SPiN Group spin.rice.edu Non-Gaussianity: a case study Typical bursty arrival (500 ms time slot) Typical Gaussian arrival (500 ms time slot) Histogram of load offered in same time bin per connection: Considerable balanced “field” of connections 10 Kb Histogram of load offered in same time bin per connection: One connection dominates 150 Kb 15 Kb

Rice University, SPiN Group spin.rice.edu Non-Gaussianity and Dominance Systematic study: time series separation For each bin of 500 ms: remove packets of the ONE strongest connection Leaves “Gaussian” residual traffic Overall traffic Residual traffic1 Strongest connection = + Mean 99%

Rice University, SPiN Group spin.rice.edu Separation on Connection Level Definition: Alpha connections: Peak rate > mean arrival rate + 1 std dev Beta connections: Residual traffic C+ analyzer (order of sec) Separation is more efficient (less accurate) using multi-scale analysis

Rice University, SPiN Group spin.rice.edu Beta Traffic Component Constitutes main load Governs LRD properties of overall traffic Is Gaussian at sufficient utilization (Kurtosis = 3) Is well matched by ON/OFF model Beta traffic Variance time plot Mean 99% Traffic percentile: 1% Recall: beta = non-dominating Histogram of Beta traffic Beta Traffic Kurtosis 3.4 Number of connections = ON/OFF Mean 99%

Rice University, SPiN Group spin.rice.edu Origins of Alpha Traffic Mostly TCP (flow & congestion controlled). HTTP, SMTP, NNTP, etc. Alpha connections tend to have the same source- destination IP addresses. Any large volume connection with the same e2e IP addresses as an alpha connection is also alpha.  Systematic cause of alpha: Large file transfers over high bandwidth e2e paths.

Rice University, SPiN Group spin.rice.edu Simple Connection Taxonomy This is the only systematic reason Bursts arise from large transfers over fast links.

Rice University, SPiN Group spin.rice.edu Cwnd or RTT? Correlation coefficient=0.68 RTT has strong influence on bandwidth and dominance. peak-rate (Bps) 1/RTT (1/s) Correlation coefficient= peak-rate (Bps) cwnd (B) Colorado State University trace, 300,000 packets BetaAlphaBetaAlpha

Rice University, SPiN Group spin.rice.edu Examples of Alpha/Beta Connections Alpha connections burst because of short round trip time, not large TCP window

Modeling of Alpha Traffic ON/OFF model revisited: High variability in connection rates (RTTs) Low rate = betaHigh rate = alpha fractional Gaussian noise stable Levy noise + = + + =

Modeling of Alpha Traffic ON/OFF model revisited: High variability in connection rates (RTTs) Low rate = betaHigh rate = alpha fractional Gaussian noisestable Levy noise

Rice University, SPiN Group spin.rice.edu

Impact: Simulation Simulation: ns topology to include alpha links Simple: equal bandwidth Realistic: heterogeneous end-to-end bandwidth Congestion control Design and management

Rice University, SPiN Group spin.rice.edu Impact: Performance Beta Traffic rules the small Queues Alpha Traffic causes the large Queue-sizes (despite small Window Size) All Alpha PacketsQueue-size with Alpha Peaks

Rice University, SPiN Group spin.rice.edu Multiscale Nature of Traffic LRD –Large time scales –approx. Gaussian –Client behavior –Bandwidth over Buffer Multifractal – Small time scale – Mixture Gaussian - Stable – Network topology – Control at Connection level Structure: Multiplicative Additive packet scheduling session lifetime network management round-trip time < 1 msec msec-secminuteshours

Rice University, SPiN Group spin.rice.edu Ongoing Work Versatile efficient additive/multiplicative models (fast synthesis, meaning of model parameters) Impact of Alpha traffic on Performance Goal: Obtain performance parameters directly from network and user specifications Monitoring tool for network load (freeware) using chirps (Caida, SLAC) Verification/”internal” measurements using IP-tunneling

Rice University, SPiN Group spin.rice.edu Summary Alpha traffic ( peak rate > burst threshold) –Few connections. Responsible for bursts –Origin: Large transfer over high bandwidth paths –High bandwidth from short RTT Beta traffic (residual) : –Main load. Responsible for LRD –Origin: Crowd with limited bandwidth –Gaussian at sufficient utilization Connection level analysis: parameter estimation drastically simplifies using multi-scale analysis Statistical modeling: requires novel multi-scale models (mixtures of additive and multiplicative trees)