论文标题
ERLANG REDUX：一种用于解决M/M/M队列的ANSATZ方法
Erlang Redux: An Ansatz Method for Solving the M/M/m Queue
论文作者
论文摘要
该博览会提出了一种新的方法，可以在等待时间和停留时间解决M/M/M队列。动机来自M/M/1队列的停留时间的代数解决方案。关键思想是引入ANSATZ转换，该转化是根据Erlang B函数定义的，该转换避免了基于应用概率理论的更不透明的推导。唯一的先决条件是对泊松分布的基本知识，这对于理解M/M/1队列已经是必需的。此处描述的方法取代了我们较早的近似变形变换。
This exposition presents a novel approach to solving an M/M/m queue for the waiting time and the residence time. The motivation comes from an algebraic solution for the residence time of the M/M/1 queue. The key idea is the introduction of an ansatz transformation, defined in terms of the Erlang B function, that avoids the more opaque derivation based on applied probability theory. The only prerequisite is an elementary knowledge of the Poisson distribution, which is already necessary for understanding the M/M/1 queue. The approach described here supersedes our earlier approximate morphing transformation.
