Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
Authors:
- Guy LatoucheGLGuy Latouche
- Marcel F. NeutsMNMarcel F. Neuts
- 1 March 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 1 (1) , 93-106
Abstract
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 matrix-geometric form. The queue is stable as long as the Poisson arrival rate does not exceed a critical value, which depends in a complicated manner on the service rates, the numbers of servers in each group, the size of the intermediate buffer and the unblocking rule followed when system becomes blocked. The critical input rate is determined in a unified manner. For stable queues, it is shown how the stationary probability vector and other important features of the queue may be computed. The essential step in the algorithm is the evaluation of the unique positive solution of a quadratic matrix equation.Keywords
This publication has 14 references indexed in Scilit:
- On the blocking process in queue networksEuropean Journal of Operational Research, 1980
- Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vectorAdvances in Applied Probability, 1978
- A Queueing Model with Finite Waiting Room and BlockingJournal of the ACM, 1976
- Study of a network of serial and non-serial servers with phase type service and finite queueing spaceJournal of Applied Probability, 1972
- Two servers in series, studied in terms of a Markov renewal branching processAdvances in Applied Probability, 1970
- Two queues in series with a finite, intermediate waitingroomJournal of Applied Probability, 1968
- Stability of finite queue, tandem server systemsJournal of Applied Probability, 1967
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical ApproachOperations Research, 1967
- A Sequence of Two Servers with No Intermediate QueueManagement Science, 1965
- Sequential Arrays of Waiting LinesOperations Research, 1956