Capacity planning

Capacity planning
Contents:
Traffic models Blocking Dropping Soft blocking in CDMA network

Traffic models
Definition of Traffic intensity
n(t )

The instantaneous traffic intensity in a pool of resources is the number of busy resources at a given instant of time. (ITU-T Recommendation B.18) Resource pool is for instance, the number of trunk lines in a concentrator, number of channels, number of timeslots,

The unit of traffic is E [erlang]

Single line or sever can handle up to 1 E traffic.

Traffic models
Traffic volume traffic intensity
AcT = n(t )dt
0 T

AcT

[Eh] is the time integral of the

Mean traffic intensity volume per time unit

Y= 1 n(t )dt T 0
T

[E] denotes traffic

Carried traffic Ac = Y [E] is equal to the mean traffic intensity (in steady state)
4

Traffic models
Offered Traffic A [E] is the traffic that would be carried if no calls we rejected due to the lack of capacity.
Call intensity Mean service time s A= s

Lost/Rejected traffic [E] is the difference between the offered and carried traffic Potential traffic: Offered traffic if there would be no restrictions on the use of the service. (Always available free of charge)
5

Traffic models
In practice, it is not feasible for mobile network (or other public communication system) to have the capacity to handle any possible load at all times. Fortunately, not all subscribers place calls at the same time and so it is reasonable to size the network to be able to handle some expected level of load. Consider a cell able to handle C simultaneous users (capacity of C channels) that has L subscribers (L mobile units). If LC, the system is referred to as nonblocking; all calls can be handled all the time. If L>C, the system is blocking; a subscriber may attempt a call and find the capacity full in use and therefore be blocked.

Traffic models
In network planning stage, one should try address the following:
What is the probability that a call request will be blocked? Alternatively, what capacity (C) is needed to achieve a certain upper bound on the probability of blocking? If blocked calls are queued for service, what is the average delay? Alternatively, what capacity is needed to achieve a certain average delay?

Traffic models
Two parameters determine the amount of load presented to a system =the mean rate of calls (connection requests) attempted per unit time h=1/ the mean holding time per successful call. The basic measure of traffic is the traffic intensity, expressed in a dimensionless unit, the Erlang: A= h A can be interpreted as the average number of calls arriving during the average holding period.

Example 1
If the calling rate averages 20 calls per minute and the average holding time is 3 minutes, then A=60.
We would expect a cell with a capacity of 120 channels to be about half utilized at any given time. A switch of capacity 50 would clearly be inadequate. A capacity of 60 would meet the average demand but, because of fluctuations around the mean rate A, this capacity would at time be inadequate.

Example 2
Consider the pattern of activity in a cell of capacity 10 channel over a period of 1 hour. The rate of calls per minute is 97/60. The average holding time per call, in minutes is 294/97. Thus A =(97/60)(294/97)=4.9 Erlangs. That is, on average, 4.9 channels are engaged.

10

Example 2
Channel 0 1 2 3 4 5 6 7 8 9 10

Minutes

60

Occupied time (min)

Number of calls

51 47 43 39 34 28 22 15 9 6

17 16 14 12 11 10 7 5 3 2

Minutes
Total

294

97
11

Traffic estimates
The common practice is to size the system to meet the average rate encountered during a busy hour. The busy hour is the 60-minute period during the day when the traffic is highest. ITU-T recommends taking the average of the busy hour traffic on the 30 busiest days of the year. Typical values of offered traffic during the busy hour Business users: 20 30 mErlang per user (1.2 1.8 min/h) Domestic users: 10 15 mErlang per user (0.5 0.9 min/h)

12

Traffic estimates
Offered voice traffic per user from user group (subscription type) j and environment i (pedestrian/vehicular) can be predicted as follows

Tij = Fi CPTO ,ij N ij

where
Fij denotes the area coverage probability of the user group j in environment i CP denotes the penetration (fraction of users having a cellular phone) TO,ij is the average generated by one user belonging to traffic class j in environment i Nij is the number of persons belonging to group j in the environment i
13

