Trunking

© Ammar Abu-Hudrouss Islamic

University Gaza 1
 Trunking and Grade of Service

◼ Concept of trunking allows a large number of users to share the

relatively small number of channels in a cell by providing access
to each user, on demand, from a pool of available channels.

◼ Users are allocated the channels on a per-cell basis.

◼ Upon the termination of the call, the channel is returned to the

pool of available channels.

◼ Trunking exploits the statistical behavior of users.

◼ Used by telephone company to estimate the number of

telephone circuits needed for an office of hundred of
telephones.

EELE 5414:WC~Ammar
Slide 2
 Trunking and Grade of Service

◼ In a trunked mobile system, when a user request a

service and all the channels are already in use, the user
is blocked.

◼ In some systems, a queue may be used to hold the

requesting users until the channel becomes available.

◼ Developed by Erlang, Danish mathematician who studied

how large population can be accommodated by limited
services.

◼ Radio channel that is occupied 30 min during 1h carries

0.5 Erlang of traffic.
EELE 5414:WC~Ammar
Slide 3
 Terminology

◼ Grade of Service (GOS):A measure of congestion which is

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).

◼ Set-up Time : The time required to allocate a trunked

radio channel to a requesting user.

◼ Blocked Call: A call which can not be completed at the

time of request, due to congestion. Also referred as a lost
call.

◼ Holding Time: Average duration of a typical call.

Denoted by H (in seconds).

EELE 5414:WC~Ammar
Slide 4
 Terminology

◼ Traffic Intensity: Measure of channel time utilization, which is

the average channel occupancy measured in Erlangs.

◼ This is dimensionless quantity 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.

◼ Request Rate: The average number of call requests per unit

time. Denoted by 𝜆 second−1

EELE 5414:WC~Ammar
Slide 5
 Erlang Formulas

◼ Per user traffic intensity 𝐴𝑢 = 𝜆𝐻 where H is the average call

duration and 𝜆 is the number of requests per unit time.

◼ For U users, 𝐴 = 𝑈𝐴𝑢 (total offered traffic intensity).

◼ When C is the number of offered channels, Erlang B formula

◼ In a C channel trunked system, if the traffic is equally

distributed among the channels, then the traffic intensity per
channel
◼ 𝐴𝑐 = 𝑈𝐴𝑢 /𝐶
𝐴𝐶
◼ Erlang B formula Pr 𝑏𝑙𝑜𝑐𝑘𝑖𝑛𝑔 = 𝐶!
𝐴𝑘
= 𝐺𝑂𝑆
σ𝐶
𝑘=0 𝑘!

EELE 5414:WC~Ammar
Slide 6
 ErlangB Formulas

◼ For example, AMPS cellular system is designed for a GOS of 2%

blocking.

◼ This implies that the channel allocations for cell sites are
designed so that 2 out of 100 calls will be blocked due to channel
occupancy during the busiest hour.

◼ This system does not offer queuing for call request.

◼ For every call, it is assumed there is no setup time and the user
is given immediate access to a channel if one is available.

◼ If no channels are available, the requesting user is blocked

without access and is free to try again later.

EELE 5414:WC~Ammar
Slide 7
 ErlangB Formulas

◼ Calls arrive as determined by Poisson distribution. It is assumed

that there are an infinite number of users. This system is based
on following assumptions.

◼ Call requests are memoryless implying that all users including

blocked users may request for channel at any time.

◼ The probability of users occupying a channel is exponentially

distributed. That means longer calls are less likely to happen.

◼ There are a finite number of channels available in pool (group of

channels).

◼ In arrival times all call requests are independent of each other.

EELE 5414:WC~Ammar
Slide 8
 ErlangB Formulas

EELE 5414:WC~Ammar
Slide 9
 Blocked Calls Delayed System (ErlangC)

◼ In Blocked Calls Delayed (BCD) or Erlang C system., a queue is

provided to hold calls which are blocked.

◼ If a channel is not available immediately, the call request is

delayed until a channel becomes available.

◼ It's measure of GOS is defined as the probability that a call is

blocked after waiting a specific length of time in the queue.

