The paper solves the queueing system Ck/Cm/s, where Ck is the class of Coxian probability density functions (pdfs) of order k, which is a subset of the pdfs that have a rational Laplace transform. It formulates the model as a continuous-time, infinite-space Markov chain by generalizing the method of stages. By using a generating function technique, the paper solves an infinite system of partial difference equations and find closed-form expressions for the system-size, general-time, prearrival, post-departure probability distributions and the usual performance measures. In particular, it proves that the probability of n customers being in the system, when it is saturated is a linear combination of geometric terms. The closed-form expressions involve a solution of a system of nonlinear equations that involves only the Laplace transforms of the interarrival and service time distributions. The paper conjectures that this result holds for a more general model. Following these theoretical results it proposes an exact algorithm for finding the system-size distribution and the system’s performance measures. The paper examines special cases and applies this method for numerically solving the C2/C2/s and Ek/C2/s queueing systems.
