A new 'building block' for performance evaluation of queueing networks with finite buffers
- 1 January 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 12 (3) , 134-142
- https://doi.org/10.1145/1031382.809321
Abstract
We propose a new 'building block', for analyzing queueing networks. This is a model of a server with a variable buffer-size. Such a model enables efficient analysis of certain queueing networks with blocking due to limited buffer spaces, since it uses only product-form submodels. The technique is extensively tested, and found to be reasonably accurate over a wide range of parameters. Several examples are given, illustrating practical situations for which our model would prove to be a useful performance analysis tool, specially since it is simple to understand, and easy to implement using standard software for closed queueing networks.Keywords
This publication has 31 references indexed in Scilit:
- Robustness of queuing network formulasJournal of the ACM, 1983
- Twenty Five Years of Cyclic Queues and Closed Queue Networks: A ReviewJournal of the Operational Research Society, 1982
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Analytical Queueing ModelsComputer, 1980
- A Review and Evaluation of Software ScienceACM Computing Surveys, 1978
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963