◼ To find the GOS it is necessary to find the likelihood that a call

is initially denied access to the system

EELE 5414:WC~Ammar
Slide 10
 Blocked Calls Delayed System (ErlangC)

◼ The likelihood of a call not having immediate access to a channel

is determined by the Erlang C formula:
𝐴𝐶
◼ Pr 𝑑𝑒𝑙𝑎𝑦 > 0 = 𝐴 𝐴𝑘
𝐴𝐶 +𝐶! 1−𝐶 σ𝐶−1
𝑘=0 𝑘!

◼ A = Traffic intensity

◼ C = Total number of channels

◼ k = kth channel

EELE 5414:WC~Ammar
Slide 11
 Blocked Calls Delayed System (ErlangC)

◼ If no channels are immediately available, the call is delayed .

◼ The probability that the delayed call is forced to wait more than
t seconds is given by the probability that a call is delayed
multiplied by the conditional probability that the delay is
greater than t seconds.

◼ The GOS of a trunked system where blocked calls are delayed is

hence given by

◼ Pr 𝑑𝑒𝑙𝑎𝑦 > 𝑡 = Pr 𝑑𝑒𝑙𝑎𝑦 > 0 Pr 𝑑𝑒𝑙𝑎𝑦 > 𝑡 𝑑𝑒𝑙𝑎𝑦 > 0

= Pr 𝑑𝑒𝑙𝑎𝑦 > 0 𝑒𝑥𝑝 − 𝐶 − 𝐴 𝑡/𝐻

EELE 5414:WC~Ammar
Slide 12
EELE 5414:WC~Ammar
Slide 13
 Example 1

◼ Example 1 How many users can be supported for 0.5% blocking

probability for the following number of trunked channels in a
blocked calls cleared system? (a) 5 (b) 10 ,
◼ Assume each user generates 0.1 Erlangs of traffic

𝐴 1.13
a) 𝑈 = 𝐴 = ≈ 11 users
𝑢 0.1

𝐴 3.96
b) a) 𝑈 = 𝐴 = ≈ 39 users
𝑢 0.1

EELE 5414:WC~Ammar
Slide 14
 Example 2

◼ 2 An urban area has a population of two million residents. Three

competing trunked mobile network (systems A, B and C) provide
cellular service in this area.
◼ System A has 394 cells with 19 channels each,
◼ System B has 98 cells with 57 channels each; and
◼ system C has 49 cells each with 100 channels.

◼ Find the number of users that can be supported at 2% blocking

