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λ$ and have exponential service times with rate $μ$. We study a decentralized random--retrial policy with d attempts: upon arrival, a job is assigned to a uniformly chosen server; if the server is full, the job is reassigned to another uniformly chosen server, for at most d attempts; if all d attempts fail, the job is rejected. In the mean-field limit, we prove that the stationary blocking probability is characterized by the unique solution of a fixed-point equation involving the Erlang-B loss function, and we establish global convergence of the fluid model to this equilibrium. We also compare the mean-field stationary blocking probability with the analogous quantity in the power-of-d model under the same parameters $(C,λ,μ)$. For the same d, we show, via coupling techniques, that the blocking probability under power-of-d is always less than or equal to the blocking under retrial-of-d; but if we consider d and d with d>d, then the retrial-of-d policy achieves a strictly lower blocking than the power-of-d policy when $ρ=λ/μ$ is sufficiently large. Moreover we show that for some specific cases, like $C=2$, $d=2$ and d=3, it occurs for all $ρ>0$, not only for $ρ$ sufficiently large. We complement the analysis with simulations that estimate the load level above which retrial-of-d outperforms power-of-d in terms of blocking.