A numerically stable algorithm for two server queue models
A queueing system M/M/2 with two parallel queues is considered. Let \(\lambda\) be the arrival rate and \(\mu\) be the service rate at each channel. It is assumed that \(\lambda <2\mu\). Two cases are considered: if the two queue-lengths are equal, a) an arrival will join either of the two queues with the same probability, b) an arrival will join, say, queue A with probability 1. The first system is called the symmetric shorter queue model and the second system is called the non-symmetric shorter queue model. The formula for the probability that there are exactly k customers in each queue is obtained. An algorithm for computing these probabilities is presented and the joint distribution of the queue lengths in the system is found. A Fortran program and numerical examples are given.
- On a new numerical computation of the steady state solution for two infinite server parallel queues
- Numerical solution of transient multi-server queueing model
- Explicit and Iterative Numerical Approaches to Solving Queueing Models
- Dynamic server assignment in a two-queue model
- Approximation methods for two-layer queueing models
- On two Bulk-Service Queueing Models
- scientific article; zbMATH DE number 1234740
- A Numerical Approach to Stability of Multiclass Queueing Networks
- A numerical solution for the multi-server queue with hyper-exponential service times
- Ein Wartesystem mit zwei parallelen Warteschlangen
- scientific article; zbMATH DE number 4155539 (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?)
- scientific article; zbMATH DE number 3513109 (Why is no real title available?)
- On Jockeying in Queues
- The autostrada queueing problem
- The shorter queue problem: A numerical study using the matrix-geometric solution
- The shortest queue problem
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- A level-crossing approach to the solution of the shortest-queue problem
- Algorithms of distributed task allocation for cooperative agents
- On a new numerical computation of the steady state solution for two infinite server parallel queues
- The autostrada queueing problem
- scientific article; zbMATH DE number 4066100 (Why is no real title available?)
- scientific article; zbMATH DE number 1270380 (Why is no real title available?)
- scientific article; zbMATH DE number 1523216 (Why is no real title available?)
This page was built for publication: A numerically stable algorithm for two server queue models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804099)
