Scribd
Upload
83 views22 pages

Analyzing Poisson Traffic: Lab-Experiment # 04 by Engr. Naveed A. Umrani

This document analyzes Poisson traffic through a lab experiment. It introduces Poisson traffic and queueing theory concepts. The purpose is to generate vectors representing the number of bytes arriving in periods of 100ms and 10ms, starting at random times, based on a data file of packet arrival times and sizes following a Poisson process. Fundamental concepts like the Poisson process properties and the M/M/1 queue are discussed. Simulation results show the number of bytes in periods of 1 second plotted in a bar graph.

Uploaded by

Mehboob Khokhar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
83 views22 pages

Analyzing Poisson Traffic: Lab-Experiment # 04 by Engr. Naveed A. Umrani

This document analyzes Poisson traffic through a lab experiment. It introduces Poisson traffic and queueing theory concepts. The purpose is to generate vectors representing the number of bytes arriving in periods of 100ms and 10ms, starting at random times, based on a data file of packet arrival times and sizes following a Poisson process. Fundamental concepts like the Poisson process properties and the M/M/1 queue are discussed. Simulation results show the number of bytes in periods of 1 second plotted in a bar graph.

Uploaded by

Mehboob Khokhar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

Analyzing Poisson Traffic

Lab-Experiment # 04 By Engr. Naveed A. Umrani

Outlines
Introduction To unit # 02

Purpose of this Lab


Fundamental Concepts Simulation and Results

Principles of Teletraffic Engineering

Introduction to Unit # 02
Unit No-02: Traffic Characterization

The purpose of this unit is to characterize various kinds of traffic, the various types of traffic are as follow: Poisson Traffic Compressed Video Traffic Ethernet Traffic The overall purpose is to analyze these different kinds of Traffic.
3 Principles of Teletraffic Engineering

Purpose of this lab


In

this lab we will study and compare the properties of network traffic. The traffic type considered will be: Poisson traffic In order to analyze Poisson Traffic we will require a Data file which is a named as poisson1.
4 Principles of Teletraffic Engineering

Fundamental Concepts
Basic Single Queue Model Classical queuing theory can be applied to an output link in a router.

Principles of Teletraffic Engineering

Fundamental Concepts
For example, a 56 kbps transmission

line can serve 1000-bit packets at a rate of


56,000 bits/sec 56 packets/sec 1000 bits/packet

Principles of Teletraffic Engineering

Fundamental Concepts
The Poisson Arrival Model A Poisson process is a sequence of events randomly spaced in time

Principles of Teletraffic Engineering

Fundamental Concepts
Examples

Customers arriving to a bank


Packets arriving to a buffer The rate of a Poisson process is the

average number of events per unit time (over a long time).

Principles of Teletraffic Engineering

Fundamental Concepts
Properties of a Poisson Process For a length of time t the probability of n arrivals in t units of time is

( t )n t Pn (t ) e n!

Principles of Teletraffic Engineering

Fundamental Concepts
For

2 disjoint (non-overlapping) intervals, (t1, t2) and (t3, t4), (i.e. t1 < t2 and t3 < t4), the number of arrivals in (t1, t2) is independent of the number of arrivals in (t3, t4).

10

Principles of Teletraffic Engineering

Fundamental Concepts
Interarrival Times of a Poisson Process Pick an arbitrary starting point in time (call it 0). 1 Let = the time until t the next arrival

P ( 1 t ) P0 (t ) e

F So (t ) P(
1

t t t ) 1 e and f ( t ) e 1 1

11

the time until the first arrival, Has an Principles of Teletraffic Engineering exponential distribution!

Fundamental Concepts
Let 2 = the length of time between the first

and second arrival. We can show that

P( 2 t | 1 s ) P( 2 t ) et for any s, t 0
1 of i.e. 2 is exponential and independent

Fundamental Concepts
1 The random variables
, are called the Interarrival times of the Poisson process The interarrival time random variables, 1 2 , , Are (pair-wise) independent. Each has an exponential distribution with mean 1/.

Fundamental Concepts
Queuing Notation
M/M/1 is a special case of more general (Kendall) notation: X/Y/m /k, where X is a symbol representing the Interarrival process M = Poisson (exponential Interarrival times, ) D = Deterministic (constant ). Y is a symbol representing the service distribution M = exponential, D = deterministic G = General (or arbitrary). m = number of servers k= k = number of buffer slots (omitted when )
Principles of Teletraffic Engineering


14

Fundamental Concepts
The M/M/1 Queue An M/M/1 queue has
Poisson arrivals (with rate ) Exponential service times (with mean 1/, so is

the service rate).

One (1) server


An infinite length buffer

The M/M/1 queue is the most basic and

important queuing model.

Simulation and Results


Important functions R = RANDOM(NAME,A,B,C) returns an array of random numbers from the named distribution that requires three parameter arrays A, B, and C. NAME can be one of:' normal', 'Poisson', 'rayleigh etc TEXTREAD Read formatted data from text file. A = TEXTREAD('FILENAME')

Simulation and Results


Generate a vector with 100 elements. Each

element stores the number of bytes from the Poisson trace (poisson1) that arrive in a time period of 1 second. 1st element: # bytes arriving in time period [0, 1 s]; 2nd element: # bytes arriving in time period [1, 2 s];
Principles of Teletraffic Engineering

17

Simulation and Results


[packet_no_p, time_p, packetsize_p] = textread('poisson1.data', '%f %f %f'); figure(1); jj=1;i=1; initial_p=0; ag_time=1000000; bytes_p=zeros(1,100); while time_p(jj)<=initial_p jj=jj+1;
18 Principles of Teletraffic Engineering

Simulation and Results


end while i<=100while ((time_p(jj)initial_p)<=ag_time*i && jj<length(packetsize_p)) bytes_p(i)=bytes_p(i)+packetsize_p(jj); jj=jj+1; End i=i+1; end bar(bytes_p);
19 Principles of Teletraffic Engineering

Simulation and Results


14 x 10
4

12

10

Size of the Packets

20

40 60 80 Spacing b/w the Packets

100

120

20

Principles of Teletraffic Engineering

Tasks
1. Generate a vector with 100 elements. Each

21

element stores the number of bytes from the Poisson trace that arrive in a time period of 100 milliseconds, beginning at a randomly selected start time. Pick a random starting point, e.g., time 30 s. 1st element: # bytes arriving in time period [30, 30.1 s]; 2nd element: # bytes arriving in time period [30.1, 30.2 s]; Principles of Teletraffic Engineering .

Tasks
2. Generate a vector with 100 elements. Each

element stores the number of bytes from the Poisson trace that arrive in a time period of 10 milliseconds, beginning at a randomly selected start time.
Pick a random starting point, e.g., time 50.2 s. 1st element: # bytes arriving in time period [50.2,

22

50.21 s]; 2nd element: # bytes arriving in time period [50.21, 50.22 s]; . %Hint: For Task1 and Task2, you only need to Principles of Teletraffic Engineering change 'initial_p', the initial time in microseconds,

You might also like