data resources management transmission

7/28/2019 Data Resources Management Transmission

1/50

All rights reserved 2005, Alcatel

Alcatel BSS B9 release

Data Resource ManagtTransmission / August 2005


2/50

All rights reserved 2005, AlcatelData resources management /August 2005

Page 2

Agenda

Best-effort TBF resources allocation / reallocation

GCH related steps

Transmission Resource Availability

Cell Transmission Equity

Test if enough GCH

Transmission Resource Reservation


3/50


Page 3

Candidate TS allocation

Best-effort TBF allocation/reallocation request(received from RRM-PCC or dequeued from a Li list)

TRX list

computing (2)

Best candidate allocation computation (4)

No candidate TS allocation

RADIO RESOURCE ALLOCATION/REALLOCATION

ALGORITHM

TBF ESTABLISHMENT PROCESS

(cf. Figure in section 3.2.2) (9)

Cell Transmission Equity (5)

Enough GCHs Not enough GCHs

ALLOC OK case ALLOC FAILED case

Test if enough GCHs (6)

Available_Nb_GCH_With_Equity

TRX list

Transmission Resource

Availability (1)

DSPcongestion state

TRX list sortedby the BSC

Available_Nb_GCH

Transmission resourcereservation (8)

n_MS_requested,n_MS_requested_concurrent

Multislot class,Bias,Traffic type

Numberof radio TSs

determination (3)

Type of the TBF request

PDCH capacity/TFI/TAI/USF

allocation (7)

- rejected request- or L4 queuing- or L5/L6 queuing

- or L7 queuing (10)

- or try to change TBF mode

(EGPRS case) (11)

es -e or resources a oca onreallocationGCH related steps


4/50


Page 4



TRX list

computing (2)




ALGORITHM








TRX list


Availability (1)

DSPcongestion state


Available_Nb_GCH




Numberof radio TSs

determination (3)



allocation (7)




(EGPRS case) (11)

es -e or resources a oca onreallocationTransmission Resource Availability


5/50


6/50


Page 6


Events requesting the establishment of someGCHs in an M-EGCH link

Transmission resources that have to beconsidered by the Transmission

resource availability process

Prioritary TBF or One-UL-block request(i.e. incoming TBF/One-UL-block allocation

for the first PS traffic in the cell)

- Free Abis resources

- Free Ater resources with GPU Ater TS

margin

- Inter-cell GCH preemptions

