The Ultimate Erlang distribution Dog Breeds Information Guide and Reference

The Erlang distribution is a probability distribution developed by A. K. Erlang to predict waiting times in queueing systems, particularly in the case of telephone traffic engineering. The Erlang distribution is the distribution of the sum of independent identically distributed random variables each having a memoryless exponential distribution. Letting n be the number of such random variables, the probability density function of the Erlang distribution is

$f(x)={x^{n-1} e^{-x} \over (n-1)!}\quad\mbox{for }x>0.$

The Erlang distribution is thus that special case of the gamma distribution is which the number in the role here called n is a positive integer.

There are two commonly used versions of the Erlang distribution, depending on the traffic assumptions modelled:

Erlang B distribution - Does not allow queuing of blocked calls
Erlang C distribution - Allows Unlimited queuing of blocked calls until they are served

The Erlang B and C distributions are still in everyday use for traffic modelling for applications such as the design of call centers.

External links