GSM Training - B10 Network Design - Capacity Analysis

Network Design
Capacity Analysis
Network Design Competence Center
February, 2008
All Rights Reserved © Alcatel-Lucent 2006, #####

Agenda
1. Network Design Process
2. Objectives of Capacity Analysis
3. Overview
4. Signalling Channels Dimensioning
5. Traffic Channels Dimensioning
6. Capacity Analysis
7. Densification Techniques
8. Useful links
2 | B10 Capacity Analysis | January 2008 All Rights Reserved © Alcatel-Lucent 2006
1
Network Design Process
Network Design Process
With Accurate & Innovative Network Design ...
1. Gathering 4. CapacityAnalysis
4. Capacity Analysis
••Air
Air Interface
Interfacedimensioning
dimensioning
2. Coverage analysis:
•Link Budgets
•RNP 5. BSS dimensioning
• Radio Sites
• BSC, MFS, TC
3. Spectrum &
• Interfaces
Throughput Analysis
You get Reliable Network Dimensioning
2
Objectives of Capacity Analysis
Objectives of Capacity Analysis
Cell level
To be able to describe the high level characteristics of each BTS cell configuration:
 Traffic Mix
 Number of Radio TS (Signalling, Traffic)
 Number of TRX (FR/DR, GPRS/EDGE, Inner/Outer)
 Supported Subscribers
3
Overview
Overview
Cell level
CS sig SDCCH dimensioning nSDCCH
CCCH/PCCCH
PS sig dimensioning nPCCCH
CELL
CELLCONFIGURATION
CS nTCH
traffic
CONFIGURATION
GPRS
traffic nTCH-DR
Traffic
EDGE
traffic
Model
nEDGE
Design
Parameters
nPS
4
Signalling Channels Dimensioning
Signalling Channels Dimensioning (1/5)
Cell level
BCCH Dimensioning:
 1 slot is always dedicated to BCCH/CCCH and can be combined with 4
SDCCH logical channels (combined mode)
CCCH Dimensioning:
 CCCH carries AGCH and PCH messages
 Number of AGCH and PCH blocks is deduced from the number of messages
per second
Nsub
AGCH mess/s  BHCA  1  SMS  LCS  OtherSig 
3600
Nsub
PCH mess/s  BHCA   MT_Proportion  MT_SMS  MT_LCS   LA_Size
3600
Cell level
In B9, the CCCH is carried on the same timeslot as BCCH (TS0), with the
constraint that AGCH blocks <= 7 and (AGCH + PCH) blocks <= 9
TS Sig = 1 (BCCH/CCCH/SDCCH) + TS SDCCH
Multiple CCCH : from B10 MR1 onwards, if the previous constraint is not
satisfied, an additive timeslot (TS2) is dedicated to the CCCH, with the new
constraint that AGCH blocks <= 14 and (AGCH + PCH) blocks <= 18
TS Sig = 1 (BCCH/CCCH) + 1 (CCCH) + TS SDCCH
Cell level
Multiple CCCH :
« 64k statistical multiplexing » scheme is advised when multiple CCCH is used

(esp. For big cells)
Benefit : higher signaling capacity

• To handle high capacity cells
• To handle cells with heavy traffic models (high BHCA, high usage, etc.)
• To define larger Location Areas (more paging messages are possible)
• Avoid master channel (PBCCH/PCCCH) deployment
Cell level
SDCCH Dimensioning:
 Location Area Updates, IMSI Attach/Detach, SMS call attempts and LCS
procedures
 Number of SDCCH channels deduced using the Erlang B law
Blocking Probability
(e.g. 0.5%) logical
Erlang B n
SDCCH
SDCCH Load
(Erlangs)
Erlangs = BHCA x Hold Time (s) / 3600
SDCCH Load = BHCA x (1 + SMS + LCS + Other Sig) x SDCCH Hold Time x Subs / 3600
Cell level
SDCCH Dimensioning:
 1 TS can carry up to 8 SDCCH logical channels
 If combined mode is allowed and (AGCH+PCH) blocks <= 3, up to 4 SDCCH
