= M-M-1 queue with Bernoulli feedback
{c}
In an <M-M-1 queue with Bernoulli feedback>, external arrivals form a <Poisson process> of rate $\lambda$, <service time>[service times] are <independent> <exponential random variable>[exponential random variables] of rate $\mu$, and each completed service independently returns its customer with <probability> $p\in[0,1)$. 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 $\mu(1-p)$ while the queue is nonempty.
For a continuously busy server, <independent> <Bernoulli thinning> of its Poisson completion clock gives an <exponential distribution>[exponential time] of rate $\mu(1-p)$ 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 $\mu(1-p)$. It has a <Stationary distribution> precisely when $\lambda<\mu(1-p)$; its geometric parameter is then $\rho=\lambda/[\mu(1-p)]$. This reduction describes the population and external departures, while individual customers can undergo several visits. For example, $p=1/2$ doubles the <mean> number of services needed per external customer from one to two.
Back to article page