Let be the number of arrivals during the next customer's service. If , that service begins immediately and one of the waiting customers is served; if , the next arrival initiates the service, and it is not counted among arrivals during its own service. Thus
Conditional on a fresh service time , is Poisson with mean . Independence of service times and the independent-increment/strong Markov property of the Poisson arrival process make these mixed counts identically distributed and independent of the previous departure history. Hence the conditional law of depends only on , proving the Markov property of the departure-embedded queue.
Put
The transition probabilities are
The first and second rows coincide because either an arrival to an empty queue or the single existing customer initiates the next service.
The service-period arrival count has probability generating function
with and . Let . In stationarity the recurrence and independence give
initially for . Rearrangement gives . Letting and using shows . Hence
Analytic continuation gives the identity inside the unit disc; boundary values follow by convergence of the probability series, with removable limiting values wherever the displayed quotient is indeterminate, particularly at .
If , then . Expand at :
Substitution into the previous quotient gives
Thus the stationary mean is
Only a finite first service moment was stated. If the second moment is infinite and , the stationary mean is infinite; the formula has that extended-value interpretation. This follows as well by writing the second-order remainder as an integral of and taking , where monotone convergence gives . A finite stationary distribution need not have a finite mean.

Articles by others on the same topic (0)

There are currently no matching articles.