A level-crossing approach to the solution of the shortest-queue problem
From MaRDI portal
Recommendations
Cites work
- A Basic Dynamic Routing Problem and Diffusion
- A note on waiting times in systems with queues in parallel
- A numerically stable algorithm for two server queue models
- Analysis of the asymmetric shortest queue problem
- scientific article; zbMATH DE number 4066100 (Why is no real title available?)
- scientific article; zbMATH DE number 715269 (Why is no real title available?)
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- On Jockeying in Queues
- Poisson Arrivals See Time Averages
- The autostrada queueing problem
- The Power-Series Algorithm Applied to the Shortest-Queue Model
- The shorter queue problem: A numerical study using the matrix-geometric solution
- The shortest queue problem
- The System Point Method in Exponential Queues: A Level Crossing Approach
- Two queues in parallel
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
Cited in
(6)- Bad luck when joining the shortest queue
- Some first passage time problems for the shortest queue model
- On the infinite server shortest queue problem: non-symmetric case
- scientific article; zbMATH DE number 1936537 (Why is no real title available?)
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- scientific article; zbMATH DE number 836619 (Why is no real title available?)
This page was built for publication: A level-crossing approach to the solution of the shortest-queue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382808)