M-M-1 queue with Bernoulli feedback Created 2026-09-24 Updated 2026-11-05
In an M-M-1 queue with Bernoulli feedback, external arrivals form a Poisson process of rate , service times are independent exponential random variables of rate , and each completed service independently returns its customer with probability . A returned customer immediately rejoins the same queue and requires a fresh service time. The queue population does not change at a feedback completion. Only completions that leave permanently produce downward jumps, at rate while the queue is nonempty.
For a continuously busy server, independent Bernoulli thinning of its Poisson completion clock gives an exponential time of rate until the next permanent departure. Thus the queue population has exactly the same birth-death process as an M/M/1 queue with service rate . It has a Stationary distribution precisely when ; its geometric parameter is then . This reduction describes the population and external departures, while individual customers can undergo several visits. For example, doubles the mean number of services needed per external customer from one to two.
For the M-M-1 queue with Bernoulli feedback, assume . The number of service visits before departure is geometric on , with probabilities , independent of the independent exponential visit lengths. The transform of the total time actually being served is
Thus
This excludes the waiting between visits. A feedback completion changes the customer's position but not the number in the system. By exponential memoryless property, the latter process has births of rate and true deaths of rate while nonempty; unsuccessful completions are self-events. It is therefore an M/M/1 number process with effective service rate , giving
For positive equality is null recurrent, larger arrival rate is unstable, and admits no departure-based equilibrium.
To prove the output claim, state the relevant time reversal of a continuous-time Markov chain theorem: an equilibrium continuous-time chain satisfying detailed balance has the same reversed path law. In this reversible birth-death process, final departures are precisely downward jumps; time reversal turns them into upward jumps. Upward jumps are supplied by a state-independent Poisson clock of rate , so their process is Poisson. Hence the stationary final-departure process is Poisson of rate . This is the output conclusion of Burke theorem for the effective number process; it does not say the process of all service completions has that rate.