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 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,\lambda,\mu)$. 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 $\tilde d$ with $\tilde d>d$, then the retrial-of-$\tilde d$ policy achieves a strictly lower blocking than the power-of-$d$ policy when $\rho=\lambda/\mu$ is sufficiently large. Moreover we show that for some specific cases, like $C=2$, $d=2$ and $\tilde d=3$, it occurs for all $\rho>0$, not only for $\rho$ sufficiently large. We complement the analysis with simulations that estimate the load level above which retrial-of-$\tilde d$ outperforms power-of-$d$ in terms of blocking.
In this paper, we study the exact distributions of the age of information (AoI) and peak AoI (PAoI) in a bufferless setting in which time-stamped updates, or processed tasks, generated by one or several information sources according to a Poisson process for each source, are submitted to a shared pool of $c$ homogeneous...
We study the classical problem of scheduling jobs with random processing times on $m$ identical machines to minimize the expected sum of completion times, for Bernoulli jobs: job $j$ takes time $p_j$ with probability $q_j$ and time $0$ otherwise, and its outcome is revealed when it starts. The benchmark is an optimal a...
Motivated by call center systems, we investigate the optimal admission control problem for a retrial queueing system with multiple customer classes. Arrivals follow independent Poisson processes, service times are exponentially distributed, and the decision maker possesses complete information on the system state. The...
In the $G_t/G/n/n$ loss queue, a customer blocked at time $u$ remains missing from the system for as long as it would have been served. A fraction $K(t-u)$ of the blocking at $u$ therefore still affects the occupancy at time $t$, where $K=1-G$ is the service survival function. We show that, for every arrival process sa...
This paper studies an N-policy M(λ1,λ2)/G/1 repairable queue in which arrival rates depend on the server state and multiple vacations may be interrupted by a Bernoulli decision. When the queue first reaches N during a vacation, the server interrupts the current vacation with probability p and otherwise completes it. We...
Ya-Xing He, Wen-Qing Wu, Qiong-Lin Liu et al.· Axioms· 0 citations
We study online channel scheduling for a single queue served by $K$ channels under bandit feedback. We propose a simple best-of-both-worlds policy that explores when the queue is empty. During busy periods, it selects the empirical best channel while the prescribed conditions hold and, if any condition is violated, swi...
Jongyeong Lee, Chansoo Kim· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.