GSM-To-UMTS Training Series 03 - WCDMA Radio Network Capacity Dimensioning - V1.0

Security Level:
WCDMA Radio Network

Capacity Dimensioning
GSM-to-UMTS Training Series_V1.0
www.huawei.com
HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential

Revision Record
Date Revision Description Author
Version
2008-10-31 1.0 Draft completed. Zang Liang
2008-12-31 1.1 Added comparison of the capacity dimensioning of Zhang Bibo

the GPRS and WCDMA to Page 3.
Explained the formula for calculation of the data
volume on Page 23.
Explained BHSA on Page 24.
Explained the related units on Page 34.
Explained the formula and parameters on Page 35.
Described the downlink interference on Page 57.
2009-01-15 1.2 Added remarks on Pages 3, 16, and 79 to compare Hou Chong
capacity dimensioning of a GSM network with that
of a WCDMA network.
HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 2

Capacity Features: WCDMA vs GSM
 WCDMA is a self-interference system.

 The WCDMA system capacity is closely related to coverage.
 The WCDMA network capacity has the soft capacity feature.
 The capacity dimensioning of a WCDMA network is based on
a certain traffic model.
 Interference in the GSM network is mainly from the cells that use the same
frequency. There is negligible interference from the subscribers in the same cell.
 In the GSM system, the capacity is independent of the coverage.
 The GSM system capacity is relatively fixed and can be estimated based on the
frequency and the number of timeslots.
 The uplink capacity of the GSM network is the same as the downlink capacity.
 The capacity dimensioning of a GSM network is based on a certain traffic model.

Foreword
At the early stage of radio network planning, we must aim to know the
scale of the network. For example, we must know how many devices
are required and how to configure the devices. Based on coverage
estimation, we can calculate the cell radius under a specific load by
using the path loss, and then obtain the number of subscribers under
the cell coverage in combination with the subscriber density.
In actual planning, can we obtain the cell radius only by considering
the coverage? Should other aspects be taken into consideration?

Objectives
Upon completion of this course, you will be able to:
 Understand the parameters of 3G traffic model

 Understand the factors that restrict the
WCDMA network capacity
 Understand the methods and procedures for
estimating multi-service capacity
 Understand the key technologies for
enhancing network capacity

Contents
1. Traffic Model
2. Uplink capacity analysis
3. Downlink capacity analysis
4. Multi-service capacity estimation
5. Network estimation procedure
6. Capacity enhancement technologies

1. Traffic Model
 1.1 Overview of Traffic Model
 1.2 CS Traffic Model
 1.3 PS Service Model
 1.4 PS Traffic Model Parameters

Service Overview
 The WCDMA system supports multiple services.
 Variable-rate services
 Hybrid services
 High-speed data packet services
 Asymmetrical services
 Large-capacity and flexible service bearing

QoS Type
It is necessary to maintain the time relationship between Voice
the information entities in the stream. Low delay tolerance service,
and symmetric data rate are required. video
Session
phone,
Real-time video
game
category
It is necessary to maintain the time relationship between Streaming
the information entities in the stream. Unidirectional multimedia
Streaming
services, high error tolerance, and high data rate are
required.
Data integrity must be maintained in request-response Web page

mode. High error tolerance and low delay tolerance are browsing,
Interactive
required. online
Non real- game
time Backgroun
The information receiving end does not expect the data
category d download
arrival within a period of time. Data integrity should be
Background of Email
maintained. Small delay restriction and error-free
transmission are required.

Objectives of Establishing Traffic Models
 To determine the system configuration, calculate the call capacity of air
interfaces.
 To determine the system capacity. In data applications, different
transmission models lead to different system capacities.
 -To plan the network properly by establishing a data transmission model
that meets the customer’s expectations.
Traffic models are provided by telecom operators. If a telecom operator
cannot provide the traffic model, a traffic model for similar scenarios or
a traffic model recommended by Huawei can be used as the basis for the
planning upon the approval of the telecom operator.

Traffic Model
 A traffic model deals with the capacity features of each service

type and the QoS expected by the subscribers who are using
the service from the perspective of data transmission.
 In data applications, the subscriber behavior research predicts

the service types available on a 3G network, number of
subscribers of each service type, usage frequency of the
service, and distribution of subscribers in different regions.

Contents of Traffic Model
Service Model
Traffic Model
Results
User Behavior
System Configuration

Typical Service Features
 Typical service features include the following feature

