Two queues with weighted one-way overflow
From MaRDI portal
Publication:398789
DOI10.1007/s11009-007-9062-2zbMath1293.90014OpenAlexW4239111561MaRDI QIDQ398789
Publication date: 15 August 2014
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-007-9062-2
Computational methods in Markov chains (60J22) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Markov chains: models, algorithms and applications
- Matrix computations.
- Iterative methods for overflow queueing models. I
- Simple and insensitive bounds for a grading and an overflow model
- Iterative methods for overflow queuing models. II
- Matrix Methods for Queuing Problems
- On the Overflow Process from a Finite Markovian Queue
- Queueing Networks: A Survey of Their Random Processes
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Stochastic inequalities for an overflow model
- Insensitive bounds for the stationary distribution of non-reversible Markov chains
- A proof of simple insensitive bounds for a pure overflow system
- Analysis of Some Overflow Problems with Queuing
- Some Traffic Overflow Problems with a Large Secondary Queue
- An Overflow System in Which Queuing Takes Precedence
- A Traffic Overflow System With a Large Primary Queue
- Traffic overflow in loss systems with selective trunk reservation
This page was built for publication: Two queues with weighted one-way overflow