Performance bounds on multiserver exponential tandem queues with finite buffers
DOI10.1016/0377-2217(92)90162-3zbMath0762.60094OpenAlexW2034376236MaRDI QIDQ1207541
Publication date: 1 April 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90162-3
performance evaluationqueueing networksblockingnumerical studyproduct form solutionsmultiserver exponential tandem queue with finite buffers
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (2)
Cites Work
- Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
- Finite capacity assembly-like queues
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Approximate analysis of exponential queueing systems with blocking
- Approximate analysis of exponential tandem queues with blocking
- Bounding the performance of tandem queues with finite buffer spaces
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Concavity of the throughput of tandem queueing systems with finite buffer storage space
- Product forms for queueing networks with state-dependent multiple job transitions
- Reversibility of Tandem Blocking Queueing Systems
- Simple Bounds for Finite Single-Server Exponential Tandem Queues
- Monotonicity of throughput in non-Markovian networks
- The Reversibility Property of Production Lines
- An Approximation Method for Open Restricted Queueing Networks
- Sequential Arrays of Waiting Lines
This page was built for publication: Performance bounds on multiserver exponential tandem queues with finite buffers
