Networks of queues and the method of stages

Abstract

In a recent article, Kelly [4] has been able to exhibit interesting equilibrium properties for a wide class of ‘quasi-reversible’ queue networks. The assumption of quasi-reversibility puts restrictions on queue discipline, but not on the distributions of the service requirements of customers: however, because of the method of proof he employed, Kelly was forced to impose the condition that the service requirements were finite mixtures of gamma distributions. The form of the results he obtained led him to conjecture that this condition was in fact unnecessary, as is shown to be the case in this paper. The method used to prove the conjecture is of potentially wide application, in problems where the ‘method of stages' leads to useful simplification.