Scribd
Upload
13 views

Lecture 31 - Queueing Systems III

Uploaded by

Neha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Lecture 31 - Queueing Systems III

Uploaded by

Neha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

LECTURE 31

QUEUEING SYSTEMS III

DR. ANUP KUMAR TRIPATHI

DEPARTMENT OF MINING ENGINEERING


NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA (NITK)
SURATHKAL − 575025, INDIA

1
QUEUEING SYSTEMS III

GENERALIZED POISSON QUEUING MODEL


 This section develops a generalized queuing model that combines both arrivals and departures
based on the Poisson assumptions − that is, the inter-arrival and the service times follow the
exponential distribution.

 The development of the generalized model is based on the long-run or steady state behavior of
the queuing situation, achieved after the system has been in operation for a sufficiently long time.

This type of analysis contrasts with the transient (or warm-up) behavior that prevails during the
early operation of the system.

 One reason for not discussing the transient behavior in this chapter is its analytical
complexity.
 Another reason is that the study of most queuing situations occurs under steady-state
conditions.

2
 The general model assumes that both the arrival and departure rates are state dependent −
meaning that they depend on the number of customers in the service facility.

For example, at a highway toll booth, attendants tend to speed up toll collection during rush hours.

Another example occurs in a shop where the rate of machine breakdown decreases as the number
of broken machines increases (because only working machines are capable of generating new
breakdowns).

 We define:

3
 The generalized model derives pn as a function of λn and μn.

These probabilities are then used to determine the system’s measures of performance, such as the
average queue length, the average waiting time, and the average utilization of the facility.

 The probabilities pn are determined by using the transition-rate diagram in Figure 3.

The queuing system is in state n when the number of customers in the system is n.

The probability of more than one event occurring during a small interval h tends to zero as h → 0.

This means that for n > 0, state n can change only to two possible states: n − 1 when a departure
occurs at the rate μn, and n + 1 when an arrival occurs at the rate λn.

State 0 can only change to state 1 when an arrival occurs at the rate λ0.

4
It is to be noted that μ0 is undefined because no departures can occur if the system is empty.

Figure 3: Poisson queues transition diagram.

 Under steady-state conditions, for n > 0, the expected rates of flow into and out of state n must be
equal.

Based on the fact that state n can be changed to states n – 1 and n + 1 only, we get:

5
Similarly, we have:

 Equating the two rates, we get the following balance equation:

 From Figure 3, the balance equation associated with n = 0 is:

6
 The balance equations are solved recursively in terms of p0.

For n = 0, we have:

 Next, for n = 1, we have:

 On substituting:

and simplifying, we get:

7
 We can show by induction that:

 The value of p0 is determined from the equation:

8
Example 2
 B&K Groceries operates with three checkout counters.

The manager uses the following schedule to determine the number of counters in operation,
depending on the number of customers in line:

Customers arrive in the counters area according to a Poisson distribution with a mean rate of 10
customers per hour.

The average checkout time per customer is exponential with mean 12 minutes.

Determine the steady-state probability pn of n customers in the checkout area.

9
Solution
 From the information of the problem, we have:

 We thus have:

10
 The value of p0 is determined from the equation:

 Using the geometric sum series:

we get:

We thus have:

11
 Given p0, we can now determine pn for n > 0.

For example, the probability that only one counter will be open is computed as the probability that
there are at most three customers in the system:

 We can use pn to determine measures of performance for the B&K situation.

For example,

12

You might also like