channels can be assigned on the BCCH/CCCH TS
 In combined mode:
logical
nSDCCH 4
TS SDCCH 
8
logical
 In non combined mode: nSDCCH
TS SDCCH 
8
5
Traffic Channels Dimensioning
Principle
Traffic Model is
Needed Resources Optimized required to
dimensioning predict the peak
number of radio
timeslots needed
Average to support a given
traffic per
subscriber
Time
Dimensioning Goal:
Probability  Assess the probability
Blocking States distribution
 Determine the
optimized value
Needed
Resources
Average Optimized dimensioning
Common Pool of Resources
Alcatel-Lucent optimised radio resource allocation algorithm:

 no need to reserve radio timeslots for EGPRS or GPRS
 TS are common pool of radio resources shared by CS, GPRS and EGPRS users
Resource sizes needed by CS and PS users:

 CS users  0.5 or 1 timeslot
 PS users  x timeslots, depending on the multi-slot class and the bias of
the application transfer
Exa m p le :
5 4 .4 kb p s
Grade of Service : Although CS users need dedicated RADIO
resources (blocking if none available), PS users accept 3 5 kb p s

Ta va il.
sharing resources with others 3 0 kb p s
Tta rget SHARIN G
 CS : Blocking probability (e.g. 2%)

 PS : Sharing probability = target throughput / available
throughput on a per radio timeslot basis
PDCH
(MCS8 )
Traffic Modelling
Main challenges for GSM/GPRS/EDGE dimensioning:

 Sharing a common resource between different users
 How to model multi-service traffic behaviour on the air interface
 How to take into account different GoS requirements
 Derive the required capacity, but optimised
Video streaming,
Over dimensioning
Voice, SMS, Optimised
Average
Shopping on line, traffic
Dimensioning
Web browsing,
File transfer,
Under dimensioning
Aggregate
Video games... traffic
Combination of 1 EDGE user Busy hour
(4+1) + 3 voice users
+1 GPRS user (3+1)
Traffic Modelling: Knapsack Model - Introduction
The issue resides in the computation of the shared system capacity

knowing GoS requirements (blocking probability, delay)
the shared capacity for GSM/GPRS/EDGE is the radio resource
Few models dealing with resources shared by various services can be

found in the literature
 The Knapsack Model (also called the Multi Erlang Model) gives an analytical
solution for CS-services requesting a common resource
Traffic Modelling: Knapsack Model – Principles (1/2)
The stochastic knapsack (or Multiservice Erlang-B) model is an extension of

the Erlang-B law applied to various circuit-switched services requesting a
same resource.
This model calculates the blocking probability of each service knowing the
total number of available resources (capacity) and the incoming traffic
intensity of each service.
•INPUTS •OUTPUTS
Inputs per service :

- Average Traffic demand (mE) Outputs per service :
- Required number of resource - Resulting blocking
•Knapsack•
•with given capacity C
Traffic Modelling: Knapsack Model – Principles (2/2)
A reverse algorithm has to be used to derive the minimal knapsack capacity

for which all the resulting service blocking probabilities are below the
required ones.
•INPUTS
Inputs per service:

- Average Traffic demand (mE)
- Required resource amount
- Grade of Service (blocking)

•CC==11
•Calculate
Calculateblocking
blocking
•probabilities
probabilities
•Increment
IncrementCC
•OUTPUTS
All services GoS OK?
No
Yes • Optimum capacity satisfying all
service GoS
• Resulting blocking per service
•Capacity=
Capacity=CC
Traffic Modelling: Alcatel-Lucent Model – Overview
NN oo rr mm aa l l i i ss ee rr ee ss oo uu rr cc ee ss ff oo rr ee aa cc hh
ss ee rr vv i i cc ee i i
 b 
