ePrints

A Note on the Solution of General Closed Queueing Networks

Lookup NU author(s):

Downloads

• Published version [.pdf]

Abstract

An algorithm for determining the marginal queue length probablity distributions for a closed queing network is presented. Efficient algorithms for determining the normalizing constant are known. The marginal distributions are obtained at minimal additional cost. Further, the algorithm does not depend on the product form solution. Thus it may be applied to closed queueing networkswith classes of customers. It is shown how the algorithm may be used to find the queue length probabilitydistribution for each class in such a network.

Publication metadata

Author(s): Hine JH

Series Editor(s): Shaw B

Publication type: Report

Publication status: Published

Series Title: Computing Laboratory Technical Report Series

Year: 1975

Pages: 8

Print publication date: 01/11/1975

Source Publication Date: November 1975

Report Number: 83

Institution: Computing Laboratory, The University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

Share