Retrials in Loss Systems: Mean-Field Analysis, Erlang Bounds, and Power-of-$d$ Comparison
We consider a system of $N$ parallel, homogeneous servers, each with finite capacity $C$. Jobs requiring one unit of capacity arrive according to a Poisson process with total rate $N\lambda$ and have exponential service times with rate $\mu$. We study a decentralized random--retrial policy with $d$ attempts: upon arriv...