if each user averages two calls per hour at an average call
duration of 3 minutes.
◼ Assuming that all three trunked systems are operating at
maximum capacity, compute the percentage market penetration
of each cellular service provided (Data: GOS = 0.02 Number Of
Channels Total Traffic Intensity (Erlangs) 57 45 19 12 100
◼
EELE 5414:WC~Ammar
Slide 15
 Example 2

◼ Solution
◼ System A
GoS= 0.02
C = 19 channels/cell
𝐴𝑢 = 2 × (3/60) = 0.1 .

From Erlang table, total traffic A = 12 Erlangs.

The number of users that can be supported per cell is
𝐴 12
𝑈= = = 120
𝐴𝑢 0.1
The total number of subscribers that can be supported by System
A is equal to 120 × 394 = 47280.

EELE 5414:WC~Ammar
Slide 16
 Example 2

◼ System B
Given: Probability of blocking= 2% = 0.02.
For C = 57 ch/cell, from the chart the total earned traffic, , is A =
45 Erlangs.
Therefore, the number of users that can be supported per cell 𝑈
𝐴 45
= = = 450 user/cell
𝐴𝑢 0.1
Total no of supported subs = 450 × 98 = 44100 users

◼ System C
Given: C = 100 ch/cell.
--→ A = 88 Erlang
𝐴 88
𝑈= = = 880= / = 88/0.1 = 880
𝐴𝑢 0.1
The total number of subscribers for C = 880 × 49 = 43120
EELE 5414:WC~Ammar
Slide 17
 Example 2

Therefore, total number of subscribers that can be supported by

these three systems are 47280 + 44100 + 43120 = 134500 .

The market penetration of A is equal to: 47280/2000000 = 2.36%

The market penetration of System B is equal to= 2.205%

The market penetration of System C is equal to 2.156%

The market penetration of the three systems combined is equal to

6.725%.

EELE 5414:WC~Ammar
Slide 18
 Example 3

◼ Example 3 A certain city has an area of 1300 square miles and is

covered by a cellular system using a seven cell reuse pattern.

◼ Each cell has a radius of 4 miles and the city has 40 MHz
spectrum with a full duplex channel bandwidth of 60 kHz.
◼ Find:
(i) The number of cells in the service area.
R= 4 miles---→ Cell area = 41.57square miles 𝐴𝑟𝑒𝑎 = 2.5981 × 𝑅2

Cluster area = 7 x 41.57 = 291 square miles.

◼ So number of cells required to cover 1300 square miles is 31.

EELE 5414:WC~Ammar
Slide 19
 Example 3

(ii) The number of channels per cell.

◼ Number of channels per cell will be total number of channels /
number of cells in a cluster.

◼ So number of channels available is 40 MHz / 60 KHz = 666

◼ Now number of channels per cell will be 666/7 = 95

(iii) Total number of subscribers that can be served.

Therefore total number of subscribers that can be served = 31 x
95 = 2945 subscribers

EELE 5414:WC~Ammar
Slide 20
 Example 4

◼ Example 4 A total of 24 MHz of bandwidth is allocated to a

particular FDD cellular telephone system that uses two 30 kHz
simplex channels to provide full duplex voice and control
channels. Assume each cell phone user generates 0.1 Erlangs of
traffic. Assume Erlang B is used.

◼ (a) Find the number of channels in each cell for a four-cell reuse
system.
24000
◼ Number of channels in each cell = = 100 channel/cell
60∗4

EELE 5414:WC~Ammar
Slide 21
◼ B) If each cell is to offer capacity that is 90% of perfect
scheduling, find the maximum number of users that can be
supported per cell where omnidirectional antennas are used at
each base station.

Since there are 100 channels per cell & the system is 90 % perfect
scheduling
90
𝐴= ∗ 100 = 90 Erlang
100

A 90
No of users= = = 900
𝐴𝑢 0.1

c) What is the blocking probability of the system in (b) when the

maximum number of users are available in the user pool?
◼ Reading for 100 channels and 90 Erlangs of traffic, From Erlang
B chart, GOS = 0.2?
◼
EELE 5414:WC~Ammar
Slide 22
d) If each new cell now uses 120∘ sectoring instead of
omnidirectional for each base station, what is the new total number
of users that can be supported per cell for the same blocking
probability as in (c)?
Assuming that number of channels remains constant even after
sectoring,
Number of channels/sector =100/3=33.33
GOS=0.03

Reading from Erlang B channel Asec=26 Erlang ( C=33, GOS= 0.03 )

No. of users per sector, Usec=260.01=260

Total no of users/ cell = 260×3=780 users.

Please note: Number of users before sectoring was employed=900.

EELE 5414:WC~Ammar
Slide 23
This is because, we have assumed number of channels/cell to be
same even after sectoring. In practice , after sectoring, the
cluster size decreases. Hence number of channels per cell
increases which results in more number of users per cell.

e) If each cell covers five square kilometers, then how many

subscribers could be supported in an urban market that is 50 km
for the case of omnidirectional base station antennas?
Each cell area = 5 sq. km

Total area=50 sq. km

Therefore, total number of cells = 10 cells.

Total number of users in omnidirectional antenna scenario= 9000

users.

EELE 5414:WC~Ammar
Slide 24
f) If each cell covers five square kilometers, then how many
subscribers could be supported in an urban market that is 50 km
for the case of 120o sectored antennas?

Total number of users in sectored antenna scenario = 7800 users.

