Answers are grounded in this paper and cite their sources.
This paper considers an n-phase generalization of the typical M/M/1 queuing model, where the queuing-type birth-and-death process is defined on a continuous-time n-state Marker chain. It shows that many models analyzed in the literature can be considered special cases of this framework. The paper focuses on the steady-state regime, and observes that, in general, closed-form results for the limiting probabilities are difficult to obtain, if at all possible. Hence, numerical methods should be employed. For an interesting special case, explicit results are obtained that are analogous to the classical solutions for the simple M/M/1 queue.
No takes yet. Share an insight, caveat, or question.
Uri Yechiali (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: