PROJECT REPORT

QUEUING OF NETWORK
PACKETS










INTRODUCTION TO QUEUING THEORY
Queuing theory is the mathematical analysis of queues and waiting times in
stochastic systems. Queues arise when the short term demand for service
exceeds the capacity

DEFINITIONS
(Bose) the basic phenomenon of queueing arises whenever a shared
facility needs to be accessed for service by a large number of jobs or
customers.

(Wolff) The primary tool for studying these problems [of congestions] is
known as queueing theory.

(Kleinrock) We study the phenomena of standing, waiting, and serving,
and we call this study Queueing Theory." "Any system in which arrivals
place demands upon a finite capacity resource may be termed a queueing
system.

(Mathworld) The study of the waiting times, lengths, and other properties
of queues.

MODEL QUEUING SYSTEM



EXAMPLES


KENDALL NOTATION 1/2/3(/4/5/6)
Six parameters in shorthand. First three typically used, unless specified
1. Arrival Distribution
2. Service Distribution
3. Number of servers
4. Total Capacity (infinite if not specified)
5. Population Size (infinite)
6. Service Discipline (FCFS/FIFO)

DISTRIBUTIONS
M: stands for "Markovian", implying exponential distribution for service
times or inter-arrival times.
D: Deterministic (e.g. fixed constant)
E
k
: Erlang with parameter k
G: General (anything)

Example :
M/M/1:
Poisson arrivals and exponential service, 1 server, infinite capacity and
population, FCFS (FIFO)
the simplest realistic queue
POISSON PROCESS
For a poisson process with average arrival rate , the probability of seeing n arrivals
in time interval delta t








POISSON PROCESS & EXPONENTIAL DISTRIBUTION
Inter-arrival time t (time between arrivals) in a Poisson process follows
exponential distribution with parameter .







0 ... ) 2 Pr(
) 1 Pr( ) ( ...]
! 2
) (
1 [ ) 1 Pr(
1 ) 0 Pr( ) ( 1 ...
! 2
) (
1 ) 0 Pr(
) (
!
) (
) Pr(
2
2
= = >=
A = A + A =
A
+ A A = A =
A = A + A =
A
+ A = =
A =
A
=
A
A
A
t t o t
t
t t te
t t o t
t
t e
t n E
n
t e
n
t
t
n t

1
) (
) Pr(
=
=

t E
e t
t
M/M/1 QUEUE MODEL



ANALYSIS OF M/M/1 QUEUE
Given:
l : Arrival rate of jobs (packets on input link)
m : Service rate of the server (output link)
Solve:
L: average number in queuing system
L
q
average number in the queue


W: average waiting time in whole system
W
q
average waiting time in the queue

SOLVING QUEUING SYSTEMS
4 unknowns: L, L
q
, W, W
q

Relationships:
L = l W
L
q
= l Wq (steady-state argument)
W = W
q
+ (1/m)
If we know any 1, can find the others
Finding L is hard or easy depending on the type of system. In general:



Equilibrium conditions






0

=
=
n
n
nP L
1 1
1 0
) (
+
+ = +
=
n n n
P P P
P P


Solving for P
0
and P
n

Step 1 :


Step 2 :



Step 3 :



Step 4 :



Solving for L





0 , 0
2
2 0 1
, P P P P P P
n
n
|
|
.
|

\
|
=
|
|
.
|

\
|
= =

=

=

=
|
|
.
|

\
|
= =
|
|
.
|

\
|
=
0
0
0 0
0
1
, 1 , 1
n
n
n
n
n
n
P P then P

{ } 1
1
1
1
1
,
0 0
<

= =
|
|
.
|

\
|
=


=

= n
n
n
n
then

( ) 1 and 1

1
0
0
= = =

=
n
n
n
n
P P

0

=
=
n
n
nP L
) 1 (
0

=
=
n
n
n ) 1 (
1
1

=
n
n
n
( )



=
1
1
) 1 (
d
d
|
.
|

\
|

=0
) 1 (
n
n
d
d


( )
2
) 1 (
1
) 1 (

= =
) 1 (
Solving W, W
q
and L
q





















( )( )

= = =
1 1 L
W
( ) ( )
) (
1 1

= = =W W
q
) ( ) (
2






= = =
q q
W L
PROBLEM
On a network gateway, measurements show that the packets arrive at a mean
rate of 125 packets per second (pps) and the gateway takes about 2 millisecs to
forward them. Assuming an M/M/1 model and exponential arrivals we have to
find:
The gateways utilization.
The probability of n packets in the gateway.
Mean number of packets in the gateway/
The number of buffers so that P(overflow) is <10
-6
.


SOLUTION
Arrival rate, = 125 pps
Service rate, = 1/0.002 = 500 pps
Gateways utilization, = / = 0.25
Prob. of n packets in gateway =

Mean number of packets in gateway =


Probability of buffer overflow = P (more than 13 packets in gateway)
=
13
= 0.25
13
= 1.49x10
-8

= 15 packets per billion packets

To limit the probability of loss to less than 10
-6
:


or

= 9.96



n n
) 25 . 0 ( 75 . 0 ) 1 ( =
33 . 0
57 . 0
25 . 0
1

= =

6
10

s
n
( ) ( ) 25 . 0 log / 10 log
6
> n
APPLICATIONS OF QUEUING THEORY
Checkout line in a supermarket
Waiting for a teller in a bank
Batch jobs waiting to be processed by the CPU
Telecommunications
Traffic control
Determining the sequence of computer operations
Predicting computer performance
Health services (eg. control of hospital bed assignments)
Airport traffic, airline ticket sales
Layout of manufacturing systems.







BIBLIOGRAPHY AND REFERENCES
These are the following links which have assisted me at each and
every step in completing this project: -

1. www.scribd.com
2. www.wikipedia.com
3. www.answers.com
4. www.askme.com
5. www.slideshare.net

Instead of these useful websites, following books were also helpful :
1. Operations Research (Hamdy. A Taha)
2. Introduction to Operations Research (Hiller & Libermann)