Enter a term or select a letter or number below.

.  1  2  3  5  6  8  A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Z 

Erlang B, C

Erlang B and C are traffic engineering formulas that determine the number of trunks required to serve a particular volume of call traffic at a given grade of service. Erlang B assumes all blocked calls disappear, to redial later or not at all. Erlang C assumes all blocked calls enter a queue, and wait indefinitely until served.