(-( Intra-cell GCH preemptions, in Cell

Transmission Equity level)

TBF or One-UL-block request(i.e. incoming TBF/One-UL-block allocation,

or T1 TBF reallocation,



or T4 TBF reallocation)

- Free Abis resources

- Free Ater resources without GPU Ater TS

margin

Inter-cell GCH preemptions

-(- Intra-cell GCH preemptions , in Cell

Transmission Equity level)

GCH establishment for the Fast Initial PS accessfeature

GCH establishment for the periodical GCH

establishment process


7/50All rights reserved 2005, AlcatelData resources management /August 2005

Page 7

[STEP 1]:

computing of the number of free Abis and Ater resources

The free Abis and Ater resources (i.e. the Abis and Ater nibbles notcurrently associated to a GCH channel) are

all the free Abis nibbles (basic Abis nibbles in the cell, bonus basic Abisnibbles in the BTS, and extra Abis nibbles in the BTS)

all the free Ater nibbles, with the restrictions of the GPU Ater TS margin andDSP GCH margin



8/50


Page 8

[STEP 1]:

computing of the number of free Abis and Ater resources

The total number of GCHs which can be established in the cell byusing free Abis and Ater nibbles is called NB_FREE_GCH

NB_FREE_GCH =

MIN [ CELL_NB_FREE_BASIC + BTS_NB_FREE_EXTRA , Nb_Free_Ater_Nibbles_For_Req ,25 ]

CELL_NB_FREE_BASIC is the number of free basic Abis nibbles available in the cell(i.e. the free basic Abis nibbles mapped to RTSs currently available for PS traffic)

BTS_NB_FREE_EXTRA is the number of free extra Abis nibbles and free bonusbasic Abis nibbles available in the BTS

Nb_Free_Ater_Nibbles_For_Req is the number of free Ater nibbles available for the

request 25 is the maximum number of GCHs allowed in the Transmission-Allocation-Request

message on BSCGP interface for G2 BSC



9/50


Page 9

[STEP 2]:

computing of the nb of possible inter-cell GCH preemptions

An inter-cell GCH preemption consists in moving a GCH from an M-EGCH link (on an source TRX) to another M-EGCH link (on a targetTRX) with the following constraints

the source TRX and the target TRX belong to two different cells of the same BTS

only the GCHs using an extra or a bonus Abis nibble are considered

The goal of the following algorithm is to compute the total number of GCHswhich can be got through inter-cell GCH preemptions for the cell.

The idea is to bring some fairness in the usage of the extra and bonus basic

Abis nibbles within a given BTS. Indeed, the algorithm guarantees that onecell cannot monopolize (for best-effort traffic purposes) all the extra andbonus basic Abis resources while some other cells also need them in thesame BTS



10/50


Page 10

[STEP 2]:computing of the nb of possible inter-cell GCH preemptions

Determination of the cells of the BTS from which it is allowed topreempt one GCH according to the fairness criteria

Only the cells of the BTS (different from the current cell) using 2extra or bonusbasic Abis nibbles more than the current cell shall be considered by the algorithm,i.e. the cells verifying the [EXTRA-USAGE-FAIRNESS] constraint :


cellcurrentTRXcellTRX

2H_ExtraNb_FREE_GCa)b_GCH_Extr(Current_Na)b_GCH_Extr(Current_N


11/50


Page 11


(1) [EXTRA-USAGE-FAIRNESS] constraint

Current_Nb_GCH_Extra have the same definition as Current_Nb_GCH, but by onlyconsidering the GCHs using extra and bonus basic Abis nibbles. Both the GCHscurrently established and the resources reserved for establishment are considered

On the other hand, as the global algorithm is iterative, Marked_Nb_GCH shall besubtracted from Current_Nb_GCH_Extra, with Marked_Nb_GCH the number ofGCHs that were already marked as preemptable by this algorithm (cf. step (3)).

Nb_FREE_GCH_Extra is the number of free extra Abis nibbles and free bonusbasic Abis nibbles available in the BTS, which are possible to be switched to free Aternibbles (knowing that the free basic Abis nibbles mapped to the RTSs within the nonpreemptable PS zone of the cell will be switched to free Ater nibbles in priority)


cellcurrentTRXcellTRX

2H_ExtraNb_FREE_GCa)b_GCH_Extr(Current_Na)b_GCH_Extr(Current_N


12/50


Page 12


(2) [Looking for one GCH to preempt from a cell of the BTS]

The cells verifying the [EXTRA-USAGE-FAIRNESS] constraint (1) are then gonethrough, from the cell having the highest value of to the cell

having the lowest value If, after having gone through all the cells of the BTS, it is found that no GCH can be

preempted, then the process is over, and go to (4)


cellTRX

a)b_GCH_Extr(Current_N


13/50


14/50


Page 14


(4) End of the process

The Transmission resource availability process is over, and the value ofAvailable_Nb_GCH is set to

Available_Nb_GCH = NB_FREE_GCH + Marked_Nb_GCH

with

NB_FREE_GCH the number of free Abis and Ater resources calculated in [STEP 1]

Marked_Nb_GCH the number of GCHs marked as inter-cell preemptable in [STEP 2]



15/50


Page 15

3 cells @ 2 TRX Max_PDCH_High_Load = 4 a maximum of4 non CS preemptable basic Abis nibbles

can be established in the cell,

Max_PDCH = 8,

Max_EGPRS_MCS = MCS-9, Max_GPRS_CS = CS-4,

Max_SPDCH_Limit = 6 a maximum of6 basic Abis nibbles can be established in thecell.

C

S

radio

Cell A

Cell B

Cell C

Abis

Basic

nibbles

6x4 extra

nibbles

reallocationTransmission Resource Availability

Example 1


16/50


Page 16

First EDGE MS (MS1), class 8 in cell A -> Target_Nb_GCH = 18 GCH Allocation for MS1 4 basic Abis nibble in the Max_PDCH_High_Load zone,

14 extra Abis nibbles,

Total = 18 GCHs.

Cell A

Cell B

Cell C

basic

extra

C

SMS1C

SCell A


Example 2


17/50


Page 17

Second EDGE MS (MS2), class 8 in cell B -> Target_Nb_GCH = 18 GCH Allocation for MS2 4 basic Abis nibbles in the Max_PDCH_High_Load zone,

10 free extra Abis nibbles,

2 basic Abis nibbles outside the Max_PDCH_High_Load zone,

Inter GCH preemption between Cell A and Cell B: 14 extra Abis in cell A, 10 extra Abis in cell B,

2 extras Abis nibbles are pre-empted from Cell A to Cell B

Total = 18 GCHs. basic

extra

Cell A

Cell B

Cell C

C

SMS1MS2

C

SCell ACell B


Example 3


18/50

B t ff t TBF ll ti /


19/50


Page 19



TRX list

computing (2)




ALGORITHM








TRX list


Availability (1)

DSPcongestion state


Available_Nb_GCH




Numberof radio TSs

determination (3)



allocation (7)




(EGPRS case) (11)

Best-effort TBF resources allocation /reallocation

es e or resources a oca on


20/50


Page 20

Cell transmission equity (5):

if a candidate TBF allocation is found on a TRX, the number of newGCHs which are possible to be established on that TRX according tointra-cell equity rules is computed. This number is called

Available_Nb_GCH_With_Equity and corresponds to a number ofintra-cell GCH pre-emptions that are possible towards that TRX

this step is completely new in B9 release

es -e or resources a oca onreallocationCell transmission equity



21/50


Page 21

The goal of this process is to compute the total number ofGCHs which are possible to be preempted from the otherM-EGCH links of the cell, towards the M-EGCH link of thetarget TRX (intra-cell GCH preemptions)

This process has for input a TRX called target TRX

That number is called Available_Nb_GCH_With_EquityThe intent is to guarantee an equity between the M-EGCHlink sizes of the different PS-capable TRXs of the cell(ideally, the size of each M-EGCH link should beproportional to its PS needs in terms of GCHs)

The Cell transmission equity process is only applicable toEvolium BTSs, and when establishing GCHs for best-effortpurposes



22/50



23/50


Page 23

Particular cases in which this algorithm shall not be played target TRX is the only PS-capable TRX of the cell having an M-

EGCH link (useless to look for some intra-cell preemptable GCHs)

if M-EGCH link of the target TRX verifies :

Current_Nb_GCH + Available_Nb_GCH >= Target_Nb_GCH

Then

Available_Nb_GCH_With_Equity shall be set to zero

Cell transmission equity process shall be exited




24/50


Page 24

1Computing of the equity factor of the cell(CELL_EQUITY_FACTOR)

This value represents the percentage of the number of GCHscurrently established (or reserved for establishment) in the cellcompared to the global GCH needs in the cell. Only the GCHs whichare potentially intra-cell preemptable are taken into account, i.e.Min_Nb_GCH GCHs are supposed to be blocked in each M-EGCHlink of the cell

CELL_EQUITY_FACTOR

=


IN_NB_GCHCELL_SUM_MCHARGET_NB_GCELL_SUM_T

IN_NB_GCHCELL_SUM_MNb_GCHAvailable_GCHURRENT_NB_CELL_SUM_C



25/50


Page 25

1Computing of the equity factor of the cell(CELL_EQUITY_FACTOR)CELL_SUM_CURRENT_NB_GCH :

sum of the Current_Nb_GCH values for all the M-EGCH links of the PS-capable TRXs of the cell (target TRX included)

Available_Nb_GCH :

Previously computed by the Transmission resource availabity process. It isindeed required to take into account the number of free Abis and Aternibbles and the number of inter-cell preemptable GCHs to get a valid valueof CELL_EQUITY_FACTOR

CELL_SUM_MIN_NB_GCH :

Sum of the Min_Nb_GCH values for all the M-EGCH links of the PS-capable

TRXs of the cell (target TRX included)CELL_SUM_TARGET_NB_GCH :

Sum of the Target_Nb_GCH values for all the M-EGCH links of the PS-capable TRXs of the cell (target TRX included)




26/50


Page 26

1Computing of the equity factor of the cell(CELL_EQUITY_FACTOR)

Particular cases (1/2)

CELL_SUM_TARGET_NB_GCH - CELL_SUM_MIN_NB_GCH) = 0 (division byzero in the formula),

