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

二项穷举策略下轮询系统矩的存在性与逼近

Existence and Approximations of Moments for Polling Systems under the Binomial-Exhaustive Policy

Yue Hu, Jing Dong, Ohad Perry

摘要:

本文建立了在二项穷举策略(BEP)下轮询系统稳态排队时刻存在的充分条件。我们假设服务器根据预先指定的表在不同的缓冲区之间进行切换,并且每当服务器从一个缓冲区移动到下一个缓冲区时都会发生超时。我们进一步假设客户到达根据独立的泊松过程,服务和停留时间是独立的随机变量一般分布。然后,我们提出了一个简单的计划来近似的时刻,这是渐近准确的,因为无约束的增长时间,其计算复杂度不增长的时刻的顺序。最后,我们证明了所提出的渐近近似的时刻是相关的流体限制下的一个大的时间尺度,因此,类似的近似可以很容易地推导出其他服务器切换策略,通过简单地确定这些控制下的流体限制。数值例子证明了我们在BEP和其他策略下的近似时刻的有效性,以及随着切换时间的增加而提高的准确性。

英文摘要:

We establish sufficient conditions for the existence of moments of the steady-state queue in polling systems operating under the binomial-exhaustive policy (BEP). We assume that the server switches between the different buffers according to a pre-specified table, and that switchover times are incurred whenever the server moves from one buffer to the next. We further assume that customers arrive according to independent Poisson processes, and that the service and switchover times are independent random variables with general distributions. We then propose a simple scheme to approximate the moments, which is shown to be asymptotically exact as the switchover times grow without bound, and whose computation complexity does not grow with the order of the moment. Finally, we demonstrate that the proposed asymptotic approximation for the moments is related to the fluid limit under a large-switchover-time scaling; thus, similar approximations can be easily derived for other server-switching policies, by simply identifying the fluid limits under those controls. Numerical examples demonstrate the effectiveness of our approximations for the moments under BEP and under other policies, and their increased accuracy as the switchover times increase.

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

↑