The \(M/G/1\) retrial queue with nonpersistent customers (Q1813544): Difference between revisions

An \(M/G/1\) queue is considered where arriving customers finding the server occupied will either leave the system with probability \(1-\alpha\) or arrive again with probability \(\alpha\) after an exponentially distributed time. An integro-differential system of equations is derived for the generating functions of the steady-state probabilities. Moreover, a recursion scheme is given for the related factorial moments based on the (unavailable) steady-state probability \(\rho\) that the server is busy. For \(\rho\) again a numerical algorithm is proposed.