Consider a closed queueing network with M service facilities and N circulating customers. Assume that the service time for a customer at service facility i is given by an exponentially distributed random variable with parameter μ_i and that, after completing service at service facility i, a customer will proceed next to service facility j with probability p_ij.^[3]

Let ${\displaystyle \mathbb {P} (n_{1},n_{2},\cdots ,n_{M})}$  be the steady state probability that the number of customers at service facility i is equal to n_i for i = 1, 2, ... , M . It follows from the Gordon–Newell theorem that

${\displaystyle \mathbb {P} (n_{1},n_{2},\cdots ,n_{M})={\frac {1}{{\text{G}}(N)}}}$ ${\displaystyle \left(X_{1}\right)^{n_{1}}}$ ${\displaystyle \left(X_{2}\right)^{n_{2}}}$  .... ${\displaystyle \left(X_{M}\right)^{n_{M}}}$ 

This result is usually written more compactly as

${\displaystyle \mathbb {P} (n_{1},n_{2},\cdots ,n_{M})={\frac {1}{{\text{G}}(N)}}\prod _{i=1}^{M}\left(X_{i}\right)^{n_{i}}}$ 

The values of X_i are determined by solving

${\displaystyle \mu _{j}X_{j}=\sum _{i=1}^{M}\mu _{i}X_{i}p_{ij}\quad {\text{ for }}j=1,\ldots ,M.}$ 

G(N) is a normalizing constant chosen so that the sum of all ${\displaystyle {\tbinom {N+M-1}{M-1}}}$  values of ${\displaystyle \mathbb {P} (n_{1},n_{2},\cdots ,n_{M})}$  is equal to 1. Buzen's algorithm represents the first efficient procedure for computing G(N).^[2][4]

The individual terms that must be added together to compute G(N) all have the following form:

${\displaystyle \left(X_{1}\right)^{n_{1}}}$ ${\displaystyle \left(X_{2}\right)^{n_{2}}}$  .... ${\displaystyle \left(X_{M}\right)^{n_{M}}}$ . Note that this set of terms can be partitioned into two groups. The first group comprises all terms for which the exponent of ${\displaystyle \left(X_{M}\right)}$  is greater than or equal to 1.  This implies that ${\displaystyle \left(X_{M}\right)}$  raised to the power 1 can be factored out of each of these terms.  

After factoring out ${\displaystyle \left(X_{M}\right)}$ , a surprising result emerges: the modified terms in the first group are identical to the terms used to compute the normalizing constant for the same network with one customer removed. Thus, the sum of the terms in the first group can be written as “X_M times G(N -1)”. This insight provides the foundation for the development of the algorithm.^[4]  

Next consider the second group.  The exponent of X_M for every term in this group is zero.  As a result, service facility M effectively disappears from all terms in this group (since it reduces in every case to a factor of 1). This leaves the total number of customers at the remaining M -1 service facilities equal to N. The second group includes all possible arrangements of these N customers.

To express this concept precisely, assume that X₁, X₂, … X_M have been obtained for a given network with M service facilities. For any n ≤ N and m ≤ M, define g(n,m) as the normalizing constant for a network with n customers, m service facilities (1,2, … m), and values of  X₁, X₂, … X_m  that match the first m members of the original sequence X₁, X₂, … X_M .

Given this definition, the sum of the terms in the second group can now be written as g(N, M -1).

It also follows immediately that “X_M times G(N -1)”, the sum of the terms in the first group, can be re-written as “X_M times g(N -1,M )”.  

In addition, the normalizing constant G(N) in the Gordon-Newell theorem can now be re-written as g(N,M).

Since G(N) is equal to the combined sum of the terms in the first and second groups,

G(N) = g(N, M ) = X_M g(N -1,M ) + g(N,M -1)

This same recurrence relation clearly exists for any intermediate value of n from 1 to N, and for any intermediate value of m from 1 to M .  

This implies g(n,m) = X_m g(n -1,m) + g(n,m -1).  Buzen’s algorithm is simply the iterative application of this fundamental recurrence relation, along with the following boundary conditions.

g(0,m) = 1 for m = 1, 2, …M

g(n,1)  =  (X_i)ⁿ for n = 0, 1, … N

The Gordon-Newell theorem enables analysts to determine the stationary probability associated with each individual state of a closed queueing network.  These individual probabilities must then be added together to evaluate other important probabilities. For example P(n_i ≥ k), the probability that the total number of customers at service center i is greater than or equal to k, must be summed over all values of n_i ≥ k and, for each such value of n_i, over all possible ways the remaining N – n_i customers can be distributed across the other M -1 service centers in the network.

Many of these marginal probabilities can be computed with minimal additional effort.  This is easy to see for the case of P(n_i ≥ k).   Clearly, X_i must be raised to the power of k or higher in every state where the number of customers at service center i is greater than or equal to k. Thus X_i ^k can be factored out from each of these probabilities, leaving a set of modified probabilities whose sum is given by G(N-k)/G(N).   This observation yields the following simple and highly efficient result:

P(n_i ≥ k) = (X_i)^k G(N-k)/G(N)

This relationship can then be used to compute the marginal distributions and expected number of customers at each service facility.

${\displaystyle \mathbb {P} (n_{i}=k)={\frac {X_{i}^{k}}{G(N)}}[G(N-k)-X_{i}G(N-k-1)]\quad {\text{ for }}k=0,1,\ldots ,N-1,}$ 

${\displaystyle \mathbb {P} (n_{i}=N)={\frac {X_{i}^{N}}{G(N)}}.}$ 

The expected number of customers at service facility i is given by

${\displaystyle \mathbb {E} (n_{i})=\sum _{k=1}^{N}X_{i}^{k}{\frac {G(N-k)}{G(N)}}.}$ 

These characterizations of quantities of interest in terms of the G(n) are also due to Buzen.^[2]

It will be assumed that the X_m have been computed by solving the relevant equations and are available as an input to our routine. Although g(n,m) is in principle a two dimensional matrix, it can be computed in a column by column fashion starting from the top of the leftmost column and running down each column to the bottom before proceeding to the next column on the right. The routine uses a single column vector C to represent the current column of g.

The first loop in the algorithm below initializes the column vector C[n] so that C[0] = 1 and C(n) = 0 for n≥1.   Note that C[0] remains equal to 1 throughout all subsequent iterations.  

In the second loop, each successive value of C(n) for n≥1 is set equal to the corresponding value of g(n,m) as the algorithm proceeds down column m.  This is achieved by setting each successive value of C(n) equal to:

g(n,m-1) plus X_m times g(n-1,m).  

Note that g(n,m-1) is the previous value of C(n), and g(n-1,m) is the current value of C(n-1)

C[0] := 1
for n := 1 step 1 until N do
   C[n] := 0;

for m := 1 step 1 until M do
  for n := 1 step 1 until N do
     C[n] := C[n] + X[m]*C[n-1];

At completion, the final values of C[n] correspond to column M in the matrix g(n,m).  Thus they represent the desired values G(0), G(1), ... , G(N). ^[2]

• Jain: The Convolution Algorithm (class handout)
• Menasce: Convolution Approach to Queueing Algorithms (presentation)