In queueing theory, a discipline within the mathematical theory of probability, the Gordon–Newell theorem is an extension of Jackson's theorem from open queueing networks to closed queueing networks of exponential servers where customers cannot leave the network.
The Gordon–Newell theorem calculates the open network solution and then eliminates the infeasible states by renormalizing the probabilities.
Calculation of the normalizing constant makes the treatment more awkward as the whole state space must be enumerated.
Buzen's algorithm or mean value analysis can be used to calculate the normalizing constant more efficiently.
The normalizing constant G(K) is given by and ei is the visit ratio, calculated by solving the simultaneous equations