parameters:
 Subscriber type (such as indoor, outdoor, and inside a
vehicle)
 Average motion speed of a subscriber
 Service type
 Uplink and downlink service rates
 Spreading factor (SF)
 Time delay requirements of the service
 QoS requirements of the service

1. Traffic Model

CS Traffic Model
 A typical CS service is the voice service. The arrival of the CS
subscribers takes on a Poisson distribution, while the interval
takes on a negative exponential distribution.
 Related parameters of the model:
 Penetration rate
 BHCA Mean busy-hour call attempts
 Mean call duration (s)
 Activation factor
 Mean rate of service (kbps)

CS Traffic Model Parameters
 Mean busy-hour traffic per user (Erlang) = (BHCA x Mean call
duration)/3600 (Erl)
 Mean busy-hour throughput per user (kbit) (G) = BHCA x Mean call
duration x activation factor x Mean rate of service (kbps)
 Mean busy-hour throughput per user (bps) (H) = (Mean busy-hour
throughput per user x 1000)/3600

1. Traffic Model

PS Traffic Model
The most frequently used model is the packet service session process
model described in ETSI UMTS30.03.

PS Services

1. Traffic Model

PS Service Model Parameters
Packet Call Num/Session

Packet Num/Packet Call
Packet Size (bytes)
Reading Time (sec)
Service Model
Typical Bearer Rate (kbps)
BLER

Determining Parameters
The basic parameters in the traffic model are determined in the
following ways:
 Obtain numerous basic parameter sample data from the
existing network.
 Obtain the probability distribution of the parameters by
processing the sample data.
 Take the distribution most proximate to the standard probability
as the corresponding parameter distribution through comparison
between the obtained distribution and the standard distribution
function.
PS Traffic Model Parameters
 Typical Bearer Rate (kbit/s):
 The bearer rate varies during the actual transmission.
 BLock Error Rate (BLER):
 For the PS domain service, we need to consider the retransmission

caused by error blocks when calculating the data transmission time.
Assume that the data volume of a service source is N and that the
block error rate at the air interface is BLER. The total data volume to be
transmitted on the air interface is as follows:

PS User Behavior Parameters
Penetration Rate
BHSA
User behavior User Distribution (High, Medium,

Low end)

PS User Behavior Parameters
 Penetration Rate：
The percentage of the users that activates this service to all the
users registered in the network.
 BHSA： The number of sessions of single-user in busy hour
specific to a service
 User Distribution (High, Medium, Low end)
The users are divided into high-end, mid-end and low-end users. Different
operators and different application scenarios have different user
distributions.

Derivative Parameters of the PS Traffic Model
 Session traffic volume (Byte): Average traffic of single session of the
service
Session traffic volume = Packet size x Packet number per packet call x
Packet call number per session
 Data transmission time (s): Transmission time for a single session of

service
Data transmission time = (1/(1-BLER)) x (((Session traffic volume x

8)/1000)/Typical bearer rate)
 Holding time (s): Average duration of a single session of service
Holding time = (Packet call number per session -1) x Reading time + Data
transmission time

Derivative Parameters of the PS Traffic Model
 Activation factor: The proportion of the time when services transmits
at full-rate in the duration of a single session.
Data transmission time

Activation factor 
Holding time
 Busy hour throughput per user (Kbit):
Busy Hour Throughput / user  ( BHSA * Session Traffic Volume * 8) / 1000

Traffic Model Sample
Mobile Typical
Busy Hour
Video Penetration Bearer Activation
BHSA Throughput/use BLER
(Stream) on Rate Rate Factor
r (kbit)
Demand (kbps)
Uplink 22.0% 0.100 2.304 8 10% 0.1798
Downlink 22.0% 0.100 102.528 64 10% 1.0000
Mobile Session
Packet Call Packet Reading
Video Packet Size Traffic Holding
Number/Se Number/P Time
(Stream) on (Bytes) Volume Time
ssion acket Call (sec)
Demand (Byte)
Uplink 2 3 480 14.6000 2880 17.8000
Downlink 1 267 480 0.0000 128160 17.8000
Data_Erlang = ∑ ((Proportion of subscribers at each level in typical application

environment x Penetration rate x Busy throughput per user in typical application
environment)/(Bearer rate x 3600 x Activation factor of this service))

Questions
1. What are the two parts of the traffic model?
2. What are the main parameters of the CS traffic

model?
3. What are the main parameters of the PS service
model?
4. What is the formula for calculating the equivalent
Erlang of the PS service?

Summary
 Content of the traffic model
 Main parameters of CS service traffic model
 Structure, main parameters, and derivative parameters of
