论文标题
M/g/1-fifo队列与均匀服务时间
M/G/1-FIFO Queue with Uniform Service Times
论文作者
论文摘要
现在有效地知道了平衡M/U/1等待时间密度的精确公式。最初的数字探索成为了象征性的宴会。逆拉普拉斯变换在小径中提供了面包屑。延迟微分方程随后给出了明确的精度。我们还评论尾巴概率渐近性和队列长度。
An exact formula for the equilibrium M/U/1 waiting time density is now effectively known. What began as a numeric exploration became a symbolic banquet. Inverse Laplace transforms provided breadcrumbs in the trail; delay differential equations subsequently gave clear-cut precision. We also remark on tail probability asymptotics and on queue lengths.
