Mean value analysis for blocking queueing networks
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 14 (4) , 418-428
- https://doi.org/10.1109/32.4663
Abstract
An approximation is introduced for the mean value analysis of queueing networks with transfer blocking. The blocking occurs when a job, after completing service at a station, wants to join a station which is full. The job resides in the server of the source station until a place becomes available in the destination station. The approximation is based on the modification of mean residence times, due to the blocking events that occur in the network. Several examples are executed that validate the approximate results.Keywords
This publication has 14 references indexed in Scilit:
- Product form approximations for queueing networks with multiple servers and blockingIEEE Transactions on Computers, 1989
- Approximate analysis of product-form type queueing networks with blocking and deadlockPerformance Evaluation, 1988
- On the exact and approximate throughput analysis of closed queuing networks with blockingIEEE Transactions on Software Engineering, 1988
- Approximate analysis of arbitrary configurations of open queueing networks with blockingAnnals of Operations Research, 1987
- Approximate analysis of open networks of queues with blocking: Tandem configurationsIEEE Transactions on Software Engineering, 1986
- Queueing networks with blockingACM SIGMETRICS Performance Evaluation Review, 1984
- Approximate analysis of exponential tandem queues with blockingEuropean Journal of Operational Research, 1982
- The Distribution of Queuing Network States at Input and Output InstantsJournal of the ACM, 1981
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975