the PS service model
 Calculation of the equivalent Erlang of the PS services

Contents
1. Traffic Model

Basic Principles
 In the WCDMA system, all the cells may share a same spectrum,
which greatly helps improve the system capacity. However, co-
frequency reuse causes interference between subscribers. Such
multi-access interference restricts the system capacity.
 The radio system capacity depends on the uplink and downlink

capacities. When planning the capacity, analyze the uplink and
downlink.

Uplink Interference Analysis – Composition of
Uplink Interference
ITOT  I own  I other  PN

 Iown: interference from subscribers of this cell
 Iother: interference from subscribers of adjacent

cells
 PN: receiver noise floor

Uplink Interference
 Receiver noise floor PN
PN = 10lg (KTW) + NF
− K: Boltzmann constant, 1.38 x 10-23 J/K
− T: Kelvin temperature. The normal temperature is 290 K.
− W: signal bandwidth. The WCDMA signal bandwidth is 3.84
MHz.
− NF: noise factor of a receiver
 10lg (KTW) = -108 dBm/3.84 MHz
 NF = 3 dB (typical value of macro-cellular NodeB)
 PN = 10lg (KTW) + NF = -105 dBm/3.84 MHz

Uplink Interference
 Interference to be overcome by each subscriber: ITOT - Pj

− Pj is the receiving power of subscriber j
Pj
 Under ideal power control: Eb / No j  W 1
 
I TOT  Pj R j v j
I TOT
 Hence: Pj 
1 W 1
1  
Eb / No j R j v j
 The interference from subscribers of this cell are the sum
of powers of all the subscribers arriving at the receiver:
N
I own   Pj
1

Uplink Interference
 Iother: interference from subscribers of neighbor cells

 It is difficult to theoretically analyze the interference from
subscribers of neighbor cells, because the interference is
related to subscriber distribution, cell layout, and antenna
pattern. I
 Interference factor of a neighbor cell: i other
I own
 When the subscribers are distributed evenly:
− For an omni-directional cell, the typical interference factor
of neighbor cells is 0.55.
− For a three-sector directional cell, the typical interference
factor of neighbor cells is 0.65.

Uplink Interference Analysis
I TOT  I own  I other  PN

N
 1  i 
I TOT
 PN
1 W 1
1
1  
1
Define: Lj 
1 W 1
1  
N
Then, I TOT  I TOT  1  i    L j  PN
1

Uplink Interference Analysis
1
Obtain I TOT  PN  N
1  1  i    L j
1
 Assume that:
 All the subscribers are 12.2

kbit/s voice subscribers,
and the demodulation
threshold is Eb/No = 5 dB.
 Voice activation factor vj =
0.67.
 Interference factor of
neighbor cells i = 0.55.

Uplink Interference Analysis –
Uplink Load Factor
 Define the uplink load factor
N N
UL  1  i    L j  1  i   
1
1 W 1
1 1
1  
EbvsNo j R j v j
 When the load factor is 1, ITOT is infinite and the corresponding
capacity is called threshold capacity.
 Under this assumption, the threshold capacity is approximately 96
subscribers.

Load Factor and Interference
 Based on the previous formulas,
we can obtain the noise rise:
50% Load – 3 dB
60% Load – 4 dB
75% Load – 6 dB

Limitations of the Current Method
 In the preceding theoretical analysis, there are certain limitations as some
factors have not been taken into considerations and some assumptions have
been made.
 No consideration of the influence of soft handover
− The interference generated by the subscribers in soft handover state
are slightly lower than those generated by ordinary subscribers.
 No consideration of the influence of AMRC and hybrid service
− AMRC reduces the voice service rate of certain subscribers, reduces
the interference generated by these subscribers, and increases the
number of subscribers supported by the system at the cost of lowering
the call quality of these subscribers.
− Different services have different data rates and demodulation thresholds.
The preceding method can still be used for analysis, but the calculation
process is complicated.
− Due to the time-variable feature of the mobile transmission environment,
the demodulation threshold even for a same service is time-variable.

Limitations of the Current Method
 Assumption of ideal power control
− The power control commands of an actual system have certain error

codes. As a result, the power control process is not ideal, and the
system capacity is reduced.
 Assumption that the subscribers are evenly distributed and the neighbor
cell interference is constant.
 In consideration of the preceding factors, the system emulation is a more
accurate method:
− Static emulation: Monte Carlo method
− Dynamic emulation

Contents
1. Traffic Model

