A numerically stable algorithm for two server queue models (Q804099)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A numerically stable algorithm for two server queue models |
scientific article |
Statements
A numerically stable algorithm for two server queue models (English)
0 references
1991
0 references
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.
0 references
parallel queues
0 references
joint distribution of the queue lengths
0 references
numerical examples
0 references