arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.0131math.PRcs.PF
收藏

按轮询时刻退出的轮询模型

A Polling Model with Reneging at Polling Instants

Marko Boon

摘要:

在本文中,我们考虑一个单服务器,循环轮询系统切换时间和泊松到达。所讨论的服务规程是详尽的门控服务。本文的创新之处在于考虑了顾客在投票时刻的违约行为。更详细地,每当服务器开始或结束对队列的访问时,在每个队列中等待的一些客户在接收服务之前离开系统。某个客户离开队列的概率取决于客户正在等待的队列以及服务器的位置。我们表明,可以通过引入客户子类型(取决于他们的到达时间段)并跟踪他们放弃系统的时刻来分析该系统。为了确定等待时间分布,我们认为该系统作为一个轮询模型,具有不同的到达率,并适用于广义版本的分布形式的小的法律。边际队列长度分布可以通过调节系统的状态(服务器的位置,以及它是服务还是切换)来找到。

英文摘要:

In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiting in each queue leave the system before having received service. The probability that a certain customer leaves the queue, depends on the queue in which the customer is waiting, and on the location of the server. We show that this system can be analysed by introducing customer subtypes, depending on their arrival periods, and keeping track of the moment when they abandon the system. In order to determine waiting time distributions, we regard the system as a polling model with varying arrival rates, and apply a generalised version of the distributional form of Little's law. The marginal queue length distribution can be found by conditioning on the state of the system (position of the server, and whether it is serving or switching).

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

↑