M / M / 1 Model

The M / M / 1 queueing model is the easiest mathematically to analyse. Hence, this page will work through some mathematical detail on analysis of the M / M / 1 model. Another section will summarise results for more complex models. More mathematical detail on the derivations in this section can be found in Chapter 2 of reference [PAGE72].

With reference to the section on Kendall notation, the reader will realise that the M / M / 1 model is a queueing model where both the distribution of customer arrivals and the distribution of service times are assumed to be exponential, and there is a single server.



M-M-1 defs


Let Pt(i) be defined as in the section on notation.

One can look at a small interval of time Delta t and express Pt(i) after the small interval of time (the equations holds for an natural number i).

M-M-1 prob stage1

For small values of Delta t, the chance of a customer arrival to the queue is LambdaDelta t, and the chance of a service completion is MuDelta t. Thus the equation above can be solved as a differential equation as Delta t tends to 0, with the correct values substituted in. The terms involving multiple events involve higher powers of Delta t, so they drop out during the analysis - demonstrating that multiple events cannot happen in a 'very short' period of time. The general solution to this equations is:

M-M-1 prob final

Also, it can shown from this that in a steady-state queueing system,

M-M-1 prob steadystate

and where

Rho equals lambda over Mu

Server Utilisation

In the steady state, the server is only being used when there are customers in the system. Thus the utilisation of the server can be found by subtracting the probability that there are no customers in the system from 1 (certainty):

M-M-1 server utilisation

Customer Waiting Time

The chance a customer will not have to wait for service at all is the probability that there are no customers in the queue:

M-M-1 no wait at all

However, one can go one better than this and work out the PDF of the customer waiting time, so that more information can be found on how long a given customer may have to wait. It can be shown by consideration of the time the other customers will have to wait in the queue, and the most likely number of customers in the queue, that:

M-M-1 average wait time

Average Number of Customers

In the steady state, by considering the probability equations above, it can be seen that:

M-M-1 average no customers

Last Updated: 14th June 1999
Written by: Andrew Ferrier