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

关于轮询系统中的开放问题

On open problems in polling systems

Marko Boon, Onno Boxma, Erik Winands

摘要:

在本文中,我们解决两个开放的问题,轮询系统,即,由多个队列组成的排队系统,由单个服务器参与,该服务器每次访问一个队列。第一个开放的问题处理的系统由两个队列,其中一个具有门控服务,而另一个接收1-有限的服务。第二个开放问题涉及具有一般(更新)到达和无限大的确定性切换时间的投票系统。我们讨论相关的,已知的结果,这两个问题,以及遇到的困难时,试图解决这些问题。

英文摘要:

In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with general (renewal) arrivals and deterministic switch-over times that become infinitely large. We discuss related, known results for both problems, and the difficulties encountered when trying to solve them.

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

↑