A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS

Abstract
A numerical method is proposed for solving the balance equations of the steady-state probabilities of a GI/G/c queueing system in a general class. The method is based on an iterative calculation of conditional probabilities, instead of absolute probabilities, conditioned by the number of customers in the system. By skillfully exploiting a convergence property of the conditional probabilities, it provides a fairly accurate solution of the balance equations with relatively little computational burden.