Scribd
Upload
29 views11 pages

Trunking

Uploaded by

bandi.prathyu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
29 views11 pages

Trunking

Uploaded by

bandi.prathyu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

TRUNKING

CONTENTS
•Problem statement
•Purpose of trunking theory
•Introduction
•Common terms in trunking theory
•Types of trunked systems
•Traffic intensity
•Example problem
Problem statement
Limited number of channels
Many users
For example a telephone system has 4 users and 3 channels.

user user user user

Central
office
Purpose of trunking theory
To determine the required capacity and allocate the proper
number of channels in order to meet GOS.
GOS: grade of service is the measure of user’s ability to
access a trunked system during busiest hour.
Introduction
Trunking theory was represented by Erlang in the late 19th
century.
It helps in establishing a trunked system which provides
communication services to a large group of users with limited
number of available channels in the system.
All PSTN/cellular radio systems exploits trunking theory to
cover a large user community with limited number of
circuits/frequency spectrum.
In a trunked radio system, each user is allocated a channel on
a per call basis, and upon the termination of the call, the
previously occupied channel is immediately returned to the
pool of channels.
In telephone system, it is used to determine the number of
telephone circuits that need to be allocated for office buildings
with hundreds of telephones.
Common terms in trunking theory
Set-up time: Time required to allocate a channel to the
requesting user.
Blocked call: call which can not be completed at the time of
request, also called as lost call.
Holding time: average duration of a typical call, denoted by
“H”.
Load: traffic intensity across the entire trunked system.
Request rate: the average number of requesting call requests
per unit time. It is denoted by “λ”
Types of trunked system
There are two types of trunked systems commonly used.
1. Blocked calls cleared: It offers no queuing for call request.
That is, for every requesting user, it is assumed to have no
any set-up time and user is given immediate access to
channel if available. If no channel is available, the requesting
user is blocked and is free to try again later.
2. Blocked calls delayed: it offers a queue to hold the calls which
are blocked. If channel is not available for the requesting user,
the call request may be delayed until a channel becomes
available.
Traffic intensity
Traffic intensity is measured in erlangs, 1 erlang is the amount
of traffic intensity carried by a channel that is completely
occupied i.e. one call-minute per minute. It is denoted by “A”
Each user generates a traffic intensity of Au erlangs.
 Au= λH
Where λ is the average number of call requests per unit time,
H is the average duration of call
Example
There are 3000 calls per hour, each lasting an average of 1.76 min.
what is the traffic intensity?
Solution: Data
average duration of a call (H) = 1.76 min
call request per unit time (λ) = 3000/hour = 3000/60= 50
Since, traffic intensity (A) = H×λ
Therefore, A = 1.76×50= 88 Erlangs.
THANK YOU!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy