An queue has Poisson arrivals of rate , independent exponential service times of rate , and infinitely many servers. Its occupancy is a birth-death process with birth rate and death rate in state .
For every , an queue is positive recurrent and has the Poisson distribution with mean as its unique stationary distribution:
In stationarity, the departure process of an queue is a Poisson process of rate . By time reversibility, the departures before any fixed time are independent of the occupancy at that time.
If and , then
with independent summands. The binomial term counts surviving initial customers; Poisson thinning gives the surviving later arrivals.
Writing , the stationary empty probability is . Alternating idle periods of mean with busy periods and applying the renewal-reward theorem gives

Articles by others on the same topic (0)

There are currently no matching articles.