4,20

Probability and Queueing Theoty#. /Queueing Theory 4.21

12
/3 Model-1 (MIMII) : (mIFIFO) Model
(i.e.) MIMII infinite capacity model
This model represents a queueing system vhth single server, Potsson
irrivals,exponentialservice time and there is no Limiton the system
and so on. Finallywe get
capacityand the customersare served on a first in first out (or first
me first served) basis.
% for n -1,43
A l /12 ß 3
We assume that the arrival rate In = andg = g for all n
Since the events, the number of customers,
and — < 1
n = O, 1, 2, 3, in the systemare mutuallyexclusiveand
the probabilityof n customers Pn from formula (6) in 4.2.6 give
eA•raustive,
we have Pn = 1

loll _1

1011..41n_1
1+2
— < Il
The equations (6) and (T) are important because they are used
to derive characteristic of the followingqueueingmodels. V n 20
(i) (MIMII) : (ølFIFO)
43.1 Characteristics or parameters of Model I
(ii) (MIMIC) : (ølFIFO)
1. LS = average number of customers In the system
(iii) (MIMII) (KIFIFO) 2011 )

and (W) (MIMIC) : (KIFIFO) Let N be the random variable representing the numbcr of customers
in the queueing system.
vaiuesof N arc 0,. I, 2, 3...
 'Uls

Ittv'ó8

0
o

11 8

11

o
 we 4. 424

know Probability
eヨ
p
(N 一
0 2
Ⅳ一 ー
Ⅳ と 2
r) 「 2 0
”
一
3
p0
=
2 2
p
0
ョ
(N
Ⅳb
1
2 ・
2 『
) 2
00
Probability

十 2
十

「
十
0
ョ
0
2
十
3 and
一
1
2 十 0
一
= 4
0=
0=
f十
2
0 0
ミ

-
印 Independent
geneindependent
parameters
Now WS 「
【
一 0
一
、
ロ
コ
ぐ gven 0 P
es. in 「
「
ating 一
0
f 0 the8 Obability g
日
ロ
s. 日 that
pdf : の ヨ
0日 0
of
queue
に 一 80
(目 and 日
【
目 e 目 e there
WT (WT 8
and cti0
do do the 十
9一
《
d
の ・
負
ロ 日 generating
Of variables
ョ parameter
generating
each pdf コ pdf are be お ま の コ コ
8
日
variables CO f(w)コ the by
E 0日 0
0「 「 日
of
0 詩 8
「
一 e pleted
sum “ custo ス 一
u
十
ロ which
日 0 目 ロ コ
1. g fu 日且 w )
2
generating. of W 日 d e
) 一
0
C60 ロ
角 service
( e let WT 0 ・ “ コ
コ ( of
一 1
butio
ー ロ product 一0ロ eも 十 十 P 日 f a
1 the ー a c 房 ー the
of 08 一
) 【 一 )
ロ f 日 お
independen co 【 と
0
「
the
Of
目 each 日 rvice 0Y56ま 具 0 日 の
- & 一 e「 ー
ga s the 0 十 the 日
に 貸
三
日 ロ y 0ロ 日 0 コ
9
”
十
ma Which 【
e日 日
r目 望4「ーbu
e es. whendensitythe ー
伝
】 一一
1

0 【 「 ) ョ
0 w
d 日 the do a
一 0「 eロ 日 「
目 日 ロ
do e
「 is 【 the
一
bu 【 the 【 su ぐ ed do g 2n80日 日
ロ
he genera
日 日 お
with rve c
伝 ぐ
冐 (.一 一
0 日 ( 一
ル コ
ロ 0 4 0「 b一 日 d. 【
0 tabc. the
日 十 【 【
e 日 コ 一 90
【 e
b 只 一
mg he 究 b一 「 ( 0 0
) ワ
.
産 ? ?
 waiting time in the
4.26
e Probability and Queueing Theorye function of the [AU 2011)
density
17. Probability
the pdf off — queue and let g(w) be
w 20 waitingtime in the
be the
I proof : Let W function of W given
that there are
n +1 —pwwn the density
be
its pdf and g customers in the queue (apart
system or (n — 1)
the
' n customersin
Hcncc f (w) = •receiving
service)
from the one

¯
1 —A) (lw)n The g(w) = ) g

times, each of which is

Now g ¯ = pdf of sum of n serVice
exponentiallydistributed with parameter g.

mgfis 1 and the n sendce times are independent,

, w.20
mgf of their sum = product ofmgfs = I— which is the
Thus WT is an exponential random variable with parameterH —A.
m.g.fof the Erlang or gamma distribution with parameter and n.
6. Probability that the waiting time in the system exceedst j;
is P > t) w20
We knowP (WT>t) =

n pwwn-•l
•gov)

-0-1) t
4.28 o Probability
and Queueing Theory@ Theory
Oeueing

the queue given the customer

10. Average wafting time in
bas to watt is E

2!

8. Average waitingtime in the queueis Wq or idle system is

(l)The probabilityof an empty system
We know W = E (W)

i.e. P (idle system)

(ii) P (busy channel)

L, L
Little's formula : Relation between Ws, Wq,
We have proved.,
00
• e—(u —l)w
201-1) -1 (u-1) 2

(u -0 2
We have,
9. Average miting time in the system ws
Proof : Since the waiting time W in the system follows expÖnenti?-l
distribution with parameter —1, the mean waiting time W = 1
(iii)

These are known Little's formula.

 4.31
o e Queueing Theoryo
e Probabilityand Queueing 77teory

SU ARY
m 1 : In trains arrive at a
First find , then W = ws-
rate of 30 trains ppr day. Assume that the inter arrival time follows
and L = W can be found. exponentialdistribution and the service time distribution is also
onential with an average,of 36 minutes. Calculate the following
(i)/ the
"(fl) the probabilitythat the system .size is atleast 10.
erage length—o non-empty queue Lw = . ws If the input of trains increases to an average of 33 per day, what will
be the change in the above quantities ? [M.U 1990, A.U.2006J
Solution : Given mean arrival rate 1 = 30 per day
o bility that the length of the queue system 2K.
per minute
24 X 60t
5. P (Channel bus* = — and P (idle systemV PO

P (Waitingtime-in the system > t) — I — trains/minute

7. Probability density function ot waiting time i? the system is given Service time is exponential'.Gth mean equal
to 36 minutes.
by f (w) = (p —A)
per minute. mean = —l
S. Probability density function of waiting time in the queue is given
by g (w) Then
¯
¯ 144
36 144

Ws--z = 144—36= 108

(i) Average queue
size L

X 108 = 2.25
trains.

(N210)

10

(0.75) 10
4.32
o Probabilityand Queueing
Theory. Queueing o 4.33
If the input increases to
33 trains per day, then
Change in probability = 0.146- 0.056
33 11
24 x •60 480 trains/minute = 0.09

and 2 : Customersarriveat a one-man barber-shop according to

= trains/minute poisson process with mean interval arrival time of 20 minutes.
fustomers spend an average of 15 minutes in tbe
an hour is used as unit. of dme, then
11
36 - 480 Wbat,is the probabilitythat a customer need not wait for a hair
_ 1440 _ 1440
40-33
is the expectednumber of customers in the barQhop
and in the queue
q =ws-L
(ili) How much time a customer to spepd in barber
1440 sup ?

"((iY)Find the average time that the customer spend in the queue.
1440 — 252 1188
(v What is the probabilitythat there will be more than 3 customers
in the system ?
11 1188
7 Solution: Model (MiM11) : (m IFIFO)
= 3.89 trains. If the arrival is poisson with rate A then the inter arrival is

Change in the size of the queue exponentialwith mean

= 389-225
= 1,64 trains Given perminute

Now P (N 10) 15 per minute

10
11 (i) Probability tb the
—x 36 system is idle is

10
33
- 0.146 = 0.25
20 20
ID
e
Theory the now of arrivals increase
how much should
By
34
N' for the phone. a second
booth ?
justify
60minutes, in order to Model
Now W
60
41—3/ (MIMII) : (ØI FIFO)
1 (
i' yie,Solution
• It is
12 minutes
shopis•f time
inter arrival
(ii) Expected number of customersin the queue and the barber Given mean

— per minute

= x 60 = custome
20
.25 customers —— 4 minutes
Mean service time

—Expected waiting time in the systemis Ws = 60 minutes

—per minute
(W) Average time customer spends in the queue is W = ws
= 60 — IS 45 minutes. 12
3Now —

15
= C3i64
Average number of persons waiting in the system is
a ple 3 : Arrivals at a telephone booth are consideredto be poisson Ls=ÄWs
an average time 12 minutes betweenone, arrival and the next.•
The length of telephone call is assumed to bé distributedexponentially"
with mean 4 Ininutes. 12 — 0.5 person

qa) (i) Find the average number of persons waitingin the system.$ (ii) Pr&ability of waiting in the
system
the —h at a person
has to wait in ghe qaeu± . P (channel is busy)
••i) Also estimate the fraction of the day when phone Millbe in?
use. [A.U.2004, 2000
12
at is the probability that it willstake more than 10 minutes'%-
for a person to wait and completebis call ?
(c The telephone will install a second booth (iii) P (Phone in
use) P (Phone is busy)
onnvinced that an arrival would expect to wait
at!east 3 mlncteÖ.±
4.36
e Probability and Queueing Theorj• M' Queueing Theoye 4.37
(b) A person takes more than
10 minutes to wait and completehis
call means that he is in the
queueing system for more than 10, the in ase in arrival should be atleast —
42
per minute.
minutes = P (WT > 10)
ple 4 : Customers arrive at a watch repair shop accordingto a
We know P t) = e Essonbrocess at a rate of one per every 10 minutes, and the service
{meis an exponential random variable with mean 8 minutes.
P (WT > 10) = e-(u-A) 10
j Find the averagenumber of customers L in the sb0k
- 10 m)Find the average time a customer spends in the shop Ws
12
(U)Find the average number of customers ih the queue L .
= = 0.1889 t is the robability at the server is idle ? (XU-2006)
(c) The second phone will be installedif E (W)
> 3 Solution: (MIMII) : I FIFO) model.
i.e.
Wenthat customer arrival is poisson process with
i.e. if rate per minute
10
i.e. if gnice time is exponential with mean 8 minutes

31
16 4

31 —per minute.
i.e. if •1 + —
16

Now,
i.e. if
16
8 - 10
i.e. if (i)Average number of customers in the shop is
Ls=AWs
i.e. if 10
(u)Averagetime a customer spends in the shop is
Hence rhe increase in arrival rate should be,.atleast = Ws 40 minutes
12

— per minute lüi)Now, w = 40—S -— 32

42
 4.39
Theory'
# Qucueing is for one hour.
d.38 •Probability and Queueing repair 3 machines, so charge
can
onehour he + 8)
cost = Rs. (48
Total
X 32 = 3.2
10

(iii) Average number of customers in the queue L 3.2 repairman :

6 per hour
(iv) Probability that the server is idle = PO= 1 —
time W
Average
= = 0.2
• 10
—hour
3
E ple : is to be hired to repair machineswhich
kdown at an average rate of 3 The breakdownfollow:
cost for 3 machines
poisson distribution. Non-productivetime of machines is considerat?•$ön-productive
to cost Rs. 16)peæ.bour. Two repairmen have been interviewed.
= Rs. 16
is slow but cheep while tbe other is fast and expensive.The•slo
repairman charges 8 per bour ayd be servicesmachinesat tbe- Repair charges = Ix 10 = Rs. 10
rate of 4 per demand' RS.10 per hour age
services at the averagerate_of6 r hour. Whichrepairman Total cost = 16 + 10 = Rs. 26
be hired ? (A.U.20091iÅf•Sincegost for fastman is less, . the fast repair man' should be
Solution Given breakdown rate is A = 3 per hour *aged.

Idle time cost Rs. 16 per hour. : At what average rate must a clerk at a supermarket
K. sÅöuldworkin order to ensure a probability of 0.90 that a
For slow repairman : customer
yillnot wail•longer than •12. mihutes ? It is
assumed that there is
Given average rate = 4 per hour. Gly arrive in a poisson fashion at
Breakdown time of machine = the
averagerate of IS. per hour. The
service by the clerk bas an
system pponential distribution.
[BDUJ
folution: MIMI 1 infinite
capacity type.
hr fren arrival rate •= 15 per hour
Non-productive cost per hour = Rs.16
15
Idle cost per hour for 3 machines= 16= Rs.48 60 per. minute.
ProbGbility
that a customer
Rcpair charges per hour - Rs..8 not have to wait
minutes. is 0.90. longer than