Teletraffic engineering/How is Telephony Traffic Modelled?
Author: Jorenjeye Arubayi
Module 20 of the Teletraffic Textbook
How is Telephony Traffic Modelled?[edit | edit source]
Summary[edit | edit source]
Telephony networks like all other networks have finite resources (circuits). This therefore makes it possible that an incoming call may not be served at a particular time, that is, the call may be blocked and cleared due to a limitation on the availability of resources. Call blocking is possibly the most noticeable phenomenon in telephony networks. The aim of modelling telephony traffic is to compute the best estimate of network blocking in order to obtain a reasonable balance between dimensioning of resources and acceptable grade of service. The most widely used traffic models are the Erlang models. Some other commonly adopted traffic models are the Engset and Poisson models.
The Poisson Traffic Model[edit | edit source]
The arrival and dropping of a telephone call occurs randomly. It is often assumed that the arrival of a call occurs according to a Poisson process, with a rate of calls per unit of time . However, this assumption may not be realistic if blocked calls result in immediate new attempts by impatient subscribers. Calls are assumed to have a memoryless property, with a mean of 1/ . Under such assumptions, the number of active calls is described as a Markov process .
The number of calls arriving within a given period of time, T, may be represented as :
P(a) = ( a/ a! ) .................(1)
where a is the number of calls arriving within a period of time T and is the mean number of call arrivals in time T.
The number of calls departing within a given period of time, T, also has a Poisson distribution given by :
P(d) = ( d/ d! ) .................(2)
where d is the number of call departures in time T and is the mean number of call departures in time T.
It can also be shown that calls have a negative exponential distribution given by :
P(T >= t) = .................(3)
where h is the call mean holding time (MHT).
"The Poisson model is commonly used for over engineering standalone trunk groups" . The following formula is used to derive the Poisson traffic model :
P(i,a) is the probability of a call being blocked due to unavailability of resources a is the traffic load in Erlangs i is the number of circuits
Example 1[edit | edit source]
You are required to create a new trunk group to be used by an office and you need to determine how many lines are needed. The office is expected to make and receive about 200 calls per day with an average holding time (AHT) of about 3 minutes (180 seconds). A blocking probability not more than 1 percent is required. Let’s assume that approximately 20 percent of the calls happen during the busy hour.
Number of calls during the busy hour = 200 calls * 20% = 40
Busy hour traffic = (40 calls * 180 AHT)/3600 = 2 erlangs
From the Poisson table we find that at 1% blocking probability, 7 trunks would be required carry slightly over 2 erlangs of traffic. This answer can be double checked by substituting the values into equation 4 as follows:
Erlang Traffic Models[edit | edit source]
A telephone system has a limited number of channels available for carrying user traffic. Arriving calls are assigned a channel until all the channels are occupied, after which any new calls will either be blocked or queued .
Erlang traffic models are formulae that can be used to estimate the number of channels required in a network, or between two PSTN exchanges, for a given grade of service and user traffic. There is also an Erlang formula for modelling queuing situations, which is useful in estimating the agent staffing requirements of call centres .
The main Erlang traffic models are:
- Erlang B
- Extended Erlang B
- Erlang C
The Erlang B Model[edit | edit source]
This is the most common Erlang model and is used to determine the number of circuits required to carry user traffic during the busy hour for a given grade of service and traffic load . The Erlang model assumes that all blocked calls will be immediately cleared .
In an Erlang-B telephone system, when all the available channels are occupied a new call trying to access a channel is blocked. The basic assumption is that that the call is lost and that the calling subscriber will not try again .
The number of active calls is described as a Markov process  and new calls arrive according to a Poisson process at a rate of calls per unit of time and terminate a rate of . "For i calls the rate of termination of one call is i times ."
At equilibrium the rate of moving into a state is the same as that of moving out of a state . The probability of being in state i, and therefore having i channels occupied, can be found to be:
A is the total traffic offered in units of Erlangs N is the number of circuits Pi is the probability that a call will be blocked due to unavailability of resources.
Example 2[edit | edit source]
There is a need to redesign trunk groups that are currently experiencing blocking during the busy hour. The current trunk group is offered 80 erlangs of traffic during the busy hour. The design requirement is for low blocking, so at a blocking probability of 0.001, the number of required circuits can be found using an Erlang B calculator based on equation 5 to be 106.
The Extended Erlang B Model[edit | edit source]
The Extended Erlang B model takes retried calls into account . This traffic model is based on the following assumptions :
- Calls arrive randomly
- Blocked callers make multiple attempts to complete their calls
- No traffic overflow is allowed
The Extended Erlang B model is usually used for standalone trunk groups that have retry probability (for example, a modem pool) .
Example 3 [edit | edit source]
You are required to determine how many circuits you need for your dial access server. You are informed that the expected traffic during the busy hour is 35 erlangs and you require not more than 2% blocking probability during that period. You also expect that 60 percent of the users will retry immediately.
Using an Extended Erlang B calculator you find that you would require 45 circuits.
The Erlang C Model[edit | edit source]
In systems modelled according to the Erlang-C formula, when all the available channels are occupied a new call is queued until it can be served . "The Erlang C model is designed around queuing theory" . The Erlang C traffic model is based on the following assumptions :
- There is an infinite number of sources
- Traffic arrives randomly
- Blocked calls are delayed
- The holding time has an exponential distribution
In the Erlang C model, you need to know the number of calls , the average call length, and the expected amount of delay in seconds . This model is usually used for conservative automatic call distributor (ACD) design to determine the number of call agents needed . The following formula is used to derive the Erlang C traffic model:
A is the total traffic offered in units of Erlangs N is the number of circuits Pc is the probability that a customer has to wait for service
Example 4 [edit | edit source]
A call centre is expected to have about 350 calls lasting approximately 2 minutes each, and each agent has an after-call work time of 15 seconds. You would like the average time in the queue to be approximately 10 seconds. Calculate the amount of expected traffic and the delay factor.
You know that you have about 350 calls of 2 minutes duration, 15 seconds must be added to the call duration because each agent is not answering a call for approximately 15 seconds. The additional 15 seconds is part of the amount of time it takes to service a call.
Expected traffic = (350 calls * (2 * 60) + 15 seconds AHT)/3600 = 13.125 erlangs
The delay factor is computed as follows:
Delay factor = (10 sec delay)/(135 seconds) = 0.074
The Engset Model[edit | edit source]
The Engset traffic model is based on the Engset calculation named after T. O. Engset. This model is similar to the Erlang B traffic model already discussed, but contains one major difference. While the Erlang B model assumes an infinite number of callers, the Engset model specifies a finite number of callers . The Engset formula requires that the expected peak traffic, the number of sources (callers) and the number of circuits in the network be known . The Engset formula is given by :
A = offered traffic load (in erlangs) from all sources S = number of sources of traffic or callers N = number of circuits Pb= probability of blocking or congestion
The Engset model also assumes that the call arrivals can be modelled by a Poisson process, and that the call holding times are described by a negative exponential distribution . However, because there are a finite number of sources, the arrival rate of new calls, , decreases as more sources become busy and therefore new calls cannot be accommodated .
Exercises[edit | edit source]
1. Design a trunk group for an office with the following specifications:
- Approximately 500 calls will be received per day with an average holding time (AHT) of about 2 minutes.
- A blocking probability not more than 1 percent is required.
- Approximately 20 percent of the calls happen during the busy hour.
Number of calls during the busy hour = 500 calls * 20% = 100 calls
Busy hour traffic = (100 calls * 120 AHT)/3600 = 3.33 erlangs
From the Poisson table we find that at 1% blocking probabailty, 9 trunks would be required carry slightly over 3.33 erlangs of traffic.
2. Determine the required number of circuits for a trunk group that is offered 150 erlangs of traffic during the busy hour with a blocking probability of 0.05.
The number of required circuits can be found using an Erlang B calculator to be 154.
3. A call centre is expected to have about 1000 calls lasting approximately 3 minutes each, and each agent has an after-call work time of 35 seconds. You would like the average time in the queue to be approximately 10 seconds. Calculate the amount of expected traffic and the delay factor.
Expected traffic = (1000 calls * (3 * 60) + 35 seconds AHT)/3600 = 59.72 erlangs
Delay factor = (10 sec delay)/(215 seconds) = 0.0465
References[edit | edit source]
 Westbay Engineers Limited, What is an Erlang?. http://www.erlang.com/whatis.html, Last accessed 21 March 2007.
 Telephony Traffic Models. http://wireless.per.nl/reference/chaptr04/erlang/erlang.htm, Last accessed 21 March 2007.
 Kennedy I. G. Teletraffic Engineering-ELEN7015 Full Lecturing Notes, School of Electrical and Information Engineering, University Of Witwatersrand, Johannesburg,2007.
 Traffic Analysis for Voice over IP. http://www.cisco.com/univercd/cc/td/doc/cisintwk/intsolns/voipsol/ta_isd.htm#xtocid26, Last accessed 21 March 2007.
 Wikipedia, Engset Calculation. http://en.wikipedia.org/wiki/Engset_calculation, Last accessed 21 March 2007.
 Wikipedia, Erlang Unit. http://en.wikipedia.org/wiki/Erlang_unit#Engset_formula, Last accessed 21 March 2007.