Downlink Interference Analysis –
Composition of the Downlink Interference
ITOT  I own  I other  PN

 Iother: interference from subscribers of adjacent cells
 PN: receiver noise floor

Composition of the Downlink Interference
 Receiver noise floor PN
PN = 10lg (KTW) + NF
− K: Boltzmann constant, 1.38 x 10-23 J/K
− T: Kelvin temperature. The normal temperature is 290 K.
− W: signal bandwidth. The WCDMA signal bandwidth is
3.84 MHz.
− NF: noise factor of a receiver
 10lg (KTW) = -108 dBm/3.84 MHz
 NF = 7 dB (typical value of UE)
 PN = 10lg (KTW) + NF = -105 dBm/3.84 MHz

Composition of Downlink Interference
 Iown: interference from this cell
 Downlink subscribers are differentiated with the mutually

orthogonal OVSF codes. In static propagation conditions
without multi-path, no mutual interference exists.
 In the case of multi-path propagation, certain energies that
cannot be detected by the RAKE receiver become interference
signals. The orthogonal factor  is defined to describe this
phenomenon.
 1   j  
PT
 I own  j
PL j
− In the formula, PT indicates the total transmit power of a
NodeB, including the dedicated-channel transmit power
and the common-channel transmit power.
N
PT  PCCH   Pj
1
Composition of Downlink Interference
 Iother: interference from neighbor cells
 The transmitting signals of neighbor cells cause interference to

the subscribers in the current cell. As the scrambling codes are
different, such interference is non-orthogonal.
 Assume that the service is evenly distributed and the transmit
powers of all NodeBs are equal. The system consists of K
NodeBs in neighbor cells, and the path loss from NodeB k to
subscriber j is PLk,j. The interference from neighbor cells for
subscriber j is calculated as follows:
K
I other  j  PT  
1
1 PLk , j

Downlink Interference Analysis
I TOT  I own  I other  PN
 1   j 
K
PT 1
 PT    PN
PL j 1 PLk , j
Assume the power control is ideal, then:

Pj
PL j W 1
EbvsNo j   
ITOT  j R j v j
The following formula can be obtained:
Rj
Pj  EbvsNo j   v j  I TOT  j  PL j
W

N
Based on this
formula:
1
The following formula

can be obtained:
N
 Rj 
PT  PCCH   EbvsNo j   v j  I TOT  j  PL j 
1  W 
   
  EbvsNo j   v j  PL j   1   j 
N Rj PT K
1
 PCCH  PT    PN 
1  W   PL j 1 PLk , j 
   
  EbvsNo j   v j   1   j  PT  PT  
N Rj K PL
 PCCH  PN  PL j 
j
1  W   1 PLk , j 

Calculate PT as follows:
 N Rj 
PCCH  PN   EbvsNo j   v j  PL j 
1  W 
PT 
 
1   1   j  i j  EbvsNo j   v j 
N Rj
1  W 
Where ij is the interference factor of neighbor cells of J,
assume that the following formula is true:
K PL j
ij  
1 PLk , j

 According to the preceding analysis, we can define the downlink load factor:
 
  1   j  i j  EbvsNo j   v j 
N Rj
DL
1  W 
 When the downlink load factor reaches 100%, the transmit power of the
NodeB is infinite, and the corresponding capacity is called threshold capacity.
 Different from the theoretic calculation of uplink capacity, j and ij in the
downlink capacity formula are variables related to subscriber positions. That
is, the downlink capacity is related to the spatial distribution of subscribers,
and can be determined only through system emulation.

Simulation Result

Simulation Result Analysis
 When the transmitting power of the base station is 43 dBm

(20 W), a maximum of about 114 subscribers are supported.
 In order to ensure system stability, the mean transmitting
power of the base station cannot exceed 80% of the
maximum transmitting power, namely, 42 dBm. Thus, about
112 subscribers are supported.

How to Control the Interference
Impact of the interference to the network

Handover success rate
Access efficiency
Call drop rate
Voice quality
Method for interference control
Improve the precision of the power control
Improve the Rake receiving efficiency
Proper network planning

Contents
1. Traffic Model

4. Multi-service Capacity Estimation
 4.1 Factors that restrict the radio
network capacity
 4.2 Commonly used capacity design
method
 4.3 Capacity estimation example based
on the Campbell’s theorem

Factors that Restrict the Radio Network Capacity
The WCDMA network capacity is

restricted by the following factors in the
radio network part:
 Uplink interference
 Downlink power
 Downlink channel code resources
 Channel Element (CE)
 Iub interface capacity

