Definitions for "Erlang B"
Traffic engineering formula used when traffic is random and there is no queuing. Erlang B assumes that blocked callers either automatically use another route, or blocked calls disappear entirely.
Blocking Formula The formula which characterizes the probability of blocking for a M/M/N/N system, i.e., a system that can hold N calls and has N servers. the systems has a Poisson Arrival process and a random exponentially distributed service or holding time.
Also called Lost Calls Cleared model. A mathematical model of telephone traffic blocking in which blocked calls are not queued. The Erlang B blocking probability for N resources, calling intensity y Erlangs, is Cf. Erlang C Model and Poisson Blocking Model.