Steady-state analysis of shortest expected delay routing
Publication:1691915
DOI10.1007/s11134-016-9497-7zbMath1386.60314DBLPjournals/questa/SelenAKL16arXiv1509.03535OpenAlexW3098527405WikidataQ59462651 ScholiaQ59462651MaRDI QIDQ1691915
Stella Kapodistria, Jori Selen, Johan S. H. van Leeuwaarden, Ivo J. B. F. Adan
Publication date: 25 January 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.03535
heterogeneous serversequilibrium distributionstate-dependent routingcompensation approachmultidimensional Markov process
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of the asymmetrical shortest two-server queueing model
- Shortest expected delay routing for Erlang servers
- Steady-state analysis of shortest expected delay routing
- Join the shortest queue: Stability and exact asymptotics
- Erlang arrivals joining the shorter queue
- Bad luck when joining the shortest queue
- Analysis of the asymmetric shortest queue problem
- Optimal control of two interacting service stations
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- J.comput. appl. math
- On the Shortest Queue Version of the Erlang Loss Model
- The queue GI/M/s with customers of different types or the queue GI/Hm/s
- The shortest queue problem
- Deciding Which Queue to Join: Some Counterexamples
- A simple dynamic routing problem
- Two queues in parallel
- A compensation approach for two-dimensional Markov processes
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
- Queueing models with multiple waiting lines
This page was built for publication: Steady-state analysis of shortest expected delay routing