Minimal Envelopes.

Slides:



Advertisements
Similar presentations
Doc.: IEEE /1216r1 Submission November 2009 BroadcomSlide 1 Internet Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .
Advertisements

Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similar Network Traffic The original paper on network traffic self-similarity.
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
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???
1 LAN Traffic Measurements Carey Williamson Department of Computer Science University of Calgary.
An Empirical Study of Real Audio Traffic A. Mena and J. Heidemann USC/Information Sciences Institute In Proceedings of IEEE Infocom Tel-Aviv, Israel March.
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.
Networking Basics: A Review Carey Williamson iCORE Chair and Professor Department of Computer Science University of Calgary.
1 Interesting Links
Variance of Aggregated Web Traffic Robert Morris MIT Laboratory for Computer Science IEEE INFOCOM 2000’
Copyright © 2005 Department of Computer Science CPSC 641 Winter Network Traffic Measurement A focus of networking research for 20+ years Collect.
Copyright © 2005 Department of Computer Science CPSC 641 Winter LAN Traffic Measurements Some of the first network traffic measurement papers were.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
1 Networking Basics: A Review Carey Williamson iCORE Professor Department of Computer Science University of Calgary.
CS 6401 Network Traffic Characteristics Outline Motivation Self-similarity Ethernet traffic WAN traffic Web traffic.
Lin Yingpei (Huawei Technologies) doc.: IEEE /1438r0 Submission November 2013 Slide 1 Traffic Observation and Study on Virtual Desktop Infrastructure.
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
Traffic Modeling.
1 FARIMA(p,d,q) Model and Application n FARIMA Models -- fractional autoregressive integrated moving average n Generating FARIMA Processes n Traffic Modeling.
Some Networking Basics: LANs, WANs, Switching, and Multiplexing Carey Williamson Department of Computer Science University of Calgary.
Network Instruments VoIP Analysis. VoIP Basics  What is VoIP?  Packetized voice traffic sent over an IP network  Competes with other traffic on the.
COMPSAC'14 - N. Larrieu /07/ How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU COMPSAC – Vasteras – July the 23.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
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.
1 Apricot2001 Effectiveness of VLAN Chan Wai Kok Faculty of Information Technology Salim Beg Faculty of Engineering.
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.
Univ. of TehranComputer Network1 Computer Networks Computer Networks (Graduate level) University of Tehran Dept. of EE and Computer Engineering By: Dr.
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.
CS 5565 Network Architecture and Protocols
Fast Pattern-Based Throughput Prediction for TCP Bulk Transfers
Empirically Characterizing the Buffer Behaviour of Real Devices
Buffer Management in a Switch
LAN Risanuri Hidayat.
Internet Traffic Modeling
All Rights Reserved, copyright
Week 6: Traffic Models and QoS
Interesting Links.
CONGESTION CONTROL.
CPSC 641: Network Measurement
CPSC 641: LAN Measurement Carey Williamson
Quality of Service For Traffic Aggregates
Week 5: Traffic Models and QoS
Notices of the AMS, September 1998
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
CS Lecture 2 Network Performance
TexPoint fonts used in EMF.
Presented by Chun Zhang 2/14/2003
Networking Basics: A Review
Carey Williamson Department of Computer Science University of Calgary
L9: Intro Network Systems
Chapter-5 Traffic Engineering.
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:

Minimal Envelopes

Minimal Envelope Arrivals Cumulative Arrivals

Minimal Envelope 10 seconds Arrivals Cumulative Arrivals

Harry Potter: 30 minutes

Harry Potter Full Trace 10 seconds

Skype Voice Call: 6 minutes SVOPC encoding, one direction of 2-way call Dark blue: UDP traffic Light blue: TCP traffic

Skype Full trace 5 seconds

Internet Traffic: 10 Gbps link One data point is the traffic in one millisecond Trace extracted from CAIDA data trace. File: equinix-chicago.dirB.20110825-134100.UTC.anon.pcap

Internet Traffic: 10 Gbps link Full trace 1 ms

Data Traffic: “Bellcore Traces” Data measured on an Ethernet network at Bellcore Labs with 10Mbps Data measures total (aggregate) traffic of all transmissions on the network Measurements from 1989 One of the first systematic analyses of network measurements

Data Traffic: 100 seconds One data point is the traffic in 100 milliseconds Data is the 0-100 seconds from BC-pAug89.TL Bellcore data trace.

Packet arrivals: 200 milliseconds ECE 466

Distribution of time gap between packets Distribution of packet sizes Bellcore traces Distribution of time gap between packets Distribution of packet sizes

Some background on Lab 1

“Typical network traffic is not well described by Poisson model” Lab 1 Lab 1 is about comparing a simple model for network traffic (Poisson traffic) with actual network traffic (LAN traffic, video traffic) Lab 1 retraces one fo the most fundamental insights of networking research ever: “Typical network traffic is not well described by Poisson model”

Poisson In a Poisson process with rate l, the number of events in a time interval (t, t+t ], denoted by N(t+t) – N(t), is given by In a Poisson process with rate l, the time between events follows an exponential distribution:

In the Past… Before there were packet networks there was the circuit-switched telephone network Traffic modeling of telephone networks was the basis for initial network models Assumed Poisson arrival process of new calls Assumed Poisson call duration Source: Prof. P. Barford (edited)

… until early 1990’s Traffic modeling of packet networks also used Poisson Assumed Poisson arrival process for packets Assumed Exponential distribution for traffic Source: Prof. P. Barford (edited)

The measurement study that changed everything Bellcore Traces: In 1989, researchers at (Leland and Wilson) begin taking high resolution traffic traces at Bellcore Ethernet traffic from a large research lab 100 m sec time stamps Packet length, status, 60 bytes of data Mostly IP traffic (a little NFS) Four data sets over three year period Over 100 million packets in traces Traces considered representative of normal use The data in part 3 of Lab 1 is a subset of the actual measurements. Source: Prof. C. Williamson

That Changed Everything….. Extract from abstract Results were published in 1993 “On the Self-Similar Nature of Ethernet Traffic” Will E. Leland, Walter Willinger, Daniel V. Wilson, Murad S. Taqqu “We demonstrate that Ethernet local area network (LAN) traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal behavior, that such behavior has serious implications for the design, control, and analysis of high-speed…” That Changed Everything….. Source: Prof. V. Mishra, Columbia U. (edited)

Fractals Source: Prof. P. Barford, U. Wisconsin

Traffic at different time scales (Bellcore traces) bursty still bursty Source: Prof. P. Barford (edited)

Source: Prof. V. Mishra, Columbia U.

What is the observation? A Poisson process When observed on a fine time scale will appear bursty When aggregated on a coarse time scale will flatten (smooth) to white noise A Self-Similar (fractal) process When aggregated over wide range of time scales will maintain its bursty characteristic Source: Prof. C. Williamson ECE 466

Why do we care? For traffic with the same average, the probability of a buffer overflow of self-similar traffic is much higher than with Poisson traffic Costs of buffers (memory) are 1/3 the cost of a high-speed router ! When aggregating traffic from multiple sources, self-similar traffic becomes burstier, while Poisson traffic becomes smoother

Self-similarity The objective in Lab 1 is to observe self-similarity and obtain a sense. The challenge of Lab 1: The Bellcore trace for Part 4 contains 1,000,000 packets The computers in the lab are not happy with that many packets Reducing the number of packets in plots, may reduce opportunities to discover self-similarity effect