Blocking formulae for the engset model

Abstract

In this paper, we present simple recursive algorithms for computing call and time congestion in the classical Engset model with M sources and N servers. The first recursion has the complexity of O(MN) and gives the blocking probabilities for all intermediate values of M and N. The second recursion assumes a particular value of M and has the complexity of O(N). It gives the blocking probabilities for all intermediate values of N. Both recursions are similar to the well-known recurrence for computing the Erlang loss function.