Cell transmission equity process shall be exitedAvailable_Nb_GCH_With_Equity = 0

CELL_EQUITY_FACTOR < 0

Min_Nb_GCH threshold cannot be reached on all the PS-capable TRXs ofthe cell (indeed, as CELL_SUM_TARGET_NB_GCH -CELL_SUM_MIN_NB_GCH is always positive, CELL_EQUITY_FACTOR 1

Among others, the fact of playing the Cell transmission equity algorithm in

this case will be useful to preempt some unused GCHs (while theT_GCH_Inactivity timer is running on some TRXs of the cell).

If CELL_EQUITY_FACTOR > 1 then CELL_EQUITY_FACTOR = 1




28/50


Page 28

2 Computing of the number of GCHs intra-cell preemptablefrom each M-EGCH link of the cell

For each PS-capable TRX which owns an M-EGCH link in the cell, avalue called TRX_EQUITY_NB_GCH is computed :

TRX_EQUITY_NB_GCH =Min_Nb_GCH + CELL_EQUITY_FACTOR

x (Target_Nb_GCH Min_Nb_GCH)

(rounded up to nearest integer)




29/50


Page 29

2 Computing of the number of GCHs intra-cell preemptablefrom each M-EGCH link of the cell

Then, the number of GCHs intra-cell preemptable from this TRX,called TRX_INTRA_CELL_PREEMPTABLE_GCH, is computed :

TRX_INTRA_CELL_PREEMPTABLE_GCH =MAX ( Established_Nb_GCH TRX_EQUITY_NB_GCH , 0 )


es -e or resources a oca on


30/50


Page 30

3 Computing of Available_Nb_GCH_With_Equity (Current_Nb_GCH + Available_Nb_GCH) >= TRX_EQUITY_NB_GCH

on the target TRX :

Available_Nb_GCH_With_Equity = 0

free Abis and Ater resources and/or the inter-cell GCH preemptionsare sufficient to meet the GCH needs of the target TRX according tothe equity rules




31/50


Page 31

3 Computing of Available_Nb_GCH_With_Equity (Current_Nb_GCH + Available_Nb_GCH) < TRX_EQUITY_NB_GCH

on the target TRX :

total number of GCHs intra-cell preemptable in the cell

CELL_INTRA_CELL_PREEMPTABLE_GCH =

The target TRX shall not be considered (in this sum) when computingCELL_INTRA_CELL_PREEMPTABLE_GCH


CellTRX PTABLE_GCHCELL_PREEMTRX_INTRA_



32/50


Page 32

3 Computing of Available_Nb_GCH_With_Equity (Current_Nb_GCH + Available_Nb_GCH) < TRX_EQUITY_NB_GCH

on the target TRX :


=MIN [ CELL_INTRA_CELL_PREEMPTABLE_GCH,

(TRX_EQUITY_NB_GCH Current_Nb_GCH Available_Nb_GCH) ]

TRX_EQUITY_NB_GCH and Current_Nb_GCH :

values associated to the target TRX.

Available_Nb_GCH

value previously computed by the Transmission resource availabityprocess




33/50


Page 33

MSa MSa MSa MSa MSb MSb MSb MSb MSc MSc MSc MSc

TRXa

Target_Nb_GCH = 14

Min_Nb_GCH = 2

TRXb

Target_Nb_GCH = 7

Min_Nb_GCH = 2

GCH 1

GCH 2

GCH 3

GCH 13

GCH 14

T3 reallocation of MSc

Available_Nb_GCH = 4

GCH 1

GCH 2

GCH 3

GCH 4Those 4 GCHs are

established with

free Abis and free

Ater resources

M-EGCH link of

TRXa

MSa MSa MSa MSa MSb MSb MSb MSb

MSc MSc MSc MSc

TRXa

Target_Nb_GCH = 14

Min_Nb_GCH = 2

Established_Nb_GCH = 14

TRXb

Target_Nb_GCH = 0

Min_Nb_GCH = 0

Established_Nb_GCH = 0

(No M-EGCH link for TRXb)

GCH 1

GCH 2

GCH 3

GCH 13

GCH 14

Initial situationMsa, MSb, MSC: GPRS MS, class 8, DL bias

M-EGCH link of

TRXbM-EGCH link ofTRXa

Established_Nb_GCH = 12 Established_Nb_GCH = 6

GCH 13

GCH 14

GCH 1

GCH 2

GCH 12

GCH 13

GCH 14TRX_Equity_Nb_GCH = 12

2 intra-cell GCH

preemptions are

possible towards

TRXb

TRX_Equity_Nb_GCH = 7

Final situation

es -e or resources a oca onreallocationCell transmission equity Example

Best effort TBF resources allocation /


34/50


Page 34



TRX list

computing (2)




ALGORITHM








TRX list


Availability (1)

DSPcongestion state


Available_Nb_GCH




Numberof radio TSs

determination (3)



allocation (7)




(EGPRS case) (11)

Best-effort TBF resources allocation /reallocation



35/50


Page 35

Test if enough GCHs (6):

the total number of GCHs which are already (or about to be)established on the previously selected TRX (i.e. Current_Nb_GCH)and/or which will be possible to be established on that TRX in the

future (i.e. Available_Nb_GCH + Available_Nb_GCH_With_Equity) istested

if there are not enough GCHs, the request has failed (ALLOCFAILED case due to transmission resource reasons). Depending onthe type of the request, the request is rejected or queued into a Li list(10)

this step is completely new in B9 release

es e or resources a oca onreallocationTest if enough GCHs



36/50


Page 36

The following conditions are tested [CC-1]

(Current_Nb_GCH + Available_Nb_GCH

+ Available_Nb_GCH_With_Equity)

>= Nb_GCH_For_TBF_Estab

[CC-1] guarantees that it will be possible to reachNb_GCH_For_TBF_Estab GCHs in the M-EGCH link of the TRXsupporting the best candidate timeslot allocation

The sum (Available_Nb_GCH + Available_Nb_GCH_With_Equity) is the

total number of GCHs that can be added to the M-EGCH link of the TRXsupporting the best candidate timeslot allocation (by new GCHestablishments, or by inter-cell GCH preemptions, or by intra-cell GCHpreemptions)




37/50


Page 37

Nb_GCH_For_TBF_Estab


Type of the request in the TRX

waiting queue

Allocatio

n policy

Minimum

number of GCHs required

to serve the request

(Nb_GCH_For_TBF_Estab)

UL TBF establishment(without concurrent TBF)

ASAP 1

UL TBF establishment

(with concurrent TBF)ASAP

1 to 5

depending on the Max allowed (M)CS of the existing

concurrent DL TBF

DL TBF establishment(without concurrent TBF)

ASAP 1

DL TBF establishment

(with concurrent TBF)ASAP

1 to 5

depending on the Max allowed (M)CS of the existing

concurrent UL TBF

T1 TBF reallocation ASAP 1

One-UL-block allocation request ASAP 1

T4 TBF reallocation ASAP1 or 2

depending on the Max allowed CS of the TBF

T3 TBF reallocation OPTIMAL1 to 5

depending on the Max allowed (M)CS of the TBF

MPDCH establishment N.A. Number of MPDCHs on the TRX (***)

RT resource allocation / modification

requestN.A. N.A.



38/50


Page 38

The following conditions are tested [CC-2]

(Nb_GCH_Activated + Nb_GCH_Reserved_For_Establishment

+ Target_Nb_GCH Current_Nb_GCH)


39/50


Page 39

IF [CC-1] AND [CC-2]

THEN

There are enough GCHs to serve the request

ELSE

There are not enough GCHs to serve the request


Best-effort TBF resources allocation /


40/50


Page 40



TRX list

computing (2)




ALGORITHM








TRX list


Availability (1)

DSPcongestion state


Available_Nb_GCH




Numberof radio TSs

determination (3)



allocation (7)




(EGPRS case) (11)

Best effort TBF resources allocation /reallocation



41/50


Page 41

Transmission resource reservation (8):

the necessary transmission resources (which are not yet established)are reserved and the TBF establishment process is undertaken (9)

the main interest of the transmission resources reservation step is toguarantee that the transmission resources will remain available duringthe GCH establishment process

the priority order to reserve the GCHs is as follows : free Abis andAter resources then inter-cell GCH pre-emptions and finally intra-cellGCH pre-emptions

es e or resources a oca onreallocationTransmission resource reservation



42/50


Page 42

The transmission resources are reserved for a given TRX,and are:

either couples of free Abis and Ater nibbles,

or already-established GCHs

(inter-cell and intra-cell GCH preemption cases).

Reserving transmission resources means setting theirstate to reserved for establishment on the considered TRX

The number of transmission resources that shall bereserved is equal to the number of available resources (i.e.

Available_Nb_GCH + Available_Nb_GCH_With_Equity)truncated to the GCH needs on the considered TRX (i.e.Target_Nb_GCH Current_Nb_GCH)




43/50


Page 43

Number of transmission resources that shall be reserved isalways equal to:

Min ( Available_Nb_GCH + Available_Nb_GCH_With_Equity,

Target_Nb_GCH Current_Nb_GCH )

Number of transmission resources that shall be reserved isalways equal to:Available_Nb_GCH

value previously computed by the Transmission resource availabity process


value previously computed by the Cell transmission equity process

If that process was not played, then Available_Nb_GCH_With_Equity = 0

Target_Nb_GCH and Current_Nb_GCH

values associated to the considered TRX (on which some GCHs have to beestablished)



44/50



45/50


Page 45

1 Priority rules for the free Abis and Ater resources The Transmission resource availability algorithm has computed the

total number free Abis and Ater resources available for the cell(NB_FREE_GCH). When reserving free resources, the GCHestablishment priority rules which shall be applied

1.1 The couples (free basic Abis nibble mapped to a RTS currently available

for PS traffic and within the non preemptable PS zone of the cell, free Aternibble) are reserved preferentially, from the leftmost RTS to the rightmostRTS of the non preemptable PS zone

1.2Then, the couples (free extra or bonus basic Abis nibble, free Aternibble) are reserved preferentially,

1.3 Then, the couples (free basic Abis nibble mapped to a RTS currently

available for PS traffic and out of the non preemptable PS zone of the cell,free Ater nibble) are reserved preferentially, from the leftmost RTS to therightmost RTS of the preemptable PS zone


es -e or resources a oca onll ti


46/50


Page 46

2 Priority rules for the inter-cell preemptable GCHs Then, the inter-cell preemptable GCHs are reserved preferentially.

The priority rules among those GCHs are all defined by theTransmission resource availability algorithm (fairness criteria andTRX-related criteria, [STEP 2])




47/50


Page 47

3 Priority rules for the intra-cell preemptable GCHsAt last, the intra-cell preemptable GCHs are reserved preferentially.

The Cell transmission equity algorithm has determined a number ofintra-cell preemptable GCHs on each TRX of the cell(TRX_INTRA_CELL_PREEMPTABLE_GCH). Those GCHs have nowto be identified and reserved.

Only the TRXs of the cell from which at least one GCH can be intra-cell preempted shall be considered (i.e. for whichTRX_INTRA_CELL_PREEMPTABLE_GCH >= 1), and the followingpriorities shall be respected for reserving the GCHs




48/50


Page 48

3 Priority rules for the intra-cell preemptable GCHs 3.1 The TRXs of the cell having the highest number of intra-cell preemptable GCHs(i.e. the highest TRX_INTRA_CELL_PREEMPTABLE_GCH value) shall be consideredin priority

3.2 If two TRXs have the same number of intra-cell preemptable GCHs, the TRXwhich is the most PS-prioritary shall be considered in priority

Then, on a given TRX of the cell (determined by the rules 3.1) and 3.2)), all the GCHs

