Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
给出了厄兰延迟公式和厄兰损失公式的紧界与简单近似，并利用其中一个结果得到了服务器分配问题的简单解析解。
Some sharp bounds and simple approximations are obtained for the Erlang delay formula and for the Erlang loss formula. One of the results is then used to get a simple analytical solution for the Server Allocation Problem.