Shortest expected delay routing for Erlang servers
From MaRDI portal
Publication:1362301
DOI10.1007/BF01206552zbMath0879.60095MaRDI QIDQ1362301
Jaap Wessels, Ivo J. B. F. Adan
Publication date: 3 August 1997
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
The shorter queue polling model ⋮ Steady-state analysis of shortest expected delay routing ⋮ A finite compensation procedure for a class of two-dimensional random walks ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Analyzing \(E_k/E_r/ c\) queues
Cites Work
- Unnamed Item
- A compensation procedure for multiprogramming queues
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Analyzing \(E_k/E_r/ c\) queues
- Analysis of the asymmetric shortest queue problem
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- On the Optimality of the Generalized Shortest Queue Policy
- J.comput. appl. math
- Poisson Arrivals See Time Averages
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- On the optimal assignment of customers to parallel servers
- A compensation approach for two-dimensional Markov processes
- On a class of two-dimensional nearest-neighbour random walks
- On the Stochastic Matrices Associated with Certain Queuing Processes
This page was built for publication: Shortest expected delay routing for Erlang servers