Downlink Transmit Power
 The downlink transmit power is divided into
two parts: One part is used for common
channels, and the other part for dedicated
(traffic) channels.
 The transmit power that is allocated by a

cell to subscribers varies with the service
demodulation threshold, propagation path
loss, and interference received by a
subscriber.
 The downlink transmit power of a cell is
shared by all the subscribers in the cell.
 The emulation method is often used to
analyze downlink interference.
N
1
Downlink Channel Code Resources
 The WCDMA network uses the code
words with the SF ranging from 4 to
512. The smaller the SF is, the higher
the supported data rate is.
 In a code tree, the allocable codes C4,0
must meet the following conditions: C2,0 1 1 1 1
1 1 C4,1
 No codes are allocated on the C1,0 1 1 -1 -1
path from this code to the root 1 C4,2
node. C2,1 1 -1 1 -1
1 -1 C4,3
 No codes that take this code 1 -1 -1 1
as the root node are allocated

SF = 1 SF = 2 SF = 4
in this sub-tree.
 Principle for code allocation:
 Try to reserve the code words
with small SFs to improve the
utilization rate.

Downlink Channel Code Resources
Following is an example of code resources allocation
SF 4 8 16 32 64 128 256 512

　　　　　　　　　　　　　　　　　　　　　　　　　　　　┏━●C(256,0):PCPICH 2
　　　　　　　　　　　　　　　　　　　　　　　　┏ 0 ┫
　　　　　　　　　　　　　　　　　　　　　　　　┃　　　┗━●C(256,1):PCCPCH 3
　　　　　　　　　　　　　　　　　　　　┏ 0 ┫
　　　　　　　　　　　　　　　　　　　　┃　　　┃　　　┏━●C(256,2): AICH 6
　　　　　　　　　　　　　　　　　　　　┃　　　┗ 1 ┫
　　　　　　　　　　　　　　　　　　　　┃　　　　　　　┗━●C(256,3): PICH 10
　　　　　　　　　　　　　　　　┏ 0 ┫
　　　　　　　　　　　　　　　　┃　　　┗━●C(64,1):SCCPCH 8
　　　　　　　　　　　　┏ 0 ┫
　　　　　　　　　　　　┃　　　┃　　　┏━●C(64,2):SCCPCH 9
　　　　　　　　　　　　┃　　　┗ 1 ┫
　　　　　　　　　　　　┃　　　　　　　┗━○3
　　　　　　　　┏ 0 ┫
　　　　　　　　┃　　　┗━○1
　　　　┏ 0 ┫
　　　　┃　　　┗━○1
┃
　　　┗━○1
　　　┏━○2
┃
　　　　┗━○3

Channel Element (CE)
 The CE is the quantitative data that logically measures the resources occupied for
service processing.
 The resources occupied for service processing are mainly related to the SF of the
service. The smaller the SF is, the greater the data traffic is, and the more the
occupied resources are.
 The SFs of typical services are:
 AMR12.2 kbps SF = 128

 CS64 kbps SF = 32
 PS64 kbps SF = 32

Channel Element (CE)
 If we define the resources required for processing AMR services of 12.2 kbps
as a CE, the number of CEs occupied by other services are as follows:
 AMR12.2 kbps 1
 CS64 kbps 4
 CS144 kbps 8
 CS384 kbps 16
 PS64 kbps 4
 PS144 kbps 8
 PS384 kbps 16

4. Multi-service Capacity Estimation
 5.1 Factors that restrict the radio
network capacity
 5.2 Commonly used capacity design
method
 5.3 Capacity estimation example based
on the Campbell’s theorem

Erlang-B Formula (I)
Erlang-B formula is used for

estimating the peak traffic that meets
certain call loss rate when the average
traffic (Erlang) is given
Erlang-B formula is only used for
Circuit switched services

Single service
The WCDMA system provides CS
and PS domain multi-services

Erlang-B Formula (II)
 The prerequisite of the Erlang-B is that the requests for resources
should be based on Poisson distribution, that is, the resource request
variance should be equal to its mean value.
 If, when a service establishes a connection, the service requests for

resources more than the unit resources, the resource request is no
longer equal to its mean value. The Erlang-B formula is not applicable in
this case.
 Comparison of the methods for multi-service capacity estimation:
Post Erlang-B
Equivalent Erlangs
Campbell’s Theorem

Post Erlang-B (I)
 By summing up the capacities

required for different services,
we obtain the capacities
required for the combined
services.
 The resource efficiency of
