OWJ100102 WCDMA Capacity Planning

7/24/2019 OWJ100102 WCDMA Capacity Planning

http://slidepdf.com/reader/full/owj100102-wcdma-capacity-planning 1/96

ISSUEISSUE

CDMA Radio Network

CDMA Radio Network

Capacity Planning

apacity Planning

1.01.0



为机密，未经许可不得扩散文档密级：内部公开

WCDMA System Capacity Characteristics

WCDMA is a self-interfering system

WCDMA system capacity is closely related to coverage

WCDMA network capacity has the soft capacity feature

The capacity planning of the WCDMA network is

performed under a certain traffic model




Course Objective

Grasp the parameters of 3G traffic model

nderstand the factors that restrict the

WCDMA network capacity

nderstand the methods and procedures

of estimating multi-service capacity

nderstand the key technologies for

enhancing network capacity

After this session, you will:




Contents of Course

Training!huawei!com

Chapter 1 Traffic Model

Chapter 2 Uplink capacity analysis

Chapter 3 ownlink capacity analysis

Chapter ! "ulti#ser$ice capacity esti%ation

Chapter & 'etwork esti%ation proce(ure

Chapter ) Capacity enhance%ent

technolo*ies





1 Overview of traffic model 1 Overview of traffic model

2 CS traffic %o(el

3 +S traffic %o(el (ia*ra%

! +S traffic %o(el para%eters




Service Overview

The WCDMA system supports multiple services

"aria#le-rate services

Com#ined services

$igh-speed data packet services

Asymmetrical services

%arge-capacity and fle&i#le service #earing


http://slidepdf.com/reader/full/owj100102-wcdma-capacity-planning 7/96 为机密，未经许可不得扩散文档密级：内部公开

os Type' e a

l - t i m e c a t e g or y

con$ersational

It is necessary to %aintain the ti%e

relationship etween the infor%ationentities in the strea%. S%all (elay

tolerance, re-uirin* (ata rate sy%%etry .

oice

ser$ice,$i(eophone

Strea%in*

/ypically uni(irectional ser$ices, hi*h

re-uire%ents on error tolerance, hi*h

re-uire%ents on rate

Strea%in*

%ulti%e(ia

(

onr e al - t i m e c a t

e g or y

Interacti$e

e-uest#response %o(e, (ata

co%pleteness %ust e %aintaine(. i*h

re-uire%ents on error tolerance, lower

re-uire%ents on (elay tolerance

e pa*e

rowse,

network

*a%e

ack*roun(

ata co%pleteness shoul( e %aintaine(.

S%all (elay restriction, re-uirin*errorless trans%ission

ack*roun(

(ownloa( ofE%ail.



Objectives of Settin! "p Traffic Model

In or(er to (eter%ine the syste% confi*uration, we nee( toIn or(er to (eter%ine the syste% confi*uration, we nee( to

(eter%ine the call capacity of the air interface first.(eter%ine the call capacity of the air interface first.

In the (ata ser$ice, (ifferent trans%ission %o(el will *enerateIn the (ata ser$ice, (ifferent trans%ission %o(el will *enerate

(ifferent syste% capacities.(ifferent syste% capacities.

e nee( to set up an e4pecte( (ata trans%ission %o(el of thee nee( to set up an e4pecte( (ata trans%ission %o(el of the

custo%er so that we can plan the network properly.custo%er so that we can plan the network properly.

In or(er to set up a correct %o(el, the operator shoul( pro$i(eIn or(er to set up a correct %o(el, the operator shoul( pro$i(e

so%e statistic para%eters as a reference.so%e statistic para%eters as a reference.



Traffic model is a means of researching the capacity featuresof each service type and the )o* e&pected #y the users who

are using the service from perspective of data transmission!

+n the data application, the user #ehaviour research mainly

forecasts the service types availa#le from the 3G, the num#er

of users of each service type, freuency of the users in using

the service, and the distri#ution of the users in different

regions!

Traffic Model



Syste% Confi*uration

User eha$iour

Ser$ice +attern

Traffic

Model

'esults

The Contents of Traffic Model



Typical Service #eatures Description

/ypical ser$ice features inclu(e the followin*/ypical ser$ice features inclu(e the followin*

feature para%eters:feature para%eters:

User type 5in(oor, insi(e $ehicle, out(oor6

User7s a$era*e %o$in* spee(

SS /ype

Uplink an( (ownlink ser$ice rates

Sprea( factor

Si*nal (elay re-uire%ents of the ser$ice

8oS re-uire%ents of the ser$ice8oS re-uire%ents of the ser$ice




1 9$er$iew of traffic %o(el

2 CS traffic model 2 CS traffic model





CS Traffic Model"oice service is representative of C* services! "oice user

arrival takes on the .oisson distri#ution! +ts time interval takes

on the e&ponent distri#ution!

/ey parameters of the model0

+enetratin* rate

CA "ean usy#hour call atte%pts

"ean call (uration 5s6

Acti$ation factor

"ean rate of ser$ice 5kps6



CS Traffic Model $arameters

Mean #usy-hour traffic 12rlang per user 4 5$CA 6 mean

call duration 73899

Mean #usy hour throughput per user 1k#it 1G 4 5$CA 6

mean call duration 6 activation factor 6 mean rate

Mean #usy hour throughput per user 1#ps 1$ 4 mean

#usy hour throughput per user 6 :99973899






2 CS traffic %o(el

3 PS traffic model diagram3 PS traffic model diagram





$S Traffic Model/he %ost fre-uently use( %o(el is the packet ser$ice session process %o(el (escrie( in E/SI/he %ost fre-uently use( %o(el is the packet ser$ice session process %o(el (escrie( in E/SI

U"/S30.03.U"/S30.03.






2 CS traffic %o(el


4 PS traffic model parameters4 PS traffic model parameters




$S Traffic Model

ata urst ata urst ata urst

+acket Call

Session

+acket Call +acket Call

ownloa(in* ownloa(in*

Acti$e or%ant or%ant Acti$e




/raffic %o(el

$S Traffic Model $arameters

+acket Call 'u%Session

+acket 'u%+acket Call

+acket Si;e5ytes6

ea(in* /i%e 5sec6

/ypical ear ate5kps6

<E




$arameter Determinin!

/he asic para%eters in the traffic %o(el are (eter%ine( in the followin*/he asic para%eters in the traffic %o(el are (eter%ine( in the followin*

ways:ways:

9tain nu%erous asic para%eter sa%ple (ata fro% the actually

operatin* network.

9tain the proaility (istriution of the para%eters throu*h

processin* of the sa%ple (ata.

/ake the (istriution %ost pro4i%ate to the stan(ar( proaility as

the correspon(in* para%eter (istriution throu*h co%parison with

the stan(ar( (istriution function.




/ypical ear ate5kps6/ypical ear ate5kps6 ：：

ear rate is $ariale in the actual trans%ission process.

<E:<E:

In the +S ser$ice, when calculatin* the (ata trans%ission ti%e,

the retrans%ission cause( y erroneous locks shoul( e

consi(ere(. Suppose the (ata -uantity of ser$ice source is ',

the air interface lock error rate is <E, the total re-uire(

(ata -uantity to e trans%itte( $ia the air interface is:

$S Traffic Model $arameters

N BLER

BLER N BLER N BLER N BLER N N n*

1

1****

32

−=+++++




User eha$iour

+enetratin* ate

SA

User istriution 5i*h,

"e(iu%, <ow en(6

$S "ser %ehaviour $arameters




$S "ser %ehaviour $arameters+enetratin* ate+enetratin* ate ：：

/he percenta*e of the users that acti$ates this ser$ice to all the

users re*istere( in the network.

SASA ：： /he ti%es of sin*le#user usy hour sessions of this ser$ice

User istriutionUser istriution 1$igh, Medium, %ow end

/he users are (i$i(e( into hi*h#en(, %i(#en( an( low#en( users.

ifferent operators an( (ifferent application situations will ha$e

(ifferent user (istriutions.




SessionSession traffic $olu%etraffic $olu%e （（ yteyte ））： Average traffic of single

session of the service

ata trans%ission ti%e 5s6ata trans%ission ti%e 5s6 ： The time in a single session of

service for purpose of transmitting data!

ol(in* /i%eol(in* /i%e （（ ss ））： Average duration of a single session of

service

$S Traffic Model Derivative $arameters

eTypicalRat

fficVolumeSessionTra

BLER sissionTime DataTransm

1000/8**

1

1)(

−=

)(

Re*)1/(

sissionTime DataTransm

adingTimeSessionlNum PackketCal

e HoldingTim

+

−

=

)/(*)/(*)( Session Num PacketCall PacketCall PacketNum PacketSize fficVolumeSessionTra =




Activation factor0 The weight of the time of service full-rate

transmission among the duration of a single session!

5usy hour throughput per user 1/#0

e HoldingTim

issionTime DataTransmor cti!e"act =

1000/8**/ fficVolumeSessionTra BHSuser roug#put BusyHourT# =

$S Traffic Model Derivative $arameters




Traffic Model &'ample

9

%oile$i(eo

strea%s

+enetratin* rate

SA

usy our

/hrou*hputu

ser 5kit6

/ypical

earrate

5kps6

<E Acti$ation factor

Uplink ;;!9< 9!:99 2.30! = :9< 0.1=>?

ownlink ;;!9< 9!:99 102.&2? 8> :9< 1.0000

9

%oile

$i(eo

strea%s

+acket

Call

'u%Ses

sion

+acket

'u%+ac

ket Call

+acket Si;e

5ytes6

ea(in

* /i%e

5sec6

Sessio

n traffic

$olu%e

yte

ol(in*

/i%e

Uplink ; 3 >=9 :>!8999 2??0 1=.?000

ownlink : ;8? >=9 9!9999 12?1)0 1=.?000

)3600

( _ ∑⋅⋅

⋅⋅=or cti!e"act redRateTypicalBea

nE!iroment pplicatioderTypical roug#put$n BusyHourT# gRate Penetratin$ser %fDiffrent Percentage Erlang Data




uestions

What are the two parts that make up thetraffic model@

What are the main parameters of the C*

traffic model@

What are the main parameters of the .*

traffic model@

What is the formula for calculating the

euivalent 2rlang of data service@




Summary of This Chapter

This chapter deals with the topic of traffic model

Main parameters of traffic model for C* service

*tructure and main parameters of .* traffic model,

and the corresponding derivative parameters

Method of calculating euivalent 2rlang of data

service




Contents of Course

Training!huawei!com

Chapter 1 /raffic "o(el

Chapter 2 Uplink capacit analsis





technolo*ies




%asic $rinciples

The radio system capacity is decided #y uplink and

downlink! When planning the capacity, we must analye from#oth uplink and downlink perspectives!

+n the WCDMA system, all the cells share the same

spectrum, which is conducive to improving the WCDMA systemcapacity! $owever, for reason of co-freuency multiple&ing, the

system incurs interference #etween users! This multi-access

interference restricts the capacity in turn!




%asic $rinciples()nterference Analysis%asic $rinciples()nterference AnalysisInterference restriction %o(el

I/9/ @ Iown Iother +' /IIownown Interference fro% the users of this cellInterference fro% the users of this cell

IIotherother Interference fro% the users of a(Bacent cellInterference fro% the users of a(Bacent cell

++'' 'oise floor of recei$er 'oise floor of recei$er

// 9utsi(e interference9utsi(e interference

+ower restriction %o(el

+/9/ @ +pil +sync +pa* +traf +other

+pil+pil +ilot channel power +ilot channel power

+sync+sync Synchroni;ation channel power Synchroni;ation channel power

+pa*+pa* +a*in* channel power +a*in* channel power

+traf+traf /raffic channel power /raffic channel power

+other+other 9ther channel power 9ther channel power

i f A i i




N ot#er o&nT%T P ' ' ' ++=

"plin* )nterference Analysis("plin*

)nterference Composition

+own：

+nterference from the users of this cell +other ：

+nterference from users of adBacent cell

.(： (oise floor of the receiver

" li * ) f A l i " li *




'eceiver noise floor .(

.( 4 :9lg1/TW ＋ (

/ ： 5oltmann constant, 4 :!3=:9-;3 E7/

T ： /elvin temperature, normal temperature0 ;F9 /

W ： *ignal #andwidth, WCDMA signal #andwidth

3!=>M$

:9lg1/TW 4 -:9=d5m73!=>M$

( 4 3d5 1typical value of macro cell 5T*

.( 4 :9lg1/TW ( 4 -:9Hd5m73!=>M$



" li * ) f A l i " li *




+own 0+nterference from users of this cell

Interference that e$ery user %ust o$erco%e: I/9/ # + B

.B is the receiving power of the user B

Un(er the i(eal power control :

$ence, .B0

/he interference fro% users of this cell is the su% of power of

all the users arri$in* at the recei$er:

( ) ( (T%T

(

(

! R

)

'

P

No E*1

/ ⋅⋅=

∑= N

(o&n P ' 1



total

( ( (

( ' )

RV P

ρ =

" li * ) f A l i " li *




+other 0+nterference from users of adBacent cell

/he interference fro% users of a(Bacent cell is (ifficult to

analy;e theoretically, ecause it is relate( to user

(istriution, cell layout, an( antenna (irection (ia*ra%.

a(Bacent cell interference factor

hen the users are (istriute( e$enly

or o%ni(irectional cells, the typical $alue of a(Bacent cell

interference factor is 0.&&

or the 3#sector (irectional cell, the typical $alue of a(Bacent

cell interference factor is 0.)&

o&n

ot#er

' ' i =






Define

Then ( ) N

N

(T%T T%T P Li ' ' +⋅+⋅= ∑1

1

"plin* )nterference Analysis

( ) ( )

N

N T%T ( ( (*

N ot#er o&nT%T

P )

' R! N E i

P ' ' '

++=

++=

∑1

0/

1

( )

)

R! N E L

( ( (*

(

0/

=




I#tain

( ) ∑⋅+−

⋅= N

(

N T%T

Li

P '

1

11

1

Suppose( that:

All the users are 12.2

kps $oice users, the

(e%o(ulation threshol(

E'o @ &(

oice acti$ation factor $B

@ 0.)=

A(Bacent cell

interference factor

i @ 0.&&

"plin* )nterference Analysis




"plin* )nterference Analysis("plin* +oad #actor

Define the uplink load factor

When the load factor is :, I/9/ is infinite, and the

corresponding capacity is called Jthreshold capacityK!

nder the a#ove assumption, the threshold capacity isappro&! F8 users!

( ) ( ) ( )∑∑ ⋅+=⋅+=

N ( ( (*

N

($L)

R! N E i Li

1

0

1

/11η




"plin* )nterference Analysis(+oad #actor

and )nterference According to the a#ovementioned relationship, the noise will rise0

( )1

1 1

11 1

T%T

N

N $L (

' NoiseRise P

i L η

= = =−

− + ∑

50% %oad — 3dB

60% %oad — 4dB

75% %oad — 6dB




The a#ovementioned theoretic analysis uses the following

simplifying e&plicitly or implicitly0

'o consi(eration of the influence of soft han(o$er

/he users in the soft switch state *enerates the interference

which is sli*htly less than that *enerate( y or(inary users.

'o consi(eration of the influence of A"C an( hyri( ser$ice

A"C re(uces the $oice ser$ice rate of so%e users, an( %akes

the% *enerate less interference, an( increases the nu%er of

users supportale y the syste%. 5/he cost is the call -uality of

such users will e (eteriorate(6

ifference ser$ices ha$e (ifferent (ata rates an( (e%o(ulation

threshol(s. In principle, we can use the fore*oin* %etho( for

analysis, ut it will co%plicate the calculation process.

Since the ti%e#$ariale feature of the %oile trans%ission

en$iron%ent, the (e%o(ulation threshol( e$en for the sa%e

ser$ice is ti%e#$ariale.

"plin* )nterference Analysis(+imitation of

the Current Method

"plin* )nterference Analysis +imitation of




I(eal power control assu%ption

/he power control co%%an(s of the actual syste%ha$e certain error co(es so that the power control

process is not i(eal, an( re(uces the syste%

capacity

Assu%e that the users are (istriute( e$enly,

an( the a(Bacent cell interference is constant

Consi(erin* the ao$e factors, the syste%

e%ulation is a %ore precise %etho(:

Static si%ulation: "onteDCarlo %etho(

yna%ic si%ulation

"plin* )nterference Analysis(+imitation of

the Current Method




Contents of Course

Training!huawei!com



Chapter 3 !ownlink capacit analsis




technolo*ies




%asic $rinciples()nterference Analysis%asic $rinciples()nterference AnalysisInterference restriction %o(el

I/9/ @ Iown Iother +' /IIownown Interference fro% the users of this cellInterference fro% the users of this cell

IIotherother Interference fro% the users of a(Bacent cellInterference fro% the users of a(Bacent cell

++'' 'oise floor of recei$er 'oise floor of recei$er

// 9utsi(e interference9utsi(e interference

+ower restriction %o(el

+/9/ @ +pil +sync +pa* +traf +other

+pil+pil +ilot channel power +ilot channel power

+sync+sync Synchroni;ation channel power Synchroni;ation channel power

+pa*+pa* +a*in* channel power +a*in* channel power

+traf+traf /raffic channel power /raffic channel power

+other+other 9ther channel power 9ther channel power

Downlin* )nterference Analysis Downlin*




N ot#er o&nT%T P ' ' ' ++=

+own： +nterference from the users of this cell

+other ： +nterference from the users of adBacent

cell

.(： (oise floor of the receiver

Downlin* )nterference Analysis(Downlin*






'eceiver noise floor .(

.( 4 :9lg1/TW ＋ (

/ 5oltmann constant, 4 :!3=:9-;3 E7/

T /elvin temperature, normal temperature ;F9 /

W *ignal #andwidth, WCDMA signal #andwidth

3!=>M$

(0 'eceiver noise figure

:9lg1/TW 4 -:9=d5m73!=>M$

( 4 ?d5 （ 2 typical value ）

.( 4 :9lg1/TW ( 4 -:9:d5m73!=>M$







+own 0+nterference from users of this cell

The downlink users are identified with the mutually orthogonal

I"* codes! +n the static propagation conditions without multi-

path, no mutual interference e&ists!

+n case of multi-path propagation, certain energy will #e detected

#y the 'A/2 receiver, and #ecome interference signals! Define

the orthogonal factor L to descri#e this phenomenon!

+n the formula, .T is a total transmitting power of 5T*, which

includes the dedicated channel transmitting power and thecommon channel transmitting power

( ) ( )1 T o&n ( (

(

P '

PLα = − ×

∑+= N

(CCH T P P P 1






+other 0 +nterference from users of adBacent cell

The transmitting signal of the adBacent cell 5T* will cause

interference to the users in the current cell! *ince the

scram#les in use are different, such interference is non

orthogonal!

Assume the service is distri#uted evenly, the transmitting

power of all 5T*s will #e eual! k,B +n the system, there are /

adBacent cell 5T*s, where path loss from the num#er k 5T*

to the user B is PLk,B! $ence we o#tain0

( ) ∑⋅= +

(k

T (ot#er PL

P ' 1 ,

1

下行干扰分析

,,,,下行干扰

行干扰构成




下行干扰分析

( ) N

+

(k

T

(

T (

N ot#er o&nT%T

P PL

P PL P

P ' ' '

+⋅+⋅−=

++=

∑1 ,

11 α

Suppose the power control is (esire(, we otain

( )( ) ( ( (T%T

(

(

(! R

)

'

PL P

E*!sNo1

⋅⋅=

Then

( ) ( ) ( (T%T (

(

( ( PL ' !)

R E*!sNo P ⋅⋅⋅⋅=




5ecause ∑+= N

(CCH T P P P 1

Then

( ) ( )

( ) ( )

( ) ( )

⋅+⋅+⋅−⋅

⋅⋅+=

+⋅+⋅−⋅

⋅⋅⋅+=

⋅⋅⋅⋅+=

∑∑

∑∑

∑

( N

+

(k

(

T T (

N

(

(

(CCH

N

+

(k

T

(

T (

N

( (

(

(CCH

N

( (

T%T (

(

(CCH T

PL P

PL

PL P P !

)

R E*!sNo P

P PL

P PL

P PL!

)

R E*!sNo P

PL ' !)

R E*!sNo P P

1 ,1

1 ,1

1

1

11

α

α

下行干扰分析




'esolve .T to o#tain

( )

( ) ( )

∑

∑

⋅⋅⋅+−−

⋅⋅⋅⋅+

= N

(

(

( ( (

N

( (

(

( N CCH

T

!)

R E*!sNoi

PL!)

R E*!sNo P P

P

1

1

11 α

where i B is the adBacent cell interference factor of the user,

defined as0

∑= +

(k

(

( PL

PLi1 ,

下行干扰分析




According to the a#ove analysis, we can define the

downlink load factor0

When the downlink load factor is :99<, the transmitting

power of the 5T* is infinite, and the corresponding

capacity is called Jthreshold capacityK!

As different from the theoretic calculation of uplink

capacity, LB and iB in the downlink capacity formula are

varia#le related to user position! (amely, the downlink

capacity is related to the spatial distri#ution of the users,

and can only #e determined through system emulation!

( ) ( )∑

⋅⋅⋅+−=

N

(

(

( ( ( DL !)

R E*!sNoi

1

1 α η

Downlin* )nterference Analysis

Downlin* )nterference Analysis &mulation




Downlin* )nterference Analysis(&mulation

$arameter Settin!






-esult





When the transmitting power of the 5T* is >3d5m 1;9W,

the supported ma&imum num#er of users is appro&! ::>!

+n order to ensure system sta#ility, we do not allow themean transmitting power of the 5T* to #e more than =9<

of the ma&imum transmitting power, namely, >;d5m! This

way, the supported num#er of users is ::;!


-esult Analysis




.ow to Control )nterference.ow to Control )nterference

+nfluence from interference in the network $andover *ucceeded$andover *ucceeded

Access efficiency Access efficiency

Call Drop 'atioCall Drop 'atio

Call ualityCall uality

+nterference control method +mprove the power control precision+mprove the power control precision

+mprove the receiving efficiency of 'ake+mprove the receiving efficiency of 'ake

'easona#le network planning'easona#le network planning




Contents of Course

Training!huawei!com




Chapter 4 M"lti#service capacit estimation



technolo*ies




Chapter / Multi,service capacity estimation

1 $etwork capacit restriction1 $etwork capacit restriction

factorsfactors 2 /ypical capacity (esi*n

%etho(s




Capacity -estriction #actors

/he C"A network capacity restriction factors in the/he C"A network capacity restriction factors in the

ra(io network part contain the followin*:ra(io networ k part contain the followin*:

Uplink interference

ownlink power

ownlink channel co(e resources

Channel processin* unit

Iu interface capacity




Downlin* Transmittin! $ower

∑+= N

(CCH T P P P 1

The downlink transmitting power comes in two parts0 one part is used

for common channel, and the other part for dedicated 1traffic channel!

The transmitting power allocated

#y the cell to each user varies

with service demodulation

threshold, propagation path loss

and the interference received #y

the user

The downlink transmitting power of the cell is shared #y all the users in

the cell

We generally use the emulation method to analye the downlink

interference!




Downlin* Channel Code -esources/he C"A network use the co(e

wor(s whose S is !&12. /he

s%aller the S is, the hi*her the

supporte( (ata rate will e.

In the co(e tree, the allocale co(es

shoul( %eet the followin* con(itions:

'o co(es on the path fro% this co(e

to the root no(e of co(e tree are

allocate(

'o co(es in the su#tree whose root

no(e is this co(e are allocate(

/ry to reser$e the co(e wor(s whose

S is s%all, so as to i%pro$e the

utili;ation.

1

1 -1

1 1

1 1 1 1

1 1 -1 -1

1 -1 1 -1

1 -1 -1 1

C1,0

C2,0

C2,1

C4,0

C4,1

C4,2

C4,3

SF = 1 SF = 2 SF = 4

1

1 -1

1 1

1 1 1 1

1 1 -1 -1

1 -1 1 -1

1 -1 -1 1

C1,0

C2,0

C2,1

C4,0

C4,1

C4,2

C4,3

SF = 1 SF = 2 SF = 4




Downlin* Channel Code -esources

ollowin* is an e4a%ple of co(e 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

┃ ┗ 1 ┫

┃ ┗━!3

┏ 0 ┫

┃ ┗━!1

┏ 0 ┫

┃ ┗━!1

┃

┗━!1

┏━!2

┃

┗━!3




Channel $rocessin! "nit 0C&

/he channel processin* unit is the -uantitati$e (ata that %easures

the resources lo*ically occupie( for ser$ice processin*./he resource occupie( y the se$ice processin* is %ainly relate(

to the sprea(in* factor of this ser$ice. /he s%aller the S is, the

*reater the (ata traffic will e, an( %ore resources will e occupie(.

/he S of typical ser$ices are: A"12.2kps S@12?

CS)!kps S@32

+S)!kps S@32

+S1!!kps S@1) +S3?!kps S@?




Channel $rocessin! "nit 0C&

If we (efine the resources re-uire( for processin* A"

12.2kps ser$ices as a channel processin* unit, the nu%er ofchannel processin* units occupie( y other ser$ices is:

A"12.2kps 1

CS)!kps !

CS1!!kps ?

CS3?!kps 1)

+S)!kps !

+S1!!kps ?

+S3?!kps 1)




)ub )nterface Capacity/he contents trans%itte( on the

Iu interface inclu(e:

The user data encapsulated in the

AA%; format 1common channel and

dedicated channel

*ignaling data encapsulated in the

AA%H format

5T* operation maintenance data

actors to e consi(ere( when esti%atin* the interface capacity:

rame coding efficiency! Through segmentation and encapsulation of the application

data at each layer, the data uantity at the #ottom layer will #e increased to different

e&tents compared with the application data at the upper layers!

Traffic! More users will generate more data traffic!

Maintenance efficiency! Certain #andwidth is reuired in the #ackground maintenance

for 5T* data transmission!

C / i i i i i




Chapter / Multi,service capacity estimation

1 'etwork capacity restriction

factors

2 Tpical capacit design2 Tpical capacit design

methodsmethods




The 2rlang-5 formula is used for

estimating the peak traffic thatmeets certain call loss rate when

the average traffic 12rlang is

given!

The 2rlang-5 formula is only used

for

Circuit switche( ser$ices

Sin*le ser$ice

/he C"A syste% pro$i(es

CS an( +S (o%ain %ulti#

ser$ices

&rlan!,% #ormula 0)




The prereuisite of the 2rlang-5 is the reuests of resources

take on a .oisson distri#ution, namely, its variance is eual to

its mean value!

+f, when a service esta#lishes a link, the service reuires the

resources which are more than the unit resources, the

resource reuest is no longer eual to its mean value, and the

2rlang-5 formula is not applica#le in this case!

Comparison of multi-service capacity estimation methods 0

.ost 2rlang-5

2uivalent 2rlangs

Camp#ellNs Theorem

&rlan!,% #ormula 0))

$ost &rlan! %




$ost &rlan!,%（!

5y summing up the

capacities reuired for

different services, we

o#tain the capacities

reuired for the com#ined

services!

(o consideration of the

resource efficiency ofdifferent services




Consi(er that two ser$ices share resourcesConsi(er that two ser$ices share resources

Ser$ice 1: 1 unit resourceconnection.12 Erlan*

Ser$ice 2: 3 unit resourcesconnection.) Erlan*

Calculate capacity re-uire( for each ser$iceCalculate capacity re-uire( for each ser$ice

Ser$ice 1: 12 Erlan*s re-uire 1> connections 51> unit

resources6, %eetin* the 2F lockin* rate

Ser$ice 2: ) Erlan*s re-uire 12 connections 5e-ui$alent to

the 3) unit resources of ser$ice 16, %eetin* the 2F lockin*

rate

/otal && unit resources

$ost &rlan!,% 0))

$ & l % 0)))




Post %rlang#& overestimates

the capacit re'"irements(

Consi(er that two ser$ices use the sa%e resourcesConsi(er that two ser$ices use the sa%e resources

Ser$ice 1: 1 unit resourceconnection.12 Erlan*

Ser$ice 2: 1 unit resourceconnection.) Erlan*

Calculate capacity re-uire( for each ser$iceCalculate capacity re-uire( for each ser$ice

Ser$ice 1: 12 Erlan*s re-uire 1> connections, %eetin* the 2F

lockin* rate

Ser$ice 2: ) Erlan*s re-uire 12 connections, %eetin* the 2F

lockin* rate

/otal 31 unit resources

owe$er, the reasonale results shoul( e: 1? Erlan*sowe$er, the reasonale results shoul( e: 1? Erlan*s

re-uire 2) connections for %eetin* the 2F lockin* rate.re-uire 2) connections for %eetin* the 2F lockin* rate.

$ost &rlan!,% 0)))

& i l & l 0)




&2uivalent &rlan!s 0)

5y converting the

#andwidth from one serviceto another service, com#ine

different services and then

calculate the reuired

capacity!*electing different services

as the measurement

#enchmark will lead to

different capacityreuirements!

& i l t & l 0))




Consider that two services share resources

Ser$ice 1: 1 unit resourceconnection.12 Erlan* Ser$ice 2: 3 unit resourcesconnection.) Erlan*

+f using service : as measurement #enchmark, the two

services are euivalent to 39 2rlangs in total!

30 Erlan*s re-uire 3> connections 53> unit resources6,

%eetin* the 2F lockin* rate

+f using service ; as measurement #enchmark, the two

services are euivalent to :9 2rlangs in total!

10 Erlan*s re-uire 1= connections 5e-ui$alent to &1 unit

resources of ser$ice 16, %eetin* the 2F lockin* rate

/he pre(ication results

are not uni-ueG

&2uivalent &rlan!s 0))

C b ll3 Th 0)




Campbell3s Theorem 0)

The Camp#ell theorem sets up a com#ined distri#ution

$ere0

is ser$ice a%plitu(e, na%ely, the channel resources

re-uire( for a sin*le link of the ser$ice.

is the %ean $alue, $ is the $ariance.

c ffic%fferedTra

α =

c

aC Capacity ii )( −

=

∑

∑

×

×

==i

i

i

i

a Erlangs

a Erlangs!

c

2

α

ia

α

C b ll3 Th 0))




Consider that two services share resources

*ervice :0 : unit resource7connection!:; 2rlang

*ervice ;0 3 unit resources7connection!8 2rlang

The system mean value is

The system variance is

The capacity factor c is

Campbell3s Theorem 0))

3063121 =×+×=×= ∑ ia Erlangsα

2.230

66 === α

!c

6636112 222=×+×=×=∑ ia Erlangs!

C b ll3 Th 0)))




Campbell3s Theorem 0)))Com#ined traffic is0

The num#er of connections for meeting the #locking rate of

;< is ;:

or the target services that meet the same Go*, the capacity

reuired is 1calculated on the #asis of the unit resource of

service :

Goal is service :0 C: 4 1;!;;: : 4>?

Goal is service ;0 C; 4 1;!;;: 3 4>F

)or different services* the same +oS re'"ires different capacities,

)or the given capacit* the +oS of different services will differ slightl,

63.132.2

30 ===c

ffic%fferedTra α

The comparison of the different capacity




method.ost 2rlang-5

Ser$ice 1 51 unit resourceconnection, 12Erl6 an( ser$ice 2

53 unit resources connection, )Erl6, re-uirin* && unit

resources in total

2uivalent 2rlangs

Calculate( accor(in* to ench%ark of ser$ice 1 51 unit

resourceconnection, 12Erl6, a total of 3> unit resources are

re-uire(

Calculate( accor(in* to ench%ark of ser$ice 2 53 unit

resourcesconnection, )Erl6, a total of &1 unit resources are

re-uire(

Camp#ellNs Theorem

In the sa%e con(itions, !=!> unit resources are re-uire(

in total.

S f Thi Ch t




Summary of This Chapter

This chapter deals with the three methods of estimating the

multi-service capacity!

The detailed process of using the Camp#ell theorem to

calculate the capacity is descri#ed!

Contents of Co rse




Contents of Course

Training!huawei!com





Chapter - $etwork estimation proced"re


technolo*ies

Chapter 4 5etwor* estimation procedure




Chapter 4 5etwor* estimation procedure

"in( trace of capacity

plannin*

eter%ine the traffic %o(el

eter%ine the 8oS

Mind trace of capacity plannin!




i$i(e the ;ones for the re*ion un(er plannin* accor(in* to

the traffic (istriution an( clutter features, e.*., (ense ;one,

or(inary uran ;one, suurs, rural areas "

+erfor% traffic %o(el analysis on the tar*et ;ones

eter%ine the sin*le#carrier plannin* capacity of each tar*et

;one accor(in* to the traffic %o(el of each specific tar*et

;one.

eter%ine the nu%er of /Ss an( carriers for the tar*et

;ones for %eetin* the capacity re-uire%ents.

eter%ine the nu%er of /Ss an( carriers accor(in* to the

capacity an( co$era*e re-uire%ents, an( select %ore /Ssan( carriers to ensure %eetin* oth capacity an( co$era*e

re-uire%ents.

Mind trace of capacity plannin!

D t i th T ffi M d lD t i th T ffi M d l




Determine the Traffic ModelDetermine the Traffic Model

eter%ine the /raffic "o(el

User (istriution (ata sheet : （ user -uantity 6*m7）

Applicationen$iron%ent

7884 7889 788:

ense uran area 11128 12060 18683

uran area 462 499 676

Suurs 246 266 341

ural areas 15 16 18

oa(strunk roa(s 23 35 48






Distri#ution percentage of users of different grades

istriution percenta*e of users of (ifferent *ra(es: 5suBectto consi(eration of each specific perio(6

Applicationen$iron%ent

i*h#en( user "i(#en( user <ow#en( user

ense uranarea

40% 40% 20%

9r(inaryuran area

15% 25% 60%

Suurs 5% 25% 70%

ural areas 1% 10% 89%

oa(trunkroa(s

1% 10% 89%

Determine the Traffic Model(CS DomainDetermine the Traffic Model(CS Domain

T ffi M d lT ffi M d l




Traffic ModelTraffic Model

SS /ype +enetratin*

rate CA A/ 5s6

Acti$efactor

"ean rate5kps6

A"$oice

:99 < : F9 9!H =

i(eophone :99 < 9!: H> : 8>

Determine the Traffic Model(+ow,end "ser $SDetermine the Traffic Model(+ow,end "ser $S

T ffi M d lT ffi M d l




Traffic ModelTraffic Model

SS /ype +enetratin*rate

SA+acket

Call'u%Session

+acket'u%+acket

Call

+acketSi;e

5ytes6

Inter#Arri$al /i%e

etween+acket Calls

5sec6

E%ail :9 < 9!:9 ; 3; >=9 3;9

39 < 9!:= H ;H >=9 >:;

9nline *a%e,IC8 ;H < 9!:9 ; 3 >=9 =

+icture an((ownloa(in*,

/+ ;H < 9!:9 ; 8; >=9 H

eal#ti%e

$i(eo 9 < 9!99 : ;8? :H99 9

S"S H9 < 9!H9 : : :89 9

E"S ""S H9 < 9!H9 ; 3; >=9 3;9

Determine the Traffic Model(Mid,end "serDetermine the Traffic Model(Mid,end "ser

$S T ffi$S T ffi M d lM d l




$S Traffic$S Traffic ModelModel

SS /ype +enetratin*

rateSA

+acketCall

'u%Session

+acket'u%+acket Call

+acketSi;e

5ytes6

Inter#Arri$al/i%e

etween+acketCalls5sec6

E%ail ;9 < 9!;9 ; 3; >=9 3;9

39 < 9!;> H ;H >=9 >:;

9nline *a%e,IC8

:H < 9!;9 ; 3 >=9 =


/+ :H < 9!;9 ; 8; >=9 H

eal#ti%e

$i(eo :9 < 9!:9 : ;8? :H99 9

S"S :99 < 9!=9 : : :89 9

E"S ""S :99 < 9!=9 ; 3; >=9 3;9

Determine the Traffic Model(.i!h,end "serDetermine the Traffic Model(.i!h,end "ser

$S T ffi$S T ffi M d lM d l




$S Traffic$S Traffic ModelModel

SS /ype +enetratin*

rateSA

+acketCall'u%Ses

sion

+acket'u%+acket Call

+acketSi;e

5ytes6

Inter#Arri$al

/i%eetween+acketCalls5sec6

E%ail 39 < 9!39 ; 3; >=9 3;9

;9 < 9!39 H ;H >=9 >:;

9nline *a%e,IC8

H < 9!39 ; 3 >=9 =


/+ :9 < 9!39 ; 8; >=9 H

eal#ti%e$i(eo

;9 < 9!;9 : ;8? :H99 9

S"S :99 < 9!89 : : :89 9

E"S ""S :99 < 9!89 ; 3; >=9 3;9

Determine the Traffic Model($S DomainDetermine the Traffic Model($S Domain

T ffiT ffi M t $ tM t $ t




After we o#tain the data traffic model of various users, we can further

o#tain the general statistics parameters for facilitating the calculation!

Mean single-user #usy hour throughput 1k#it 4 low-end user

penetrating rate 6 low-end user 5usy $our Throughput7user 6 low-end

user percentage mid-end user penetrating rate 6 mid-end user 5usy

$our Throughput 7 user 6 mid-end user percentage high-end userpenetrating rate 6 high-end user 5usy $our Throughput 7 user 6 high-

end user percentage

Theoretic length of session 1#ytes 4 .acket Call

(um7*ession6.acket (um7.acket Call6.acket *ie 1#ytesMean time of reading 1s41.acket Call (um7*ession-:6+nter-Arrival

Time 5etween .acket Calls 1sec

TrafficTraffic Measurement $arametersMeasurement $arameters

Determinin! the oSDeterminin! the oS




Determinin! the oSDeterminin! the oS

The capacity under planning is the capacity that meets

certain )o*! Generally, the C* service uses the call

loss7#locking pro#a#ility as the inde& Go*! or the .* service,

we use the accepta#le delay and accepta#le minimum

throughput as the Go* inde&! *ometimes in the #iddingdocuments of the operator, the .* service uses the call loss

mode to descri#e its Go*!

Contents of CourseContents of Course




Contents of CourseContents of Course

Training!huawei!com






Chapter . Capacit enhancement

technologies

Transmittin! DiversityTransmittin! Diversity




Transmittin! DiversityTransmittin! Diversity

/rans%ittin* (i$ersity can enhance the/rans%ittin* (i$ersity can enhance the

(ownlink capacity an( co$era*e(ownlink capacity an( co$era*e

Conclusion of capacity enhance%ent ofConclusion of capacity enhance%ent of

trans%ittin* (i$ersitytrans%ittin* (i$ersity

S// %o(e: Capacity increase of 1= 2!F

/4AA516 %o(e: Capacity increase of 1) 23F

/4AA526 %o(e: Capacity increase of 31 3=F

Sectori;in!Sectori;in!




Sectori;in!Sectori;in!

+n the dense ur#an areas and the normal ur#an areas

with high traffic, increase of the num#er of sectors of the

5T* is a method of increasing the capacity!

8 sectors, generally using the antenna whose horiontal

lo#e is 33OThe capacity of a 8-sector 5T* is :!8? times that of a 3-

sector 5T*

.SD$A.SD$A




S+A 5i*h Spee( ownlink +acket Access6 is a (ownlink hi*h#

spee( (ata ser$ice solution of the C"A syste%. /he hi*hest rate

is up to 12"ps or %ore.

In the suse-uent el), the rele$ant technolo*ies such as "I"9

an( 9" of the S+A will e intro(uce( to further increase the

(ownlink capacity.

Multi,"ser Detection 0M"DMulti,"ser Detection 0M"D




Multi "ser Detection 0M"DMulti "ser Detection 0M"D

Sin*le cell:Sin*le cell: I%pro$e the capacity y =0 100F

"ulti#cell:"ulti#cell:

I%pro$e the capacity y !0 )0F

e(uce the UE trans%ittin* power:e(uce the UE trans%ittin* power:

e(uce the trans%ittin* power y 2 3 ( Increase the stan(y ti%e

SA 0Smart AntennaSA 0Smart Antenna




0

The *A can improve the uplink and downlink capacity and

coverage, and decrease the transmitting power reuirements!

*A gain test results

Area Uplink ownlink

:&> ;&; ;&> :&>

Capacity gain :!=H :!?9 3!3? 3!H>

Coverage gain :!>; :!3H ;!9; ;!9?

"MTS Multi,%and +ayered 5etwor*"MTS Multi,%and +ayered 5etwor*




"MTS Multi %and +ayered 5etwor* "MTS Multi %and +ayered 5etwor*

With the development of the 3G users and services, thecapacity reuirements are higher and higher, and a single

technology can hardly meet the growing capacity reuirement!

A mature 3G network can resolve the issue of capacity

fundamentally through MT* multi-#and layered network!

Supple%ental construction: U"/S>00, U"/S1?00, /#

SC"A

OWJ100102 WCDMA Capacity Planning

Documents

Transcript of OWJ100102 WCDMA Capacity Planning