Exact Product Form Solution for Queueing Networks with Blocking

  title={Exact Product Form Solution for Queueing Networks with Blocking},
  author={Ian F. Akyildiz},
  journal={IEEE Transactions on Computers},
  • I. Akyildiz
  • Published 1987
  • Business
  • IEEE Transactions on Computers
This work investigates closed queueing networks with blocking composed of two stations with multiple servers. Blocking occurs when a job wanting to enter a full station is forced to remain in its source station, thus blocking the source station until room is available at the destination station. This type of blocking is known as classical blocking. We show that, for a two-station closed queueing network with blocking, there exists an equivalent nonblocking network with the same state space… 

Figures from this paper

Throughput analysis of a two station closed queueing network with blocking and server breakdown
An exact analysis is presented to compute the throughput of a two station closed queueing network with multiple servers subject to blocking and breakdown of servers. Blocking occurs in a network when
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking
It is shown that the equilibrium-state probabilities for this type of blocking queuing network have an approximate product-form solution, which is based on normalizing the infeasible states that violate station capacities, and the throughputs of both systems are approximately equal.
Exact analysis of queueing networks with multiple job classes and blocking-after-service
Two models of closed queueing networks with blocking-after-service and multiple job classes are analyzed and exact product form solutions are obtained for the equilibrium state probabilities in both models.
Survey of closed queueing networks with blocking
This paper gives a systematic presentation of the literature related to closed queueing networks with finite queues and the results are significant for both researchers and practitioners.
Mean Value Analysis for Blocking Queueing Networks
An approximation is introduced for the mean value analysis of queueing networks with transfer blocking based on the modification of mean residence times, due to the blocking events that occur in the network.
A survey of product form queueing networks with blocking and their equivalences
A survey of product form solutions of queueing networks with blocking and equivalence properties among different blocking network models is presented and relationships between open and closed product form queueing network models with different blocking mechanisms are examined.
Queueing Networks with Finite Capacities
  • R. Onvural
  • Mathematics, Computer Science
    Performance/SIGMETRICS Tutorials
  • 1993
In this paper, we give a tutorial of queueing networks with blocking. Except for a few special cases, these networks could not be shown to have product form solutions. Although the steady state queue
Availability analysis of two-station closed queueing network with blocking—practical application
A method of analysis for a two-station closed queueing network model with blocking is described. A practical application of this method is presented for an airfleet operation and maintenance system


A variable buffer-size model and its use in analyzing closed queueing networks with blocking
A new model, with variable buffer-size, is introduced as a conceptual tool to model part of a tandem network with blocking, using only product-form submodels, which enables efficient analysis of certain types of closed queueing networks with blocking due to limited buffer spaces.
An Approximation Method for Open Restricted Queueing Networks
It is found that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.
A Symmetrical Exponential Open Queue Network with Blocking and Feedback
  • H. Perros
  • Computer Science, Mathematics
    IEEE Transactions on Software Engineering
  • 1981
An approximate expression of the probability distribution of the number of blocked first- level servers conditioned upon a service completion of a first-level server is obtained and this expression compares well with simulation data.
Queueing networks with blocking: a bibliography
A first attempt to compile an exhaustive list of related papers in which analytic investigations (exact or approximate) or numerical investigations of queueing networks with blocking have been reported.
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
The asymptotic analysis of the stationary distribution in the case of a large number of customers is given and shows that a special nonlinear programming problem must be solved to obtain parameters of the limiting distribution.
Mean-Value Analysis of Closed Multichain Queuing Networks
It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product
Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
Stable queuing systems consisting of two groups of servers, having exponential service times, placed in tandem and separated by a finite buffer, are shown to have a steady-state probability vector of
Approximate analysis of open networks of queues with blocking: Tandem configurations
An approximation procedure is developed for the analysis of tandem configurations consisting of single server finite queues linked in series and gives results in the form of the marginal probability distribution of the number of units in each queue of the tandem configuration.
A new 'building block' for performance evaluation of queueing networks with finite buffers
This work proposes a new 'building block', a model of a server with a variable buffer-size that enables efficient analysis of certain queueing networks with blocking due to limited buffer spaces, since it uses only product-form submodels.
Modeling a class of state-dependent routing in flexible manufacturing systems
A closed queueing network model for flexible manufacturing systems (FMSs), where parts routing follows a probabilistic shortest-queue (PSQ) scheme, that proves that with the PSQ routing, the Markovian queue-length process satisfies time reversibility and has a product-form equilibrium distribution.