different services is not taken
into account.

Post Erlang-B (II)
 Assume that two types of services share resources
 Service 1: one unit resource/connection.12 Erlang

 Service 2: three unit resources/connection.6 Erlang
 Calculate capacity required for each service
 Service 1: 12 Erlangs require 19 unit resources, meeting the 2%

blocking rate
 Service 2: 6 Erlangs require 12 connections (equivalent to the 36
unit resources of service 1), meeting the 2% blocking rate
 Total 55 unit resources

Post Erlang-B (III)
 Assume that two services use the same resources.
 Service 1: one unit resource/connection, 12 Erlangs
 Calculate the capacity required for each service.
 Service 1: A 12-Erlang traffic volume requires 19 unit resources to meet the
blocking rate of 2%.
 Service 2: A 6-Erlang traffic volume requires 12 unit resources to meet the blocking
rate of 2%.
 In total, 31 unit resources are required.
 However, the reasonable result should be as follows: A 18-Erlang traffic volume
requires 26 unit resources to meet the blocking rate of 2%.
Post Erlang-B overestimates

the capacity requirements!

Equivalent Erlangs (I)
 Combine different services

by converting the bandwidth
from one service to another,
and then calculate the
required capacity.
 Selecting different services

as the measurement
benchmark may lead to
different capacity
requirements.

Equivalent Erlangs (II)
 Assume that two services share resources.

 Service 2: three unit resources/connection, 6 Erlangs
 If service 1 is taken as the measurement benchmark, the total traffic
volume for the two services is equivalent to 30 Erlangs.
 A 30-Erlang traffic volume requires 39 unit resources to meet the
blocking rate of 2%.
 If service 2 is taken as the measurement benchmark, the total traffic
volume for the two services is equivalent to 10 Erlangs.
 A 10-Erlang traffic volume requires 17 unit resources (equivalent to
51 unit resources of service 1) to meet the blocking rate of 2%.
The forecast results

do not match!

Campbell’s Theorem (I)
 The Campbell’s Theorem sets up a kind of combined distribution.
(Ci  ai ) 
Capacity  OfferedTraffic 
c c
 Erlangs  ai
2
v
c  i
  Erlangs  a
i
i
 Where:
 ai indicates the service amplitude, that is, the channel resources

required for a single link of the service.
  indicates the mean value, and v indicates the variance.

Campbell’s Theorem (II)
 Assume that two types of services share resources
 Service 1: one unit resource/connection.12 Erlang

 Service 2: three unit resources/connection.6 Erlang
 The system mean value is
   Erlangs  ai  112  3  6  30
 The system variance is
v   Erlangs  ai  12 12  6  32  66
2
 The capacity factor c is 1
c  v  30
66
 2.2

Campbell’s Theorem (III)
 Combined traffic is calculated as follows:
30 
OfferedTraffic    13.63
c 2.2
 A capacity of 21 resources is required to meet the blocking rate of 2%.
 For the target services that meet a same Grade of Service (GoS), the
capacity required is as follows (based on the unit resource of service 1):
 Target service 1: C1 = (2.2 x 21) + 1 = 47
 Target service 2: C2 = (2.2 x 21) + 3 = 49
For a same GoS, different services require different capacities.

For a given capacity, the GoSs of different services differ slightly.

Comparison Between Common Capacity Design
Methods
 Post Erlang-B
 Service 1 (one unit resource/connection, 12 Erlangs) and service 2

(three unit resources/connection, 6 Erlangs) require 55 unit
resources in total.
 Equivalent Erlangs
 As calculated based on service 1 (one unit resource/connection, 12

Erlangs), a total of 39 unit resources are required.
 As calculated based on service 2 (three unit resources/connection,
6 Erlangs), a total of 51 unit resources are required.
 Campbell’s Theorem
 Under the same conditions, 47 to 49 unit resources are required in

total.

Questions
1. What are the factors that restrict the network

capacity?
2. What are the common methods for estimation of the
multi-service capacity?

Summary
 This chapter describes three methods for the estimation of the multi-
service capacity.
 This chapter details the process of calculating the capacity with the
Campbell’s theorem.

Contents
1. Traffic Model

5 Network Estimation Procedure
 Capacity dimensioning ideas
 Determining the Service Model
 Determining the QoS

Capacity Dimensioning Ideas
 Based on traffic distribution and geographical features, divide the
areas to be planned into dense urban areas, ordinary urban areas,
suburban areas, and rural areas.
 Perform traffic model analysis for all target areas.
 Based on the traffic models in different target areas, determine

