M/E_k/1 (∞/FIFO) System: Queuing Theory

It is a queuing model where the arrivals follow a Poisson process, service time follows an Erlang (k) probability distribution and the number of server is one.

Queue capacity of the system is infinite with first in first out mode. The first M in the notation stands for Poisson input, k for number of phases, 1 for the number of servers and ∞ for infinite capacity of the system.

An Erlang Family (E_k)

E_k of a probability distribution is the probability distribution of a random variable, which can be expressed as the sum k independently, identically distributed exponential variables.

On small screens, use horizontal scrollbar to view full calculation

Example 1

The registration of a student at Universal Teacher Publications requires three steps to be completed sequentially. The time taken to perform each step follows an exponential distribution with mean 30/3 minutes and is independent of each other. Students arrive at the head office according to a Poisson input process with a mean rate of 25 per hour. Assuming that there is only one person for registration. On the basis of this information, find the following:

1. expected waiting time
2. expected numbers of students in the queue.

Solution.

This is an M/E_k/1 system.

Here k = 3, λ = 25 per hour.

Example 2: M/E_k/1 (∞/FIFO) System (Queuing Models)

Repair of a certain type of machine requires three steps to be completed sequentially. The time taken to perform each step follows an exponential distribution with mean 20/3 minutes and is independent of each other. The machine breakdown follows a Poisson process with rate of 1per 2 hours. Assuming that there is only one repairman, find out

1. The expected idle time of a machine.
2. The average waiting time of a broken down machine in a queue.
3. The expected number of broken down machines in the queue.
4. The average number of machines which are not in operation

Solution.

This is an M/E_k/1 system.

Here k =3, λ =1/2 per hour.

Use horizontal scrollbar to view full calculation

As k approaches to infinity, the expressions of L_q, W_q , W_s and L_s are given by

Example 3

At Indira Gandhi airport, it takes exactly 6 minutes to land an aeroplane, once it is given the signal to land. Although incoming planes have scheduled arrival times, the wide variability in arrival times produces an effect which makes the incoming planes appear to arrive in a Poisson fashion at an average rate of 6 per hour. This produces occasional stack-ups at the airport, which can be dangerous and costly. Under these circumstances, how much time will a pilot expect to spend circling the field waiting to land?

Solution.

Here, service time is fixed being equal to 6 minutes.
The service distribution is last member of Erlang family, i.e., for k = ∞
Mean arrival rate of aeroplanes, λ = 6 per hour
Mean landing rate of planes, μ = (1/6) X 60 = 10 per hour