Estimation of number of user per cell

Vehicles, pedestrians and teletraffic are assumed to be uniformly distributed in each region (cell) Homogeneous street mesh
LB LB

Coverage region of a cell AC Area of the cell

14

Estimation of number of user per cell

Number of potential users of type i Ni = i Ls/Si = i 2AC/(LBSi) where i denotes number of person per vehicle (1=1 for pedestrians) LS total length of streets in the coverage area LS=AC/(LB2)2LB

15

Offered traffic
Offered traffic A = Tij
i j

Aggregate of the traffic generated by the different user groups in different environments

16

Traffic estimates
Consider a square cell plan L=1 km
Road network mesh

LB=0.2 km Total length of the road mesh 2 LS=2(1000m) /(200m)=10000 m = 10 km

17

Traffic estimate
Penetration CP = 0.25 Single subscription time (j can be omitted) Offered traffic per user: TO,1=TO,2=20 mErlang Coverage probability: F1=0.8 (Pedestrian), F2=0.95 (Vehicular) Distance between pedestrians S1=4 m Distance between vehicles S2=25 m Number of people in a car 2=1 (1=1) Number of pedestrians N1 = 1 Ls/S1 = 110000/4=2500 Number of cars N1 = 2 Ls/S2 = 110000/25=400 Traffic offered by pedestrian users T_1=F_1C_P T_{O,1} N_1 = 0.80.250,022500=10 Erlang Traffic offered by vehicular users T_2=F_2C_P T_{O,2} N_2 = 0.950.250,02400=1,9 Erlang Offered traffic A= T_1+T_2 = 11,9 Erlang

18

Traffic Estimates
Blocked calls may be handled in one of two ways. First, blocked calls can be put in a queue awaiting a free channel; this is referred to as lost calls delayed (LCD), although in fact the call is not lost, merely delayed. Second, a blocked call be rejected and dropped. This in turn leads to two assumptions about the action of the user.
If the user hangs up and waits some random time interval before another call attempt, this is known as lost calls cleared (LCC). This type is generally used in cellular systems. If the user repeatedly attempts calling, it is known as lost calls held (LCH).

19

Erlang Capacity
Number of channels per cell C Voice traffic (Poisson arrivals and exponential distributed call lengths) Call arrival rate Call departure rate (Mean length of a call h=1/) Offered traffic =/
Unit of the traffic is Erlang, which corresponds to the expected number of occupied channels.

20

10

Erlang Capacity
Consider the flow from state to another
New call arrive with rate calls per second On-going call ends (i.e. calls depart) with rate calls per second k=Pr{Number of occupied channels is k} In steady state flow in = flow out k k-1 =kk , k=1,2,3,,C k = C k! k , = Probabilities must sum up to one Ck=0 k =1
k =0

k!

Number of active calls

2t C t

21

Erlang Capacity
Lost call cleared model (LCC). If a new call sees all the channels occupied it will try again after long random time. Blocking probability: Change that there are no free channels for new calls = C.
C
EC ( ) =

k!
k =0

C! , = k

Erlang-B formula

Offered traffic A = Carried traffic Y = (1-EC()) Lost traffic AL= E() Unit of traffic is Erlang (number of reserved channels)
22

11

Dimensioning
Blocking probability 0.01
Blocking Probability 10
0

Erlang-B 1 2 3

10

-5

10

10

-10

10

-15

10

-20

Minimum number of channels needed m 5

10

-25

10

-30

0.2

0.4

0.6

0.8

1.2

1.4

1.6

1.8

Offered traffic 0.8 Erlang

23

Mobility
In cellular radio systems, mobiles make handovers from cell to another. If there are not enough free channels in the new cell, then call dropping happens. The sojourn time at cell is approximately exponentially distributed

24

12

Priority handoff
Priority given to handoff calls before new calls Reservation technique:
C channels

Guard channels C-x

Keep n channels for handoff calls only Block new calls whenever only n channels remain idle

. Ordinary channels x

25

