Erlang B Model

The Erlang B Model is a queuing theory model used in telecommunication systems engineering that calculates the probability of call blocking in a multi-server loss system with Poisson arrival processes, exponential service times, a finite number of servers, and no queue for waiting calls, distinguishing it from other traffic models by its assumption of zero retrial and immediate call abandonment upon congestion.

64

Publications

2.7K

Citations

156

Authors

85

Institutions

Publications per year

2017–2026

10

Variants

Erlang B

Authors

156

  1. GF
    G.J. Foschini

    Nokia (United States), United States

    3 publications · 245 citations

    3

    h-index

  2. IA
    Imad Al-Ajarmeh

    DePaul University, United States

    2 publications · 45 citations

    2

    h-index

  3. JY
    James Yu

    DePaul University, United States

    2 publications · 45 citations

    2

    h-index

  4. PJ
    Peter J. Smith

    University of Canterbury, New Zealand

    2 publications · 30 citations

    2

    h-index

  5. AM
    A.R. Murch

    Victoria University of Wellington, New Zealand

    2 publications · 30 citations

    2

    h-index

1–5 of 156

Venues

  1. Journal of Applied Probability

    JAP · 4 publications · 110 citations

    4

    h-index

  2. Bell System Technical Journal

    BSTJ · 3 publications · 538 citations

    3

    h-index

  3. IEEE Transactions on Communications

    3 publications · 168 citations

    3

    h-index

  4. Performance Evaluation

    2 publications · 22 citations

    2

    h-index

  5. Advances in Applied Probability

    AAP · 2 publications · 69 citations

    2

    h-index

1–5