Erlang (unit)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 11 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The erlang (symbol E ) is a dimensionless unit that is used in telephony as a measure of offered load or carried load on service-providing elements such as telephone circuits or telephone switching equipment. A single cord circuit has the capacity to be used for 60 minutes in one hour. Full utilization of that capacity, 60 minutes of traffic, constitutes 1 erlang. Carried traffic in erlangs is the average number of concurrent calls measured over a given period (often one hour), while offered traffic is the traffic that would be carried if all call-attempts succeeded. How much offered traffic is carried in practice will depend on what happens to unanswered calls when all servers are busy. The CCITT named the international unit of telephone traffic the erlang in 1946 in honor of Agner Krarup Erlang. In Erlang's analysis of efficient telephone line usage, he derived the formulae for two important cases, Erlang-B and Erlang-C, which became foundational results in teletraffic engineering and queueing theory. His results, which are still used today, relate quality of service to the number of available servers. Both formulae take offered load as one of their main inputs (in erlangs), which is often expressed as call arrival rate times average call length.…

The erlang (symbol E ) is a dimensionless unit that is used in telephony as a measure of offered load or carried load on service-providing elements such as telephone circuits or telephone switching equipment. A single cord circuit has the capacity to be used for 60 minutes in one hour. Full utilization of that capacity, 60 minutes of traffic, constitutes 1 erlang. Carried traffic in erlangs is the average number of concurrent calls measured over a given period (often one hour), while offered traffic is the traffic that would be carried if all call-attempts succeeded. How much offered traffic is carried in practice will depend on what happens to unanswered calls when all servers are busy. The CCITT named the international unit of telephone traffic the erlang in 1946 in honor of Agner Krarup Erlang. In Erlang's analysis of efficient telephone line usage, he derived the formulae for two important cases, Erlang-B and Erlang-C, which became foundational results in teletraffic engineering and queueing theory. His results, which are still used today, relate quality of service to the number of available servers. Both formulae take offered load as one of their main inputs (in erlangs), which is often expressed as call arrival rate times average call length. A distinguishing assumption behind the Erlang B formula is that there is no queue, so that if all service elements are already in use then a newly arriving call will be blocked and subsequently lost. The formula gives the probability of this occurring. In contrast, the Erlang C formula provides for the possibility of an unlimited queue and it gives the probability that a new call will need to wait in the queue due to all servers being in use. Erlang's formulae apply quite widely, but they may fail when congestion is especially high causing unsuccessful traffic to repeatedly retry. One way of accounting for retries when no queue is available is the Extended Erlang B method. E = \lambda h provided that h and λ are expressed using the same units of time (seconds and calls per second, or minutes and calls per minute). The practical measurement of traffic is typically based on continuous observations over several days or weeks, during which the instantaneous traffic is recorded at regular, short intervals (such as every few seconds). These measurements are then used to calculate a single result, most commonly the busy-hour traffic (in erlangs). This is the average number of concurrent calls during a given one-hour period of the day, where that period is selected to give the highest result. (This result is called the time-consistent busy-hour traffic). An alternative is to calculate a busy-hour traffic value separately for each day (which may correspond to slightly different times each day) and take the average of these values. This generally gives a slightly higher value than the time-consistent busy-hour value. Where the existing busy-hour carried traffic, E c , is measured on an already overloaded system, with a significant level of blocking, it is necessary to take account of the blocked calls in estimating the busy-hour offered traffic E o (which is the traffic value to be used in the Erlang formulae). The offered traffic can be estimated by . For this purpose, where the system includes a means of counting blocked calls and successful calls, P b can be estimated directly from the proportion of calls that are blocked. Failing that, P b can be estimated by using E c in place of E o in the Erlang formula and the resulting estimate of P b can then be used in to provide a first estimate of E o . Another method of estimating E o in an overloaded system is to measure the busy-hour call arrival rate, λ (counting successful calls and blocked calls), and the average call-holding time (for successful calls), h, and then estimate E o using the formula . For a situation where the traffic to be handled is completely new traffic, the only choice is to try to model expected user behavior. For example, one could estimate active user population, N, expected level of use, U (number of calls/transactions per user per day), busy-hour concentration factor, C (proportion of daily activity that will fall in the busy hour), and average holding time/service time, h (expressed in minutes). A projection of busy-hour offered traffic would then be . (The division by 60 translates the busy-hour call/transaction arrival rate into a per-minute value, to match the units in which h is expressed.) P_\text{b} = B(E,m) = \frac{\frac{E^m}{m!}} { \sum_{i=0}^m \frac{E^i}{i!}} where: P b is the probability of blocking m is the number of identical parallel resources such as servers, telephone lines, etc. E = λh is the normalised ingress load (offered traffic stated in erlang). The erlang is a dimensionless load unit calculated as the mean arrival rate, λ, multiplied by the mean call holding time, h. The unit has to be dimensionless for Little's Law to be dimensionally sane. This may be expressed recursively as follows, in a form that is used to simplify the calculation of tables of the Erlang B formula: B(E,0) = 1. \, B(E,j) = \frac{E B(E,j - 1)}{E B(E,j - 1) + j} \ \forall{j} = 1,2,\ldots,m. Typically, instead of B(E, m) the inverse 1/B(E, m) is calculated in numerical computation in order to ensure numerical stability: \frac{1}{B(E,0)} = 1 \frac{1}{B(E,j)} = 1 + \frac{j}{E}\frac{1}{B(E,j - 1)} \ \forall{j} = 1,2,\ldots,m. The recursive form is derivable from the non-recursive form by repeated substitution. Function ErlangB (E As Double, m As Integer) As Double Dim InvB As Double Dim j As Integer InvB = 1.0 For j = 1 To m InvB = 1.0 + InvB * j / E Next j ErlangB = 1.0 / InvB End Function or a Python version: def erlang_b(E: float, m: int) -> float: """Calculate the probability of call losses.""" inv_b = 1.0 for j in range(1, m + 1): inv_b = 1.0 + inv_b * j / E return 1.0 / inv_b The Erlang B formula is decreasing and convex in m. It requires that call arrivals can be modeled by a Poisson process, which is not always a good match, but is valid for any statistical distribution of call holding times with a finite mean. It applies to traffic transmission systems that do not buffer traffic. More modern examples compared to POTS where Erlang B is still applicable, are optical burst switching (OBS) and several current approaches to optical packet switching (OPS). Erlang B was developed as a trunk sizing tool for telephone networks with holding times in the minutes range, but being a mathematical equation it applies on any time-scale. The steps in the process are as follows. It starts at iteration k=0 with a known initial baseline level of traffic E_{0} , which is successively adjusted to calculate a sequence of new offered traffic values E_{k+1} , each of which accounts for the recalls arising from the previously calculated offered traffic E_{k} . Calculate the probability of a caller being blocked on their first attempt P_\text{b} = B(E_k,m) as above for Erlang B. Calculate the probable number of blocked calls B_\text{e} = E_k P_\text{b} Calculate the number of recalls, R , assuming a fixed recall factor, R_\text{f} , R = B_\text{e} R_\text{f} Calculate the new offered traffic E_{k+1}=E_{0}+R where E_{0} is the initial (baseline) level of traffic. Return to step 1, substituting E_{k+1} for E_{k} , and iterate until a stable value of E is obtained. Once a satisfactory value of E has been found, the blocking probability P_\text{b} and the recall factor can be used to calculate the probability that all of a caller's attempts are lost, not just their first call but also any subsequent retries. P_\text{w} = {{\frac{E^m}{m!} \frac{m}{m - E}} \over \left ( \sum\limits_{i=0}^{m-1} \frac{E^i}{i!} \right ) + \frac{E^m}{m!} \frac{m}{m - E}} where: E is the total traffic offered in units of erlangs m is the number of servers P_\text{w} is the probability that a customer has to wait for service. It is assumed that the call arrivals can be modeled by a Poisson process and that call holding times are described by an exponential distribution, therefore the Erlang C formula follows from the assumptions of the M/M/c queue model.

Limitations of the Erlang formula

When Erlang developed the Erlang-B and Erlang-C traffic equations, they were developed on a set of assumptions. These assumptions are accurate under most conditions; however in the event of extremely high traffic congestion, Erlang's equations fail to accurately predict the correct number of circuits required because of re-entrant traffic. This is termed a high-loss system, where congestion breeds further congestion at peak times. In such cases, it is first necessary for many additional circuits to be made available so that the high loss can be alleviated. Once this action has been taken, congestion will return to reasonable levels and Erlang's equations can then be used to determine how exactly many circuits are really required. An example of an instance which would cause such a High Loss System to develop would be if a TV-based advertisement were to announce a particular telephone number to call at a specific time. In this case, a large number of people would simultaneously phone the number provided. If the service provider had not catered for this sudden peak demand, extreme traffic congestion will develop and Erlang's equations cannot be used.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1303140867 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.