M 13424

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Connexions module: m13424

The Engset Calculation


Mookho Tsilo
This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License

The Engset calculation is named after its developer, T. O. Engset, who created it to determine the probability of congestion occurring within a circuit group. The level of congestion can be used to determine a network's performance as it measured by the grade of service. The formula requires that the user knows the expected peak trac, the number of sources (callers) and the number of circuits in the network. Businesses need to know the minimum number of voice circuits they need to have to and from the PSTN. An approximate approach is to use the Erlang-B formula. However, if the business has a small number of extensions, then the more exact Engset calculation, which takes the user population size into account, should be used instead. (For a large user population, the Engset and the Erlang-B calculations give the same result.) Engset's equation is similar to the Erlang-B formula; however it contains one major dierence: Erlang's equation assumes an innite source of calls and Engset species a nite number of callers [1]. Thus Engset's equation should be used when the source population is small (say less than 200 users, extensions or customers). In practice, like Erlang's equations, Engset's formula requires recursion to solve for the blocking or congestion probability. To determine this probability, the calculation must rst determine an initial estimate. This initial estimate is substituted into the equation and the equation then is solved. The answer to this initial calculation is then substituted back into the equation, resulting in a new answer which is again substituted. This iterative process continues until the equation converges to the correct answer [1, 2]. Engset's equation follows [1]:

Engset Equation

Figure 1

Where A = oered trac intensity in erlangs, from all sources ; S = number of sources of trac ; N = number of circuits in group; Pr(b) = probability of blocking or congestion References
Version
1.1: Feb 17, 2006 6:16 am US/Central

http://creativecommons.org/licenses/by/2.0/

http://cnx.org/content/m13424/1.1/

Connexions module: m13424

1. Parkinson R., Trac Engineering Techniques in Telecommunications, Infotel Systems Inc (pdf). Last accessed 17 October 2005. 2. ITU-T Study Group 2, Teletrac Engineering Handbook(pdf). Last accessed 17 October 2005.

Retrieved and edited from "http://en.wikipedia.org/wiki/Engset_calculation" ________________________

http://cnx.org/content/m13424/1.1/

You might also like