限时和限k轮询系统的矩阵分析解
Time-Limited and k-Limited Polling Systems: A Matrix Analytic Solution
摘要：
在本文中，我们将开发一个工具来分析轮询系统的服务器，时间限制，和k-有限的服务纪律。这些规则不满足轮询系统中的分支性质，因此文献中几乎没有关于它们的精确结果。我们的策略是应用一个迭代方案，该方案是基于在封闭形式的联合队列长度在开始和结束的服务器访问队列。这些核关系是利用吸收马尔可夫链理论导出的。最后，我们将展示我们的工具在具有单个服务器的串联排队网络的情况下也可以工作，该服务器可以一次服务一个队列。
英文摘要：
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains. Finally, we will show that our tool works also in the case of a tandem queueing network with a single server that can serve one queue at a time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
