A relation between stationary queue and waiting time distributions

Publisher Website
Google Scholar
Abstract
A theorem is proved which, in essence, says the following. If, for any queueing system, (i) the arrival process is stationary, (ii) the queue discipline is first-in-first-out (FIFO), and (iii) the waiting time of each customer is statistically independent of the number of arrivals during any time interval after his arrival, then the stationary random queue size has the same distribution as the number of customers who arrive during a random time interval distributed as the stationary waiting time.

This publication has 3 references indexed in Scilit: