论文标题
泊松到达，指数服务时间和无限服务器队列繁忙时期和繁忙的周期分配功能界限
Poisson Arrivals, Exponential Service Time, and Infinite Servers Queue Busy Period and Busy Cycle Distribution Function Bounds
论文作者
论文摘要
繁忙的时期分布功能知识对于任何队列系统和MGINF队列都很重要。但是，数学表达式通常非常复杂，除了少数例外，通常涉及无限的总和和多次卷积。因此，在这项工作中，为MMINF系统繁忙长度分布函数推导了一些范围，这意味着第二m指数服务时间，分析表达式比确切的表达更简单。结果，也提出了MMINF系统繁忙长度分布函数的一些界限。
The busy period length distribution function knowledge is important for any queue system, and for the MGINF queue. But the mathematical expressions are in general very complicated, with a few exceptions, involving usually infinite sums and multiple convolutions. So, in this work are deduced some bounds for the MMINF system busy period length distribution function, meaning the second M exponential service time, which analytic expressions are simpler than the exact one. As a consequence, also some bounds for the MMINF system busy cycle length distribution function are presented.