EELE 5414:WC~Ammar
Slide 25
Example 5 A hexagonal cell has a cell radius of 1.387 Km. It is a 4
cell reuse system. The total number of channels in the entire
system is 60. If the load per user is 0.029 Erlangs, and 𝜆 =1
call/hour , compute the following for an Erlang C system that has a
5 % probability of a delayed call :
a. How many users per square km will this system support?
Cluster size = 4, Cell radius (R) = 1.387 km, S= 60, Au= 0.029 Erlangs, 𝜆=1
call/hour, GOS= 0.05

Total no of channels per cell (c)=60/4=15 Channels.

From Erlang C with Traffic Intensity = 9 Erlangs
Total Traffic intensity 9
Total number of user= = =310users
Traffic per user 0.029

Number of Users 310

Number of users per Sq.Km= = = =62
Area covered per cell 2.598×1.3872
Users/Sq. km
.

EELE 5414:WC~Ammar
Slide 26
 b. What is the probability that a delayed call will have to wait for
more than 10 seconds?
𝜆=1 call / hour
𝐴𝑢 = 𝜆 × 𝐻
Therefore,
𝐻 = 𝐴𝑢 /𝜆 = 0.029 hours ×3600=104.4 seconds.

𝑃𝑟 𝑑𝑒𝑙𝑎𝑦 > 10𝑠/𝑑𝑒𝑙𝑎𝑦 = 𝑒 −(C−A)E/H = 𝑒 −(15−9)10/104.4

= 56.29%

c. What is the probability that a call will be delayed for more than
10 seconds?
𝑃𝑟 𝑑𝑒𝑙𝑎𝑦 > 10𝑠 = 𝑃𝑟 𝑑𝑒𝑙𝑎𝑦 > 10𝑠/𝑑𝑒𝑙𝑎𝑦 𝑃𝑟 𝑑𝑒𝑙𝑎𝑦 = 0.05 ∗ 0.5629 =
2.81%
.

EELE 5414:WC~Ammar
Slide 27
Example 6: Exercises in trunking (queueing) theory:

(a) What is the maximum system capacity (total and per channel) in
Erlangs when providing a 2 % blocking probability with four
channels, with 20 channels, with 40 channels?
Cluster size = 4.
As read from the Erlang B chart,
Atotal=1.1 Erlang
Aper channel=1.1/4=0.275 Erlang

For N=20 channels

Atotal =13.2 Erlang---→ Aper channel=13.2/20=0.66 Erlang

For N=40 channels

Atotal = 31 Erlan --→ Aper channel=31/40=0.775 Erlang

EELE 5414:WC~Ammar
Slide 28
(b) How many users can be supported with 40 channels at 2%
blocking? Assume H = 105 s, 𝜆= 1 call/hour.
𝐴𝑢 = 𝜆 × 𝐻=1×105/(60×60)=0.0292
U=A/Au=31/.0292=1068 user

(c) Using the traffic intensity calculated in part (a), find the grade
of service in a lost call delayed system for the case of delays being
greater than 20 seconds. Assume that H = 105 s, and determine
the GOS for four channels, for 20 channels, for 40 channels.

Pr 𝑑𝑒𝑙𝑎𝑦 > 20 = Pr 𝑑𝑒𝑙𝑎𝑦 > 0 𝑒𝑥𝑝 − 𝐶 − 𝐴 𝑡/𝐻 =0.017

For C = 20 channel, Atotal=13.2 Erlang
Pr(delay > 0) = 0.057 (from graph)
Pr 𝑑𝑒𝑙𝑎𝑦 > 20 = Pr 𝑑𝑒𝑙𝑎𝑦 > 0 𝑒𝑥𝑝 − 𝐶 − 𝐴 𝑡/𝐻 =0.0156

EELE 5414:WC~Ammar
Slide 29
For C = 40 channel, Atotal=31 Erlang
Pr(delay > 0) = 0.083
Pr 𝑑𝑒𝑙𝑎𝑦 > 20 = Pr 𝑑𝑒𝑙𝑎𝑦 > 0 𝑒𝑥𝑝 − 𝐶 − 𝐴 𝑡/𝐻 =0.0149

(d) Comparing part (a) and part (c), does a lost call delayed system
with a 20 second queue perform better than a system that clears
blocked calls?
??

EELE 5414:WC~Ammar
Slide 30