Shortest expected delay routing for Erlang servers
From MaRDI portal
Publication:1362301
DOI10.1007/BF01206552zbMATH Open0879.60095MaRDI QIDQ1362301FDOQ1362301
Authors: J. Wessels, Ivo Adan 
Publication date: 3 August 1997
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Poisson Arrivals See Time Averages
- On a class of two-dimensional nearest-neighbour random walks
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- On the optimal assignment of customers to parallel servers
- Analysis of the asymmetric shortest queue problem
- Two Similar Queues in Parallel
- On the Optimality of the Generalized Shortest Queue Policy
- J.comput. appl. math
- A compensation approach for two-dimensional Markov processes
- On the Stochastic Matrices Associated with Certain Queuing Processes
- TWO QUEUES IN PARALLEL
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- A compensation procedure for multiprogramming queues
- Analyzing \(E_k/E_r/ c\) queues
Cited In (6)
- A finite compensation procedure for a class of two-dimensional random walks
- The shorter queue polling model
- Analyzing \(E_k/E_r/ c\) queues
- Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
- Steady-state analysis of shortest expected delay routing
- Analysis of the shortest relay queue policy in a cooperative random access network with collisions
This page was built for publication: Shortest expected delay routing for Erlang servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362301)
