TRAFFIC

ANALYSIS

Aditta Chowdhury
Dept. of EEE
CUET
TRAFFIC ENGINEERING
• The telecommunication system has to service the voice traffic and data
traffic.
• The traffic is defined as the occupancy of the server.
• Traffic engineering is a method of optimizing the performance of a
telecommunications network by dynamically analyzing, predicting and
regulating the behaviour of data transmitted over that network
• Traffic engineering is also known as teletraffic engineering and traffic
management
TRAFFIC ENGINEERING
• Traffic Engineering provides the basis for analyzing and designing
telecommunication networks or models.
• Used to provide a method for determining the cost-effectiveness
of various sizes and configurations of networks
• Techniques of Traffic Analysis
It is divided into two general categories: Loss system and
Delay system
TRAFFIC ANALYSIS

• Loss system: In a loss system, overload traffic is rejected

without being serviced.
• Delay system: In a delay system, overload traffic is held is a
queue until the facilities become available to service it.
NETWORK TRAFFIC LOAD

In a traffic network the

traffic load on a typical
day during 24 hours
NETWORK TRAFFIC LOAD
• The use of the network from night to morning, or 0-6 hours, is very low as most people are
asleep.
• There is a large peak around mid-forenoon and mid-afternoon signifying busy office
activities.
• The afternoon peak is, however, slightly smaller. The load is low during the lunch-hour
period, i.e.12.00-14.00 hours.
• The period 17.00-18.00 hours is characterised by low traffic signifying that the people are
moving from offices to their residences.
• The peak of the domestic calls occurs after 16:00 hours when persons reach home.
PARAMETERS
BUSY HOUR
• In a day the 60 minute interval in which the traffic is the highest is called the busy
hour
• 1 hour interval lying in time interval concerned in which traffic is highest (max call
attempts).
• Peak Busy hour
PARAMETERS
TIME CONSISTENT BUSY HOUR
The one hour period starting at the same time each day for which the number of call
attempts is greatest over the days.
CCR (call completion rate)
It is defined as the number of successful calls to the number of call attempts.

number of successful call

CCR =
Number of calls attempts
PARAMETERS
• Network is generally designed to provide an overall CCR of 0.70
CCR = 0.75 is considered excellent.
Higher CCR is not cost-effective.
BHCA (busy hour call attempts)
The number of call attempts in the busy hour is called busy hour call attempts.
PARAMETERS
• Network is generally designed to provide an overall CCR of 0.70
CCR = 0.75 is considered excellent.
Higher CCR is not cost-effective.
BHCA (busy hour call attempts)
The number of call attempts in the busy hour is called busy hour call attempts.
TRAFFIC MEASUREMENT
• Measurement of traffic within a network allows a network managers &
analysts to both make day to day decisions about operations and plan for
long- term developments.
• These measurements are conducted continuously, and the results are
compiled into reports for further n/w management.
• Traffic measurements are used in many fundamental activities such as
calculating traffic intensity in specific circuit or group, identification of
traffic pattern and trends, monitoring services etc.
TRAFFIC STATISTICS
Statistical description is not just a tool, but a cornerstone for the analysis and design
of any switching network, underscoring its paramount importance.
1. Call rate(λ): It is the average number of connection requests per unit time, also
known as the Average Arrival Rate.
If 'n' is the average number of calls to and from a terminal during a period of 'T'
seconds, the calling rate is given as:

CR=λ= =Calls / s
TRAFFIC STATISTICS
2. Holding Time(h): It is the average duration of occupancy of a traffic path by a call.
It is also known as Service Time.
For voice traffic, it is the average holding time per call in hours or 100 seconds.
For data traffic, it is the average transmission per message in seconds.
The reciprocal of holding time is referred to as "Service rate (μ)".

μ= calls per hour

TRAFFIC STATISTICS
3. Distribution of Destinations: It is described as the probability of a call request being for a
particular destination. This helps determine the number of trunks needed between individual
centers.
4. User Behavior: The switching system is a function of the behavior of users, and the system
behaves differently for different users.
5. Average Occupancy: This is the ratio of the average arrival rate to the average service rate.
If ‘n’ is the average number of calls to and from a terminal during a period of ‘T’ seconds and the
average holding time is 'h' seconds, the average occupancy is given by:

