轮询系统中平均等待时间的基本推导
An Elementary Derivation of Mean Wait Time in Polling Systems
AI总结:
本文通过仅基于代数和泊松过程性质的初等方法,推导了轮询系统的平均等待时间,避免了矩生成函数和拉普拉斯变换等复杂工具。
摘要:
轮询系统是排队论中一个成熟的主题。然而,其正式处理通常严重依赖相对复杂的理论工具,如矩生成函数和拉普拉斯变换,并且解决方案通常需要求解大型方程组。我们证明,如果你只关心系统的平均等待时间而不是高阶矩,那么可以通过仅基于代数和泊松过程的一些众所周知的性质的基本推导得到它。我们的结果足够简单,可以在实际应用中轻松使用,并且推导的简洁性使其非常适合教学目的。
英文摘要:
Polling systems are a well-established subject in queueing theory. However, their formal treatments generally rely heavily on relatively sophisticated theoretical tools, such as moment generating functions and Laplace transforms, and solutions often require the solution of large systems of equations. We show that, if you are willing to only have the average waiting of a system time rather than higher moments, it can found through an elementary derivation based only on algebra and some well-known properties of Poisson processes. Our result is simple enough to be easily used in real-world applications, and the simplicity of our derivation makes it ideal for pedagogical purposes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。