the single-TRX planning capacity of each target area.
 Determine the NodeB quantity and TRX quantity in the target
areas that meet the capacity requirements.
 Compare the NodeB quantity and TRX quantity determined
based on the capacity requirements with those based on the
coverage requirements. Select the larger NodeB quantity and
TRX quantity to meet the capacity and coverage requirements at
the same time.

Determining the Service Model
 Subscriber distribution data
Subscribers Distributed in Different Scenarios

(Number of Subscribers/km2)
Application 2003 2004 2005
Scenario
Dense Urban 11128 12060 18683
Common Urban 462 499 676
Suburban 246 266 341
Rural 15 16 18
Road/Main Road 23 35 48

Determining the Service
Model
 Proportion of subscribers at different levels
Proportion of Subscribers at Different Levels

(Consider This in Combination with the Time)
Application High-end Mid-end Low-end

Scenario
Dense 40% 40% 20%

urban
Common 15% 25% 60%
urban
Suburban 5% 25% 70%
Rural 1% 10% 89%
Road/Main 1% 10% 89%
road

Determining the Service Model – CS Service Model
Mean
Service Penetration Activation
BHCA AHT (s) Rate
Type Rate Factor
(kbit/s)
AMR
100 % 1 90 0.5 8
speech
Video
100 % 0.1 54 1 64
phone

Determining the Service Model – PS Service
Model of Low-end Subscribers
Inter-Arrival
Penetr Packet Call Packet Packet
Service Time Between
ation BHSA Number/Se Number/Pa Size
Type Packet Calls
Rate ssion cket Call (bytes)
(sec)
Email 10 % 0.10 2 32 480 320

Internet 30 % 0.18 5 25 480 412
Online
25 % 0.10 2 3 480 8
game, ICQ
Picture
and ring
25 % 0.10 2 62 480 5
downloadi
ng, FTP
Real-time
0% 0.00 1 267 1500 0
video
SMS 50 % 0.50 1 1 160 0
EMS /
50 % 0.50 2 32 480 320
MMS

Model of Mid-end Subscribers
Inter-
Packet Arrival
Packet Packet
Service Penetrati Call Time
BHSA Number/P Size
Type on Rate Number/S Between
acket Call (bytes)
ession Packet
Calls (sec)
Email 20 % 0.20 2 32 480 320
Internet 30 % 0.24 5 25 480 412
Online
game, 15 % 0.20 2 3 480 8
ICQ
Picture
and ring
15 % 0.20 2 62 480 5
download
ing, FTP
Real-time
10 % 0.10 1 267 1500 0
video
SMS 100 % 0.80 1 1 160 0
EMS /
100 % 0.80 2 32 480 320
MMS

Model of High-end Subscribers
Inter-
Packet Arrival
Packet Packet
Service Penetrati Call Time
BHSA Number/P Size
Type on Rate Number/S Between
acket Call (bytes)
ession Packet
Calls (sec)
Email 30 % 0.30 2 32 480 320
Internet 20 % 0.30 5 25 480 412
Online
game, 5% 0.30 2 3 480 8
ICQ
Picture
and ring
10 % 0.30 2 62 480 5
download
ing, FTP
Real-time
20 % 0.20 1 267 1500 0
video
SMS 100 % 0.60 1 1 160 0
EMS /
100 % 0.60 2 32 480 320
MMS

Determining the Service Model – PS Traffic Model
Parameters
 With the data service models of various user types, we can obtain the
traffic model parameters for calculation.
 Busy hour throughput per subscriber (kbit) = Penetration rate of low-
end subscribers x Busy hour throughput per low-end subscriber x
Proportion of low-end subscribers + Penetration rate of mid-range
subscribers x Busy hour throughput per mid-range subscriber x
Proportion of mid-range subscribers + Penetration rate of high-end
subscribers x Busy hour throughput per high-end subscriber x
Proportion of high-end subscribers
 Theoretical length of a session (bytes) = Packet Call Num/Session x
Packet Num/Packet Call x Packet Size (bytes)
 Average reading time (s) = (Packet Call Num/Session-1) x Inter-Arrival
Time Between Packet Calls (s)

Determining the QoS
Capacity dimensioning determines the capacity under certain QoS
conditions. CS services generally take the call loss or blocking rate to
evaluate the GoS. PS services generally take the acceptable time delay or
acceptable minimum throughput to evaluate the GoS. In the tender
documents of operators, the GoS of PS services is sometimes described
as call loss.