λ
= = λh =
TRAFFIC INTENSIT Y
• Traffic intensity is a measure of the average occupancy of a server or resource
during a specified period of time, usually a busy hour.
• The traffic intensity offered by each user is: Α= h Erlangs
Where h is the average holding time of a call, μ is the average number of calls
requested/hour,
Period for which a server is occupied
A=
Total period of observation
TRAFFIC INTENSITY
• Traffic intensity is measured in two units:
1. Erlangs (E): It represents one circuit occupied for one hour.
The maximum capacity of a single server is 1 E; the server is always busy.
It is also expressed as traffic carried per server. Used for voice and data transmission.
2. Cent Call Seconds (CCS): It is used to measure the amount of traffic expressed in
units of 100 seconds. Also referred as hundred call seconds (CS), sometimes also
described in Call minutes (CM)
It is valid for only telephone circuits.
TRAFFIC INTENSITY
• The international unit of traffic is the Erlangs
• It is dimensionless unit of telephone traffic.
• After A. K. Erlang (1878-1929) a Danish scientist.
• One erlang represents one circuit occupied for one hour.
• In data communications, an 1 E = 64 kbps of data
• 1 E = 1 x 60 call mins = 1 x 3600 call seconds
• 1E = 36 CCS = 3600 CS = 60 CM
PROBLEMS
Example 1.: A subscriber makes 3 phone calls of 4 minutes, 3 minutes, and 3 minutes
duration in a 1-hour period. Estimate the subscriber traffic in Erlangs, CCS, and CM.
Solution:
Busy Period 4+3+3 minutes
Total Period=60 min(1 hr)
Subscriber traffic in Erlangs= Busy Period/Total Period = 10/60 = 0.16 E
Traffic in CCS=(4+3+3) X 60/100 = 6 CCS
Traffic in CM=4+3+3 = 10 CM
PROBLEMS
Example 2.: A subscriber makes 4 phone calls of 5 minutes, 4 minutes, 3 minutes, and 2
minutes duration in a 2-hour period. Estimate the subscriber traffic in Erlangs, CCS,
and CM.
Solution:
Busy Period 5+4+3+3 minutes
Total Period=120 min(2 hr)
Subscriber traffic in Erlangs= Busy Period/Total Period = 15/120 = 0.125 E
Traffic in CCS=(5+4+3+2) X 60/100 = 8.4 CCS
Traffic in CM=4+3+3 = 15 CM
PROBLEMS
Example 3.:
A subscriber makes 3 calls of duration of 8,2,4 minutes during 2 hours of a day.
calculate the BHCA and erlang capacity of exchange is all its 5000 subscribers have
same traffic per hour and CCR of 80%.
Given, number of successful calls = 3, duration of calls = 8+2+4 = 14
CCR = 80%, total duration = 60 x 2 = 120
Find BHCA =? & Traffic carried per server =?
Solution:
Traffic carried per server = 14/120 E = 0.117 E.
 number of successful call
CCR = =
Number of calls attempts Number of calls attempts

Number of calls attempts = = 3.75

Number of calls attempts .

BHCA = = = 16.07
/
PROBLEMS
Example 4.:
An exchange server has 500 subscribers. If the average BHCA is 8000 and CCR
is 50% calculate busy hour calling rate.
Given, total subscribers= 500, BHCA= 8000, CCR = 50%
Find busy hour calling rate =?
Solution:
Average busy hour calls = BHCA x CCR = 4000
Average busy hour calls
Busy hour calling rate = =8
PROBLEMS
Example 5.:
Over a 10-minute observation interval, 20 users initiate call. Total call duration is
4800s. Calculate load offered to network by subscriber and average subscriber traffic.
Solution:
average number of calls requested, µ = 20/10 = 2 calls per minute
4800
Mean holding time, h = = 4 minutes/call

Load offered = µh= 8 E

Average subscriber traffic = 8/20 E = 0.4 E
GRADE OF SERVICE
• The grade of service refers to the proportion of unsuccessful calls relative to the total number of
calls.
• GOS is ratio of lost traffic to offered traffic.
ℎ
=
ℎ

−
=

• A= offered traffic (Attempt), B= carried traffic (success), A-B= lost traffic (failed)
GRADE OF SERVICE
• GOS depends on traffic intensity
• The smaller the value of GOS, the better the service. The recommended GOS is 0.002.
REASONS OF CALL FAILURE
Customer behavior
• Wrong number dialed
• No answer
• Busy subscriber
• Long delay
Due to system
• Technical problem
• Maintenance
CALL BLOCKING
• Call blocking in telecommunications occurs when a system is unable to handle an
incoming call due to a lack of available resources, such as phone lines, channels, or
circuits. As a result, the call is "blocked" and cannot be completed. This typically happens
when the traffic demand exceeds the system's capacity to handle concurrent calls.
• There are two common types of call blocking:
1. Hard blocking: In systems without queuing, like traditional telephone systems, if all lines
or channels are busy, the incoming call is immediately blocked and cannot be processed
until a resource becomes available.
2. Soft blocking: In some systems, such as call centers, calls can be placed in a queue until a
line or agent becomes free. If there’s no queue or if the queue is full, the call is blocked.
CALL BLOCKING
• Causes of Call Blocking:
• Limited number of lines or channels: The system has a fixed number of lines available to handle
calls. When all are in use, additional calls cannot be handled.
• High traffic: During peak usage times, such as during emergencies or busy hours, traffic increases,
and the system may not be able to accommodate all calls.
• Insufficient capacity planning: If a system isn't designed to handle the expected call volume, calls
can be blocked regularly.
CALL BLOCKING PROBABILIT Y
• The call blocking probability in telecommunications can be calculated using
Erlang B formula. This formula is used in systems where calls that cannot be
immediately handled are blocked (not queued). It’s particularly useful for analyzing
traffic in a system with a finite number of lines (or servers).
• The Erlang B formula is:

, = !
∑
!
•A is the traffic intensity in Erlangs (the product of the average call arrival rate and the average call
duration).
•N is the number of servers (or lines).
PROBLEM
• Example 6.:
Suppose a telephone system has 5 lines, and the traffic intensity is 3 Erlangs. What is the
probability that a call will be blocked?
Solution:

= = = .
! !

∑ = + + + + + = .
! ! ! ! ! ! !
B(3,5) = 2.025/18.4 = 0.1101 or 11.01%
THANK YOU