Approximate analysis of open networks of queues with blocking: Tandem configurations
IEEE Transactions on Software Engineering
Mean Value Analysis for Blocking Queueing Networks
IEEE Transactions on Software Engineering
Approximate analysis of product-form type queueing networks with blocking and deadlock
Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Queueing networks with blocking: a bibliography
ACM SIGMETRICS Performance Evaluation Review
Mean Value Analysis for Blocking Queueing Networks
IEEE Transactions on Software Engineering
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking
IEEE Transactions on Computers
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers
IEEE Transactions on Software Engineering
Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
A customer threshold property for closed finite queueing networks
Performance Evaluation
Performance analysis of two-loop closed production systems
Computers and Operations Research
MemScale: active low-power modes for main memory
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Queueing networks with blocking: analysis, solution algorithms and properties
Network performance engineering
| Hi-index | 0.01 |
A type of blocking is investigated in which, on completion of its service, a job attempts to enter a new station. If, at that moment, the destination station is full, the job is forced to reside in the server of the source station until a place becomes available in the destination station. The server of the source station remains blocked during this period of time. This model is known as a queuing network with transfer blocking. The state space of queuing networks with blocking is reduced by considering finite capacities of the stations. A nonblocking queuing network with the appropriate total number of jobs is derived. The state space of this network is equal to the state space of the blocking queuing network. The transformation of state space is exact for two-station networks and approximate for three-or-more station cases. The approximation has been validated by executing several examples, including stress tests. In all investigated network models, the approximate throughput results deviate, on the average, less than 3% from the simulation results.