Determining the QoS
Requirements for the blocking rate
Blocking Voice SM MM Video Audio Video Video Internet Emai

Rate Service S S Stream Stream Phone Conference l
Dense
urban
Common
urban
Suburban
Rural
Road/mai
n road

Contents
1. Traffic Model

Transmit Diversity
 The transmit diversity can increase the downlink capacity

and coverage.
 Conclusion on capacity improvement through the transmit

diversity
 STTD mode: capacity increase by 17% to 24%
 TxAA(1) mode: capacity increase by 16% to 23%
 TxAA(2) mode: capacity increase by 31% to 37%

Sectorization
 In dense urban areas and ordinary urban areas with high traffic,
increasing the sectors in a NodeB helps increase the capacity.
 A six-sector NodeB generally uses the antennas with the horizontal lobe
33º.
 The capacity of a 6-sector NodeB is 1.67 times as large as that of a three-
sector NodeB.
 Capacity enhancement technologies of GSM

 Division of cells
 Closer frequency reuse
 Adding micro-cellular devices
 Extended frequency bands
 CoBCCH
 Half rate

Comparison Between GSM Capacity Expansion
and WCDMA Capacity Expansion
GSM capacity expansion
If capacity expansion is required for the network in future, you only need to
allocate new channels to the corresponding cells. Other changes are not needed
on the network as long as the expansion does not exceed the maximum capacity
(determined by the frequency resources and frequency reuse) of cells. Otherwise,
new NodeBs or sectors must be added with frequency planning.
WCDMA capacity expansion
The handover between different frequencies (or between the TRXs in a same
sector) in the WCDMA system is hard handover, which requires you to enable the
compression mode and occupies huge system resources. Therefore, the capacity
expansion of the WCDMA system is not as simple as that of the GSM system,
which can be implemented through additional TRXs to the corresponding cells.
The method of dividing cells for capacity expansion also costs a lot. In the early
phase of capacity dimensioning, a signal margin must be determined to serve as
a compensation for interference in the case of traffic increase during the
calculation of the cell area.

Thank You!
www.huawei.com

GSM-To-UMTS Training Series 03 - WCDMA Radio Network Capacity Dimensioning - V1.0

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

GSM-To-UMTS Training Series 03 - WCDMA Radio Network Capacity Dimensioning - V1.0

Загружено:

Авторское право:

Доступные форматы

Security Level:

WCDMA Radio Network

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential

2008-10-31 1.0 Draft completed. Zang Liang

2008-12-31 1.1 Added comparison of the capacity dimensioning of Zhang Bibo

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 2

 WCDMA is a self-interference system.

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 3

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 4

 Understand the parameters of 3G traffic model

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 5

2. Uplink capacity analysis

3. Downlink capacity analysis

4. Multi-service capacity estimation

5. Network estimation procedure

6. Capacity enhancement technologies

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 6

 1.1 Overview of Traffic Model

 1.2 CS Traffic Model

 1.3 PS Service Model

 1.4 PS Traffic Model Parameters

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 7

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 8

Data integrity must be maintained in request-response Web page

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 9

 To determine the system configuration, calculate the call capacity of air

 To determine the system capacity. In data applications, different

transmission models lead to different system capacities.

 -To plan the network properly by establishing a data transmission model

that meets the customer’s expectations.

Traffic models are provided by telecom operators. If a telecom operator

planning upon the approval of the telecom operator.

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 10

 A traffic model deals with the capacity features of each service

 In data applications, the subscriber behavior research predicts

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 11

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 12

 Typical service features include the following feature

 QoS requirements of the service

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 13

 1.1 Overview of Traffic Model

 1.2 CS Traffic Model

 1.3 PS Service Model

 1.4 PS Traffic Model Parameters

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 14

 A typical CS service is the voice service. The arrival of the CS

subscribers takes on a Poisson distribution, while the interval

takes on a negative exponential distribution.

 Related parameters of the model:

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 15

 Mean busy-hour traffic per user (Erlang) = (BHCA x Mean call

duration x activation factor x Mean rate of service (kbps)

 Mean busy-hour throughput per user (bps) (H) = (Mean busy-hour

throughput per user x 1000)/3600

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 16

 1.1 Overview of Traffic Model

 1.2 CS Traffic Model

 1.3 PS Service Model

 1.4 PS Traffic Model Parameters

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 17

model described in ETSI UMTS30.03.

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 18

HUAWEI TECHNOLOGIES CO., LTD. HUAWEI Confidential Page 19