Professional Documents
Culture Documents
CHAPTER 2
TELECOMMUNICATIONS TRAFFIC
Introduction:
In case of telecommunication systems, it is required to design the
system in accordance with the number of calls that are in progress at any
point of time and the total number of subscribers that are connected to the
network. Teletraffic engineering involves the design of the number of
switching equipment required and the number of transmission lines required
for carrying telephone calls.
In teletraffic engineering the term trunk is used to describe any entity
that will carry one call. The arrangement of trunks and switches within an
exchange is called it’s trunking.
We can check the number of calls in progress at different intervals of
time for a whole day and then tabulate the results. If a graph is plotted taking
the number of calls in progress on y-axis and the time of the day on x-axis
the graph would look like this:-
fig 1.
The maximum number of calls occurs between 8:00 and 10:00 am for
this particular exchange. This hour which corresponds to the peak traffic of
the exchange is called the busy hour.
The busy hour varies for different exchanges and the teletraffic curve
also varies for different exchanges from what is shown in the fig 1.
Telecommunications traffic
a) 1
>. 2
3
.
1
b) 2
3
1
c) 2
3
Fig. 2
Example of 1 erlang of traffic carried on 3 trunks
Figure 2(a) shows 1 erlang of traffic resulting from one truck being busy for
the holding time T. Figure 2(b) shows 1 erlang of traffic resulting from two
trunks with each trunk being busy for 50% of the time T. Figure 2(c) shows
1 erlang of traffic being carried by three trunks with each of the trunks being
busy for 33.33% of the time T.
Sometimes the traffic is also expressed in terms of hundreds of call
seconds per hour ( CCS).
1 erlang = 36 CCS
A=Ch/T (1)
where A=traffic in erlangs
C=average number of calls
arriving during time T
h=average holding time
Congestion:
Normally in a telecommunication system, the installed equipment
will be enough to carry the busy hour traffic and not the entire traffic that
can be generated by the subscribers since the probability of every subscriber
making a call simultaneously is negligible. In such a design a situation might
arise where all the trunks of the system are busy. The system will not be able
to accept any further calls. This state is known as congestion.
There are two things that could happen to a call that encounters
congestion depending upon the design of the exchange:
1) The call will be unsuccessful i.e. lost. Such a system is called a lost call
system.
2) The call will wait in a queue until a trunk frees up. Such calls are
delayed and not lost. Such systems are called delayed systems or queued
systems.
The traffic carried by a lost call system will always be less than the
traffic offered.
Note: Larger the Grade of service worse is the service given. Ideally B=0.
Traffic measurement:
It is essential to keep a record of the traffic that is offered to a
telephone exchange in order to upgrade the system capacity as and when
required.
Initially the number of calls used to be measured manually. Later
automatic traffic recorders were installed in automatic exchanges. In modern
SPC systems, a separate sub-program keeps count of the traffic generated.
Mathematical model:
A mathematical model needs to be developed in order to study
telecommunications traffic. Such a model is based on two assumptions:
a) pure chance traffic
b) statistical equilibrium
a) The assumption of pure chance traffic means that call arrivals and call
terminations are independent random events. It also implies that the
number of sources generating calls is very large. Since call arrivals are
independent random events, the occurrence of calls is not affected by
previous calls, therefore traffic is sometimes called memoryless
traffic.
Proof:
Consider a small interval of time δt such that the probability of two or
more things happening in this interval is very small. The events that could
occur in δt are,
a) one call arrives with probability P(a)
Telecommunications traffic
Our aim is to find the GOS (B) of a lost call system that is offered traffic of
A erlangs and has N outgoing trunks. Erlang worked out a solution to this
problem based on the following assumptions:
i. Pure chance traffic – implies call arrivals and call terminations are
independent random events.
ii. Statistical equilibrium - implies probabilities remain unchanged for
the period being considered.
iii. Full availability – all incoming calls can be connected to any
outgoing trunk that is free.
iv. Calls that encounter congestion are lost which is the basis on which
lost call systems are classified.
If there are x calls in progress, then from equation 8,
N
P(x) = (Ax/x!) ÷ Σk=0 Ak/k!
This is called the first erlang distribution. When x=N, P(N) is the probability
that a call encounters congestion i.e. the GOS of the network. It is
represented by E 1,N
N
B = E 1,N = (A /N!) ÷ Σk=0 Ak/k!
N
(12)
This formula is also called erlang’s lost call formula. E 1,N can also be
calculated by an iterative formula given by
Traffic performance:
B = B1 + B2
In general for an n link connection
n
B= Σ Bk
k=1
Thus P(x) for a queuing system is given by equations 12(a) and 16 where
P(0) is defined by equation 17.
Probability of delay:
The probability that there are Z calls in the system where Z>=N is given
by, infinity
P(x>=Z) = Σx=z P(x)
infinity
= NN/N! P(0) Σk=0 (A/N)x
infinity
= N /N! P(0) (A/N) Σk=0 (A/N)k
N z
where k = x-z
P(x>=Z) = N /N! (A/N) Z [ 1-A/N]-1 P(0)
N
(18)
If there are more than N calls in a system, then any further incoming
calls will have some delay. The probability of delay
PD = P(x>=N)
From 17 we have,
PD = P(x>=N) = NN/N!(A/N)N [1-A/N]-1 P(0)
= AN/N! (N/N-A) P(0) (19)
= E2,N (A)
Telecommunications traffic
2) During busy hour a single customer line receives 3 calls and makes 3
calls of average duration 2 minutes. Find occupancy of trunk.
Solution:
Occupancy of single trunk = probability of finding trunk busy =A
A= 6 *2/60 = 0.2 E
Telecommunications traffic
Solution:
From 1, A = Ch/ T
4) On an average one call arrives every 5s. During a period of 10s, what is
the probability that
a. no call arrives
b. one call arrives
c. two calls arrive
d. more than two calls arrive
Solution:
We have P(x) = μx/x!.e- μ here μ=2
Solution: 5
a. GOS B = E 1,N (A) = (2 /5!) /( Σk=0 Ak/k!) = 0.2667/7.2667 = 0.037
5
Note : this example shows that greater is the number of trunks, lower is the
Grade of service and thus the service provided is better.
E 1,1(A) = A/(A+1) = B
The traffic lost by 1st trunk = traffic overflowing into 2nd trunk
In general, we can say the traffic carried by kth trunk = traffic lost from
first k-1 trunks – traffic lost from first k trunks
= A [E 1,k-1(A) - E 1,k(A)]
Solution:
a. traffic carried by 1st choice trunk = A/(A+1) =2/3 =0.667E
b. E 1,4(2) = (16/24)/ 7.2667 = 0.095
Traffic carried by last choice trunk= 2[0.095-0.037]=0.12E