arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.10628math.PR
收藏

可充电服务器的队列

Queues with Rechargeable Servers

Cornell University(康奈尔大学)

Eliezer Fuentes-Quezada, Jamol Pender

AI总结:

本文提出了一种考虑充电动态的Erlang-S*队列模型,推导了流体和扩散极限,并提出了新的 staffing 规则以优化延迟和放弃概率。

摘要:

无人机配送系统违反了经典排队模型的核心假设:服务器容量不是固定的。无人机(服务器)必须定期充电,这导致了服务可用性的随机波动。我们引入了一个Erlang-S*队列,该队列结合了充电动态(服务完成后的充电概率p和充电返回率γ)以及放弃机制。我们推导了流体和扩散极限,从而得到了联合队列-服务器过程(Q,S)的闭合形式稳态均值、方差和协方差。扩散极限使我们能够推导出新的 staffing 规则,用于延迟概率和放弃目标的概率。关键见解是服务器的随机性导致相对于固定服务器系统的系统性容量损失,从而导致了依赖于制度的 staffing 调整:在欠载制度中为加法位移,在超载制度中为乘法缩放。我们的模拟实验验证了极限定理的准确性以及 staffing 计划实现其目标的性能。

英文摘要:

We introduce an Erlang-S$^*$ queue with stochastic server unavailability motivated by charging dynamics in drone delivery systems. Servers enter a charging state after service with probability $p$ and return at rate $γ$, while customers may abandon. We develop fluid and diffusion approximations for the joint process $(Q,S)$. In strictly underloaded and overloaded regimes, the diffusion limits reduce to Ornstein Uhlenbeck processes, enabling closed-form moment approximations and tractable staffing rules. At the critical boundary, however, the drift becomes non-smooth, and the limiting diffusion transitions into a continuous regime switching process between two operational phases. This shift alters the covariance structure and calls for a new staffing rule driven by diffusion-scale fluctuations of the gap $Q - S$. To address this challenge, we introduce a new Gaussian closure method, which remains tractable even in the non-smooth boundary regime. Numerical experiments confirm the accuracy of the approximations and the resulting staffing prescriptions across overloaded, underloaded and critical regimes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