B i  ROUNDUP  i
 Norm factor

 min j b j 
CC == 11
CC aa l lcc uu l laa tt ee bb l l oo cc kk i inn gg pp rr oo bb aa bb i i l l i i tt i i ee ss

ww i itt hh KK aa uu ff mm aa nn -- RR oo bb ee rr tt ss aa l l gg oo rr i i tt hh mm
Traffic
T r a ffic
M o d e l
tt aa kk i inn gg i i nn tt oo aa cc cc oo uu nn tt bb oo tt hh Model
CC SS aa nn dd PP SS tt rr aa ff ff i i cc
I I nn cc rr ee mm ee nn tt CC FF oo rr PP SS ss ee rr vv i icc ee ss , , tt rr aa nn ss l laa tt ee tt hh ee
FF oo rr CC SS ss ee rr vv i i cc ee ss , , cc oo mm pp aa rr ee bb l loo cc kk i i nn gg pp rr oo bb aa bb i il li itt i iee ss ff oo uu nn dd i inn tt oo PP SS
tt hh ee bb l loo cc kk i i nn gg pp rr oo bb aa bb i il l i i tt i iee ss GG oo SS aa nn dd cc oo mm pp aa rr ee i itt tt oo tt hh ee rr ee qq uu i irr ee dd
ff oo uu nn dd ww i i tt hh tt hh ee rr ee qq uu i i rr ee dd GG oo SS GG oo SS
A ll s e r v ic e s O K ?
N o
Y es
CC aa pp aa cc ii tt yy == CC  mm ii nn bb i i // NN oo rr mm FF aa cc t too r r
Traffic Channels Dimensioning CS Traffic
Traffic Modelling: Alcatel-Lucent Model – Traffic Intensities (1/9)
Cell level
The knapsack model needs computation of the traffic intensities :
CS Traffic
HRCR
HRCR * nof_subs * speech_penetration_rate * HR_traffic_intensity
nof_subs speech_traffic_per_sub / 1000
speech_penetration_rate
(1 – HRCR) * nof_subs * speech_penetration_rate * FR_traffic_intensity
speech_traffic_per_sub speech_traffic_per_sub / 1000
nof_subs
CSD_penetration_rate nof_subs * CSD_penetration_rate * CSD_traffic_intensity

CSD_traffic_per_sub / 1000
CSD_traffic_per_sub
Traffic Channels Dimensioning PS Traffic
Cell level
PS Traffic
UL DL
Starting with B10 MR2 the UL and
DL throughputs are improved
because of two new features: Class Tx Rx Sum
 Extended Dynamic Allocation 11 3 4 5
(Class: 11 and 12)
-> up to 4 UL TS instead of 2 12 4 4 5
-> maximum 5 TS UL+DL 30 1 5 6
31 2 4 6
 Support of the High Multislot
Classes (Class: 30, 31, 32 and 32 3 3 6
33)
-> up to 5 DL TS instead of 4 33 4 1 6
-> maximum 6 TS UL+DL
Traffic Channels Dimensioning PS Traffic
Cell level
UL
DL MCS9 BLER9
100%
MCS8 BLER8
MCS7 BLER7
MCS6 BLER6
MCS5 BLER5
MCS4 BLER4
MCS3 BLER3 av_TP_EGPRS

MCS2 BLER2
MCS1 BLER1
0%
(M)CSi (M)CSi
BLER i MCS_distrib i
MCS_bitrate i
(M)CSi
Σi (M)CS_bitrate i * ( 1 – BLER i ) * (M)CS_distrib i = av_TP_EGPRS
Traffic Channels Dimensioning NRT PS Traffic
Nof_subs Nof subs in the cell (at Busy Hour)
Cell level
Traffic
x NRT_penet_rate k Nof subs using NRT service k (at Busy Hour)
x NRT_session_per_sub k Nof sessions of NRT service k (at Busy Hour)
x NRT_traffic_per_session k Traffic for NRT service k (at Busy Hour)

