A numerically stable algorithm for two server queue models |
| |
| Authors: | Yiqiang Zhao Winfried K Grassmann |
| |
| Institution: | (1) Department of Mathematics, University of Saskatchewan, S7N 0W0, Canada;(2) Department of Computational Science, University of Saskatchewan, S7N 0W0, Canada |
| |
| Abstract: | In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. |
| |
| Keywords: | Queues in parallel generating functions two-dimensional Markov chains |
| 本文献已被 SpringerLink 等数据库收录！ |
|
