Shortest expected delay routing for Erlang servers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- A compensation approach for two-dimensional Markov processes
- A compensation procedure for multiprogramming queues
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Analysis of the asymmetric shortest queue problem
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Analyzing \(E_k/E_r/ c\) queues
- J.comput. appl. math
- On a class of two-dimensional nearest-neighbour random walks
- On the Optimality of the Generalized Shortest Queue Policy
- On the Stochastic Matrices Associated with Certain Queuing Processes
- On the optimal assignment of customers to parallel servers
- Poisson Arrivals See Time Averages
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
Cited in
(7)- Erlang arrivals joining the shorter queue
- 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)