100% 100%
x MS_EGPRS_distrib ts x MS_GPRS_distrib ts Traffic for NRT
service k with (E)GPRS
0% 0% on ts Timeslots (at Busy Hour)
ghput
UL
DL
…..
av_TP_EGPRS * ts
1, 2, 3, 4
or 5 ts
…..
av_TP_GPRS * ts
Throu
Throughp
Durattion
Dura ion
NRT service k usage duration with NRT service k usage duration with
EGPRS on ts Timeslots (at Busy Hour) GPRS on ts Timeslots (at Busy Hour)
3600
Erl (E)GPRS_NRT_traffic_intensity k,ts = ( Nof_subs * NRT_penet_rate k *

NRT_session_per_sub k * NRT_traffic_per_session k * MS_(E)GPRS_distrib ts )
/ (av_TP_EGPRS * ts * 3600 )
Number of ts * PDCHs needed to carry the average traffic over the Busy Hour
Conclusions on CS and NRT PS services

PS services can be characterised by:
 number of users requesting 1, 2, 3, 4, 5 timeslots ( multi-slot class
distribution and application bias)  definition of classes of users
 PS traffic intensity per class of users ( volume and available bit rate)
 sharing probability (related to target bit rate and available bit rate) 
quantile = 1 - sharing probability
 no delay
Alcatel-Lucent traffic model will then consider:

 CS services (FR, HR, CSD) with their allowed blocking probability
 PS services with their allowed quantile. Sharing probability can be converted
into an equivalent blocking probability – then Knapsack can be used.
Traffic Channels Dimensioning RT PS Traffic
RT PS
Based on the support of Packet Flow Contexts (3GPP R99)
 BSS involved in the PDP context negotiation
 Context between SGSN and BSS  enables support of Streaming QoS
 Examples of Aggregated BSS QoS Profile parameters:
 Traffic class
 Traffic handling priority
 Guaranteed bit rate
Offered QoS can be tuned at the OMC:
 RMIN: minimum available throughput per PDCH
 It may be chosen to represent what 80% or 90% of the subscribers in the cell are
having per PDCH;
 Proposal: choose RMIN from the throughput CDF in the cell (see later)
 SAFETY_MARGIN: capacity which should be left for Non Real-Time services
Impact on network design:

 Introduction of a new type of PS services: Real-Time (RT)
 Characteristics of RT PS services:
 Penetration rate, technology (GPRS/EGPRS),
 Number of sessions in uplink and in downlink,
 Volume per session in uplink and in downlink,
 Guaranteed bit rate required in uplink and in downlink,
 Required coverage,
 Required blocking
Number of needed timeslots = Guaranteed bit rate / Available bit rate
Cumulative
Cumulative Distribution
Distribution Function
Function of
of
the
the Cell
Cell Throughput
Throughput per
per PDCH
PDCH
100
100
1st step : from cell
80
80
throughput CDF, derive
[%]
Probability [%]
60
available bit rate for
Probability
60
the required coverage
40
40
(e.g. 80% required
20
20
coverage 
00
00 10
10 20
20 30
30 40
40 50
50 60
60
15kbps/PDCH)
Throughput
Throughput [Kbps]
[Kbps]
2nd step : from requested guaranteed bit rate and available bit rate,
compute number of needed dedicated timeslots (e.g. 50kbps
guaranteed  50/15 = 3.3 PDCHs)
3rd step : compute traffic intensity in each direction and consider

