Asymptotically optimal control of parallel tandem queues with loss
From MaRDI portal
Publication:5962130
DOI10.1007/s11134-010-9177-yzbMath1230.90071MaRDI QIDQ5962130
Publication date: 16 September 2010
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-010-9177-y
90B15: Stochastic network models in operations research
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Research of Heterogeneous Queueing System SM|M $$^{(n)}|\infty $$, Optimal admission control for two station tandem queues with loss, Admission control strategies for tandem Markovian loss systems, Optimal admission control for tandem loss systems with two stations
Cites Work
- Unnamed Item
- Unnamed Item
- A paradox in a queueing network with state-dependent routing and loss
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Alternative routeing in fully connected queueing networks
- How bad is selfish routing?
- On the Optimality of the Generalized Shortest Queue Policy
- On the Shortest Queue Policy for the Tandem Parallel Queue
- Least Busy Alternative Routing in Queueing and Loss Networks
- On the Assignment of Customers to Parallel Queues
- Deciding Which Queue to Join: Some Counterexamples
- Some Useful Functions for Functional Limit Theorems
- The throughput of a series of buffers
- Optimality of the shortest line discipline
- On a tandem queueing model with identical service times at both counters, I
- Asymptotically Optimal Loss Network Control
- On the static assignment to parallel servers
- On the interchangeability and stochastic ordering of ·/M/1 queues in tandem
- The Effect of Increasing Routing Choice on Resource Pooling
- Minimizing response times and queue lengths in systems of parallel queues
- Optimal Admission Control for Tandem Queues With Loss
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
