Answers are grounded in this paper and cite their sources.
The following problem is considered: N queues of unrestricted length are served in cyclic order by a single server. Input to each queue is Poisson, the service time distribution may be arbitrary, and a finite time is required by the server to go from one queue to the next. Supposing that at any queue the server serves all units which he finds when he arrives, what is the probability pnthat in a stationary state he finds exactly n units? The method for solving this problem is based on the notion of a “self-consistent” probability distribution and is actually applicable to a general class of multiqueue situations of which the one considered here is typical.
No takes yet. Share an insight, caveat, or question.
Martin A. Leibowitz (1961) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: