MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M.

MURALIDHARAN UNIT - IV 1

PROBABILITY & QUEUEING THEORY

UNIT – IV MARKOVIAN QUEUEING THEORY

A group of items waiting to receive service, including those receiving the service is
known as waiting line or a queue. The formation of queues is a common phenomenon which
occurs whenever the current demand for a service exceeds the current capacity to provide that
service. The queues of peoples may be seen at a cinema ticket window, bus stop, reservation
office, counters of super market, etc. The person waiting in a queue or receiving the service is
called the customer and the person by whom he is serviced is called a server.
Consider a network server which is connected with multiple number of terminals. When
each of the terminal gives a job to server like printing, executing, running, etc., all the works are
not done simultaneously. They are being done one by one. While one job is performed, if
another job arrives it is forced to wait. Thus a queue is formed. Our ultimate aim is to minimize
the waiting time of a job in the queue which can be done by increasing the server (subject to
economic conditions) or changing the queue discipline or priority
So, in general the waiting time of a job (customer) in a queue depends on the following criteria:
1. Arrival / inter arrival pattern (a)
2. Service / departure time pattern (b)
3. Number of servers (c)
4. Capacity of the system (d)
5. Queue discipline (e)
So the notation of a queue arises : (a / b / c) : (d / e)
In general, the arrival pattern is assumed as Poisson (which has Markov property) and service
time is exponential (which has Memoryless property)
In our discussions we study the following models
Model I : (M / M / 1) : (∞ / FIFO) – Single server, Infinite capacity
Model II : (M/ M/c or s) : (∞/FIFO) –Multi server (more than one server), Infinite capacity
Model III : (M / M / 1) : (K / FIFO) – Single server, Finite capacity
Model IV : (M/ M/c or s) : (K / FIFO) – Multi server (more than one server), Finite capacity
A queue means customers waiting for service. A system means customers waiting for service
and customers being served.
Our discussion is restricted to find steady state probabilities (po and pn) and four important
statistical averages. They are
Ls – Average number of customers in the system
Lq – Average number of customers waiting in queue
Ws – Average waiting time in the system (waiting time in queue + service time)
Wq – Average waiting time in the queue
Steps to solve the problem in Queueing Model
1. Read the question carefully and identify the model
2. Fix unit time [1 min. / 1 hour / 1 day / 1 week / 1 sec.]
3. Identify λ [number of customers arriving per unit time]
µ [number of customers served per unit time]
4. Find Po and write relation between Po and Pn
5. Answer the questions like Ls, Lq, Ws, Wq which is asked in the problem.
Note : For each model the following should be always kept in mind.
(i) Po
(ii) Relation between Po and Pn.
(iii) Any one of Ls [ (M / M / 1) model] (or) Lq [ (M / M / s) model]
The other averages can be derived using Little’s formula.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 2

LITTLE’s FORMULA

For infinite capacity [ Model I & II ] For finite capacity [ Model III & IV ]
λ λ′
Ls = Lq + Ls = L q + , λ ′ is the effective arrival rate.
µ µ
Lq = λ Wq Ls = λ ′ W s
Ls = λ Ws 1
Ws = Wq +
1 µ
W s = Wq +
µ Lq = λ ′ W q

where λ ′ = µ (1 − p o ) [ for Model III ]

 s −1

and λ ′ = µ  s − ∑ ( s − n) p n  [ for Model IV ]
 n =0 

FORMULAS

MODEL - I : ( M / M / 1) : (∞ / FIFO )
1.Steady state probability ( p0 )
λ
p0 = 1 −
µ
n n
λ λ  λ
p n =   p 0 =   1 − 
µ µ  µ
2.Average no. of customers in the system ( Ls )
λ
Ls =
µ −λ
3.Average number of customers in the queue ( Lq )
λ λ λ λ2
Lq = Ls − = − =
µ µ − λ µ µ (µ − λ )
4. Average waiting time of a customer in the system ( Ws )
L λ 1
Ws = s = =
λ λ (µ − λ ) (µ − λ )
5. Average waiting time of a customer in the queue ( Wq )
λ2 Lq λ
Wq = = =
λ λ µ (µ − λ ) µ (µ − λ )
6.Probability that the number of customers in the system exceeds ‘k’
k +1
λ
p ( n > k ) =  
µ
7. Average number of customers in the non-empty queue ( Lw )
µ
Lw =
µ −λ
8. Average waiting time of customers in the queue ,if he has to wait.
1
E (Wq Wq > 0) =
µ −λ
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 3

9. Probability density function of the waiting time in the queue

λ −( µ −λ ) w
 µ (µ − λ ) e , w>0

g ( w) = 
1 − λ ,w=0
 µ

MODEL - II : ( M / M / c (or ) s ) : (∞ / FIFO )

 1  λ n
   p0 , n<s
 n!  µ 
1. p n = 
n
 1 λ
   p 0
n−s 
, n≥s
 s ! s µ

s +1
λ
 
2. Lq =
1 µ p0
2
s .s!  λ 
1 − 
 µ s 
s +1
λ
 
λ 1 µ λ
3. L s = L q + = 2
p0 +
µ s. s !  λ  µ
1 − 
 µs

s
λ
 
4. Ws =
Ls
=
1
+
1 µ p0
2
λ µ µ . s. s !  λ 
1 − 
 µ s 
s
λ 
 
Lq 1 µ
5. Wq = = 2
p0
λ µ. s. s !  λ 
1 − 
 µ s 

1
6. p 0 =
 s 
n   λ  
s −1 1 λ   µ 
∑   + 
n=0 n! µ  s ! 1 − λ  
  µ s  
 
 MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 4

MODEL - III ( M / M / 1) : ( K / FIFO )


 λ  λ
n 1 − 1−
λ  µ  µ
p n =    k +1 
, if λ ≠ µ p0 = k +1
, if λ ≠ µ
1. µ
   λ  λ 
1 −  µ   1 −  
    µ 
1 1
pn = , if λ = µ p0 = , if λ = µ
k +1 k +1
k
=
2. s 2 ,
L if λ = µ

 λ 
k +1
 ( k + 1)   
 λ   µ  
 
L s =   −  k +1 
, if λ ≠ µ
µ −λ  λ 
 1 −  µ  
   
λ′
L = L −
3. q s
µ where λ ′ is the effective arrival rate (i.e.) λ ′ = µ (1 − p0 )
Ls
4. Ws =
λ′
Lq
5. W q =
λ′
MODEL - IV (M / M / s) : ( K / FIFO)
 1  λ n
   p0 , n≤s
 n!  µ 
 n
 1 λ 
1. p n =  n− s
  p0 , s < n ≤ k
 s! s µ
0 ,n>k



s
λ ρ λ
2. Lq = p 0  µ  1 − ρ k −s
[− ( k − s )(1 − ρ ) ρ k −s
where ρ]=
  s !(1 − ρ )
2
sµ
λ′  s −1   k 
3. Ls = Lq + where λ ′ = µ  s − ∑ ( s − n) pn  Q ∑ pn = 1
µ  n =0   n =0 
Ls
4. W s =
λ′
Lq
5. Wq = where λ ′ is the effective arrival rate
λ′
1
6. p 0 = n s n− s
s −11 λ 1 λ k  λ 
∑   +   ∑  
n =0 n !  µ  s !  µ  n= s  µ s 
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 5

Symbol Identification in Queueing Theory Problems

