Computational algorithms for product form queueing networks

In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.

[1]  J. L. Smith.  An analysis of time-sharing computer systems using Markov models , 1966, AFIPS '66 (Spring).

[2]  Donald Fred Towsley.  Local balance models of computer systems. , 1975 .

[3]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[4]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[5]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[6]  K. Mani Chandy,et al.  The impact of distributions and disciplines on multiple processor systems , 1979, CACM.

[7]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[8]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

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

[10]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[11]  F. R. Moore,et al.  Computational model of a closed queuing network with exponential servers , 1972 .

[12]  Simon S. Lam,et al.  Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..

[13]  Hisashi Kobayashi,et al.  A Computational Algorithm for Queue Distributions via the Pólya Theory of Enumeration , 1979, International Symposium on Computer Modeling, Measurement and Evaluation.