Priority handoff
The channel holding time is approximately the same for both handoff and new calls. Arrival rate of new calls N Arrival rate of handoff calls H Steady state probabilities (H+N)k-1 =kk, k=0,1,2,,x Hk-1 =kk, k=x+1,x+2,C
N + H

Ordinary channels N + H H

Guard channels
H

Number of active calls

..
x

x
( x + 1)

( x + 1)

26

13

Priority handoff
Define N=N/ =N/ =N+ Probabilities must sum up to one, hence

k =0

=
k =0

k!

0 +

k = x +1

x H k x
k!

0 =1
1

C x k x H kx 0 = + k =0 k ! k = x +1 k !

Steady state probabilities

0 k = x k !k x H 0 k!
k

State probabilities
k k! x k C x k x + k ! k1 kH! k =0 = x+ k = x H k x k! C x k x H k x + k =0 k ! k = x +1 k ! k = 0,1, 2,..., x

k = 1, 2,..., x k = x + 1, x + 2,..., C

k = x + 1, x + 2,..., C

27

Priority handoff
Blocking probability for new calls
x
C

BN ( x) = x =

k!
+
k =0

x!
k = x +1

x H k x
k!

Dropping probability for handoff calls x H Cx C! BH ( x) = x k C x H k x k ! + k+1 k ! =x k =0

28

14

Prioritized Channel Allocation (Hong, Oh, Tcha)

29

Prioritized Channel Allocation (Oh & Tcha, 89)

30

15

Handoff Resource Reservation

10
0

Telephony traffic C=12

Blocking
Pb n=6

Number of guard channels n =C-x= 2, 4, 6

10
Pblock, Pdrop

-1

Blocking & Dropping probability

n=4

Dropping
n=2 Pd n=2 n=4 n=6

10

-2

Relative mobility H/ =0.5

10

-3

Relative load (Erlangs) Total load

10

31

Handoff Resource Reservation

Telephony traffic C=12 n=2 Rel Mob = H/
n=2 n=4 n=6

100

n=6 Rel mobility = .8 .5 .2

Blocking & Dropping probability

10-1

n=4 n=2

Blocking
-2

10

Dropping

10-3 0

10

12

Relative load

32

16

Cost of Mobility - GOS

Telephony traffic C=12 n=2 Rel Mob = H/ GOS = BN+10BH

100

10-1

GOS

Rel mobility = .8 .5 .2

10-2

10-3 2

2.5

3.5

4.5

5.5

Relative load

33

Soft capacity
In CDMA case, the number of available resources is not hard blocked (i.e. limited by the by the amount of hardware) but depend on the interference.
Capacity Capacity Equally loaded cells => Equal capacity Less interference in the neighboring cells => Higher capacity in the middle cell

34

17

CDMA system
Uplink
SNIR
i = W

W = 3.84 Mcps Ri
Pi

i Ri I tot Pi
1 I W tot 1+ i Ri i

i 0.67 i = 1
Li = 1 W 1+ i Ri i

Received power
P = i

Chip rate (WCDMA) Bit rate Voice activity Activity factor for data calls Uplink load factor

Interference + noise power

j

I tot = (1 + ) Pj + N 0W = (1 + ) L j I tot + N 0W
j

I = ext 0.55 I own

Other cell to own interference ratio

I tot I tot 1 = = N 0W I tot (1 + ) L j I tot 1 (1 + ) L j
j j

Noise rise

35

Load factor
Uplink load ul
I tot I tot 1 1 = = = N 0W I tot (1 + ) L j I tot 1 (1 + ) L j 1 ul
j j

ul = (1 + ) L j
j

Pole capacity
P = Li i 1 N0W , ul 1 Maximum load, if power 1ul constraint is relaxed
j

ul = (1 + ) L j = 1

36

18

Load factor
Let us consider only single service class
ul = (1 + ) L j = (1 + ) NL
j

N Number of simultaneous users

Maximum number of users for certain service

ul = N
(1 + ) W R W ul N = 1 + R (1 + ) 1+

If

>> 1

, then

