Approximate analysis of exponential queueing systems with blocking
From MaRDI portal
Publication:1143721
DOI10.1007/BF00269808zbMath0442.60091MaRDI QIDQ1143721
Alan G. Konheim, Onno J. Boxma
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (24)
A model to approximate transient performance of the flowshop ⋮ An efficient two-phase approximation method for exponential tandem queueing systems with blocking ⋮ Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ Asymptotic behavior of the expansion method for open finite queueing networks ⋮ Deadlock free buffer allocation in closed queueing networks ⋮ Strong truncation approximation in tandem queues with blocking ⋮ Queues with interruptions: a survey ⋮ Approximate analysis of exponential tandem queues with blocking ⋮ The use of decomposition techniques for the analysis of open restricted queuing networks ⋮ Effective bandwidths at multi-class queues ⋮ Performance analysis of a queueing system with facilities requiring post- processing ⋮ Qeueing models for performance analysis: Selection of single station models ⋮ Performance bounds on multiserver exponential tandem queues with finite buffers ⋮ The generalized expansion method for open finite queueing networks ⋮ Buffer allocation in flow-shop-type production systems with general arrival and service patterns ⋮ Approximate decomposition for closed queueing network models of FMSs with a block-and wait and state-dependent routing mechanism ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ On equivalencies of blocking mechanisms in queueing networks with blocking ⋮ An analytic finite capacity queueing network model capturing the propagation of congestion and blocking ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ A survey of product form queueing networks with blocking and their equivalences ⋮ Bounding the performance of tandem queues with finite buffer spaces ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers
Cites Work
- Unnamed Item
- Unnamed Item
- On the blocking process in queue networks
- Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
- Horner's rule for the evaluation of general closed queueing networks
- A Queueing Model with Finite Waiting Room and Blocking
- Finite Capacity Queuing Systems with Applications in Computer Modeling
- Transient Behaviour of a Tandem Queue
- Two queues in series with a finite, intermediate waitingroom
- Closed Queuing Systems with Exponential Servers
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- A Sequence of Two Servers with No Intermediate Queue
This page was built for publication: Approximate analysis of exponential queueing systems with blocking
