Notices of the AMS, September 1998

Slides:



Advertisements
Similar presentations
Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts control and improve performance detect changes of network state.
Advertisements

Doc.: IEEE /1216r1 Submission November 2009 BroadcomSlide 1 Internet Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .
Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similarity in WAN Traffic A subsequent paper established the presence of network.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similar Network Traffic The original paper on network traffic self-similarity.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
An Analytical Model for Network Flow Analysis Ernesto Gomez, Yasha Karant, Keith Schubert Institute for Applied Supercomputing Department of Computer Science.
Modeling, Simulation and Measurements of Queuing Delay under Long-tail Internet Traffic Michele Garetto Politecnico di Torino, Italy Don Towsley University.
Network and Service Assurance Laboratory Analysis of self-similar Traffic Using Multiplexer & Demultiplexer Loaded with Heterogeneous ON/OFF Sources Huai.
2014 Examples of Traffic. Video Video Traffic (High Definition) –30 frames per second –Frame format: 1920x1080 pixels –24 bits per pixel  Required rate:
2  Something “feels the same” regardless of scale 4 What is that???
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
1 Self-Similar Wide Area Network Traffic Carey Williamson University of Calgary.
1 Self-Similar Ethernet LAN Traffic Carey Williamson University of Calgary.
CMPT 855Module Network Traffic Self-Similarity Carey Williamson Department of Computer Science University of Saskatchewan.
On the Self-Similar Nature of Ethernet Traffic - Leland, et. Al Presented by Sumitra Ganesh.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
Self-Similarity in Network Traffic Kevin Henkener 5/29/2002.
1 Interesting Links
CSE 561 – Traffic Models David Wetherall Spring 2000.
Origins of Long Range Dependence Myths and Legends Aleksandar Kuzmanovic 01/08/2001.
Estimating Congestion in TCP Traffic Stephan Bohacek and Boris Rozovskii University of Southern California Objective: Develop stochastic model of TCP Necessary.
Long Range Dependent Traffic and Leaky Buckets CS215-winter ’01 Demetrios Laios 3/22/2001.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
CS 6401 Network Traffic Characteristics Outline Motivation Self-similarity Ethernet traffic WAN traffic Web traffic.
Internet Traffic Modeling Poisson Model vs. Self-Similar Model By Srividhya Chandrasekaran Dept of CS University of Houston.
Self-Similar Traffic COMP5416 Advanced Network Technologies.
Self-Similarity of Network Traffic Presented by Wei Lu Supervised by Niclas Meier 05/
Applications of Poisson Process
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
References for M/G/1 Input Process
Exponential and Chi-Square Random Variables
COMPSAC'14 - N. Larrieu /07/ How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU COMPSAC – Vasteras – July the 23.
Interacting Network Elements: Chaos and Congestion Propagation Gábor Vattay Department of Physics of Complex Systems Eötvös University, Budapest, Hungary.
On Internet Traffic Dynamics and Internet Topology II Internet Model Validation Walter Willinger AT&T Labs-Research
Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
A Nonstationary Poisson View of Internet Traffic Thomas Karagiannis joint work with Mart Molle, Michalis Faloutsos, Andre Broido.
Burst Metric In packet-based networks Initial Considerations for IPPM burst metric Tuesday, March 21, 2006.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
Traffic ( ) Heavy tails (HT) in net traffic??? Careful measurements Appropriate statistics Connecting traffic to application behavior “optimal”
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
Risk Analysis Workshop April 14, 2004 HT, LRD and MF in teletraffic1 Heavy tails, long memory and multifractals in teletraffic modelling István Maricza.
Internet research Needs Better Models Sally Floyd, Eddie Kohler ISCI Center for Internet Research, Berkeley, California Presented by Max Podlesny.
1 Hailuoto Workshop A Statistician ’ s Adventures in Internetland J. S. Marron Department of Statistics and Operations Research University of North Carolina.
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
Notices of the AMS, September Internet traffic Standard Poisson models don’t capture long-range correlations. Poisson Measured “bursty” on all time.
1 Interesting Links. On the Self-Similar Nature of Ethernet Traffic Will E. Leland, Walter Willinger and Daniel V. Wilson BELLCORE Murad S. Taqqu BU Analysis.
Impact of New CC on Cross Traffic
Queuing Theory and Traffic Analysis
CMPE 252A: Computer Networks
Network Performance Measurement and Analysis
Load Balancing and Data centers
Internet Traffic Modeling
Interesting Links.
Minimal Envelopes.
CPSC 641: Network Measurement
Evaluation of Load Balancing Algorithms and Internet Traffic Modeling for Performance Analysis By Arthur L. Blais.
Queueing Theory Carey Williamson Department of Computer Science
Mark E. Crovella and Azer Bestavros Computer Science Dept,
Internet Research Needs a Critical Perspective Towards Models
Queueing Theory II.
Presented by Chun Zhang 2/14/2003
Network Traffic Modeling
Huang Kai Qi Zhengwei Liu Bo Shanghai Jiao Tong University.
Carey Williamson Department of Computer Science University of Calgary
CPSC 641: Network Measurement
CPSC 641: Network Traffic Self-Similarity
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

Notices of the AMS, September 1998

Poisson Measured Internet traffic Standard Poisson models don’t capture long-range correlations. “bursty” on all time scales

Fractal Measured Internet traffic Fractional Gaussian (fractal) noise models measurements well. Hurst parameter H is an aggregate measure of long-range correlations. “bursty” on all time scales

The “physics” of the Internet “Physicists use chaos to calm the web,” (Physics World, 2001) www.networkphysics.com Large literature in physics journals and recently in Science, Nature, etc…

The SOC (Self-Organized Criticality) view Links

Average Queue Links Flow “phase transition” capacity

Lattice without congestion control (?!?) “Critical” phase transition at max capacity At criticality: self-similar fluctuations, long tailed queues and latencies, 1/f time series, etc Flow capacity Average Queue

Alternative “edge of chaos” models Self-similarity due to chaos and independent of higher-layer characteristics

Why SOC/EOC/… models fail No “critical” traffic rate Self-similar scaling at all different rates TCP can be unstable and perhaps chaotic, but does not generate self-similar scaling Self-similar scaling occurs in all forms of traffic (TCP and nonTCP) Measured traffic is not consistent with these models Fractal and scale-free topology models are equally specious (for different reasons)

A network based explanation Underlying cause: If connections arrive randomly (in time) and if their size (# packets) have high variability (i.e. are heavy-tailed with infinite variance) then the aggregate traffic is perforce self-similar Evidence Coherent and mathematically rigorous framework Alternative measurements (e.g. TCP connections, IP flows) Alternative analysis (e.g. heavy-tailed property)

Web servers Heavy tailed web traffic p  s- Typical web traffic Heavy tailed web traffic  > 1.0 log(freq > size) p  s- log(file size) Is streamed out on the net. Creating fractal Gaussian internet traffic (Willinger,…) Web servers

creating long-range correlations with Is streamed onto the Internet Fat tail web traffic time creating long-range correlations with Is streamed onto the Internet

Heavy tails in networks? Heavy tails and divergent length scales are everywhere in networks. There is a large literature since 1994: Leland, Taqqu, Willinger, Wilson Paxson, Floyd Crovella, Bestavros Harchol-Balter,…

Piece of a consistent, rigorous theory with supporting measurements Typical web traffic Heavy tailed web traffic  > 1.0 log(freq > size) p  s- log(file size) Is streamed out on the net. Piece of a consistent, rigorous theory with supporting measurements Web servers