Nepal Telecom Exam Preparation

(Level 7)

Dipak Kumar Nidhi

Erlang B formula
Queuing
theorem
 Telecommunications traffic
engineering
●Basic knowledge of statistics
•Loss systems: where calls that
●Queuing theory
○The nature of traffic, cannot be handled are given
○Their practical models, equipment busy tone
•Queuing systems: where calls
○Their measurements
○Simulations that cannot be handled immediately
○To make predictions are queued
○Plan telecommunication networks such as a telephone network or the
Internet
● These tools and basic knowledge help provide reliable service at lower
cost.( Minimum trunk, switches required )
● Determine and maintain the quality of service (QoS) and in
particular the grade of service (GoS)
 Erlang B formula
Erlang
●The basic unit of telecom traffic intensity.
●Strictly speaking, an erlang is what mathematicians call a
“dimensionless unit,” representing continuous use of one circuit.
●Single circuit used continuously carries 60 minutes of calling in one
hour, one erlang is usually defined as 60 minutes of traffic.
●Receiving 300 two-minute calls in an hour, then you received 600
minutes, or 10 erlangs, of traffic in that hour.
●CCS — 100 call seconds .
●If you have data in CCS, divide the numbers by 36 to get erlangs.
 Erlang B formula
Erlang B (Erlang loss formula)
●Developed by Agner Krarup Erlang, Danish Scientist
●This is the formula to use when a blocked call is really blocked — for
example, when somebody calls your phone number and gets a busy signal
or tries to access a tie trunk and finds it in use.
 Trunking Theory Terminology
Set-up Time:
The time required to allocated a trunked radio channel to a requesting user.
Blocked Call (Lost Call):
Call that cannot be completed at time of request, due to congestion.
Holding Time:
Average duration of a typical call. Denoted by h (in seconds).
Traffic Intensity:
Measure of channel time utilization, which is the average channel
occupancy measured in Erlangs. This is a dimensionless and may be used to
measure the time utilization of single or multiple channels.
Denoted by A.
Load:
Traffic intensity across the entire trunked radio system, measured in
Erlangs.
 Trunking Theory Terminology
Grade of Service (GOS):
A measure of congestion specified as the probability of a call being blocked
(for Erlang B), or the probability of a call being delayed beyond a certain
amount of time (for Erlang C).
Request Rate:
The average number of call requests per unit time. Denoted by λ calls per
second.
Traffic intensity:
A = λh
(average number of calls received during the average holding time)
●If channel capacity is N – system can be seen as a multiserver
queuing system
λh = ρN
ρ is server utilization, fraction of time server is busy
●A also average number of channels required
 Network Design Parameters
Grade of Service (GoS)
●Ratio of the number of lost calls to the total number of attempted
calls, same as the probability of blockage.
●The lower the number the better the system (A GoS of 0.01 is
better than a GoS of 0.05)

Grade of Service (B)= Number of lost calls

Number of attempted calls
 Network Design Parameters
Estimated Traffic:
●Traffic is the term that quantifies usage. Usage or total traffic
intensity is measured in centi-call seconds (CCS) = 100 call
seconds of traffic in one hour. 36 CCS = 100% utilization
Network Design:
●Trade-off between cost and quality of service
●Optimum designs: cost-savings while maintaining quality
Offered traffic:
●Offered Traffic is the number of calls presented by the
subscriber to the network.
Offered traffic = Number of user × traffic
intensity
Carried traffic:
●Carried Traffic is the maximum capacity of the network
Traffic Flow
 Components of the Tables

1. Lines – trunks – circuits – agents: always in whole numbers 1,2,3,4 etc.

2. Traffic – measured in units called Erlangs. One Erlang is 3600 seconds of
traffic. One Erlang is 60 minutes of traffic. 3600 seconds
= 60 minutes.
Can also be measured in CCS.
One CCS = 100 seconds.
36 CCS = 1 Erlang.
3. Grade of service. Probability that a call will be blocked. Smaller is
better! P.01 = 1 % = 1 out of a 100. P 0.1 = 10% = 1 out of 10 blocked.
 Basic concepts of Traffic
●Before we apply the traffic theory for data communication and
computer networking some basic concepts are in order. These
concepts apply equally well for both computer networking as well as
for circuit switched systems. Following definitions are in order:
○Call arrival
○Number of trunks in use
○Peak load
○Traffic load (Offered load)
○Poisson arrival
○Blocking probability
○Carried traffic
○Routing control
○Overload condition
○Diurnal traffic
 Definitions
●In conventional traffic theory it has been found that the user requests
for trunk connections take place according to Poisson Process with
connection requests rate of □ calls/seconds. The Poisson process is
characterized by the following properties:
○In a very small interval □, only two things can happen: Either there
can be a request for a single call with probability □□, or there are
no request for calls with probability 1- □□
○The arrival of connection requests in different intervals are
statistically independent
●The time that a user maintains a connection is known as holding time.
Average holding time E(X) can be expressed as seconds/call
●The offered load a is defined as:
a = □calls/sec * E(X) seconds/call
The above is dimensionless and defined in units of traffic
known as Erlang
 Definitions
●Traffic defined above in terms of a is the offered traffic vs. the
carried traffic [Discussion ]
●One Erlang corresponds to an offered load that would occupy a single
trunk 100% of the time, for example, an arrival rate of □ = 1 calls/sec
and call holding time of E(X) = 1 would occupy a single trunk all of
the time.
●There are three formulas used in traffic theory: Erlang B, Erlang C,
and Poisson
○For Erlang B if all channels are in use when the system
receives a new call, the call will be blocked
○For Poisson, blocked calls wait in the system proportional to the
call holding time. If the channel becomes available before the
holding time expires the call will be served
○For Erlang C, blocked call wait in the system indefinitely
●For low blocking probability all these three approaches gives about
the same result as shown in the probability curve below
Traffic Design Tables
Traffic Design Tables
Traffic Design Tables
Traffic Design
Tables
●Traffic Usage is measured in CCS or Erlangs.

● Erlang equals 1 hour of traffic usage.

○Can be converted to minutes by multiplying by 60.

● CCS (Centi* Call Seconds) is used for smaller increments of

measurement.
○ 1 CCS is worth 100 seconds.
○ C is the Roman Numeral for 100
●1 Erlang=60 minutes=3600 seconds=36 CCS, 1 CCS=1.67 minutes.

● The typical resident generates about 3-5 CCS per call and the
typical business is about double that.

● Knowing desired GoS and traffic load, the number of circuits is

found using traffic tables .

 References
1. William Stallings
Data and Computer Communications3GPP
2. 4G Americas (3G Americas)
3. DoCoMo
4. Wikipedia
Thanks