An Approximation Method for Tandem Queues with Blocking

@article{Brandwajn1988AnAM,
  title={An Approximation Method for Tandem Queues with Blocking},
  author={Alexandre Brandwajn and Lily Jow},
  journal={Oper. Res.},
  year={1988},
  volume={36},
  pages={73-83}
}
We propose an approximate analysis of open systems of tandem queues with blocking caused by finite buffers between servers. Our approach relies on the use of marginal probability distributions (“state equivalence”) coupled with an approximate evaluation of the conditional probabilities introduced through the equivalence. The method iterates over consecutive pairs of servers using the solution of a two-queue system as a building block. It produces performance measures for individual servers as… 
Approximate analysis of open networks of queues with blocking: Tandem configurations
TLDR
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.
Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking
TLDR
An iterative procedure for approximating the marginal occupancy probabilities for each queue of the system is offered, based upon the SIMP approximation previously used for tandem queues.
Control of a tandem queue with a startup cost for the second server
TLDR
This work presents a rather intuitive, easy to understand, and at the same time very accurate technique to approximate the optimal decision policy and shows that the approximation works extremely well for a wide range of parameter combinations.
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking
TLDR
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.
Control of a tandem queue with a startup cost for the second server
TLDR
This work presents a rather intuitive, easy to understand, and at the same time very accurate technique to approximate the optimal decision policy for tandem queues and shows that the approximation works extremely well for a wide range of parameter combinations.
Analysis and Approximation of Dual Tandem Queues with Finite Buffer Capacity
TLDR
It is shown that in general system service rate of a dual tandem queue with finite buffer capacity is equal or smaller than its bottleneck service rate, and virtual interruptions, which are the extra idle period at the bottleneck caused by the non-bottlenecks, depend on arrival rates.
Approximate Analysis of Tandem Blocking Queueing Networks with Correlated Arrivals and Services
TLDR
The accuracy of the approximation is examined and it is confirmed that the method well approximates the performance of tandem queueing networks with correlated arrivals and services.
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Approximate analysis of open networks of queues with blocking: Tandem configurations
TLDR
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.
An Approximation Method for Open Restricted Queueing Networks
TLDR
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.
Finite Queues in Series with Exponential or Erlang Service Times - A Numerical Approach
TLDR
A procedure is described for approximating the mean output rate for the case of exponential holding times and it is demonstrated that this procedure provides an excellent approximation for most cases and that it is computationally feasible for large problems.
Cyclic Queuing Systems with Restricted Length Queues
TLDR
The closed, cyclic systems that are considered are shown to be stochastically equivalent to open systems in which the number of customers is a random variable and the concept of duality is introduced.
A new 'building block' for performance evaluation of queueing networks with finite buffers
TLDR
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.
Equivalence and Decomposition in Queueing Systems - A Unified Approach
  • A. Brandwajn
  • Mathematics, Computer Science
    Perform. Evaluation
  • 1985
Sequential Arrays of Waiting Lines
TLDR
The problem considered in this paper is that in which a sequence of service operations must be performed on the units to be serviced, and the maximum possible utilization is obtained for all cases discussed.
Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers
TLDR
This algorithm suggests a general approach for solving large scale structured Markov chain problems by choosing a sum-of-products form solution for a class of states, and deriving the remaining expressions by using the transition equations.
...
...