Abstract: | There are a great number of queueing systems, including the MX/MY/c, the GlX/M/c and the discrete Gl/G/1 queue in which the state probabilities are determined by repeated queue equations. This paper gives a simple, efficient and numerically stable algorithm to caiculate the state probabilities and measure of performance for such systems. The method avoids both complex arithmetric and matrix manipulations. |