which are not in the reserved transitory state are considered. When consideringthose GCHs, the same priority rules as the GCH release rules are applied, i.e

3.3 The intra-cell preemptable GCHs using basic Abis nibbles mapped to RTSs out ofthe non preemptable PS zone of the cell are reserved preferentially, from therightmost RTS to the leftmost RTS of the preemptable PS zone

3.4 Then, the intra-cell preemptable GCHs using extra Abis or bonus basic Abisnibbles are reserved preferentially,

3.5 At last, the intra-cell preemptable GCHs using basic Abis nibbles mapped to RTSswithin the non preemptable PS zone of the cell are reserved, from the rightmost RTSto the leftmost RTS of the non preemptable PS zone

es e o esou ces a oca oreallocationTransmission resource reservation



49/50


Page 49

How the reserved resources will be usedAfter the Transmission resource reservation process, all the

reserved resources will be attempted to be established and/orpreempted towards the M-EGCH link of the considered TRX

In the case of the TBF establishment process, the GCHs may be establishedin several steps (cf. ASAP allocation policy) or in one unique step (Optimal

allocation policy). In the other cases (MPDCH establishment, Periodical GCH establishment

process, Fast Initial PS Access), all the GCHs will be attempted to beestablished in one unique step

Note: following the reservation of some transmission resources on the TRX,the Current_Nb_GCH value of the considered TRX shall be updated

reallocationTransmission resource reservation


50/50

Page 50

www.alcatel.com

data resources management transmission

Documents