Several simple queueing models, commonly used as textbook examples, have explicit steady-state solutions, which to date have escaped notice. These solutions are easily computable. In addition to their didactic interest, the results presented here are also useful in the analysis of more complex queueing models.
No takes yet. Share an insight, caveat, or question.
Marcel F. Neuts (1982) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: