Unit V Section 1

Queuing Theory
A queue (Q) or a waiting line is a group of units waiting for service in a system when
they arrive at a service channel that offers such facility. The basic features which characterize a
queue are
(1). The input
(2). The service mechanism
(3). Queue discipline
(4). Number of service channel.
The calling population is the population from which the Q is formed.
Waiting time in the Q is the time spent in the Q before being serviced.
Waiting time in the system is the time spent in the Q plus the time spent during service.
There are two types of state of the system.
i. Transient state: is one when its operating characteristics are dependent on time.
ii. Steady state: is one when its operating characteristics are independent of time.
The mean arrival rate denotes the mean number of arrivals per unit time. The mean
service rate, denoted by , is the mean number of units served per unit time.
The ratio =

denotes the traffic intensity and its unit of measurement is Erlang. It is also
known as Utilization factor.
If > 1

> 1
>
mean arrival rate > mean service rate
the system has settled down to steady state
If < 1

< 1
<
mean arrival rate < mean service rate
the number of units in the Q tends to increase indefinitely
Q Discipline:
FIFO (FCFS): First In First Out (First Come First Serve)
LIFO (FILO): Last in First Out (First in Last Out)
SIRO: Service in Random Order
Customers behavior:
a) Balking: The customer may not join the Q because the Q is too long or there is no
sufficient space to wait and he has no time to wait.
b) Reneging: Leaves the Q due to impatience.

c) Priority: When service is rendered on priority to a unit based on its importance or due to
some emergency/handicap, then the behavior is said to be priority.

d) Jockeying: When there are two or more Qs, the customer may move from one Q to the
other for his personal economic gains, that is jockey for position.

The Kendalls notation is generally used to describe a Q-structure. It consists of a 3 part
descriptor
(A/ B (G) / C): (D/E)
A denotes the unit arrival time distribution
B denotes the service time distribution
G is for an arbitrary (general) distribution for service time
C denotes the number of services channels available.
D denotes the capacity of the system.
M is used to denote the exponential/Markov distribution.
E denotes queue discipline
eg: (M/G/1) : (/FIFO) denotes a single channel queuing system having exponential inter arrival
time and arbitrary service time, infinite capacity and first in first out discipline.


To be continued..