Computational algorithms for closed queueing networks with exponential servers

Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.

[1]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[2]  Charles Gilbert Moore,et al.  Network models for large-scale time-sharing systems , 1971 .

[3]  Jeffrey Buzen,et al.  Analysis of system bottlenecks using a queueing network model , 1971, SIGOPS Workshop on System Performance Evaluation.

[4]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.