Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Takahashi et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: