Approximating the mean response time of parallel queues with JSQ policy
From MaRDI portal
Recommendations
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
- Delay-join the shortest queue routing for a parallel queueing system with removable servers
- On a new numerical computation of the steady state solution for two infinite server parallel queues
Cites work
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- scientific article; zbMATH DE number 4066100 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- A Basic Dynamic Routing Problem and Diffusion
- A note on waiting times in systems with queues in parallel
- A simple dynamic routing problem
- Optimality of the shortest line discipline
- The shorter queue problem: A numerical study using the matrix-geometric solution
- The shortest queue problem
- Two Similar Queues in Parallel
- Two queues in parallel
Cited in
(1)
This page was built for publication: Approximating the mean response time of parallel queues with JSQ policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919783)