1. Probability that all the servers are idle / Probability that arriving customer need not wait
for service = p (no customers in the system)
= p ( n  0) = po
2. P ( atleast or any one of the servers is idle) = p ( n  s)
= po + p1 + ……. Ps-1
3. Probability that the server is busy / Probability that an arrival has to wait
= p ( atleast one customer in the system)
= p (n  1 [ for (M/M/1) model ]
= p1 + p2 + …….
= 1 – po [ since the sum of the probability is 1
(i.e.) po + p1 + p2 +……. = 1 ]
4. Probability that all the c or s servers are busy / Probability that an arrival has to wait /
Fraction of time when all the servers are busy
= p ( atleast c or s number of customers in the system)
= p (n   [ for (M/M/s) model ]
= 1 – ( po + p1 + p2 +…….+ps-1)
5. Probability that number of customers in the system exceed k = p ( n > k)
= p ( n ≥ k + 1)
6. Probability that number of customers in the queue exceed k = p ( q > k )
=p(n–s>k)
= p(n>s+k)
= p ( n ≥ s + k + 1)
[ since s + q = n ⇒ q = n – s ]
7. Probability that waiting time in the system exceeds α = p ( Ws > α )
− ( µ −λ ) α
= e , [ for Model I ]
8. Probability that waiting time in the system exceeds t = P(Ws > t)
 s
− µ t  s −1 −  
 λ 
  λ   µ 
  1 − e 
 p0 
 µ   
=e −µ t 
1+ 
  λ  λ   , [ for Model II ]
 
s ! 1 −   s − 1 −  
  µ s   µ 
 
9. Probability that waiting time in the queue exceeds α = p ( Wq > α )
( before service )
10. Average /expected /mean number of customers in the system - Ls
11. Average/expected/mean number of customers in the queue – Lq
(waiting line)
12. Average number of customers ( waiting for service ) – Lq
13. Average waiting time of a customer/spending in the system - Ws
[ for completing service ( service time is included here) ]
14. Average waiting time of a customer in the queue - Wq
[ waiting for service ( service time is excluded here) ]
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 6

15. Expected length of customers waiting time, if the customers has to wait
E (Wq ) 1
in the queue = E[Wq / Ws > 0] = = [ for Model II ]
P(Ws > 0) µ s − λ
λ
16. Fraction of time when the system are busy = ρ = [ for Model II ]
µs
λ
Fraction of time when the system are idle = 1 – ρ where ρ =
µs
17. Probability that there is no customer waiting to be served [ for Model I ]
= P(there is at most one customer in the counter)
= p0 + p1
18. Probability that a customer is being served and nobody is waiting = p1
(exactly one customer) [ for Model I ]
s
19. Average of the all the servers are idle at any time = ∑ kP
k =0
s −k (for Model II)

20. (i) Average of the server is idle = p0

λ
(ii) Average of the server is busy = (Model I)
µ
λ
21. (i) Average of all the servers are busy = ρ =
µs
λ
(ii) Average of all the servers are idle =1 – ρ where ρ = (for Model II)
µs
22. Probability that any of the server remains idle = P(n ≤ 1 ) = p0 + p1 (for Model II)

Problems
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 7

1. A petrol pump station has 2 pumps .The service time follows the exponential distribution
with mean of 4 minutes and cars arrive for service is a Poisson process at the rate of 10
cars per hour. Find the probability that a customer has to wait for service. What is the
probability that the pumps remains idle. What is the probability that any of the pumps
remains idle.
2. A petrol pump station has 4 pumps. The service time follows the exponential distribution
with a mean of 6 minutes and cars arrive for service in a Poisson process at the rate of 30
cars per hour.
(i) What is the probability that an arrival will have to wait in line?
(ii) Find the average waiting time in the queue, average time spent in the system and the
average number of cars in the system.
3. In a railway marshalling yards, goods trains arrive at a rate of 30 trains per day. Assume
that the inter-arrival time follows exponential distribution and the service time is also
exponential with an average of 36 minutes . Calculate the following :
(i) The mean queue size, (ii) The probability that the queue size exceeds 10
(iii) If the input of trains increases to an average of 33 per day , what will be the change
in above quantities.
4. There are three typists in an office. Each typist can type an average of 6 letters per hour.
If letters arrive for being typed at the rate of 15 letters per hour.
(i) What fraction of time all the typists will be busy?
(ii) What is the average number of letters waiting to be typed?
(iii) What is the average time a letter has to spend for waiting and for being typed.
(iv) What is the probability that a letter will take longer than 20 minutes waiting to be
typed and being typed?
(v) What is the probability that no letter are there in the system?
5. A 2 person barber shop has 5 chairs to accommodate the waiting customers. Potential
customers who arrive when all 5 chairs are full, leave without entering the barber shop.
Customers arrive at the average rate of 4 per hour and spend an average of 12 minutes in
the barber’s chair. Compute p0 , p1 , p7 and Lq .

6. Arrivals at a telephone booth are considered to be Poisson with an average time of 12

minutes between one arrival and the next. The length of a phone call is assumed to be
distributed exponentially with mean 4 minutes.
(a) Find the average number of persons waiting in the system.
(b) What is the probability that a person arriving at the booth will have to wait in the
queue?
(c) What is the probability that it will take him more than 10 minutes altogether to wait
for the phone and complete his call?
(d) Estimate the fraction of the day when the phone will be in use.
(e) The telephone department will install a second booth, when convinced that an
arrival has to wait on the average for at least 3 minutes for phone. By how much the
flow of arrivals should increase in order to justify a second booth?
(f) What is the average length of the queue that forms from time to time?
7. Average of 10 cars per hour arrive at a single server drive-in teller. Assume that the
average service time for each customer is 4 minutes and both inter arrival times and
services are exponential.
(i) What is the probability that the teller is idle?
(ii) What is the average number of cars waiting in the line for the teller?
(iii) What is the average amount of time a drive-in customer spends in the bank parking
(iv) On the average, how many customers per hour will be served by the teller.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 8

8. A one man barber has a total of 10 seats. Inter arrival times are exponentially distributed,
and an average of 20 prospective customers arrive each hour at the shop. Those
customers who find the shop full do not enter. The barber takes an average of 12 minutes
to cut each customer hair. Haircut times are exponentially distributed.
(i) On the average, how many haircuts per hour will the barber complete?
(ii) On the average, how much time will be spent in the shop by a customer who enters?
9. Customers arrive at a watch repair shop according to a Poisson process at a rate of one
per every 10 minutes and the service time is an exponential random variable with mean 8
minutes.
(i) Find the average number of customers Ls in the shop.
(ii) Find the average time a customer spends in the shop Ws .
(iii) Find the average number of customers in the queue Lq .
(iv) What is the probability that the server is idle.
10. A car service station has 2 bays where service can be offered simultaneously; because of
space limitation only 4 cars are accepted for servicing. The arrival process is Poisson
with 12 cars per day. The service time in both the bays is exponentially distributed with
µ = 8 car per day per bay. Find the average number of cars in the service station, the
average numbers of cars waiting for service and the average time a car spends in the
system.
11. Customers arrive at a one – man barber shop according to a Poisson process with a
mean inter arrival time of 12 minutes. Customers spend an average of 10 minutes in the
barber’s chair.
(i) What is the probability that a customer need not wait for a hair cut ?
(ii) What is the expected number of customers in the barber shop and in the queue?
(iii) How much time can a customer expect to spend in the barber shop?
(iv) Find the average time that the customer spends in the queue.
(v) What is the probability that there will be 6 or more customers waiting for service?
(vi) Calculate the percentage of time an arrival can walk straight into the barber’s chair
without having to wait.
(vii) Calculate the percentage of customers who have to wait prior to getting into the
barber’s chair.
(viii) What is the probability that more than 3 customers are in the system?
(ix) What is the probability that the waiting time in the system is greater than 30
minutes?
(x) Management will provide another chair and here another barber, when a customer’s
waiting time in the shop exceeds 1.15 hour. How much the average rate of arrivals
increase to warrant a second barber?
12. Customers arrive at a one – man barber shop according to a Poisson process with a mean
inter arrival time of 20 minutes. Customers spend an average of 15 minutes in the
barber’s chair. If an hour is used as a unit time , then
( i ) What is the probability that a customer need not wait for a hair cut ?
( ii ) What is the expected number of customers in the barber shop and in the queue?
(iii) How much time can a customer expect to spend in the barber shop?
(iv) Find the average time that the customer spends in the queue.
(v) What is the probability that there will be 6 or more customers waiting for service?
13. A duplicating machine maintained for office use is operated by an office assistant who
earns Rs. 5 per hour. The time to complete each job varies according to an exponential
distribution with mean 6 minutes. Assume a Poisson input with an average arrival rate of
5 jobs per hour. If an 8 hour day is used as a base, determine
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 9

(i) The percentage idle time of the machine.

(ii) The average time a job is in the system.
(iii) The average earning per day of the assistant.
14. A supermarket has 2 girls attending to sales at the counters. If the service time for each
customer is exponential with mean 4 minutes and if people arrive in Poisson fashion at
the rate of 10 per hour.
(i) What is the probability that a customer has to wait for service?
(ii) What is the expected percentage of idle time for each girl?
(iii) If the customers has to wait in the queue, what is the expected length of his waiting
time?
15. In a given M/M/1 queueing system, the average arrivals is 4 customers per minute :
ρ = 0 .7
What are (i) mean number of customer Ls in the system
(ii) mean number of customers Lq in the queue.
(iii) probability that the server is idle.
(iv) mean waiting time Ws in the system.
16. A barber shop has 2 barbers and three chairs for customers. Assume that the customers
arrive in a Poisson fashion at a rate of 5 per hour and that each barber service customers
according to an exponential distribution with mean of 15 minutes. Further if a customer
arrives and there are no empty chairs in the shop, he will leave. What is the probability
that the shop is empty? What is the expected number of cutomers in the shop?
17. A concentrator receives messages from a group of terminals and transmits them over a
single transmission line. Suppose that messages arrives according to a Poisson process at
a rate of one message every 4 milliseconds and suppose that message transmission times
are exponentially distributed with mean 3 milliseconds. Find the mean number of
messages in the system and the mean total delay in the system. What percentage increase
in arrival rate results in a doubling of the above mean total delay?
18. On every Sunday morning, a Dental hospital renders free dental service to the patients.
As per the hospital rules, 3 dentists who are equally qualified and experienced will be on
duty then. It takes on an average 10 minutes for a patient to get treatment and the actual
time taken is known to vary approximately exponentially around this average. The
patients arrive according to the Poisson distribution with an average of 12 per hour. The
hospital management wants to investigate the following:
(i) The expected number of patients waiting in the queue.
(ii) The average time that a patient spends at the hospital.
19. A repairman is to be hired to repair machines which breakdown at an average rate of 3
per hour. The breakdown follow poisson distribution. Non-productive time of machine is
considered to cost Rs.16 per hour. Two repairman have been interviewed. One is slow
but cheap while the other is fast and expensive. The slow repairman charges Rs. 8 per
hour and he services machines at the rate of 4 per hour. The fast repairman demands
Rs.10 per hour and services at the average rate of 6 per hour. Which repairman should be
hired?
20. A bank has two tellers working on savings account. The first teller handles withdrawals
only. The second teller handles deposits only. It has been found that the service time
distributions for both deposits and withdrawals are exponential distribution with mean
service time of 3minutes per customer. Deposits are found to arrive in a Poisson fashion
throughout the day with mean arrival rate of 16 per hour. Withdrawals also arrive in a
Poisson fashion with mean arrival rate of 14 per hour. What would be the effect on the
average waiting time for the customers of each teller could handle both withdrawals and
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 10

deposits. What would be the effect if this could only be accomplished by increasing the
service time to 3.5 minutes?
21. On average 96 patients per 24 hour day require the service of an emergency clinic. Also,
an average a patient requires 10 minutes of active attention .Assume that the facility can
handle only one emergency at a time . Suppose that it costs the clinic Rs.100 per patient t
treated to obtain an average servicing time of 10 minutes and that each minutes of
decrease in this average time would cost Rs.10 per patient treated . How much would
have to be budgeted by the clinic to decrease the average size of queue from 1 patient to


patient ?
22. Patients arrive at a clinic according to Poisson distribution at a rate of 30 patients per
hour. The waiting room does not accommodate more than 14 patients. Examination time
per patient is exponential with mean rate of 20 per hour.
(i) What is the probability that an arriving patients will not wait?
(ii) Find the effective arrival rate at the clinic.
(iii) What is the expected waiting time until a patient is discharged from clinic?
23. A telephone exchange has two long distance operators. The telephone company finds
that during the peak load, long distance calls arrive in a Poisson fashion at an average rate
of 15 per hour. The length of service of these calls is approximately exponentially
distributed with mean length of 5 minutes.
(i) What is the probability that the subscriber will have to wait for his long distance calls
during the peak hours of the day?
(ii) If the subscribers will wait and are served in turn, what is the expected waiting time?
24. Given an average arrival rate of 20 per hour, is it better for a customer to get service at a
single channel with mean service rate of 22 customers per hour or at one of two channels
in parallel with mean service rate of 11 customers per hour for each of the two channels.
Assume both queues to be of Poisson type.
25. In a busy medical shop there are 3 salesman who receive the customers supply the drugs
and billing. On finishing the job with any one, the customer goes to payment and leaves
the shop. If customers enter in Poisson at the rate of 30 per hour and the service of each
salesman is 5 minutes in exponential distribution and 1 minute per customer for payment
with an exponential distribution. Find average number of customers, average waiting
time in the shop. If the owner wishes that no customer should stay more than 8 minutes
and not exceed 5 customers in the shop and at the same time he wishes to take on the
average 1.5 minutes per customer for his job, find if these can be accomplished by
appointing one more salesman.

26. At a one man barber shop, the customers arrive following Poisson process at an average
rate of 5 per hour and they are served according to exponential distribution with an
average service rate of 10 minutes. Assuming that only 5 seats are available for waiting
customers, find the average time a customer spends in the system.

27. A general insurance company has three claim adjusters in its branch office. People with
claims against the company are found to arrive in Poisson fashion at an average rate of 20
per 8 hour day. The amount of time that an adjuster spends with a claimant is found to
have negative exponential distribution with mean service time 40 minutes. Claimants are
processed in the order of their appearance. How many hours a week can an adjuster
expect to spend with claimants. How much time, on the average does claimant spend in
the branch office.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 11

28. Cars arrive at a petrol pump, having one petrol unit, in Poisson fashion with an average
of 10 cars per hour. The service time is distributed exponentially with mean of 3 minutes.
Find average number of cars in the system, average waiting time in the queue, average
queue length, the probability that the number of cars in the system is 2.

29. (i) Write the steady-state equations for the model (M / M / C) : (FIFO / ∞ / ∞)
(ii) Obtain the expected waiting time of a customer in the queue of the above model.
(iii) In the above model λ = 10 per hour, µ = 3 per hour, C = 4, what is the probability
that a customer has to wait before he gets service?

30. A branch of a national bank has only one typist. Since the typing work varies in length,
the typing rate is randomly distributed approximating Poisson distribution with mean rate
of 8 letters per hour. The letter arrive at a rate of 5 per hour during the entire 8 hour work
day. If the typewrite is valued at Rs. 1.50 per hour
Determine equipment utilization, the percent time an arriving letter has to wait, average
system time and average idle time cost of the typewriter per day.

31. Customers arrive at the First Class Ticket counter of a Theatre at the rate of 12 per hour.
There is one clerk serving the customers at the rate of 30 per hour. What is the probability
that there is no customer in the counter? What is the probability that there are more than 2
customers in the counter? What is the probability that there is no customer waiting to be
served? What is the probability that a customer is being served and nobody is waiting?

32. Ships arrive at a port at the rate of one in every 4 hours with exponential distribution of
inter arrival times. The time a ship occupies a berth for unloading has exponential
distribution with an average of 10 hours. If the average delay of ships waiting for berths
is to be kept below 14 hours, how many berths should be provided at the port?

33. A tax consulting firm has four service counters in the office to receive people who have
problems and complaints about their income, wealth and sales taxes. Arrivals average 80
persons in an 8 hour service day. Each tax adviser spends an irregular amount of time in
servicing the arrival which have been found to have exponential distribution. The average
service time is 20 minutes. Calculate the average number of customers in the system,
average number of customers waiting for service, average waiting time for the customer
in the system and in queue, number of hours each week a tax consultant spends with
customer, the probability that a customer has to wait for service and the expected number
of idle tax advisers at any specified time.

34. The arrivals at the counter in a bank occur in accordance with a Poisson process at an
average rate of 8 per hour. The duration of service of a customer has an exponential
distribution with mean of 6 minutes. Find the probability that
(i) an arriving customer has to wait.
(ii) 4 customers in the system
(iii) an arriving customer has to spend less than 15 minutes in the bank.
Also estimate the fraction of the total time that the counter is busy.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 12
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 13

1. Solution:
2 pumps [ 2 server (i.e.) s = 2] and no restriction on accomodation
∴ ( M / M / 2) : (∞ / FIFO) - Model II
Unit time – 1 hour
1 1 Mean = 4 min.
λ = 10 / hr , µ = / min . = × 60 / hr
4 4 So, for 4 min. - 1 car serviced
= 15 / hr For 1 min. - ¼ car serviced
λ 10 λ 0.67 1
∴ µ = / min .
= = 0.67 , = = 0.33 4
µ 15 sµ 2
(i) P( a customer has to wait for service ) = p (n ≥ 2) = p 2 + p 3 + p 4 + − − − − − −
= 1 − [ p 0 + p1 ]
 s   2 
s −1 1  λ 
n   λ   1 n   λ  
1   µ  1 λ   µ 
=∑   + = ∑   +  
p0 n=0 n !  µ   s ! 1 − λ   n=0 n !  µ   2! 1 − λ  
  µ s     2 µ  
   
 1 λ λ2 1
= 1 +  +
 1! µ  2! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 0.67) + (0.67) 2
2 1 − 0.33
=1.67 + 0.33
1
=2
p0
1
p0 = = 0.5
2
λ
p1 = p 0 = (0.67) (0.5) = 0.335
1! µ
∴ p (n ≥ 2) = 1 − [ p0 + p1 ]
= 1 − (0.5 + 0.335) = 0.165
(ii) Both pumps remains idle = P[no customers(cars) in the system]
= p0
= 0.5
(iii) Any of the pump remains idle = P(there is at most one customer in the system)
= P(n < 1) = p0 + p1
= 0.5 + 0.335 = 0.835

2. Solution:
4 pumps [ 4 server (i.e.) s = 4] and no restriction on accomodation
∴ (M / M / 4) : (∞ / FIFO) - Model II
Unit time – 1 hour
1 1 Mean = 6 min.
λ = 30 / hr , µ = / min . = × 60 / hr
6 6 So, for 6 min. - 1 car serviced
= 10 / hr For 1 min. – 1/6 car serviced
1
λ 30 λ 3 ∴ µ = / min .
= =3, = = 0.75 6
µ 10 sµ 4
(i) P( a customer has to wait for service ) = p(n ≥ 4) = p 4 + p5 + p6 + − − − − − −
= 1 − [ p 0 + p1 + p 2 + p 3 ]
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 14

 s   4 
n    λ 
  3 n    λ 
 
1 s −1 1  λ    µ  1 λ   µ 
=∑   + = ∑   +  
p0 n=0 n !  µ   s ! 1 − λ   n =0 n !  µ   4! 1 − λ  
  µ s     4 µ  
   
 1 λ 1  λ  2 1  λ 3  λ4 1
= 1 + +   +    +
 1! µ 2!  µ  3!  µ   4! µ 
4
λ 
 1 − 
 4µ 
 3 2 33  1 1
= 1 + 3 + +  + (3) 4
 2 6  4! 1 − 0.75
=1 + 3 + 4.5 + 4.5 + 13.5
1
= 26.5
p0
1
p0 =
26.5
λ λ2 λ3
p1 = p0 = 3 p0 , p2 = p0 = 4.5 p0 , p3 = p0 = 4.5 p0
1! µ 2 !µ 2 3 !µ 3
∴ p (n ≥ 4) = 1 − [ p 0 + p1 + p 2 + p 3 ]
= 1 − [ p 0 + 3 p 0 + 4.5 p 0 + 4.5 p 0 ]
13
= 1 − 13 p 0 = 1 − = 0.5094
26.5
s +1
λ 
 
Lq =
1 µ p0 =
1 (3)5 1
=
81
= 0.5094
s . s!  λ 
2 4 . 4 ! (1 − 0.75 )2 26.5 159
1 − 
 µ s 
λ
Average number of cars in the system = Ls = Lq + = 0.5094 + 3 = 3.5094 cars
µ
3.5094 Ls
Average time spent in the system = Ws = =
= 0.1169 hr ≅ 7.01 min .
λ 30
Lq 0.5094
Average waiting time in the queue = Wq = λ = 30 = 0.01698 hr ≅ 1.02 min .

3. Solution:
Only one marshalling yard [ 1 server (i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 day
1 1
λ = 30 / day , µ =
/ min . = × 60 / hr
36 36
5
= × 24 / day = 40 / day
3
2
λ 30 2
Mean queue size = Lq = = = 2.25 trains
µ ( µ − λ ) 40(40 − 30)
Probability that queue size exceeds 10 = P(q > 10) = P(n – s > 10) = P(n – 1 > 10)
= P(n > 11)
11 + 1
λ
=   = (0.75)12
µ
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 15

If λ = 33, we have
33 2
(i) Lq = = 3.8892
40 × 7
12 12
λ  33 
(ii) p (n ≥ 12) =  µ  =  = 0.0994
   40 

4. Solution:
There are 3 typists [ 3 server (i.e.) s = 3] and no restriction on accomodation
∴ ( M / M / 3) : (∞ / FIFO ) - Model II
Unit time – 1 hour
λ = 15 / hr , µ = 6 / hr
λ 15 λ 2.5
= = 2.5 , = = 0.833
µ 6 sµ 3
(i) All the typists will be busy [i.e. if there are atleast 3 customers (letters) in the system]
= p(n ≥ 3) = p3 + p4 + p5 + − − − − − −
= 1 − [ p 0 + p1 + p 2 ]
 s   3 
s −1 1  λ 
n   λ   2 n  
 λ 
 
1   µ  1 λ   µ 
=∑   + = ∑   +  
p 0 n=0 n !  µ   s ! 1 − λ   n =0 n !  µ   3! 1 − λ  
  µ s     3 µ  
   
 1 λ 1  λ 2  λ3 1

= 1+ +   + 
 1! µ 2!  µ   3! µ 3  λ 
1 − 
 3µ 
 ( 2.5) 2  1 1
= 1 + 2.5 +  + (2.5) 3
 6
 2  1 − 0.833
1
= 22.2188
p0
p0 = 0.045
λ λ2
p1 = p 0 = 2.5 p 0 , p 2 = 2
p0 = 3.125 p0
1! µ 2 !µ
∴ p (n ≥ 3) = 1 − [ p 0 + p1 + p 2 ]
= 1 − [ p 0 + 2.5 p 0 + 3.125 p 0 ]
=1 − 6.625 p0
= 1 − 6.625 (0.045) = 0.7019

(ii) Average number of letters waiting to be typed (queue) = Lq

s +1
λ
 
Lq =
1 µ p0 =
1 (2.5)4
(0.045) =
1.7578
= 3.5016
s . s!  λ 
2 3. 3! (1 − 0.833) 2 0.5020
1 − 
 µ s 
λ
Ls = Lq + = 3.5016 + 2.5 = 6.0016
µ
L s 6.0016
(iii) Average time spent in the system = Ws = = = 0.4001 hr ≅ 24 min . nearly
λ 15
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 16

(iv) Probability that waiting time in the system exceeds t = P(Ws > t)
= P(Ws > 20 min)
= P(Ws > 1/3 hr.)
 s − µ t  s −1 −  
 λ 
 λ   µ  
   1 − e  p0 
 µ   
P (W s > t ) = e − µ t  
1 + 
  λ  λ 
s ! 1 −   s − 1 − 
  µ s  µ 
 
 

P (Ws >1 / 3) = e
−
6
3

1 +
{ }
(2.5)3 1 − e − 2 (− 0.5 ) (0.045) 
 = 0.4616
 3! (1 − 0.833 )(− 0.5 ) 
(v) P( no letter in the system) = p0 = 0.045

5. Solution:
2 person barber shop [ 2 server (i.e.) s = 2]
and 5 chairs to accommodate the waiting customers + 2 chair = 7 chair
∴ ( M / M / 2) : (7 / FIFO ) - Model IV
Unit time – 1 hour
1 1
λ = 4 / hr , µ = / min . = × 60 / hr
12 12
= 5 / hr
λ 4 λ 0.8
= = 0.8 , ρ= = = 0.4
µ 5 sµ 2
n s n −s
1 s −1 1  λ  1 λ k  λ 
(i ) =∑   +   ∑  
p0 n=0 n !  µ  s !  µ  n = s  µ s 
n 2 n −2
1 1 λ 1 λ 7  λ 
=∑   +   ∑  
n =0 n !  µ  2 !  µ  n=2  2 µ 
 1 λ  (0.8) 2
= 1 + + [
1 + (0.4) + (0.4) 2 + (0.4) 3 + (0.4) 4 + (0.4) 5 ]
 1! µ  2
(0.8) 2
=1 + 0.8 +
2
[
1 + (0.4) + (0.4) 2 + (0.4) 3 + (0.4) 4 + (0.4) 5 ]
1
= 2.3311
p0
p0 = 0.4290
1
1 λ
(ii) p1 =   p 0 = (0.8) (0.4290) = 0.3432
1!  µ 
7
1 λ 1
(iii) p7 =   p 0 = (0.8)7 (0.4290) = 0.0014
s n−s s!  µ  5
2 2!
s
λ
(iv) Lq = p0  
ρ
[
1 − ρ k − s − (k − s)(1 − ρ ) ρ k − s ]
 µ  s !(1 − ρ )
2

= (0.4290) (0.8) 2
0.4
2! (1 − 0.4) 2
[
1 − (0.4) 5 − (5)(1 − 0.4)(0.4) 5 ]
= 0.1462
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 17

6. Solution:
Only one telephone booth [ 1 server (i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 min. Arrival time
1 1 For 12 min. – 1 customer
λ= / min ., µ = / min . 1
12 4 For 1 min. – customer
12
(a) Average number of persons in the queue = Lq 1
∴ λ = / min .
λ2 (1 / 12) 2 1 12
Lq = = = = 0.167 persons Service time
µ ( µ − λ ) 1 / 4(1 / 4 − 1 / 12) 6
For 4 min. – 1 customer
(b) P(person arriving at the booth will have to wait) 1
For 1 min. – customer
= p (n ≥ 1) 4
= 1– p 0 1
∴ µ = / min .
4
1
 λ λ 1
= 1 − 1 −  = = 12 =
 µ µ 1 3
4
1 1  5
− − 10 −
− ( µ − λ )10  4 12  3
(c) P(Ws > 10) = e = e = e = 0.1889

(d) P(the phone will be in use if there is atleast one customer in the system)
= p (n ≥ 1) = 1 – p0
 λ 1
= 1 – 1 − µ  = 3
 
1
(or) the fraction of the day when the phone will be in use =
3
(e) The second phone will be installed, if Wq > 3.
λ
(i.e.) if >3
µ ( µ − λ)
λR
(i.e.) if > 3 where λ R is the required arrival rate
1 1
( − λR )
4 4
31 
(i.e.) if λR >  − λR 
4 4 
3 3
(i.e.) if λR + λR >
4 16
7 3
(i.e.) if λR >
4 16
3
(i.e.) if λR >
28
3 1 1
Hence the arrival rate should increase by – = per minute.
28 12 42

(f) Average length of the queue that forms from time to time
= Average number of customers in the non-empty queue
1
µ 4 = 3 = 1. 5
= =
µ −λ 1 1 2
−
4 12
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 18

7. Solution:
A single server [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hour
1 1
λ = 10 / hr , µ = / min . = × 60 / hr
4 4
= 15 / hr
 λ 10 1
(i) Probability that the teller is idle = p0 = 1 − µ  = 1 − 15 = 3 = 0.33
 
λ2 10 2
(ii) Average number of cars in the queue = Lq = =
µ ( µ − λ ) 15(15 − 10)
= 1.33 cars

1 1 1
(iii) Average waiting time in the system = Ws = µ − λ = 15 − 10 = 5 = 0.2 hr = 12 min .
(iv) Number of customers serviced by teller per hour = service rate = µ = 15/ hr
(i.e) 15 customers per hour will be served by the teller.

8. Solution:
A one-man barber shop [ 1 server (i.e.) s = 1] has a total of 10 seats.
∴ ( M / M / 1) : (10 / FIFO ) - Model III
Unit time – 1 hour
1 1
λ = 20 / hr , µ = / min . = × 60 / hr
12 12
= 5 / hr
Here λ ≠ µ
(i) Number of haircuts serviced by barber per hour = service rate = µ = 5/ hr
(i.e) 5 haircuts per hour will be completed by the barber.
(ii)
 λ 
k +1
 (k + 1)   
 λ   µ  
Ls =   −  k +1 
µ −λ   λ 
 1 −  µ  
   
20 (11)(4)11 4 46137344 4 29
= − 11
=− − = − + 11 = = 9.67
5 − 20 1 − (4) 3 (−4194303) 3 3
λ
1−
µ 1− 4 3
p0 = k +1
= 11
= = 0.00000072
λ 1 − ( 4) 4194303
1 −  
µ 
λ ′ = µ (1 − p 0 ) = 5(1 – 0.00000072) = 5
Ls 9.67
Ws = = = 1.934 hr = 1 hr 56 min .
λ′ 5
9. Solution:
A watch repair shop [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 min.
1 1
λ= / min ., µ = / min .
10 8
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 19

1
λ 10
(i) Average number of customers in the shop = s µ − λ 1 1 = 4 customers
L = =
−
8 10
1 1
(ii) Average time a customer spends in the shop = Ws = µ − λ = 1 1 = 40 min .
−
8 10
λ2
(iii) Average number of customers in the queue = Lq = µ (µ − λ )

=
(110) 2

=
16
= 3.2 customers
11 1  5
 − 
8  8 10 
λ
(iv) Probability that the server is idle = p0 = 1 − µ
1
=1 − 10 = 1 − 4 = 1 = 0.2
1 5 5
8

10. Solution:
Car service station has 2 bays [ 2 server (i.e.) s = 2]
Only 4 cars are accepted for serving [(i.e.) 2 cars are in service and 2 cars are waiting]
∴ ( M / M / 2) : (4 / FIFO ) - Model IV
Unit time – 1 day
λ = 12 / day , µ = 8 / day
λ 12 λ 1.5
= = 1.5 , ρ = = = 0.75
µ 8 sµ 2
To find Ls, Lq, Ws
n s n− s
1 s −1 1  λ  1 λ k  λ 
=∑   +   ∑  
p 0 n =0 n !  µ  s!  µ  n= s µs
n 2 n −2
1 1 λ 1 λ 4  λ 
=∑   +   ∑  
n=0 n!  µ  2!  µ  n =2  2µ 
 1 λ  (1.5) 2
= 1 + + [
1 + (0.75) + (0.75) 2 ]
 1! µ  2
(1.5) 2
= 1 + 1.5 +
2
[1 + (0.75) + (0.75) 2 ]
1
= 5.1016
p0
p0 = 0.1960
1
1λ
p1 =   p0 = (1.5) (0.1960) = 0.294
1!  µ 
s
λ
Lq = p0  
ρ
[
1 − ρ k − s − (k − s )(1 − ρ ) ρ k − s ]
 µ  s !(1 − ρ )
2

= (0.1960) (1.5) 2
0.75
2 ! (1 − 0.75) 2
[
1 − (0.75) 2 − (2)(1 − 0.75)(0.75) 2 ]
= 0.4134 cars
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 20

λ′
Ls = Lq +
µ
λ ′  s −1 
=  s − ∑ ( s − n) p n 
µ  n=0 
1
= 2 − ∑ ( 2 − n) p n
n=0
= 2 − {2 p 0 + p1}
= 2 − 2(0.1960) − 0.294
λ′
=1.314
µ
⇒ λ ′ = µ (1.314) = 8(1.314) = 10.512
λ′
∴ Ls = Lq +
µ
= 0.4134 + 1.314
= 1.7274 =1.73 cars
L 1.73
Ws = s = = 0.1646 day
λ ′ 10.512

11. Solution:
A one man barber shop [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 min.
1 1 λ 1 / 12 10 5
λ = / min . , µ = / min . , = = =
12 10 µ 1 / 10 12 6
(i) P(a customer need not wait for a hair cut) = P(no customer in the system)
= p0
λ
= 1− µ
5 1
= 1− =
6 6
1
12λ
(ii) Expected number of customers in the shop = Ls = µ − λ = 1 1 = 5 customers
−
10 12
λ2
Expected number of customers in the queue = Lq = µ (µ − λ )

=
(112)
2

= 4.17 customers
1  1 1 
 − 
10  10 12 
1 1
(iii) Average time a customer spends in the shop = W s = = = 60 min .
µ −λ 1 1
−
10 12
(iv) Average time a customer spends in the queue = Wq
λ 1 / 12
= = = 50 min .
µ (µ − λ ) 1  1 1 
 − 
10  10 12 
6 6
λ 5
(v) p (n ≥ 6) =  µ  =  6  = 0.3349
   
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 21

(vi) P(a customer straight goes to the barber’s chair)

= P(no customer in the system)
1
= p0 =
6
1
∴ Percentage of time an arrival need not wait = × 100 = 16.7
6
(vii) P(a customer has to wait to get into the barber’s chair) = p (n ≥ 1)
= 1 – p0
 λ 5
= 1 – 1 − µ  = 6
 
5
∴ Percentage of customers who have to wait = × 100 = 83.33
6
(viii) P( more than 3 customers are in the system) = P(n > 3)
4 4
λ 5
=   =   = 0.4823
µ 6
 1 1  1
− −  30 −
− ( µ − λ ) 30
(ix) P(Ws > 30) = e = e  10 12 
= e 2
= 0.6065
(x) Given Ws > 75 [ since 1.15hr = 75 min. ]
1
(i.e.) > 75
µ −λ
1
> µ −λ
75
1 1
λ> −
10 75
13
λ>
150
Hence to warrant a second barber the average arrival rate should increase
13 1 1
by 150 − 12 = 300 per minute.

12. Solution:
A one man barber shop [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr
1 1 1 1 λ 5
λ = / min . = × 60 / hr = 5 / hr , µ = / min . = × 60 = 6 / hr , =
12 12 10 10 µ 6
(i) P(a customer need not wait for a hair cut) = P(no customer in the system)
= p0
λ
= 1− µ
5 1
= 1− =
6 6
λ 5
(ii) Expected number of customers in the shop = Ls = µ − λ = 6 − 5 = 5 customers
λ2
Expected number of customers in the queue = Lq = µ (µ − λ )
52
= = 4.17 customers
6(6 − 5 )
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 22

1 1
(iii) Average time a customer spends in the shop = Ws = µ − λ = 6 − 5 = 1 hr
(iv) Average time a customer spends in the queue = Wq
λ 5 5
= = = hr = 50 min .
µ ( µ − λ ) 6 (6 − 5) 6
6 6
λ 5
(v) p (n ≥ 6) =  µ  =  6  = 0.3349
   
13. Solution:
One machine [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr
1 1 λ 5 1
λ = 5 / hr , µ = / min . = × 60 = 10 / hr , = =
6 6 µ 10 2
(i) P(the machine is idle) = p0
λ
= 1− µ
1 1
= 1− =
2 2
1
∴ Percentage of idle time of the machine = × 100 = 50
2
1 1 1
(ii) Ws = = = hr = 12 min .
µ − λ 10 − 5 5
(iii) E(earning per day) = 8hr × 5/hr
= Rs. 40 per day
14. Solution:
A supermarket has 2 girls [ 2 server (i.e.) s = 2] and no restriction on accomodation
∴ ( M / M / 2) : (∞ / FIFO) - Model II
Unit time – 1 hour
1 1
λ = 10 / hr , µ = / min . = × 60 / hr = 15 / hr
4 4
λ 10 λ 0.67
= = 0.67 , ρ = = = 0.33
µ 15 sµ 2
(i) P( a customer has to wait for service ) = p (n ≥ 2) = p 2 + p 3 + p 4 + − − − − − −
= 1 − [ p 0 + p1 ]
 s   2 
n   λ   1 n   λ  
1 s −1 1 λ   µ  1 λ   µ 
=∑   + = ∑   +  
p0 n= 0 n ! µ  s ! 1 − λ   n =0 n !  µ   2! 1 − λ  
  µ s     2 µ  
   
 1 λ λ 2
1
= 1 + +
 1! µ  2! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 0.67) + (0.67) 2
2 1 − 0.33
= 1.67 + 0.33 = 2
1
=2
p0
1
p0 = = 0.5
2
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 23

λ
p1 = p 0 = (0.67) (0.5) = 0.335
1! µ
∴ p (n ≥ 2) = 1 − [ p0 + p1 ]
= 1 − (0.5 + 0.335) = 0.165

λ 10 1
(ii) Fraction of time when the girls are busy = ρ = s µ = 2 (15) = 3
Fraction of time when the girls are idle = 1 − ρ
1 2
=1 − =
3 3
2
∴ Expected percentage of idle time for each girl = × 100 = 67%
3
1
(iii) Expected length of customers waiting time = µ s − λ
1 1
= (15) (2) − 10 = 20 hr = 3 min .

15. Solution:
Given (M / M / 1) [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 min.
λ = 4 / min
Given ρ = 0.7
λ
= 0.7
µ
4
= 0.7
µ
4
µ= = 5.71
0.7
λ 4 4
(i) Ls = µ − λ = 5.71 − 4 = 1.71 = 2.3392 customers
λ2 42
L =
(ii) q µ (µ − λ ) (5.71)(5.71 − 4 ) = 1.6387 customers
=

λ
(iii) Probability that the server is idle = p0 = 1 − µ
4
= 1− = 0.2995
5.71
1 1 1
(iv) Ws = µ − λ = 5.71 − 4 = 1.71 = 0.5848 min .

16. Solution:
Barber shop has 2 barbers [ 2 server (i.e.) s = 2] and 3 chairs for waiting customers
∴ ( M / M / 2) : (5 / FIFO ) - Model IV
Unit time – 1 hr
1 1
λ = 5 / hr , µ =
/ min = × 60 = 4 / hr
15 15
λ 5 λ 1.25
= = 1.25 , ρ = = = 0.625
µ 4 sµ 2
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 24

(i) Probability that the shop is empty = p0

n s n− s
1 s −1 1  λ  1 λ k  λ 
=∑   +   ∑  
p 0 n =0 n !  µ  s!  µ  n= s µs
n 2 n −2
1 1 λ 1 λ 5  λ 
=∑   +   ∑  
n=0 n!  µ  2!  µ  n=2  2µ 
 1 λ  (1.25) 2
= 1 + + [
1 + (0.625) + (0.625) 2 + (0.625) 3 ]
 1! µ  2
(1.25) 2
=1 + 1.25 + [2.2598]
2
1
= 4.0154
p0
p0 = 0.2490
1
1λ
p1 =   p0 = (1.25) (0.2490) = 0.3113
1!  µ 
λ′
(ii) Ls = Lq + µ
s
λ
Lq = p 0  
ρ
[
1 − ρ k − s − (k − s)(1 − ρ ) ρ k − s ]
 µ  s !(1 − ρ )
2

= (0.2490) (1.25) 2
0.625
2 ! (1 − 0.625) 2
[
1 − (0.625) 3 − (3)(1 − 0.625)(0.625) 3 ]
= 0.4160 customers

λ ′  s −1 
=  s − ∑ ( s − n) p n 
µ  n =0 
1
= 2− ∑ (2 − n) p n
n =0
= 2 − {2 p0 + p1}
= 2 − 2(0.2490) − 0.3113
λ′
= 1.1907
µ
λ′
∴ Ls = Lq +
µ
= 0.4160 + 1.1907
= 1.6067 customers

17. Solution:
A single transmission line [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 milliseconds
1 1
λ= / ms. , µ = / ms.
4 3
(i) Mean number of messages in the system = Ls
λ 1/ 4 1/ 4
= = = = 3 messages
µ −λ 1 / 3 − 1 / 4 1 / 12
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 25

1 1
(ii) Mean total delay in the system = Ws = µ − λ = 1 / 3 − 1 / 4 = 12 milli sec onds
1
(iii) Given 2Ws = µ − λ
new
1
2 (12) =
1/ 3 − λ′
1 1
− λ′ =
3 24
1 1 7
⇒ λ′ = − =
3 24 24
λ′ − λ
Percentage increase = × 100
λ
7 / 24 − 1 / 4
= × 100
1/ 4
1
= × 100 = 16.67%
6
18. Solution:
3 dentists [ 3 server (i.e.) s = 3] and no restriction on accomodation
∴ (M / M / 3) : (∞ / FIFO) - Model II
Unit time – 1 hour
1 1
λ = 12 / hr , µ =
/ min . = × 60 / hr
10 10
= 6 / hr
λ 12 λ 2
= =2, =
µ 6 sµ 3
 s   3 
s −1 1  λ 
n   λ   2 n  
 λ 
 
1   µ  1 λ    µ 
=∑   + = ∑   +  
p0 n=0 n!  µ  
 s ! 1 − λ  n !  µ   λ 
  3! 1 − 
n = 0
  µ s     3 µ  
   
 1 λ 1  λ  2  23 1
= 1 + +    +
 1! µ 2!  µ   6  2 
1 − 
 3
8
= (1 + 2 + 2) + (3)
6
1
=9
p0
1
p0 = = 0.1111
9
(i) Expected number of patients waiting in the queue = Lq
s +1
λ 
 
Lq =
1 µ p0 =
1 (2 )4
(0.1111) = 0.8889
s . s!  2 3 . 3! 2
λ   2 
1 −  1 − 
 µ s   3
λ
Now, Ls = Lq + µ = 0.8889 + 2 = 2.8889
Ls 2.8889
(ii) Ws = = = 0.2407 hr = 14.44 min .
λ 12
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 26

19. Solution:
A repairman is to be hired [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr
For fast repairman
λ = 3 / hr. , µ = 6 / hr.
The cost includes cost paid to repairman and idle time cost .
 No. of machines arriving 
Idle time cost = [Idle time for machine (Ws )] ×   × Cost
 per day to repairman 
1
= × (3 × 8) × 16
µ−λ
1
= × (3 × 8) × 16
6−3
= Rs. 128
Total cost = Idle time cost + cost paid to repairman
= Rs 128 + (Rs 10) × 8
= Rs 208
For slow repairman
λ = 3 / hr. , µ = 4 / hr.
1
Idle time cost = × (3 × 8) × 16
µ −λ
1
= × (3 × 8) ×16
4−3
= Rs. 384
Total cost = Idle time cost + cost paid to repairman
= Rs 384 + (Rs 8) × 8
= Rs 448
∴ The fast repairman should be hired.

20. Solution:
(i) If deposits and withdrawals are handled by two tellers seperately, then the
situation is ( M / M / 1) : (∞ / FIFO ) - Model I
(ii) If both tellers handle both services, then it is ( M / M / 2) : (∞ / FIFO) - Model II
Unit time – 1 hr
(i) Deposits only (M/M/1) Withdrawals only (M/M/1)

1 1
λ1 = 16 , µ = / min . = 20 / hr λ 2 = 14 , µ = / min . = 20 / hr
3 3
λ 16 λ 14
Wq = = Wq = =
µ ( µ − λ ) 20(20 − 16) µ ( µ − λ ) 20(20 − 14)
1 7
= hr = 12 min . = hr = 7 min .
5 60

(ii) Deposits & Withdrawals (M/M/2)

1
λ = λ1 + λ 2 = 16 + 14 = 30 / hr , µ = / min = 20 / hr
3
λ 30 λ 1.5
= = 1.5 , = = 0.75
µ 20 sµ 2
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 27

 s   2 
n   λ   n   λ  
1 s −1
1 λ    µ  1
1 λ   µ 
=∑   + = ∑   + 
p0 n=0 n !  µ  
 s ! 1 − λ  n! µ  2 ! 1 − λ  
 n= 0
  µ s     2 µ 
 
 1 λ λ2 1
= 1 +  +
 1! µ  2 ! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 1.5) + (1.5) 2
2 1 − 0.75
1
=7
p0
1
p0 = = 0.1429
7
s +1
λ 
 
Lq =
1 µ p0 =
1 (1.5) (0.1429) = 1.9292
3

s. s!  λ 
2
2 . 2 ! (1 − 0.75)2
1 − 
 µs
Lq 1.9292
Wq = = = 0.0643 hr = 3.86 min .
λ 30
Thus when both the tellers handle both services, the average waiting time of the
customer is decreased.
Hence situation (ii) is better.
Now, if the service time is increased to 3.5 minutes, then
1 1 120
λ = 30 / hr , µ =/ min = × 60 = / hr
3.5 3.5 7
λ 30 × 7 7 λ 7 7
= = = 1.75 , = = = 0.875
µ 120 4 s µ 2× 4 8
 s   2 
n   λ   n   λ  
1 s −1
1 λ   µ  1
1 λ   µ 
=∑   + = ∑   + 
p0 n=0 n !  µ  
 s ! 1 − λ  n! µ  2! 1 − λ  
 n =0
  µ s     2 µ  

 1 λ λ2 1
= 1 +  +
 1! µ  2! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 1.75) + (1.75) 2
2 1 − 0.875
1
= 15
p0
1
p0 = = 0.0667
15
s +1
λ
 
Lq =
1 µ p0 =
1 (1.75) (0.0667) = 5.7195
3

s . s!  λ 
2
2 . 2! (1 − 0.875)2
1 − 
 µ s 
Lq 5.7195
Wq = = = 0.1907 hr = 11.44 min .
λ 30
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 28

21. Solution:
Only one emergency clinic [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 min
The problem dealt with queue size.

Arrival time
For 24 hr → 96 patients arrive
96
For 1 hr (60 min.) → = 4 patients
24
4 1
For 1 min. → = patient
60 15
1
∴λ= patient / min .
15

Service time 10 min. for a patient.

1
⇒µ= patient / min
10
Given average number of patients in the queue = Lq = 1 patient, which is the
current queue size.
For the new queue size (shall be reduced by increasing µ )
λ2
Lq =
µ ′( µ ′ − λ )
1 λ2
=
2 µ ′( µ ′ − λ )
⇒ µ ′ 2 − λ µ ′ − 2 λ2 = 0
1 2
µ ′2 − µ ′ − =0
15 225
225µ ′ 2 − 15µ ′ − 2 = 0
(15 µ ′ − 2) (15 µ ′ + 1) = 0
2
⇒ µ′ = patient / min , sin ce negative value is not acceptable
15
So, for 15 min → 2 patients treated
15
⇒ 1 patient → min = 7 12 min
2
∴ Increase in service rate = µ ′ − µ
2 1 1
= − = patient / min .
15 10 30
∴ Decrease in service time = 10 min − 7 12 min
= 2 12 min
∴ Extra cos t = 2 12 × Rs.10 = Rs. 25
∴ New Budget = Rs.100 + Rs. 25
= Rs. 125
∴ In order to get the required size of the queue, the budget should be increased from
Rs. 100 per patient to Rs. 125 per patient.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 29

22. Solution:
Only one clinic [(i.e.) s = 1] and 14 patients in waiting room.
Total Accomodation : 14 patients in waiting room and 1 patient in doctor’s room.
∴ ( M / M / 1) : (15 / FIFO) - Model III
Unit time – 1 hr.
λ 30
λ = 30 / hr , µ = 20 / hr , = = 1.5 Here λ ≠ µ
µ 20
λ
1−
µ 1 − 1 .5
(i) P(customer will not wait) = p0 = k +1 = = 0.00076
λ 1 − (1.5) 16
1 −  
µ 
(ii) Effective arrival rate at the clinic, λ ′ = µ (1 − p 0 ) = 20(1 – 0.00076) = 19.98 / hr
= 20 patients / hr.
(iii) Expected waiting time until he is discharged from clinic = Ws
 λ 
k +1

 (k + 1)   
 λ   µ  
Ls =   −  k +1 
µ −λ  λ 
1 −  
 µ  
30 (16)(1.5)16
= −
20 − 30 1 − (1.5)16
= 13.02
L 13.02
∴ Ws = s = = 0.651 hr = 39.06 min .
λ′ 20
23. Solution:
2 long distance opeators [ 2 server (i.e.) s = 2] and no restriction on accomodation
∴ ( M / M / 2) : (∞ / FIFO) - Model II
Unit time – 1 hour
1 1
λ = 15 / hr , µ = / min . = × 60 / hr = 12 / hr
5 5
λ 15 λ 1.25
= = 1.25 , = = 0.625
µ 12 sµ 2
(i) P( the subscriber will have to wait ) = p (n ≥ 2) = p 2 + p 3 + p 4 + − − − − − −
= 1 − [ p 0 + p1 ]
 s   2 
n   λ   n   λ  
1 s −1
1 λ    µ  1
1 λ   µ 
=∑   + = ∑   + 
p0 n=0 n !  µ  
 s ! 1 − λ  n! µ  2! 1 − λ  
 n= 0
  µ s     2 µ 
 
 1 λ λ2 1
= 1 +  +
 1! µ  2 ! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 1.25) + (1.25) 2
2 1 − 0.625
1
= 4.3333
p0
1
p0 = = 0.2308
4.3333
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 30

λ
p1 = p0 = (1.25) (0.2308) = 0.2885
1! µ
∴ p ( n ≥ 2) = 1 − [ p0 + p1 ]
= 1 − (0.2308 + 0.2885) = 0.4807
(ii) Expected waiting time = Wq , Ws
s +1
λ
 
Lq =
1 µ 1
p0 =
(1.25)3 (0.2308) = 0.8014
s . s!  λ 
2
2 . 2 ! (1 − 0.625)2
1 − 
 µ s 
Lq 0.8014
∴ Wq = = = 0.0534 hr = 3.2 min .
λ 15
λ
Ls = Lq + = 0.8014 + 1.25 = 2.0514
µ
L 2.0514
∴ Ws = s = = 0.1368 hr = 8.208 min .
λ 15

24. Solution:
First consider only one server is servicing.
∴ ( M / M / 1) : (∞ / FIFO) - Model I
Unit time – 1 hr.
λ = 20 / hr , µ = 22 / hr
1
Waiting time of a customer in the system = Ws =
µ −λ
1
= = 0.5 hr = 30 min .
22 − 20
∴ Waiting time of a customer with single server = 30 minutes.
Now consider two server are servicing.
∴ ( M / M / 2) : (∞ / FIFO) - Model II
Unit time – 1 hour
λ = 20 / hr , µ =11 / hr
λ 20 λ 1.8181
= = 1.8181 , = = 0.9091
µ 11 sµ 2
To find Ws
 s   2 
n   λ   1 n   λ  
1 s −1
1 λ   µ  1 λ   µ 
=∑   + = ∑   +  
p0 n=0 n !  µ   s ! 1 − λ   n =0 n !  µ   2! 1 − λ  
  µ s     2 µ  
   
 1 λ λ2 1
= 1 +  +
 1! µ  2! µ 1 − λ 
2

 2µ 
 
1 1
= (1 + 1.8181) + (1.8181) 2
2 1 − 0.9091
1
= 21.0001
p0
1
p0 = = 0.0476
21.0001
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 31

s +1
λ
 
Lq =
1 µ p0 =
1 (1.8181) (0.0476) = 8.6551
3

s . s!  λ 
2
2 . 2 ! (1 − 0.9191)2
1 − 
 µs
λ
Ls = Lq + = 8.6551 + 1.8181 = 10.4732
µ
L 10.4732
∴ Ws = s = = 0.5237 hr = 31.42 min .
λ 20
Thus waiting time of a customer with 2 server = 31.42 minutes.
Hence Model I is better which has less waiting time.

25. Solution:
Case (i) Not appointing one more salesman
For supply
There are 3 salesman [ 3 server (i.e.) s = 3] and no restriction on accomodation
∴ ( M / M / 3) : (∞ / FIFO ) - Model II
Unit time – 1 hour
1 1
λ = 30 / hr , µ 1 = / min . = × 60 / hr = 12 / hr
5 5
λ 30 λ 2.5
= = 2.5 , = = 0.8333
µ 1 12 sµ 1 3
 s   3 
   λ   2    λ  
1 λ 
n  1 λ 
n 
1 s −1
  µ1     µ1  
=∑   + = ∑   +  
p0 n=0 n!  µ1  
 s ! 1 − λ  n !  µ   λ 
  3! 1 − 
n = 0 1
  µ1 s     3 µ1  
   
 1 λ 1  λ  2  (2.5) 3 1
= 1 + +    +
 1! µ1 2!  µ1   6 (1 − 0.8333)
15.625
= (1 + 2.5 + 3.125) +
1.0002
1
= 22.2469
p0
1
p0 = = 0.0450
21.0001
s +1
λ 
 
Lq =
1  µ1  p =
1 (2.5) 4
(0.0450) = 3.5142
0
s . s!  λ 
2
3 . 3! (1 − 0 . 8333) 2

1 − 
 µ1 s 
λ
Ls = Lq + = 3.5142 + 2.5 = 6.0142
µ1
Ls 6.0142
∴ Ws = = = 0.2005 hr = 12.03 min .
λ 30
For payment
Only 1 salesman [ 1 server (i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hour
1
λ = 30 / hr , µ 2 = / min . = 1 × 60 / hr = 60 / hr
1
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 32

λ 30
Ls = = =1
µ 2 − λ 60 − 30
1 1 1
Ws = = = hr = 2 min .
µ 2 − λ 60 − 30 30
Hence average number of customers in the shop = 6.0142 + 1 = 7.0142 customers
and average waiting time = 12.03 + 2 = 14.03 min.
Case (ii) Appointing one more salesman
For supply
There are 4 salesman [4 server (i.e.) s = 4] and no restriction on accomodation
∴ ( M / M / 4) : (∞ / FIFO ) - Model II
Unit time – 1 hour
1 1
λ = 30 / hr , µ 1 = / min . = × 60 / hr = 12 / hr
5 5
λ 30 λ 2 .5
= = 2.5 , = = 0.625
µ 1 12 sµ 1 4
 s   4 
n   λ   3 n   λ  
1 s −1
1 λ    µ1   1 λ    µ1  
=∑   + = ∑   +  
p 0 n =0 n !  µ1   s ! 1 − λ   n =0 n !  µ1   4 ! 1 − λ  
  µ1 s     4 µ1  
   
 1 λ 1  λ  2 1  λ  3  (2.5) 4 1
= 1 + +   +    +
 1! µ1 2 !  µ1  3!  µ1   24 (1 − 0.625)
= (1 + 2.5 + 3.125 + 2.6042) + 4.3403
1
= 13.5695
p0
1
p0 = = 0.0737
13.5695
s +1
λ 
 
Lq =
1  µ1 p0 =
1 (2.5) (0.0737) = 0.5331
5

s.s!  λ 
2
4 . 4! (1 − 0.625)2
1 − 
 µ s
1 

λ
Ls = Lq + = 0.5331 + 2.5 = 3.0331
µ1
Ls 3.0331
∴ Ws = = = 0.1011 hr = 6.07 min .
λ 30
For payment
Only 1 salesman [ 1 server (i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hour
1 1
λ = 30 / hr , µ 2 = / min . = × 60 / hr = 40 / hr
1. 5 1 .5
λ 30
Ls = = =3
µ 2 − λ 40 − 30
1 1 1
Ws = = = hr = 6 min .
µ 2 − λ 40 − 30 10
Hence average number of customers in the shop = 3.0331 + 3 = 6.0331 customers
and average waiting time = 6.07 + 6 = 12.07 min.
∴ There is some advantage due to the appointment but owner’s job could not be
accomplished fully.
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 33

26. Solution:
A one barber shop [(i.e.) s = 1] and 5 seats are available for waiting customers.
Total Accomodation : 5 seats are there for waiting customer and 1 person in
barber’s chair.
∴ ( M / M / 1) : (6 / FIFO ) - Model III
Unit time – 1 hr.
1 1 λ 5
λ = 5 / hr , µ = / min = × 60 / hr = 6 / hr , = = 0.833 Here λ ≠ µ
10 10 µ 6
Average time a customer spends in the system = Ws
λ
1−
µ 1 − 0.833
p0 = k +1
= = 0.2314
λ  1 − ( 0.833) 7
1 −  
µ 
 λ 
k +1
 (k + 1)   
 λ   µ  
Ls =   −  k +1 
µ −λ  λ 
 1 −  µ  
   
5 (7)(0.833) 7
= −
6 − 5 1 − (0.833) 7
= 2.3006
λ ′ = µ (1 − p 0 ) = 6(1 – 0.2314) = 4.61 / hr
L s 2.3006
∴ Ws = = = 0.499 hr = 29.94 min .
λ′ 4.61

27. Solution:
A general insurance company has 3 claim adjusters [ 3 server (i.e.) s = 3] and no
restriction on accomodation
∴ (M / M / 3) : (∞ / FIFO) - Model II
Unit time – 1 hour
20 5 1 1 3
λ = / hr = / hr , µ = / min . = × 60 / hr = / hr
8 2 40 40 2
λ 5/ 2 5 λ 5/3 5
= = = 1.67 , = = = 0.556
µ 3/ 2 3 sµ 3 9
 s   3 
s −1 1  λ 
n   λ   2 1 λ 
n  
 λ 
 
1   µ    µ 
=∑   + = ∑   +  
p 0 n =0 n !  µ   s ! 1 − λ   n =0 n !  µ   3! 1 − λ  
  µ s     3 µ  
   
 1 λ 1  λ 2  (1.67) 3
= 1 + +    +
 1! µ 2!  µ   6 (1 − 0.556 )

 1 
= 1 + 1.67 + (1.67) 2  + 1.7483
 2 
1
= 5.8127
p0
1
p0 = = 0.1720
5.8127
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 34

λ 5/3 5
(a) Fraction of time an adjuster is busy = s µ = 3 = 9 = 0.556
∴ Number of hours a week an adjuster can expect to spend with claimants
5
= × 8 × 5 = 22.22 hrs
9
(b) Average time spent by a claimant in the office = Ws
s +1
λ
 
Lq =
1 µ p =
1 (1.67)4 (0.1720) = 0.3770
0
s . s!  λ 
2 3 . 3 ! (1 − 0.556)2
1 − 
 µ s 
λ
L s = L q + = 0.3770 + 1.67 = 2.047
µ
L s 2.047 2 (2.047 )
∴ Ws = = = 0.818 hr = 49.08 min .
λ 5/2 5

28. Solution:
A petrol pump [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr.
1 1
λ = 10 / hr , µ = / min . = × 60 / hr = 20 / hr
3 3
λ 10
(i) Ls = µ − λ = 20 − 10 = 1 car
1 1 1
(ii) W s = µ − λ = 20 − 10 = 10 = 0.1 hr = 6 min .

λ2 10 2
L =
(iii) q µ (µ − λ ) (20)(20 − 10) = 0.5 car
=

(iv) P(the number of cars in the system is 2) = p2

2 2
λ  λ  λ
=   p 0 =   1 − 
µ µ  µ
2
 10   10 
=   1 − 
 20   20 
= 0.125

29. Solution:
nµ , n < s
(i) λn = λ ∀ n & µn = 
s µ , n ≥ s
By birth and death process
λ λ λ ......λn−1
pn = 0 1 2 p
µ 0 µ1 µ 2 ....µ n 0
 λ λ λ.......ntimes
1µ 2 µ 3µ ........ntimes p0 , n<s

=
 λ λ λ .......n times
p , n≥s
[1µ 2 µ 3 µ ........(s − 1) µ ] [ sµ . sµ .........(n − s + 1) µ times ] 0
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 35

 λn
 p0 , n<s
 n!µ
n ( s − 1)! µ s −1 ( s µ ) n− s +1
=
 λn ( s − 1)! s.s n− s µ s −1+ n− s +1
 s ! s n− s µ n p 0 , n≥s
 s ! s n− s µ n
To find p0
Sum of all probabilities = 1
(i.e.) [ p0 + p1 + p2 + ....... + p s −1 ] + [ p s + p s +1 + p s + 2 + .......] = 1
 1λ 1 λ
2
1 λ
s −1   1  λ s 1 λ
s +1 

⇒ p0 + p0 +   p0 + ..........+   p0  +    p0 +   p0 ...... = 1
 1! µ 2!  µ  ( s − 1) !  µ    s !  µ  s. s !  µ  

1 λ
s −1 n
1 λ
s   λ   λ  2  λ 3 
⇒ p0 ∑   +   p0 1 +   +   +   + ......... = 1
n = 0 n!  µ  s!  µ    sµ   sµ   sµ  
  λ 
s 
 s −1 1  λ  n
µ  λ 
−1 
⇒ p0  ∑   +  1 −   =1
n = 0 n!  µ  s !  sµ  
 
 s 
1 n   λ  
⇒ p0 = 1 s −1 1  λ    µ 
  (Or ) = ∑   + 
p0 n=0 n !  µ 
s
n   λ    s ! 1 − λ  
s −1 1 λ   µ    µ s  
∑   +   
n=0 n! µ  s ! 1 − λ  
  µ s  
 

(ii) Expected waiting time of a customer in the queue = Wq

To find Lq
∞
Lq = ∑ (n − s) pn n=q+s
n=s q=n–s
= 0. p s + 1. p s +1 + 2. p s + 2 + .............
λn +1 2 λn + 2 3 λn+3
= p 0 + p 0 + p 0 + ...............
s ! s µ n +1 s ! s 2 µ n+ 2 s ! s 3 µ n+3
λn+1  λ λ2 
= p 01 + 2. + 3 + ..........
s ! s µ n+1  sµ s2µ 2 
s +1
λ 
−2  
λn+1  λ  1 µ
= p0 
 1 −  = p0
s ! s µ n+1  sµ  s. s !  λ 
2
1 − 
 µ s 
s
λ
 
Lq 1 µ
p0
∴ Wq = = µ. s . s ! 2
λ  λ 
1 − 
 µ s 

(iii) Unit time – 1 hour

λ = 10 / hr , µ = 3 / hr , s = 4
λ 10 λ 10 / 3 5
= = 3.333 , = = = 0.833
µ 3 sµ 4 6
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 36

P(a customer has to wait for service ) = p (n ≥ 4) = p 4 + p5 + p6 + − − − − − −

= 1 − [ p 0 + p1 + p 2 + p 3 ]
 s   4 
n   λ   3 n   λ  
1 s −1 1 λ   µ  1 λ   µ 
=∑   + = ∑   + 
p 0 n =0 n ! µ  s ! 1 − λ   n =0 n ! µ  4 ! 1 − λ  
  µ s     4µ 
 
  
 1 λ 1  λ  2 1  λ 3  (3.333) 4
= 1 + +   +    +
 1! µ 2 !  µ  3!  µ   24 (1 − 0.833)

 1 1 
= 1 + 3.333 + (3.333) 2 + (3.333) 3  + 30.7903
 2 6 
1
= 46.8487
p0
1
p0 = = 0.0213
46.8487
λ λ2 λ3
p1 = p 0 = 3.333 p 0 , p 2 = 2
p0 = 1.667 p0 , p3 = p 0 = 0.556 p 0
1! µ 2 !µ 3 !µ 3
∴ p (n ≥ 4) = 1 − [ p 0 + p1 + p 2 + p3 ]
= 1 − [ p 0 + 3.333 p0 + 1.667 p 0 + 0.556 p0 ]
= 1 − 6.556 p0
= 1 − 6.556 (0.0213)
= 0.8604

30. Solution:
Only one typist [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr.
λ = 5 / hr , µ = 8 / hr
λ 5
(i) Equipment utilization (The typewriter remains busy) = µ = 8 = 0.625
(ii) P(Arriving letter has to wait) = p (n ≥ 1) = p1 + p 2 + p3 + − − − − − −
 λ
= 1 − p 0 = 1 − 1 − 
 µ
λ
= = 0.625
µ
∴ The percent time an arriving letter has to wait = 0.625 × 100 = 62.5%
1 1 1
(iii) W s = µ − λ = 8 − 5 = 3 hr = 20 min .
(iv) Average idle time cost of the typewriter per day = p0 × 8 × Rs 1.50
 5
= 1 −  × 8 × 1.50
 8
= Rs 4.50
31. Solution:
Only one ticket counter [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr.
λ = 12 / hr , µ = 30 / hr
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 37

 λ 12 2
(i) P(no customer in the counter) = p0 = 1 − µ  = 1 − 30 = 1 − 5 = 0.6
 
(ii) P(there are more than 2 customers in the counter) = p (n > 2)
3
λ
=   = (0.6) 3 = 0.064
µ
(iii) P(there is no customer waiting to be served)
= P(there is at most one customer in the counter)
= p0 + p1
λ  12 
= p 0 +   p 0 = 0.6 +   ( 0.6) = 0.84
µ  30 
(iv) P(a customer is being served and nobody is waiting)
= P(there is exactly one customer)
= p1
 12 
=   (0.6) = 0.24
 30 

32. Solution:
The problem is to find how many servers should be provided at the port.
1 1
Here λ = / hr , µ = / hr
4 10
λ
For multiple server queueing system s µ < 1 , to ensure that the queue does not explode.
λ 1/ 4 10
(i.e.) s µ < 1 ⇒ s (1 / 10) < 1 ⇒ 4 s < 1
5
⇒ <s
2
5
⇒ s>
2
5
First we calculate the waiting time in the queue (Wq) for s = 3 (since s > )
2
λ 1/ 4 5 λ 2.5
= = = 2.5 , = = 0.833
µ 1 / 10 2 sµ 3
 s   3 
s −1 1  λ 
n   λ   2 n   λ  
1   µ  1 λ   µ 
=∑   + = ∑   + 
p 0 n =0 n !  µ   s ! 1 − λ   n =0 n ! µ  3! 1 − λ  
  µ s     3 µ  
   
 1 λ 1  λ 2  (2.5) 3
= 1 + +    +
 1! µ 2 !  µ   6 (1 − 0.833)

 1 
= 1 + 2.5 + ( 2.5) 2  + 15.5938
 2 
1
= 22.2188
p0
1
p0 = = 0.0450
22.2188
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 38

s +1
λ
 
Lq =
1 µ p =
1 (2.5)4 (0.0450) = 3.5016
0
s . s!  λ 
2 3.3! (1 − 0.833)2
1 − 
 µ s 
Lq 3.5016
∴ Wq = = = 14.0064 hrs
λ 1/ 4
which is slightly greater than 14 hours. So three berths (s = 3) are not enough.
Now we calculate the waiting time in the queue (Wq) for s = 4
λ 1/ 4 5 λ 2.5
= = = 2.5 , = = 0.625
µ 1 / 10 2 sµ 4
 s   4 
n   λ   3 n   λ  
1 s −1 1 λ   µ  1 λ   µ 
=∑   + = ∑   + 
p 0 n =0 n ! µ  s ! 1 − λ   n =0 n ! µ  4 ! 1 − λ  
  µ s     4µ 
 
  
 1 λ 1  λ  2 1  λ 3  ( 2.5) 4
= 1 + +   +    +
 1! µ 2 !  µ  3!  µ   24 (1 − 0.625 )

 1 1 
= 1 + 2.5 + ( 2.5) 2 + ( 2.5) 3  + 4.3403
 2 6 
1
= 13.5695
p0
1
p0 = = 0.0737
13.5695
s +1
λ
 
Lq =
1 µ p0 =
1 (2.5)5
(0.0737) = 0.5331
s . s!  λ 
2 4. 4! (1 − 0.625)2
1 − 
 µ s 
Lq 0.5331
∴ Wq = = = 2.1324 hrs
λ 1/ 4
which is less than 14 hours.
Hence four berths (s = 4) must be provided.

33. Solution:
A tax consulting firm has 4 service counters [ 4 server (i.e.) s = 4] and no restriction
on accomodation
∴ ( M / M / 4) : (∞ / FIFO ) - Model II
Unit time – 1 hour
80 1 1
λ= / hr = 10 / hr , µ = / min . = × 60 / hr = 3 / hr
8 20 20
λ 10 λ 10 / 3 5
= = 3.333 , = = = 0.833
µ 3 sµ 4 6
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 39

 s   4 
s −1 1  λ 
n   λ   3 n   λ  
1   µ  1 λ   µ 
=∑   + = ∑   +  
p 0 n =0 n !  µ   s ! 1 − λ   n =0 n !  µ   4 ! 1 − λ  
  µ s     4µ 
 
  
 1 λ 1  λ  2 1  λ 3  (3.333) 4
= 1 + +   +    +
 1! µ 2 !  µ  3!  µ   24 (1 − 0.833)

 1 1 
= 1 + 3.333 + (3.333) 2 + (3.333) 3  + 30.7903
 2 6 
1
= 46.8487
p0
1
p0 = = 0.0213
46.8487
s +1
λ
 
1 µ 1 (3.333) 5
L = p0 = (0.0213) = 3.2723
(i) q s . s !  λ 
2 4 . 4 ! (1 − 0.833) 2
1 − 
 µs
λ
(ii) Ls = Lq + µ = 3.2723 + 3.333 = 6.6053

Ls 6.6053
(iii) Ws = = = 0.6605
λ 10
Lq 3.2723
(iv) Wq = = = 0.3272
λ 10
λ 10 5
(v) Utilization factor ( a tax consultant is busy) = ρ = s µ = 4 × 3 = 6
Hence the number of hours each week a tax consultant spends with customer
5
= × 8 × 5 = 33.33 hrs
6
(vi) P( a customer has to wait for service ) = p (n ≥ 4) = p4 + p5 + p6 + − − − − − −
= 1 − [ p 0 + p1 + p 2 + p 3 ]
λ λ2 λ3
p1 = p 0 = 3.333 p 0 , 2
p = 2
p0 = 1.667 p0 , p3 = p 0 = 0.556 p 0
1! µ 2 !µ 3 !µ 3
∴ p ( n ≥ 4) = 1 − [ p 0 + p1 + p 2 + p3 ]
= 1 − [ p 0 + 3.333 p0 + 1.667 p 0 + 0.556 p0 ]
= 1 − 6.556 p0
= 1 − 6.556 (0.0213)
= 0.8604
s 4
(vii) Average of idle tax advisers at any time = ∑ kPs − k = ∑ kP4 − k
k =0 k =0

= 0 + 1p3 + 2p2 + 3p1 + 4p0

= 0.556 p0 + 2(1.667) p0 + 3(3.333) p0 + 4p0
= 17.889 p0
= 17.889 (0.0213)
= 0.3810
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 40

34. Solution:
Only one counter in the bank [(i.e.) s = 1] and no restriction on accomodation
∴ ( M / M / 1) : (∞ / FIFO ) - Model I
Unit time – 1 hr.
1 1
λ = 8 / hr , µ = / min . = × 60 / hr = 10 / hr
6 6
(i) P(an arriving customer has to wait) = p (n ≥ 1) = p1 + p2 + p3 + − − − − − −
 λ
= 1 − p 0 = 1 − 1 − 
 µ
λ 8
= = = 0.8
µ 10
(ii) P(there are 4 customers in the system ) = p4
4 4
λ  λ   λ
=   p0 =   1 − 
µ µ  µ
= (0.8) 4 (1 − 0.8)
= 0.0819
(iii) P(a customer has to spend less than 15 minutes in the bank) = P(Ws < 15)
 1 
= P Ws < hr 
 4 
 1
= 1 − P W s > 
 4
1
− (10 − 8)
= 1− e 4

1
−
= 1− e 2

= 1 − 0.6065
= 0.3935
λ 8
(iv) Fraction of time that the counter is busy = µ = 10 = 0.8
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 41

1. Derive p 0 , Ls , Lq , W s , Wq for ( M / M / 1) : (∞ / FIFO ) queueing model

(or) Derive the formula for average number of customers in the system, probability
that the number of customers in the system exceeds k and the average waiting time
of a customer in the queue for the model (M / M / 1) : (∞ / FIFO)
Sol. λn = λ ∀ n & µ n = µ ∀ n
By birth and death process
λ λ λ ......λn−1
pn = 0 1 2 p
µ1 µ 2 µ 3 ......µ n 0
λ λ λ .......n times
= p0
µ µ µ........n times
n
λn λ 
= n p 0 =   p 0
µ µ
To find p0
Sum of all probabilities = 1
(i.e.) p0 + p1 + p 2 + ......... = 1
2 3
λ λ λ
⇒ p 0 + p0 +   p 0 +   p 0 + ...... = 1
µ µ µ
  λ   λ  2  λ 3 
⇒ p 0 1 +   +   +   + ......... = 1
  µ   µ   µ  
−1
 λ λ
⇒ p 0 1 −  =1 ⇒ p0 = 1 −
 µ µ
(i) To find Ls
Ls = E ( N ) = ∑ n p n
= 0. p0 + 1. p1 + 2. p 2 + ........
2 3
λ λ  λ 
= 1. p 0 + 2.  p 0 + 3  p0 + .......
µ µ µ
λ  2
λ λ 
= p 0 . 1 + 2. + 3.  + .......
µ  µ µ 
−2 −2
λ λ  λ λ λ
= p0 . 1 −  = 1 − . 1 − 
µ µ  µ µ µ
−1 −1
λ λ λ µ −λ λ µ 
= 1 −  =   =  
µ µ µ µ  µ  µ − λ 
λ
Ls =
µ −λ
To find Lq
Using Little’s formula
λ λ λ λ µ − λ (µ − λ ) λ2
Lq = Ls − = − = =
µ µ −λ µ µ (µ − λ ) µ (µ − λ )
To find Ws
Using Little’s formula
Ls 1
Ws = =
λ µ −λ
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 42

(iii) To find Wq
Using Little’s formula
Lq λ
Wq = =
λ µ (µ − λ )
∞
(ii) P(The system capacity exceeds k) = ∑
n = k +1
P ( n)

n
∞λ
P( n > k ) = ∑   p 0
n = k +1  µ 
n
 λ ∞ λ
= 1 −  ∑  
 µ  n = k +1  µ 

λ   λ  
k +1 k +2 k +3
 λ  λ 
= 1 −    +   +   + .............
 µ   µ  µ µ 
 
k +1  2 
 λ  λ  λ  λ 
= 1 −    1 +   +   + ............
 µ  µ    µ   µ  

k +1 −1
 λ  λ   λ
= 1 −    1 − 
 µ  µ   µ
k +1
λ
=  
µ

2. Derive p 0 , Ls , Lq , Ws , Wq for ( M / M / s ) : (∞ / FIFO ) queueing model

Sol.
nµ , n < s
λn = λ ∀ n & µn = 
s µ , n ≥ s
By birth and death process
λ λ λ ......λn−1
pn = 0 1 2 p
µ1 µ 2 µ 3 ......µ n 0
 λ λ λ.......n times
1µ 2 µ 3µ........n times p 0 , n<s

=
 λ λ λ.......n times
p , n≥s
 [1µ 2 µ 3 µ ........( s − 1) µ ] [sµ . sµ .........( n − s + 1)µ times ] 0
 λn
 n 0
p , n<s
 n !µ ( s − 1)! µ s −1 ( s µ ) n− s +1
=
 λn ( s − 1)! s.s n− s µ s −1+ n− s +1
 s ! s n−s µ n p0 , n≥s
 s ! s n− s µ n

To find p0
Sum of all probabilities = 1
(i.e.) [ p0 + p1 + p 2 + ....... + p s −1 ] + [ p s + p s +1 + p s + 2 + .......] = 1
 1λ 1 λ
2
1 λ
s −1   1  λ s 1 λ
s +1 
⇒  p0 + p0 +   p 0 + .......... +   p0  +    p 0 +   p 0 ...... = 1
 1! µ 2!  µ  ( s − 1) !  µ    s!  µ  s. s !  µ  
   
1 λ 
s −1 n
1λ
s   λ   λ  2  λ 3 
⇒ p0 ∑   +   p0 1 +   +   +   + ......... = 1
n = 0 n!  µ  s! µ    sµ   sµ   sµ  
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 43

 λ 
s 
 s −1 1  λ   µ 
n
 λ 
−1 
⇒ p0  ∑   +   1 −   = 1
n = 0 n !  µ  s!  s µ  
 
 s 
1 s −1 1  λ 
n   λ  
⇒ p0 = 1   µ 
  (Or ) =∑   + 
p0 n=0 n !  µ 
s
n   λ    s ! 1 − λ  
s −1 1 λ   µ    µ s  
∑   +   
n =0 n ! µ  s ! 1 − λ  
  µ s  
 
To find Lq
∞
Lq = ∑ ( n − s ) p n n=q+s
n=s q=n–s
= 0. p s + 1. p s +1 + 2. p s + 2 + .............
λn +1 2 λn + 2 3 λ n +3
= p 0 + p 0 + p0 + ...............
s ! s µ n +1 s ! s 2 µ n +2 s ! s 3 µ n+3
λn+1  λ λ2 
= p 0 1 + 2. + 3 + ..........
s ! s µ n+1  sµ s 2µ 2 
−2
λn+1  λ 
= p0 1 −
n+1 

s ! s µ  sµ 
s +1
λ
 
Lq =
1 µ p0
s . s!  2
λ 
1 − 
 µ s 
To find Ls
s +1
λ
 
Ls = Lq +
λ
=
1 µ p0 +
λ
2
µ s . s!  λ  µ
1 − 
 µs
To find Ws
 λ
s +1  λ
s
     
Ls 1  1 µ λ 1 µ 1
Ws = = p0 +  = p0 +
λ λ  s . s !  λ 
2
µ  µ. s . s !  λ 
2
µ
 1 −   1 − 
  µ s    µ s 
To find Wq
s
λ
 
Lq 1 µ
Wq = = µ. s . s ! 2
p0
λ  λ 
1 − 
 µs
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 44

3. Derive p 0 , Ls , Lq ,W s ,Wq for ( M / M / 1) : ( k / FIFO ) queueing model

λ , n < k
Sol. λ n =  and µ n = µ ∀ n
0, n≥k
By birth and death process
λ λ λ ......λ n−1
pn = 0 1 2 p
µ1 µ 2 µ 3 ....µ n 0
 λn
 p , n≤k
= µn 0

0 , n>k

To find p0
Case (i) When λ ≠ µ
We have p0 + p1 + p 2 + ......... = 1
λ λ2 λk
⇒ p 0 + p 0 + 2 p 0 + ..... + k p 0 = 1 − − − − − −(1)
µ µ µ
 λ λ2 λk 
⇒ p 0 1 + + 2 + ..... + k  = 1
 µ µ µ 
  λ  k +1  λ
1 −    1−
 µ 
⇒ p0     = 1 ⇒ p0 =
µ
, if λ ≠ µ
λ λ
k +1
 1−  1 −  
 µ 
  µ
 λ 
n  1−
λ   µ 
∴ p n =    k +1 
, if λ ≠ µ
µ  λ  
 
1 −  µ  
   
λ
Case (ii) When µ = 1 (i.e.) λ = µ we have from equation (1),
p0 + [ p0 + p0 + .....k times ] = 1
⇒ (k + 1) p0 = 1
1 1
⇒ p0 = , if λ = µ ∴ pn = , if λ = µ
k +1 k +1

To find Ls
Case (i) When λ ≠ µ
k
Ls = ∑ n p n
n= 0

= 0. p0 + 1. p1 + 2. p 2 + ........ + k . p k
2 3 k
λ λ  λ  λ
= 1. p 0 + 2.  p 0 + 3  p 0 + ....... + k   p 0
µ µ µ µ
λ λ 
2 k −1
λ  λ 
= p0 1 + 2.  + 3  + ....... + k   
µ µ µ  µ  
 λ
1−
µ 1− x
=
x (1 − x)
1 − x k +1
[1 + 2.x + 3.x 2
]
+ ....... + k .x k −1 where x =
λ
µ
, p0 =
λ
k +1
=
1 − x k +1
1 −  
µ
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 45

x (1 − x) d
=
1− x k +1 dx
(
x + x 2 + x 3 ....... + .x k )
x (1 − x) d
=
1− x k +1
dx
(
1 + x + x 2 + x 3 ....... + .x k − 1 )
x (1 − x) d 1 − x k +1 
=  − 1
1 − x k +1 dx  1 − x 
x (1 − x ) d  x − x k +1 
=  
1 − x k +1 dx  1 − x 

= 
(
x (1 − x )  (1 − x){1 − ( k + 1) x k } − x − x k +1 (−1) 

)
1 − x k +1  (1 − x) 2 
x (1 − x ) 1 − (k + 1) x k − x + ( k + 1) x k +1 + x − x k +1 
=  
1 − x k +1  (1 − x ) 2 
x 1 − (k + 1) x k + k x k +1 
=  
1 − x k +1  1− x 
x − x k + 2 + x k + 2 − (k + 1) x k +1 + k x k +2
=
(1 − x ) (1 − x k +1 )
x (1 − x k +1 ) − x k +1[ (k + 1) − k x − x ]
=
(1 − x ) (1 − x k +1 )
x (1 − x k +1 ) − x k +1[ (1 − x) (1 + k )] (k + 1) – kx – x
= k + 1 – kx – x
(1 − x) (1 − x k +1 ) k(1 – x) + (1 – x)
x x k +1 (k + 1) (1 – x) (1 + k)
= −
1− x 1 − x k +1
k +1
λ  λ  (k + 1)
µ
− 
µ
=
1− λ
k +1
µ 1 −  λ 
 µ
k +1
(k + 1)  λ 
λ  µ
Ls = − k +1
, if λ ≠ µ
µ −λ
1 −  λ 
 µ
Case (ii) When λ = µ
k k 1 1 k
Ls = ∑ n pn = ∑ n = ∑ n
n=0 n=0 k + 1 k + 1 n=0
1
= [0 + 1 + 2 + 3 + .............. + k ]
k +1
1 k ( k + 1) k
= =
k +1 2 2

Lq, Ws, Wq can be found using Little’s formula.

λ′
Lq = L s − where λ ′ = µ (1 − p 0 ) is the effective arrival rate.
µ
Ls Lq
Ws = and Wq =
λ′ λ′
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 46

4. Derive p 0 , L s , Lq , W s , W q for ( M / M / s ) : (k / FIFO ) queuing model

λ , n < k
λ
Sol. Let n 0 ,
=
 n≥k
nµ , n < s
µ
and n s µ , n ≥ s
=

By birth and death process
λ λ λ ......λn −1
pn = 0 1 2 p0 , n ≥1 − − − − − − (1)
µ1 µ 2 µ 3 ....µ n
Using the values of λn and µ n in equation (1) and noting that 1 < s < k, we get
 λn
 p
n 0
, n<s
 n! µ

pn = 
λn
n−s n
p0 , s≤n<k
 s! s µ


 0 , n>k

To find p0
∞
∑ pn = 1
n=0
s −1 k
⇒ ∑ pn + ∑ pn = 1
n=0 n=s
n n
s −11 λ k 1 λ
⇒ ∑   p0 + ∑ n−s
  p0 = 1
n = 0 n!  µ  n = s s! s µ
 s −1 1  λ  n s s k  λ  n 
⇒∑   + ∑    p0 = 1
 n = 0 n !  µ  s ! n = s  µ s  
 
 s −1 1  λ  n s s k  λ  n − s + s 
⇒∑   + ∑    p0 = 1
 n = 0 n !  µ  s ! n = s  µ s  
 
 s −1 1 λ
n
ss  λ  k  λ 
s n−s 
⇒∑   +   ∑    p0 = 1
n = 0 n !  µ  s !  µ s  n = s  µ s  
 
 s −1 1 λ 1
n s
λ k  λ 
n−s 
⇒∑   +   ∑    p0 = 1
n = 0 n!  µ  s!  µ  n=s  µ s  
 
1
(i.e.) p0 =
 s −1 1  λ  n 1  λ  s k  λ 
n−s 
∑   +   ∑   
 n = 0 n !  µ  s !  µ  n = s  µ s  
 
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 47

To find Lq
k
Lq = ∑ (n − s) pn
n=s
n
k (n − s) λ
= ∑   p0
n=s s! s n − s µ
n
p k (n − s )  λ 
= 0 ∑  
s! n=s sn−s  µ 
s n−s
p λ  k (n − s)  λ 
= 0   ∑  
s!  µ  n=s sn−s  µ 
s x
p λ  k −s x λ 
= 0   ∑   [ Put n − s = x]
s!  µ  x =0 sx  µ 
s k −s x
p λ  λ 
= 0   ∑ x  
s!  µ  x =0  sµ 
s k −s
p λ λ
= 0   ∑ x ρ x where ρ =
s!  µ  x =0 sµ
s
p  λ  k −s
= 0   ρ ∑ x ρ x −1
s!  µ  x = 0
s k −s
p ρλ  d
= 0   ∑ (ρ x )
s!  µ  x =0 dρ
s
p ρλ d k −s
= 0   ∑ ρx
s !  µ  dρ x =0
s
p 0 ρ  λ  d  1 − ρ k − s +1 
=    
s !  µ  dρ  1 − ρ 
s
p0 ρ  λ   (1 − ρ ){− (k − s + 1) ρ k −s } − (1 − ρ k −s +1 ) (−1) 
=    
s !  µ   (1 − ρ ) 2 
s
p ρ  λ   − (k − s ) (1 − ρ ) ρ k − s − (1 − ρ ) ρ k −s + 1 − ρ k −s +1 
= 0    
s !  µ   (1 − ρ ) 2 
s
 λ  ρ  − (k − s) (1 − ρ ) ρ k −s + 1 − ρ k −s (1 − ρ + ρ ) 
= p0    
 µ  s !  (1 − ρ ) 2 
s
λ 
Lq = p0  
ρ
2
[
1 − ρ k −s − (k − s ) (1 − ρ ) ρ k − s ]
 µ  s ! (1 − ρ )

Ls, Ws, Wq can be found using Little’s formula.

λ′  s −1 
Ls = Lq + λ ′ = µ  s − ∑ ( s − n ) p n  is the effective arrival rate.
µ where  n = 0 
Ls Lq
Ws = and Wq =
λ′ λ′
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 48

5. Derive the average of self service queueing model.

Sol. In self service model, each customer is a server.
Service rate µ n = n µ [ when there are n customers in the system]
λn = λ ∀ n , if no restriction on accommodation.
By birth and death process
λ λ λ ......λn−1
pn = 0 1 2 p
µ1 µ 2 µ 3 ......µ n 0
λ λ λ .......n times
= p0
1µ 2µ 3µ........nµ
n
1 λn 1 λ
= p =   p0
n !  µ 
0
n! µ n
To find p0
We have sum of all probabilities = 1
(i.e.) p0 + p1 + p 2 + ......... = 1
2 3
1λ 1 λ 1 λ
⇒ p0 + p0 +   p0 +   p0 + ...... = 1
1! µ 2!  µ  3!  µ 
 1  λ  1  λ  2 1  λ 3 

⇒ p0 1 +   +   +   + ......... = 1
 1!  µ  2!  µ  3!  µ  
λ
µ
⇒ p0 e =1
−λ
µ
⇒ p0 = e

To find Ls
Ls = E ( N ) = ∑ n p n
= 0. p 0 + 1. p1 + 2. p 2 + ........
2 3
1 λ 1 λ 1 λ
= p 0 + 2.   p 0 + 3   p 0 + ...........
1! µ 2!  µ  3!  µ 

λ  1 λ 1 λ 
2 3
1 λ
= p 0 . 1 + +   +   + ...........
µ  1! µ 2 !  µ  3!  µ  
 
λ
λ µ
= p0 . e
µ
λ λ
−
µ λ µ
=e e
µ
λ
Ls =
µ

λ λ λ
Now, Lq = Ls − µ = µ − µ = 0
Ls λ/µ 1
Ws = = =
λ λ µ
Lq 0
and Wq = = =0
λ λ
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 49

Problem
1. Self service system is followed in a super market at a metropolis. The customer
arrivals occur according to a Poisson distribution with mean 40 per hour. Service
time per customer is exponential distributed with mean 6 minutes.
(i) Find the expected number of customers in the system.
(ii) What is the percentage of time the facility is idle.
Sol. Self service system means each customer is a server.
(i.e.) Infinite number of customers.
So, infinite number of servers and no information about capacity.
∴ ( M / M / ∞) : (∞ / FIFO)
Unit time – 1 hr.
1 1
λ = 40 / hr , µ = / min . = × 60 / hr = 10 / hr
6 6
(i) Expected number of customers in the system = Ls
λ
=
µ
40
= = 4 customers
10
(ii) P(the facility is idle) = p0
− λ
µ
=e
= e− 4
= 0.0183
∴ Percentage of time the facility is idle = 0.0183 × 100 = 1.83%
MOHAMED SATHAK A J COLLEGE OF ENGINEERING PQT by Mr. M. MURALIDHARAN UNIT - IV 50