Queueing Notaton

Presented by
-Santoshi Illur
(2VX14MCA41)

David kendall

Queueing Notaton

Kendall proposed Queueing Notaton

Kendall's notation is the standard
system used to describe and classify a
queueing node.
D. G. Kendall proposed describing
queueing models using following factor
written A/S/c/K/N/D.

Where
A: The arrival process
S: The service time distribution
c: The number of servers
K: The number of places in the system
N: The calling population
D: The queue's discipline

Example:
M/M/1// indicates a single server
system that has unlimited queue
capacity and an infinite population of
potential arrivals.
The interarrival times and service
times are exponentially distributed.

When N and K are infinite, they may be

dropped from the notation.
Example, M/M/1 // is often shortened to
M/M/1.The nurse attending 5 hospital
patients might be represented by
M/M/1 /5/5.

Queueing Notation for parallel

Server System

THANK YOU....