COMSATS
UNIVERSITY ISLAMABAD
EEE-354: Telecommunication
Systems Engineering
Problem Session
Teletraffic Engineering
Example 1:
1200 calls are offered to a channel and 6 calls are lost. Duration of a call is 3
minutes. Find:
a) Offered traffic, A
b) Carried traffic
c) Lost traffic
d) GOS, B
e) Congestion time
Teletraffic Engineering
Solution:
a) Offered traffic, A
A = CH/T = (1200 x 3) / 60 = 60 E
b) Carried traffic
Carried traffic = [(1200-6) x 3] / 60 = 59.7 E
c) Lost traffic
Lost traffic = (6 x 3) / 60 = 0.3 E
d) GOS, B
B = Lost traffic / Offered traffic
= 6/1200
= 0.005
e) Congestion time
Congestion time = B x 1 hours (second)
= 0.005 x 60 x 60
= 18 seconds
Teletraffic Engineering
Example 3:
Using Poisson traffic tables,
(a)Find how many trunks are needed to serve 50 E at “P.01” (1% Poisson
blocking)
Answer:
(b) Find how many trunks are needed to serve 5 E at “P.01”
Answer:
(c) Compare the trunking efficiency of the 50 E group to the 5 E group.
Answer: 50 E: 5 E :
(d) What general insight can you gain from this?
Poisson Traffic Tables
Teletraffic Engineering
Example 5:
A call established at 1am between a mobile and MSC. Assuming a
continuous connection and data transfer rate at 30 kbit/s,
determine the traffic intensity if the call is terminated at 1:50 a.m
Solution
• Traffic intensity = (1 call)*(50 mins)*(1 hour/60 min) = 0.83 Er
Note, traffic intensity has nothing to do with the data rate, only the holding time is
taken into account.
Teletraffic Engineering
Example 6:
A telephone switching board can handle 120 phones. Assuming the followings,
determine the outgoing traffic intensity and number of channels
- On average 5 calls/hour per phone,
- Average call duration time = 4 minutes, - 60% of all calls made are external.
- QoS = 0.9%
Solution:
A = U.𝜇.H
𝜇 *U = (120 call*5 calls/hour)*60% =360 call/h
H = 4 mins/call
Therefore AI =360 * 4 * (1 hour/60 mins) = 24 Erlangs.
Thus 24 hours of circuit talk time is required for every hour of elapsed time
No. of channels C from Erlang B chart = ~ 34
Teletraffic Engineering
Example 7:
A Trunked mobile network system “system A” provides service in an urban area.
System A has 394 cells with 19 channels each. Find the number of userd that
can be supported at 2% blocking if each user averages 2 calls per hour at an
average call duration of 3 minutes
Solution:
Given
Probability of blocking =2%
Number of channels per cell used in the system =19
From Erlang B chart the total carried traffic =12 Erlangs
Traffic intensity per user =2*3/60=0.1 Erlangs
Erlang C
BCH-> Poisson ; BCC-> Erlang B ; BCW-> Erlang C
• Erlang-C formula allows you to calculate the probability that
a customer will have to wait for a resource. The formula is:
• This formula is applicable under the following conditions:
– Customer requests are Poisson arrivals
– Service times are exponentially distributed
– Customers do not abandon resource requests while waiting for a
resource
– Requests from customers are independent of each other. This formula
does not work if customer requests have been triggered by some
common event like calling a talk show, natural calamity etc.
– The number of customers is much larger than the number of resources
available to service them. In general, the formula gives acceptable results
if the number of customers is at least 10 times the total number of
resources (N)
Erlang C Traffic Tables
© 2013-14 Khurram Aziz CIIT Department of Electrical Engineering EEE-354: Telecommunication Systems Engineering
Queueing Systems
Example 1:
A wireless channel of IEEE 802.11b = 11Mbps. For a video file needed to be
sent at 2 Mbps
Find the
• The average transmission time
• The average number of waiting bits
The average number of waiting bits is the average number of customers in Queue not in system (Correction
in video lecture)
Queueing Systems
Example 2:
Arrival rate of telephone calls at a telephone booth is according to the Poisson
distribution with an average time of 9 minutes between two consecutive
arrivals. The length of telephone call is assume to be exponentially distributed
with mean 3 minutes.
(a) Determine the probability that a person arriving at the booth will have to
wait.
(b) Find the average Queue length that forms from time to time
(c)The telephone company will install a second booth when convinced that an
arrival would expect to have to wait at least four minutes for the phone. Find the
increase in flow of arrivals which will justify a second booth.
Queueing Systems
Example 3:
Suppose we’re dealing with a single-server queueing system in which the arrivals
are Poisson with a mean of 12 minutes, and the services are exponential with rate
10 per hour. Suppose that the system can only hold 4 customers (in line + being
served). Find the expected number of customers in line.
Solution:
Step 1: Model Identification
This is M/M/1/4 model
Step 2: Find 𝝁 𝝀
𝜆=5, 𝜇 = 10
! #
𝝆= =
" 𝟏𝟎
'(𝝆
𝑃& = ! =0.516
'(*
L=0.839
𝐿+ =L-(1- 𝑃& )=0.355
Queueing Systems
Example 4:
Consider a network gateway, at which measurements have shown that
packets arrive at a mean rate of 125 packets per second, and are
buffered until they can be transmitted. The gateway takes 2 milliseconds
on average to transmit a packet. The gateway currently has 13 places
(including the packet being transmitted) and packets that arrive when
the buffer is full are lost. We wish to find out if the buffer capacity is
sufficient to ensure that less than one packet per million gets lost.
Solution
We represent the gateway as a M/M/1/13 queue, with λ = 125 and µ =
1/0.002 = 500. The utilization of the gateway will be ρ = λ/µ = 0.25. The
loss rate is the arrival rate multiplied by the probability that the system
is full, i.e. λ ×𝑝! . The proportion of packets that are lost is simply 𝑝!
(expected number lost per time unit divided by the expected number
arriving per time unit)
Thus the expected proportion of packets lost is 0.0112 every million
packets, well within the requirement.
Queueing Systems
Example:
Patients arrival at a clinic having single doctor according to Poisson distribution
at a rate of 30 patients per hour. The waiting room does not accommodate more
than 14 patients. Examination time per patient is exponential with mean rate of
20 per hour.
(a) Find the effective arrival rate at the clinic.
(b) What is the probability that an arriving patient will not wait?
( c) What is the expected waiting time until a patient is discharged from the
clinic?
Queueing Systems
Example 5:
Students arrive at a computer 10 per hour. Spends 20 minutes per
terminal(assume exponentially distributed) and then leave. Centre
has 5 terminals.
(a)How many terminals can go down and still be able to service
the students.
(b)What is the probability that all the terminals are busy.
(c )How long is the average student in centre
Queueing Systems
Solution:
Step1: Model Identification
M/M/5 with infinite capcity
Step 2: Find 𝝁 𝝀
$.$&
𝜆=0.167/min, 𝜇 = '()
(a) Find system utilization
*
=
&+
Queueing Systems
(b)Probability of 5 terminals being busy=> Erlang C Formula
𝟏 𝝀
𝑃$= (01) 3 (01)0
. 𝝆 = 𝒄𝝁
=0.67
𝟏.(∑𝒄𝒏-𝟏 𝒏! ).𝒄!(𝟏51)
𝟏
𝑷𝟎 = (6.68) 3 (6.68)8
=0.03
𝟏.(∑𝒄𝒏-𝟏 𝒏! ).𝟓!(𝟎.𝟑𝟑)
(;.;&)8
𝜅= ∗ 0.03=0.319
&!($.;;)
Queueing Systems
(c )Waiting time in system
% )
W=&'()*+) + '
-./)0 )
W= + = 23.86 minutes
1∗-.-1 (-.//) -.-1
Homework Problem