(1 + ) N

R ul W W ul NR (1 + )

Maximum rate for given number of users

R=

ul 1 (1 + ) N
37

(1 + ) N

ul

Noise rise
Transmission power
pi = Li 1 L 1 N0W i N0W gi 1 ul gi 1 ul,max

Noise rise

Noise rise tells how much larger power is needed due to multiuser communication compared to single link Power constraint
pi pmax , i = 1, 2,..., N

vs

ul ul ,max

It is easier to set limit to the relative power change than to consider the individual power constraints
38

19

Noise rise
Noise rise as a function of load
I tot N 0W
20 18 16 14 Noise rise (dB) 12 10 8 6 4 2 0

Typical operation range 3dB 10 dB

0.1

0.2

0.3

0.4

0.5 Load

0.6

0.7

0.8

0.9

ul

Typical operation range 0.5 0.9

39

Capacity vs coverage
Noise rise limits the capacity. Pole capacity can not be exceed even if there would be infinite amount of power available By increasing the load the coverage area is decreased and vice versa Cell breathing: Cell size is allowed to vary according the load.
P

gi =

Li 1 N0W pi 1 ul

40

20

Example
UMTS Relese 99 (WCDMA)
Chiprate W=3.84 Mcps R=30 kbit/s (uncoded data rate) Voice activity =0.67 SINR = 5 dB Other-to-own cell interference ratio =0.55 Noise rise I tot N 0W =10 dB Load
I tot 1 = = 1010/10 ul = 0.9 N 0W 1 ul

Maximum number of simultaneous voice users

ul = N
0.9 (1 + ) W ul 3.84 106 N = 1 + = 1 + 35.7 3 5/10 W R (1 + ) 0.67 30 10 10 (1 + 0.55) 1+ R

By rounding down, we get N=35 users per cell

41

Soft capacity
In equally loaded case, the number of channels available in a cell is
W ul N hb = 1 + R (1 + )

For given blocking probability pB this leads to hardblocked capacity Yhb for the carried traffic:

ENhb ( Ahb ) = pB Yhb = (1 pB ) Ahb

42

21

Soft capacity
Let us model the effect of intra cell interference by increasing the number of users
ul = N hb (1 + )
1 W (1 + ) N hb = 1 + ul W R 1+ Nown + N ext R

Now this pool of Nsb=(1+)Nhb must be shared by the middle cell and neighboring cells. Calls arrive to cell with rate Asb calls per time unit and effective interferers arrive with rate Asb Outage happens if the total number of calls exceed Nsb. Soft blocked capacity:

EN sb ( (1 + ) Asb ) = pB Ysb = (1 pB ) Asb

43

Soft capacity
Procedure: 1. Calculate number of channels per cell
W ul N hb = 1 + R (1 + )

2. Hard blocked capacity Yhb from Erlang-B formula EN (Ahb)=pB => Ahb = EN1 ( pB )
hb
hb

Yhb = (1 pB ) Ahb

3. Obtain soft blocked capacity from E 1 ( p ) E(1+)N ((1+)Ahb)=pB => Asb = N B

hb

hb

1+ Ysb = (1 pB ) Asb

4. Soft capacity = (Yhb/Ysb-1)*100%

44

22

Example
Uplink of WCDMA System Voice activity : Voice Data SIR Voice 12.2 kbs Data 16-32 kbs Data 64 kbs Data 144 kbs Other-to-own cell interference ratio Noise rise Blocking / Outage probability 67% 100% 4 dB 3 dB 2 dB 1.5 dB 0.55 3 dB (50% load factor) 0.02

45

Soft capacity
Bit rate Channels Hard per cell blocked C0 capacity 60.5 39.0 19.7 12.5 6.4 50.1 Erl 30.1 Erl 12.9 Erl 7.0 Erl 2.5 Erl Soft blocked capacity 52.8 Erl 32.3 Erl 14.4 Erl 14.4 Erl 3.2 Erl Soft capacity 5% 7% 12% 17% 28%

12.2 16 32 64 144

46

23