GSM Network Performance Management and Optimisation
GSM Network Performance Management and Optimisation
GSM Network Performance Management and Optimisation
1.8 Handovers
Uplink Downlink
Guard Band
1 frame period
100 kHz wide Channel Numbers (n) (ARFCN)
4.615 ms
200 kHz spacing
0 1 2 3 4 5 6 7
Raw data rate =
33.75kbps per traffic channel
timeslot = 0.577 ms 270kbps per carrier channel
DCS - 1800 Spectrum
1710 1785 1805 1880 MHz
Uplink Downlink
Fu(n)
Range of ARFCN:
512 - 885
1 2 3 4 n
Guard Band
100 kHz wide
Guard Band
100 kHz wide
Channel Numbers (n) (ARFCN)
200 kHz spacing
GSM Logical Channels
• Two types of logical channel are defined; traffic and control channels
• Each is further sub-divided as shown:
Traffic Control
CBCH
NCH
Traffic Channel Multiframe
• The TCH multiframe consists of 26 timeslots.
• This multiframe maps the following logical channels:
• TCH
• SACCH
• FACCH
T T T T T T T T T T T T S T T T T T T T T T T T T I
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Downlink: Uplink:
•FCCH •RACH
•SCH
•BCCH
•CCCH (combination of PCH and AGCH)
Downlink F = FCCH S = SCH I = Idle
F S BCCH CCCH F S CCCH CCCH F S CCCH CCCH F S CCCH CCCH F S CCCH CCCH I
0 1 2-5 6-9 10 11 12-15 16-19 20 21 22-25 26-29 30 31 32-35 36-39 40 41 42-45 46-49 50
RACH
Uplink
SDCCH SDCCH SDCCH SDCCH SDCCH SDCCH SDCCH SDCCH SACCH SACCH SACCH SACCH
0 1 2 3 4 5 6 7 0 1 2 3 I I I
1 2 3 1 2 3
MS1 - Timeslot 1 time
1 2 3 1 2 3
• Timing Advance signal causes mobiles further from base station to transmit
earlier - this compensates for extra propagation delay
1 2 3 1 2 3
MS1 - Timeslot 1 time
1 2 3 1 2 3
Timing Advance
Timing Advance
• Timing Advance is calculated from delay of data bits in the access burst
received by the base station - long guard period allows space for this delay
delay
0 1 2 3 4 5 6 7
Downlink
Delay
3 timeslots Uplink
0 1 2 3 4 5 6 7
Timing
Advance
Uplink
0 1 2 3 4 5 6 7
Actual delay
8 7 6 5 4 3 2 1
BA Range IEI Octet 1
Length of BA Range Contents Octet 2
Number of Ranges Octet 3
RANGE1_LOWER Octet 4
RANGE1_LOWER RANGE1_HIGHER Octet 5
RANGE1_HIGHER RANGE2_LOWER Octet 6
RANGE2_LOWER RANGE2_HIGHER Octet 7
RANGE2_HIGHER Octet 8
RANGE3_LOWER Octet 9
RANGE3_LOWER RANGE3_HIGHER Octet 10
RANGE3_HIGHER RANGE4_LOWER Octet 11
RANGE4_LOWER RANGE4_HIGHER Octet 12
RANGE4_HIGHER Octet 13
Octet n
BA ARFCN List
8 7 6 5 4 3 2 1
Cell Channel Description IEI
0 0 0 0 CA CA CA CA
Format ID spare spare ARFCN ARFCN ARFCN ARFCN
124 123 122 121
CA CA CA CA CA CA CA CA
ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN
120 119 118 117 116 115 114 113
CA CA CA CA CA CA CA CA
ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN ARFCN
008 007 006 005 004 003 002 001
85Bm RxLev
96dBm
RxLev / BSIC
BCCH Carrier Measurement – Idle Mode
• Neighbouring Cells:
• MS scans all carriers listed in the BA list and identifies the 6
strongest
• Signal level averaged over at least 5 measurements
• Result stored in RXLEV (n) parameter
• MS must attempt to decode the BCCH channel of 6 best
neighbours at least every 30 seconds
• Serving Cell
• Measurements taken during allocated paging block
• Measurements averaged over 5 consecutive paging blocks or
5 seconds (whichever greater)
BCCH Carrier Measurements – Dedicated Mode
RxLev Measurement
RxQual Reports
RxLev / BSIC
BCCH Carrier Measurement – Dedicated Mode
For GSM Phase 1 mobiles, cell reselection is achieved by comparing current cell C1
with neighbouring C1 cell measurements:
• Offset:
• optional parameter to encourage or discourage cell selection
• H(Penalty_Time-T):
• when a cell is added to list of strongest cells, a negative ‘Temporary Offset’
offset is applied for a ‘Penalty time’:
• If timer expires, offset is removed making cell more attractive
• If cell is removed from list, timer is reset
• Used to prevent fast-moving MSs from selecting the cell
• Temporary Offset:
• Value of the negative offset applied
Section 1 – GSM Principles
Handover Processes
There are four different processes for handing over
within a GSM system, each requiring differing
procedures:
• Channels (time slots) in the same cell BSC
Internal
• Cells within the same BSS (same BSC)
BSC
•
MSC
Cells under the control of different MSCs
Handover Types
• Handovers can be initiated by either MS or MSC
• Handover decisions are based on the following parameters
(in priority order):
• UL/DL Signal Quality
• UL/DL Signal Level
• Interference
• Power Budget
• Distance of MS from BTS
• Can be up- or down-link specific
• Each parameter has operator-defined threshold parameters
• Handover decisions can be based on one or a combination
of these parameters
Section 1 – GSM Principles
Handover Initiation
MS BSS
Message Type
Handover Reference
Power Command
or
Mobile Allocation Frequency Hopping
Section 1 – GSM Principles
Handover Margin
Measurement report
Handover Required
Measurement report
Handover Request
Measurement report
Acknowledgement
Handover Command
Handover Command
Handover Access
Handover Detection
Physical Information
Handover Complete
Handover Complete
Clear Command
Measurement report
Clear Complete
Measurement report
Section 1 – GSM Principles
TS0 TS1 TS2 TS3 TS4 TS5 TS6 TS7 TS0 TS1 TS2 TS3 TS4 TS5 TS6 TS7 TS0 TS1 TS2 TS3 TS4 TS5 TS6 TS7
F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1 F1
F1 F1 F1 F1 F1 F1 F1 F1 F2 F2 F2 F2 F2 F2 F2 F2 F3 F3 F3 F3 F3 F3 F3 F3
Sequential: F1 F2 F3 F4 F1 F2 F3 F4 F1 F2 F3 F4
Hop Sequence
TDMA Frame
Pseudo-Random: F1 F4 F3 F2 F1 F4 F3 F2 F1 F4 F3 F2
Hop Sequence
Section 1 – GSM Principles
F1 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7
F2 0 1 2 3 4 5 6 7
F3 0 1 2 3 4 5 6 7
Time
Section 1 – GSM Principles
• Only TRXs used for traffic channels will hop through set
sequences
TRX 1 F1 F1 F1 F1
TRX 2 F2 F3 F4 F2
TRX 3 F3 F4 F2 F3
TRX 4 F4 F2 F3 F4
• Above example uses same HSN for each TRX but different MAIOs
Section 1 – GSM Principles
Fixed TRX
Antenna
Baseband
Fixed TRX Combiner
Data Signal
Fixed TRX
Switch controller
Baseband Synthesiser
TRX
Antenna
Data Signal
Tuning controller
Section 1 – GSM Principles
Layer 3 Messaging
BTS
GSM Core
BSC MSC PSTN
Network
BTS
CM CM
MM MM
Layer 3
DTAP DTAP
RR
BSSMAP BSSMAP
RR
RR BTSM BTSM SCCP SCCP
Network Characteristics
and
Problem Types
Section 2 – Network Characteristics & Problems
Section 2
2.1 Introduction
• Coverage
• Capacity
• Quality of Service (QoS)
• Cost-effectiveness (ROI)
Section 2 – Network Characteristics & Problems
• Cell Balancing
• Antenna Configuration
• Equipment Performance
Section 2 – Network Characteristics & Problems
Cell Balancing
• Power budget calculations show the maximum distance of the mobile from
the base station at which uplink and downlink can be maintained
• In a balanced system, the boundary for uplink and downlink must be the
same
• Antenna Alignment
• Tilting Configuration
Antenna Alignment
Capacity can be increased by cell splitting where antenna re-
alignment is necessary
New cell
Antenna Tilt
-5 -5
0
Electrical Downtilt + 0
Electrical -5 -5
-20 -20
-25 -25
-30 -30
-35
-35
Section 2 – Network Characteristics & Problems
Diversity Reception
• Diversity reception is a way to improve the quality and
strength of the signal arriving at the base station, by
receiving it in several independent ways
Space Diversity
• Two receiving antennas are used at the base
station
• If they are far apart, the received signals will
be independent of each other
• If one has suffered fading, the other may
not
• A suitable distance is generally about 10
wavelengths
• GSM 900, 10l = 3 metres
Rx Tx/Rx
Tx Rx
Rx Rx
Tx Rx
Rx Tx/Rx
Tx Rx
Rx Tx/Rx
Rx
Section 2 – Network Characteristics & Problems
Polarisation Diversity
• As the radio signal undergoes multiple
reflections and scattering, the plane of
polarisation is rotated randomly
Dipoles
• This gives good coverage of vertical crossed at 45o
polarisation and strong components of
rotated signals
Section 2 – Network Characteristics & Problems
Equipment Performance
• Roaming
• Handover failure
Introduction to
Performance Management
Section 3
3.1 Introduction
Performance Management
Initial Network
Design and
Optimisation Implementation
Monitor Network
Implement
Changes
Analyse Data
Identify
Problems
Yes QoS No
Target
s Met?
Section 3 – Introduction to Performance Management
Performance Metrics
• Technical functionality:
• Failed establishment, dropped calls, failed handovers etc
• Traffic volume:
• Number of Subscribers, offered traffic, erlangs per cell or
per subscriber, switch processor load etc
• System availability:
• Channel % availability, switch outage times, channel
outage times etc
• System efficiency:
• % utilisation of resources, are GoS targets being met? %
blocking of cells and core network channels etc
Section 3 – Introduction to Performance Management
•Drive Testing
Analysis of Data
Data can be analysed under several headings:
• Call success
• evaluating the outcome of call attempt in terms of set-up time, clear
down success, assignment success etc
• Statistical distributions
• RxLev, RxQual
• Handover analysis
• showing success rate of attempted handovers
• Neighbours
• comparing neighbour cells found by signal level measurements with
the neighbour list in the site database
• Coverage Analysis
• Analysing the coverage threshold levels using serving cell/neighbour
cell comparison to identify problem areas
• Quality
• gives a comparison of signal quality from serving and neighbouring
cells
Section 3 – Introduction to Performance Management
• Examples of analysis
screens in NEPTUNE
Performance Measurement
Metrics
Section 4 – Performance Metrics
Section 4
4.1 Introduction
• TCH Usage
• SDCCH Usage
• Handover Statistics
• Connection Establishment
Speech Quality Measurements
Utilisation Factor
Erlangs _ Carried
Utilizatio n
Theoretical _ Erlangs _ 2%GOS
Section 5
Section 5
5.1 Introduction
• Benefits:
• Replicates subscriber conditions (QoS perspective)
• Able to provide comparative performance between different operators
• Focus on specific parameter set or geographical region
• Limitations:
• Difficult to replicate subscriber usage patterns
• Area access restriction may limit realistic testing
• Difficult to achieve network-wide snapshot
(limited time and/or geographical area)
• Primarily down-link analysis only
• Resource intensive and expensive
Ascom QVoice
Test Mobile Box
Section 5 – Drive Testing
• BCCH
• BSIC
• TCH
are identified
Section 5 – Drive Testing
• BCCH n
• RxLev n
• BSIC n
Section 5 – Drive Testing
Neighbour Lists
• Many handover problems, dropped calls and so on are due to incorrect
neighbour lists.
• Each time a change is made to a network, the neighbour relationships
should be rigorously updated.
• Failure to maintain neighbour lists leads to problems such as:
• Unwanted legacy neighbours
• Neighbour lists reaching the maximum allowable (typically 32)
• Neighbours defined on co-channel frequencies
• Missing neighbours
• Unintended one-way neighbour definitions
• Depending on the vendor, the OMC may support automated neighbour
detection via A-bis interface traces.
Section 5 – Drive Testing
Neighbour Data
• RxLev data can be displayed
for the six best neighbour cells
and compared with the serving
cell’s RxLev
Layer 3 Messages
• Neptune displays all layer 3
messages recorded by the test
mobile using the following fields:
• Time of message
• Direction
• UL = Uplink
• DL = Downlink
• Message Category
• RR = Radio Resource
• MM = Mobility Management
• CC = Call Control
• Message Type
• More detailed description
Section 5 – Drive Testing
Graphical Display
• Data can be displayed
in a variety of graphical
forms
• The display here
shows:
• RxLev for the serving cell
• RXLev for six best
neighbours
• RxQual for the serving
cell
• Frame Erasure Rate
(FER) of the current
measurement
Section 5 – Drive Testing
Section 6
6.1 Introduction
OMC Functions
• Performance Management
Statistical Data
• Traffic Throughput:
Traffic for one subscriber = no of calls per hour per subscriber * MHT
3600
Section 6 – The OMC
Periodic Counters
• Daily:
• Cell Level
• Rapid Fault Identification
• Includes Call setup rate, TCH/SDCCH congestion, TCH drop call
rate
• Weekly:
• Cell Level
• Performance Trends
• Includes traffic trends, cell retention, cell accessibility
• Monthly:
• BSC Level
• Performance Trends
• Includes processor loading, BSS call setup, handover success rates
Section 7
Introduction to Optimisation
Section 7 – Optimisation Overview
Section 7
7.1 Introduction
No prescribed methodology
Often network architecture dependant
Often vendor equipment-dependant
Often engineer-experience dependant
An overview course
Insight into one approach to processes
Optimisation is an art as much as a science
A ‘tool-box’ approach
Section 7 – Optimisation Overview
Performance Management
Initial Network
Design and
Optimisation Implementation
Monitor Network
Implement
Changes
Analyse Data
Identify
Problems
Yes QoS No
Target
s Met?
Section 7 – Optimisation Overview
Monitoring/
Network Audit Phase
Optimisation Activity
Phase
Measure Performance,
Establish Benchmark
Performance Review to
Identify Major Performance
Affecting Issues
Decide on Strategy,
Establish Action Plan Feedback from
Optimisation
Activities
• TCH Blocking
• SDCCH RF Loss
• Dropped Calls
• Handovers
Section 7 – Optimisation Overview
• A Interface Analysis:
• Call Setup Failures
• Handover Causes
Section 7 – Optimisation Overview
BSS Database
Parameters Review:
Ongoing Identify and Fix Hardware Problems Settings
Performance Consistency
Measurement Change Control
Process
Identify and Fix Neighbour Problems
Feedback to modify
strategy decisions
Review Process and Results
Optimisation Activities
Section 8 – Optimisation Activities
Section 8
8.1 Introduction
• Effected from:
• PC connected directly to hardware
• Remotely from OMC/NMC
• OMC Statistics
• Driver \Test data
• A-bis and A interface logs
• Optimise by:
• Analyse neighbour performance form statistics.
• Utilise automated neighbour detection
• Identify inconsistent neighbour profiles
• Modify appropriate neighbour lists
Section 8 – Optimisation Activities
• The TCH plan requires the same considerations as BCCH, but may also
employ:
• Frequency hopping - synthesiser or baseband
• Multiple Re-use Patterns - giving tighter re-use on lower TCH layers
• Concentric multi-layer cell arrangements in which BCCH is only required on
one band
Section 8 – Optimisation Activities
1 ch 1 ch
14 ch 26 ch 8 ch
Section 8 – Optimisation Activities
Antenna Down-Tilting
-5 -5
0
Electrical Downtilt + 0
Electrical -5 -5
-20 -20
-25 -25
-30 -30
-35
-35
Section 8 – Optimisation Activities
Antenna Selection
• Combining:
• Economical with antenna elements
• Reduced coverage due to insertion loss
• Diversity Choice:
• Horizontal space diversity
• Vertical space diversity
• Polarisation diversity
Section 9
NSS Characteristics
Section 9 – NSS Characteristics
Section 9
9.1 Introduction
VLR
BSC
AuC
MSC
BSC
HLR
EIR
BSC
MSC
BSC GMSC
VLR
Section 9 – NSS Characteristics
HLR 1 GPRS
600k
MSC MSC
MSC MSC MSC
MSC MSC MSC Layer
MSC MSC MSC MSC
MSC MSC MSC MSC
MSC MSC MSC MSC
MSC MSC MSC
MSC
MSC
Section 9 – NSS Characteristics
A Interface Configuration
2Mbps – E1 Link
0 Frame Alignment
1 TS1 TS2 TS3 TS4 fm Trunk 1
2 TS1 TS2 TS3 TS4 fm Trunk 2
3 TS1 TS2 TS3 TS4 fm Trunk 3
4 Trunk 1 TS0 Data fm Trunk 1
TRUNK 1 5 TS5 TS6 TS7 TS8 fm Trunk 1 TRUNK 1
6 TS5 TS6 TS7 TS8 fm Trunk 2
7 TS5 TS6 TS7 TS8 fm Trunk 3
8 Trunk 2 TS0 Data fm Trunk 2
: : : : :
: : : : :
TRUNK 2 TRUNK 2
13 TS13 TS14 TS15 n/u fm Trunk 1
TRAU Configurations
Um Abis A
BTS Site BSC Site MSC Site
CCU
TRAU A
CCU
PLMN Interfaces
VLR
B
BSC
A AuC
MSC D
H
A C
F G
BSC
E HLR
EIR E C
F
D
BSC A
MSC
E
A B
BSC GMSC
VLR
Section 9 – NSS Characteristics
VLR
B
BSC
A AuC
MSC D
H
A C
F G
BSC
E HLR
C7 Network EIR E C
F
D
BSC A
MSC
E
A B
BSC GMSC
VLR
Section 9 – NSS Characteristics
SP
SP
STP SP
STP
SP
SP SP
SP
SP STP
SP
STP
Section 9 – NSS Characteristics
SP VLR
BSC SP
AuC
STP SP
MSC
BSC SP
SP HLR
BSC SP
STP SP
EIR
MSC
SP
BSC SP
VLR
Section 9 – NSS Characteristics
A Interface Signalling
BSSMAP
MTP 1-3
Section 9 – NSS Characteristics
D
F
E
C B
MAP
Layer 3 SCCP
C7 Protocol Stack
Section 9 – NSS Characteristics
Section 10
?.1 Introduction
Define Optimisation
Requirements
Define Implementation
Strategy
Optimisation Activity
Phase
NSS Data Capture Phase
• Available Data:
• C7 signal routing
• C7 link loading
• User traffic routing
• Trunk group configuration and loading
• NSS configuration parameters
• Database loading
NSS Data Analysis Phase
• STEP 1 –
• Organise collected data into functional areas
• STEP 2 –
• Validate organised data
• STEP 3 –
• Evaluate validated data
NSS Optimisation Phase
• STEP 1 –
• Review areas of concern identified as part of
the Validation Phase
• STEP 2 –
• Identify optimisation techniques suitable for
improving poorly performing areas
NSS Implementation Phase
• Check for:
• Main and alternate routing
• Periodicity of Monitoring:
• Carried out at least monthly (preferably weekly)
• Carried out on significant network configuration change
• Recommended Capacity:
• ITU Q.706 specifies maximum of 200mE per link in each direction
• May be exceeded temporarily but is not recommended
• Calculation:
• Ideal Situation:
3 303 84
4 302 76
• Links should not exceed 200mE HLR1
5 312 91
• Signalling traffic should be spread 6 104 94
evenly across all links in link set
7 104 109
8 103 89
9 104 102
Signal Load Evaluation – Link Load Symmetry
• Ideal Situation:
• Individual links should not exceed
200mE
TSC1 C7 Load C7 Load
• Tx/Rx loads should be as symmetrical
as possible Destination Link No Rx [mErl] Tx [mErl]
• Benefits:
MSC3 0 15 483
1 19 437
• Simplified routing
• Reduces risk of lost MSUs
• Reduced risk of signalling loops
• More efficient bearer usage
The table above serves as an example of unbalanced signal loading between a
TSC and an MSC in a live network. The Rx side of the two signalling links shown
is relatively unused whereas the Tx side is overloaded (exceeding the 200mE
threshold). Inefficient usage of C7 links is wasteful of C7 hardware resources.
•simplified routing
•reduces the risk of lost MSU
•reduces the risk of signalling loops being created.
•More efficient bearer utilisation due to equal load Tx/Rx volume
spreading
MSU per sec
H
LR
1
H (
LR Ra
2 ha
0
500
1000
1500
2000
2500
3000
3500
4000
4500
5000
(R ha
ah n )
M aHLR h 1
S an
CE )
HLR
M 2
M AM
SMSC1
C
M KJ
SMSC2
CR
Al M A
gh SMSC3
ad CS
ir B
H M MSC4
LR SC
3 MSC5
(
M BH)
S
CHLR3
M BE
S H
CMSC6
FA
M
Exchange
H R
LR S CMSC7
5 LC
(E T
mMSC8
LC a m
EM TTHLR4)
S
Total MSU per sec
AM C1
TTSC1
M SC
S 1
FA CTSC2 K
TE AN
HMSC9
M
S
C
MSC10
Recommended Nodal MSU Capacity <= 1500 MSUs/second
Tx
Rx
Signal Load Evaluation – Nodal MSU Capacity
• GOS = 1%
NSS Traffic – Trunk Utilisation Example
Addit.
GoS = 1% Max Erlangs/trunk = 0.7 Only trunk utilisation > 75% shown
Network Parameter Analysis
PARAMETER REC
PARAMETER REC
Location Update New Visitor Y
IMSI Attach Y
AUTHENTICATION Location Update N
COUNT Periodic Location Update N
Mobile Originating Call N
Mobile Originating SMS N
Mobile Terminating Call N
Mobile Terminating SMS N
Mobile Terminating USSD N
Mobile SS Operation N
Parameter Analysis – IMEI Check Parameters
PARAMETER REC
Location Update New Visitor Y
IMSI Attach Y
Location Update Y(10)
Periodic Location Update N
Mobile Originating Call N
IMEI CHECKING ON…. Mobile Terminating Call N
Mobile Originating SMS N
Mobile Terminating SMS N
Mobile Terminating USSD N
Mobile SS Operation N
Black List Effect BLOCK
Grey List Effect TRACE
Unknown IMEI Effect BLOCK
NSS - Implicit Deregistration
VLR
• VLR utilisation refers to subscriber record Sr. No. MSC Utilisation
capacity and usage within a VLR
1 MSC-1 65%
• Utilisation problems include: 2 MSC-2 82%
• Over-capacity in certain VLRs 3 MSC-3 26%
• Uneven spread of records across the 4 MSC-4 100%
network
5 MSC-5 86%
• Over-capacity can result in: 6 MSC-6 66%
• Call function failures (e.g. setup/handover, 7 MSC-7 71%
authentication etc)
8 MSC-8 100%
• Lack of growth capability
9 MSC-9 62%
10 MSC-10 7%
NSS - VLR Cleaning
• Reduces capacity loading within a VLR (Nokia proprietary)
• Deletes subscriber records that are inactive for a specified
period of time
• Compares timestamp value in subscriber profile with
inactivity timer.
• Timer is reset when sub scriber record is accessed
• If timer value > timestamp, subscriber record is marked for
deletion
• ‘Cleaning’ takes place during non-busy periods
• Common settings are typically 24hrs to 3 days
NSS Databases – HLR Utilisation
• HLR utilisation refers to
subscriber record capacity and
usage within a HLR
%AGE USAGE OF HLRs
• Utilisation problems include:
100
• Over-capacity in certain HLRs 90
• Uneven spread of records across 80
70
the network
60
Optimising Networks
for
New Services
Section 11 – New Service Optimisation
Section 11
11.1 Introduction
Equivalent Erlangs
2 Erlangs 1 Erlang of
of Low High
Bandwidth Bandwidth High
Bandwidth
Equivalent
Section 11 – New Service Optimisation
Post Erlang-B
• Consider 2 services sharing the same resource:
• Service 1: uses 1 trunk per connection. 12 Erlangs of traffic.
• Service 2: uses 3 trunks per connection. 6 Erlangs of traffic.
Post Erlang-B
• Consider 2 services requiring equal resource:
• Service 1: uses 1 trunk per connection. 12 Erlangs of traffic.
• Service 2: uses 1 trunk per connection. 6 Erlangs of traffic.
• We could calculate the requirement separately
• Service 1: 12 Erlangs require 19 trunks for a 2% Blocking Probability
• Service 2: 6 Erlangs require 12 trunks.
• Adding these together gives 31 trunks.
• The accepted method of treating the above would be to regard
it as a total of 18 Erlangs that would require 26 trunks.
• Post Erlang-B overestimates the requirement.
Section 11– New Service Optimisation
Campbell’s Theorem
• Campbell’s theorem creates a composite distribution where:
Capacity
Ci ai OfferedTraffic
Ci = available capacity
= mean
c c u = variance
i = arrival rate
i i bi
a 2
ai = amplitude of service
c i
Service Offered Traffic γi bi
a b
bi = mean holding time
i i i c = capacity factor
i
• The amplitude (ai) used in the capacity is the amplitude of the target service
• Once the equivalent offered traffic and capacity are derived, GoS can be
derived with Erlang-B
• Required capacity can be calculated if offered traffic and GoS target is
known
Section 11 – New Service Optimisation
α 30
Equivalent Offered Traffic 13.63
c 2.2
• Equivalent Erlangs
• Optimistic if you use the smallest amplitude of trunk (39)
• Pessimistic if you use the largest amplitude of trunk (51)
• Post Erlang-B
• Pessimistic (55)
• Trunking efficiency improvement with magnitude ignored
• Campbell’s theorem
• Middle band (47 - 49)
• Different capacities required for different services - realistic
• Preferred solution for dimensioning, but not ideal...
Section 11 – New Service Optimisation
• Ci ai
Considering the equation: Capacity
c
Ci
15 1
10.5
1.335
282
= 55.5
5.08
• Cell requirement is established at 56 cells.
• Each of the cells will service:
• 4.46 Erlangs of voice
• 1.13 Erlangs of HSCSD.
Section 11 – New Service Optimisation
Data may be packet switched, in which case it can be made to “fill the
gaps” in the demand for voice services.
Load
Peak traffic
Spare capacity for which can
be allocated to non real time
applications Average circuit
switched traffic
Time
Section 11 – New Service Optimisation
• First assume that the packet data can be scheduled to fill the spare real time
capacity.
• When all the spare real time capacity has been exhausted we must convert the
remaining capacity to an equivalent data capacity.
• Solution:
Timeslots available on average = 7 - 2 = 5
This represents a total data rate of 5 x 13 = 65 kb/s
• Cell Reselection
• Service Exceptions
• Average Response Times
• Suspend/Resume Procedures
• Attach/Detach Procedures
• Routing Area (RA) Update Procedures
• PDP Context Activations
• Data Volumes and Rates
GPRS Service Exceptions
GGS
BSS SGSN
N
MS
IMSI/NSAPI
PDP Context
DLCI
Data Link Connection
TID
Virtual Tunnel
CONNECTION
CONNECTION TYPE
IDENTIFIER
Section 11 – New Service Optimisation
| 0000100002 | 0000100003 | CI
Number of Frames
Deleted
Time in millsecs
BVCI
• Suspend Procedure:
• Enables a GPRS Class B MS to suspend GPRS mode in
order to make a circuit-switched connection
• Resume Procedure:
• Enables a GPRS Class B MS to resume GPRS mode having
made a circuit switched connection
• Monitoring:
• Procedure can be monitored and failures can be displayed
by TLLI, cell or cause
Section 11 – New Service Optimisation
RA Updates
Number
Number of
RA Rejects per Cause
RA Rejects
DL LLC Rate
Bytes
Time (minutes)
Time (minutes)
• Periodicity of Monitoring:
• Carried out at least monthly (preferably weekly)
• Carried out on significant network configuration change
• Evaluation:
• ITU Q.706 specifies maximum of 200mE per link in each direction
• May be exceeded temporarily
• Calculation:
• Ideal Situation:
3 303 84
4 302 76
• Links should not exceed 200mE
5 312 91
• Signalling traffic should be spread 6 104 94
evenly across all links in set
7 104 109
8 103 89
9 104 102
Section 9 – NSS Characteristics and Evaluation
• Ideal Situation:
• Individual links should not exceed
200mE
TSC1 C7 Load C7 Load
• Tx/Rx loads should be as symmetrical
as possible Destination Link No Rx [mErl] Tx [mErl]
• Benefits:
MSC3 0 15 483
1 19 437
• Simplified Routing
• Reduces risk of lost MSUs
• Reduced risk of signalling loops
• More efficient bearer usage
MSU per sec
H
LR
1
H (
LR Ra
2 ha
0
500
1000
1500
2000
2500
3000
3500
4000
4500
5000
(R ha
ah n )
M aHLR h 1
S an
CE )
HLR
M 2
M AM
SMSC1
C
M KJ
SMSC2
CR
Al M A
gh SMSC3
ad CS
ir B
H M MSC4
LR SC
3 MSC5
(
M BH)
S
CHLR3
M BE
S H
CMSC6
FA
M
Exchange
H R
LR S CMSC7
5 LC
(E T
mMSC8
LC a m
EM TTHLR4)
S
Total MSU per sec
AM C1
TTSC1
M SC
S 1
FA CTSC2 K
TE AN
HMSC9
M
S
C
MSC10
Tx
Rx
Signal Load Evaluation – Nodal MSU Capacity
• TMSI-Related Parameters:
• IMSI Attach (Y)
• Location Update (Y)
• Location Update - New Visitor (Y)
• Location Update – Periodic (N)
• MO Call Update (N)
• MO SMS Update (N)
• MT Call Update (N)
• MT SMS Update (N)
• MT USSD Update (N)
• Mobile SS Operation Update (N)
Section 9 – NSS Characteristics and Evaluation
• Authentication-Related Parameters:
• IMSI Attach (Y)
• Location Update (N)
• Location Update - New Visitor (Y)
• Location Update – Periodic (N)
• MO Call Update (N)
• MO SMS Update (N)
• MT Call Update (N)
• MT SMS Update (N)
• MT USSD Update (N)
• Mobile SS Operation Update (N)
Section 9 – NSS Characteristics and Evaluation
• IMEI-Related Parameters:
• IMSI Attach (Y)
• Location Update (Y – every 10th update)
• Location Update - New Visitor (Y)
• Location Update – Periodic (N)
• MO Call Update (N)
• MO SMS Update (N)
• MT Call Update (N)
• MT SMS Update (N)
• MT USSD Update (N)
• Mobile SS Operation Update (N)
• Black (block) – Grey (trace)
Section 9 – NSS Characteristics and Evaluation
Network Subsystem
Optimisation
Section 9 – Network Subsystem Optimisation
Section 9
9.1 Introduction
9.2
9.3
Section 10
Optimising Networks
for
New Services
Section 10 – New Service Optimisation
Section 10
10.1 Introduction
Equivalent Erlangs
2 Erlangs 1 Erlang of
of Low High
Bandwidth Bandwidth High
Bandwidth
Equivalent
Section 10 – New Service Optimisation
Post Erlang-B
• Consider 2 services sharing the same resource:
• Service 1: uses 1 trunk per connection. 12 Erlangs of traffic.
• Service 2: uses 3 trunks per connection. 6 Erlangs of traffic.
Post Erlang-B
• Consider 2 services requiring equal resource:
• Service 1: uses 1 trunk per connection. 12 Erlangs of traffic.
• Service 2: uses 1 trunk per connection. 6 Erlangs of traffic.
• We could calculate the requirement separately
• Service 1: 12 Erlangs require 19 trunks for a 2% Blocking Probability
• Service 2: 6 Erlangs require 12 trunks.
• Adding these together gives 31 trunks.
• The accepted method of treating the above would be to regard
it as a total of 18 Erlangs that would require 26 trunks.
• Post Erlang-B overestimates the requirement.
Section 10 – New Service Optimisation
Campbell’s Theorem
• Campbell’s theorem creates a composite distribution where:
Capacity
Ci ai OfferedTraffic
Ci = available capacity
= mean
c c u = variance
i = arrival rate
i i bi
a 2
ai = amplitude of service
c i
Service Offered Traffic γi bi
a b
bi = mean holding time
i i i c = capacity factor
i
• The amplitude (ai) used in the capacity is the amplitude of the target service
• Once the equivalent offered traffic and capacity are derived, GoS can be
derived with Erlang-B
• Required capacity can be calculated if offered traffic and GoS target is
known
Section 10 – New Service Optimisation
α 30
Equivalent Offered Traffic 13.63
c 2.2
• Equivalent Erlangs
• Optimistic if you use the smallest amplitude of trunk (39)
• Pessimistic if you use the largest amplitude of trunk (51)
• Post Erlang-B
• Pessimistic (55)
• Trunking efficiency improvement with magnitude ignored
• Campbell’s theorem
• Middle band (47 - 49)
• Different capacities required for different services - realistic
• Preferred solution for dimensioning, but not ideal...
Section 10 – New Service Optimisation
• Ci ai
Considering the equation: Capacity
c
Ci
15 1
10.5
1.335
282
= 55.5
5.08
• Cell requirement is established at 56 cells.
• Each of the cells will service:
• 4.46 Erlangs of voice
• 1.13 Erlangs of HSCSD.
Section 10 – New Service Optimisation
Data may be packet switched, in which case it can be made to “fill the
gaps” in the demand for voice services.
Load
Peak traffic
Spare capacity for which can
be allocated to non real time
applications Average circuit
switched traffic
Time
Section 10 – New Service Optimisation
• First assume that the packet data can be scheduled to fill the spare real time
capacity.
• When all the spare real time capacity has been exhausted we must convert the
remaining capacity to an equivalent data capacity.
• Solution:
Timeslots available on average = 7 - 2 = 5
This represents a total data rate of 5 x 13 = 65 kb/s
• Cell Reselection
• Service Exceptions
• Average Response Times
• Suspend/Resume Procedures
• Attach/Detach Procedures
• Routing Area (RA) Update Procedures
• PDP Context Activations
• Data Volumes and Rates
Section 10 – New Service Optimisation
GGS
BSS SGSN
N
MS
IMSI/NSAPI
PDP Context
DLCI
Data Link Connection
TID
Virtual Tunnel
CONNECTION
CONNECTION TYPE
IDENTIFIER
Section 10 – New Service Optimisation
| 0000100002 | 0000100003 | CI
Number of Frames
Deleted
• Suspend Procedure:
• Enables a GPRS Class B MS to suspend GPRS mode in
order to make a circuit-switched connection
• Resume Procedure:
• Enables a GPRS Class B MS to resume GPRS mode having
made a circuit switched connection
• Monitoring:
• Procedure can be monitored and failures can be displayed
by TLLI, cell or cause
Section 10 – New Service Optimisation
Time in millsecs
BVCI
RA Updates
Number
Number of
RA Rejects per Cause
RA Rejects
DL LLC Rate
Bytes
Time (minutes)
Time (minutes)
NSS Characteristics
and
Problem Types
Section 9 – NSS Characteristics and Problem Types
Section 9
9.1 Introduction
Section 10
?.1 Introduction
Define Optimisation
Requirements
Define Implementation
Strategy
Optimisation Activity
Phase
Section 10 – NSS Optimisation
SS7 Routing
VLR
B
BSC
A AuC
MSC D
H
A C
BSC
E F HLR
BSC A
F EIR D
MSC
A
B
BSC
VLR
Section ? – NSS Optimisation
HLR 1 GPRS
600k
MSC MSC
MSC MSC MSC
MSC MSC MSC Layer
MSC MSC MSC MSC
MSC MSC MSC MSC
MSC MSC MSC MSC
MSC MSC MSC
MSC
MSC
Section ? – NSS Optimisation
0
500
1000
1500
2000
2500
3000
3500
4000
4500
5000
(R ha
ah n )
M aha
S
CE n )
M
M AM
S
C
M KJ
S
CR
Al M A
gh S C
ad S
ir B
H M
LR SC
3
(B
M H
S )
C
M BE
S H
CF
Exchange
M AR
H S
LR C
5 LC
(E T
m
LC a m
EM TT )
S
Total MSU per sec
AM C1
T
M SC
S 1
FA CK
TE AN
H
M
S
C
Tx
Rx
Link Loading – Symmetrical Load Spreading
PARAMETER REC
• Advantages of Au usage:
• Increases security of network
• Prevents unauthorised network access
• Implementation of Au is an Operator decision
• Can be implemented internally and/or for roaming
subscribers
• Excessive Au increases signalling capacity requirements
• Use of Au should be uniform across network
Section ? – NSS Optimisation
VLR
• VLR utilisation refers to subscriber record Sr. No. MSC Utilisation
capacity and usage within a VLR
1 MSC-1 65%
• Utilisation problems include: 2 MSC-2 82%
• Over-capacity in certain VLRs 3 MSC-3 26%
• Uneven spread of records across the 4 MSC-4 100%
network
5 MSC-5 86%
• Over-capacity can result in: 6 MSC-6 66%
• Call function failures (e.g. setup/handover, 7 MSC-7 71%
authentication etc)
8 MSC-8 100%
• Lack of growth capability
9 MSC-9 62%
10 MSC-10 7%
Section 9 – NSS Characteristics and Evaluation
GoS = 1% Max Erlangs/trunk = 0.7 Only trunk utilisation > 75% shown
Section 10 – New Service Optimisation
End of Course
Any Questions?