streaming as a CS service requesting 3.3 timeslots with a certain
blocking rate requirement
Cell level
The knapsack model needs computation of the traffic intensities :
Traffic
Nof_subs Nof subs in the cell (at Busy Hour)
x RT_penet_rate k Nof subs using RT service k (at Busy Hour)
x RT_session_per_sub k Nof sessions of RT service k (at Busy Hour)
x RT_traffic_per_session k Traffic for RT service k (at Busy Hour)
Throughput
UL
Guaranteed_bit_rate k
DL
Durat ion
RT service k usage duration
(at Busy Hour)
3600 Duration
Erl RT_traffic_intensity k = ( Nof_subs * RT_penet_rate k *
RT_session_per_sub k * RT_traffic_per_session k ) / ( Guaranteed_bit_rate k * 3600 )
6
Capacity Analysis
Capacity Analysis
Summary
For CS services:
 Traffic demand (mErl)
 GoS: blocking
 Required resources (0.5-1)
Radio Time Slots Needs
For NRT PS services: Probability
 Traffic demand (kbits)
 Available throughput per TS Traffic
Model
 GoS: target throughput per TS # TS
 Required resources (1-4)
For RT PS services (B9+):

 Traffic demand (kbits)
 Required service coverage (%)  Required capacity to
satisfy GoS of each service
 Required guaranteed
throughput per session  Resulting GoS for each
 GoS: blocking service
Capacity Analysis
Number of subscribers
CS/PS load per subscriber

Half Rate Call Ratio
PS Throughputs (Target, Guaranteed)
Number of subscribers
CS/AMR/PS Traffic profiles

penetration
Traffic mix Configuration
rates
Traffic Model Analysis
Grade of Service
Blocking Option/features
Sharing TS (CS, Speech, DR, PS, EDGE)
Cell configuration
Multi-slot class / BLER TRX (FR, DR, PS, EDGE)
Dual band cell distribution
Multi-band cell
Concentric cell
OK Not OK = increase or decrease
Nb. TRXs
Cell capacity Configuration constraints Incl. Nb DR TRX
Incl. Nb. PS TRX
= Final number of subscribers Incl. Nb. EDGE TRX
Capacity Analysis
Example
Da ta MMS Tra ffic / W AP Tra ffic / W EB Tra ffic /

Tra ffic Mix Sp e e ch p e n e tra tion Da ta Use r Da ta Use r Da ta Use r
Speech O nly 25 mErl 0% n/ a n/ a n/ a
Speech + Low Da ta Tra ffic 25 mErl 5% 40 kb its 8 0 kbits 80 kb its
Speech + Medium Da ta Tra ffic 25 mErl 1 0% 1 00 kb its 200 kbits 200 kbits
Speech + High Da ta Tra ffic 25 mErl 2 0% 3 00 kb its 600 kbits 600 kbits
N um b e r o f
Site Typ e use rs
S4 44 Speech O nly
26 31
S4 44 Speech + Lo w GPRS Tra ffic
26 10
S4 44 Speech + Med ium GPRS Tra ffic
25 29
S4 44 Speech + Hig h GPRS Tra ffic
21 30
S4 44 Speech + Lo w EDGE Tra ffic
26 22
Higher Capacity
S4 44 Speech + Med ium EDGE Tra ffic
25 86 with EDGE than
S4 44 Speech + Hig h EDGE Tra ffic with GPRS
23 85
7
Densification Techniques
Activate capacity enhancement features
 Half Rate
 Description: multiplexing of 2 users on the same slots during traffic peaks
 Benefits: considerable capacity gain (30% for a 50% penetration rate)
 Drawbacks: voice quality degradation (mitigated w/ AMR), no capacity gain for data
 Directed Retry & Fast Traffic Handover

 Description: sharing resources between overlapping cells
 Benefits: allows to increase traffic load beyond Erlang B
 Drawbacks: increased TRX load, no gain in case of congestion
Q  EDGE
 Description: 8-PSK, Incremental Redundancy
 Benefits: higher spectral efficiency and therefore higher capacity
 Drawbacks: costly (software, bandwidth consuming on the transmission network side), handset availability
 And more: Multiband, Queuing…..
Deploy a multi-layer network and/or indoor solutions
 Multi-layer network
 Description: introduction of a second layer of micro-cells, interaction through advanced resource allocation
features
Micro
 Benefits: contained interference, high QoS, suited for located hot spots traffic Macro
 Drawbacks: deployment cost, transmission cost, requires an accurate knowledge of the traffic distribution layer
layer
 Dedicated Indoor Solutions

 Description: dedicated BTS and distribution systems inside of buildings
 Benefits: good protection between in-building and outdoor sites, high QoS, suited for business areas, shopping
malls, airports…
 Drawbacks: costly (BTS, distribution system), requires accurate planning
Indoor
O utdoor
69.7%
30.3%
www.alcatel-lucent.com

GSM Training - B10 Network Design - Capacity Analysis

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

GSM Training - B10 Network Design - Capacity Analysis

Uploaded by

Copyright:

Available Formats

Network Design

Network Design Competence Center

All Rights Reserved © Alcatel-Lucent 2006, #####

1. Network Design Process

2. Objectives of Capacity Analysis

4. Signalling Channels Dimensioning

5. Traffic Channels Dimensioning

With Accurate & Innovative Network Design ...

You get Reliable Network Dimensioning

CS sig SDCCH dimensioning nSDCCH

TS Sig = 1 (BCCH/CCCH/SDCCH) + TS SDCCH

TS Sig = 1 (BCCH/CCCH) + 1 (CCCH) + TS SDCCH

« 64k statistical multiplexing » scheme is advised when multiple CCCH is used

Benefit : higher signaling capacity

Erlangs = BHCA x Hold Time (s) / 3600

Alcatel-Lucent optimised radio resource allocation algorithm:

Resource sizes needed by CS and PS users:

Grade of Service : Although CS users need dedicated RADIO

resources (blocking if none available), PS users accept 3 5 kb p s

 CS : Blocking probability (e.g. 2%)

Main challenges for GSM/GPRS/EDGE dimensioning:

The issue resides in the computation of the shared system capacity

Few models dealing with resources shared by various services can be

The stochastic knapsack (or Multiservice Erlang-B) model is an extension of

Inputs per service :

- Required number of resource - Resulting blocking

A reverse algorithm has to be used to derive the minimal knapsack capacity

Inputs per service:

- Grade of Service (blocking)

CC aa l lcc uu l laa tt ee bb l l oo cc kk i inn gg pp rr oo bb aa bb i i l l i i tt i i ee ss

CSD_penetration_rate nof_subs * CSD_penetration_rate * CSD_traffic_intensity

-> maximum 5 TS UL+DL 30 1 5 6

-> maximum 6 TS UL+DL

MCS3 BLER3 av_TP_EGPRS

Σi (M)CS_bitrate i * ( 1 – BLER i ) * (M)CS_distrib i = av_TP_EGPRS

x NRT_session_per_sub k Nof sessions of NRT service k (at Busy Hour)

x NRT_traffic_per_session k Traffic for NRT service k (at Busy Hour)

Erl (E)GPRS_NRT_traffic_intensity k,ts = ( Nof_subs * NRT_penet_rate k *

Conclusions on CS and NRT PS services

Alcatel-Lucent traffic model will then consider:

Impact on network design:

Number of needed timeslots = Guaranteed bit rate / Available bit rate

3rd step : compute traffic intensity in each direction and consider

x RT_penet_rate k Nof subs using RT service k (at Busy Hour)

x RT_session_per_sub k Nof sessions of RT service k (at Busy Hour)

x RT_traffic_per_session k Traffic for RT service k (at Busy Hour)

For RT PS services (B9+):

CS/PS load per subscriber

CS/AMR/PS Traffic profiles

Da ta MMS Tra ffic / W AP Tra ffic / W EB Tra ffic /

 Directed Retry & Fast Traffic Handover

 Dedicated Indoor Solutions

You might also like