1 2 3

Arriving at the BACK of

queue
Waiting in the queue
(Storage process)
Being served at the
FRONT of queue
Queuing theory is the mathematical study of
waiting lines, or queues.
Some performance factors :
a, Average waiting time in the queue system.
b, Expected number waiting or receiving ser-
vice.
c, Probability of encountering the system in
certain states (empty, full, having an avail-
able server or having to wait a certain time
to be served)
1
Four Queuing Disciplines
1. First in first out
One customer is served at a time.
Who is waiting the longest, will be served first.
2. Last in first out
One customer is served at a time.
Who is waiting the shortest, will be served first. (stack)
3. Processor sharing
Customers are served equally.
Network capacity is shared between customers.
They all effectively experience the same delay.
Ex : A shop has finite people (3) for serving customers although it has a waiting line, it can
still increase customer service time. (Vietcombank)
4. Priority
Customers with high priority are served first.
Ex : Korean Embassy has to serve Korean customers before serving Vietnamese customers
2
Queuing system Modeling.
1. Control processes within exchanges
A particular form of state equations : a Markov chain
Markov chain : model the system in each state.
2. Incoming traffic to queuing systems is modeled via
Poisson distribution
It is based on Erlands queuing theory assumptions
3
Erlangs queuing theory assumptions
Pure-chance traffic.
Call arrivals and departures are random and indepen-
dent events.
Statistical equilibrium.
Probabilities within the system do not change.
Full availability.
All incoming traffic can be routed to any other custom-
er within the network.
Congestion is cleared as soon as servers are free.
4
STACK LIFO (computing)
Last in, first out.
Three operations : Push Pop Stack top.
Push : add a new item to the top of stack.
Overflow state : if stack is full space.
Pop : remove an item from the top of stack.
Underflowstate : if stack is empty.
Stack top : get data from the top position and return that
data to user.
Underflow : can also happen if stack is empty.
The lowest element has the longest staying time.
5
Markov Chain
Undergoes transitions from one state to another in a
chainlike manner.
Three operations : Push Pop Stack top.
Push : add a new item to the top of stack.
Overflowstate : if stack is full space.
Pop : remove an item from the top of stack.
Underflowstate : if stack is empty.
Stack top : get data from the top position and return that data
to user.
Underflow : can also happen if stack is empty.
The lowest element has the longest staying time.
6
Poisson process, Exponential
distributions
Poisson probability distribution:
The observer records the number of events
that occur in a time interval of fixed length.
(Negative) Exponential probability distribution:
The observer records the length of time
interval between consecutive events
MEMORY-LESS
How many events occur in a fixed interval time
How long does an event happen before
transitions to the next event ?
POISSON
EXPONENTIAL
7
Poisson process
Poisson process: (a stochastic process)
Events occur continuously and independently of one another.
Ex : Radioactive decay of atoms, telephone calls arrival, page
view requests, rainfall.
Mathematics:
A collection of random variables
N(t) : number of events that have occurred up to time t (starting
from time 0)
The number of events between time a and time b is given as
N(b) N(a). This number of events has a Poisson distribution.
{ }
( ) : 0 N t t >
( )
( )..............
N a
N b

Non-negative
Integer-value
Non-decrease
8
Poisson process - Mathematics
Homogeneous
K : number of events occur in time interval (t, t+T).
Mathematics:
A collection of random variables
N(t) : number of events that have occurred up to time t (starting
from time 0)
The number of events between time a and time b is given as
N(b) N(a). This number of events has a Poisson distribution.
( )
( )
( ( ))
!
0,1,...,
k
e
P N t N t k
k
k

+ = = (

=
9
Queuing model notation.
Queuing model
A/B/S/K/N/D
A/B : arrival/service time distribution
S : number of servers
K : system capacity (infinite assumption)
N : calling population (infinite assumption)
D : service discipline (LIFO, FIFO, Processor Sharing, Priority)
Standard notions for distributions A or B:
M : a Markovian (poisson, exponential) distribution
E
K
: an Erlang distribution with k phases.
D : degenerate (deterministic) distribution (constant)
G : general distribution (arbitrary)
PH : a phase-type distribution
10
Queuing model
Construction & analysis.
Queuing models are used to represent the steady state of a queuing system.
Therefore, these are stochastic models that represent the probability that a
queuing system will be found in a particular configuration or state.
General procedure for construction and analyzing queuing models :
1. Identify the parameters of the system.
2. Identify the system states.
3. Draw a state-transition diagram
4. There is a balanced flow between states probabilities of being in
adjacent states can be related mathematically in terms of the arrival and
service rates and state probabilities.
5. Express all the state probabilities in terms of the empty state probability,
using the inter-state transition relationships.
6. Determine the empty state probability by using the fact that all state
probabilities always sum to 1.
11