Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas

Published Online:https://doi.org/10.1287/mnsc.34.8.959

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.