Вы находитесь на странице: 1из 5

3GPP TSG-RAN1 #35 R1-031246

November 17-21, 2003


Lisbon, Portuga
Agenda item: 7!1
Source: "ua#omm $uro%e
Title: Re&eren#e No'e-( s#)e'uer &or $*L
Document for: Re&eren#e
+ntro'u#tion
In order to provide fast scheduling for EUL, it is necessary to avoid the communication delay between the RNC and
Node- and possibly different RNCs, which dominates the !"C# reconfiguration delay in the centrali$ed RNC
scheduling% !hat is possible by having a scheduler placed in Node-% #uch scheduler is decentrali$ed and uses only the
limited information about the received signal from a UE% In this document we provide a description and details of such
decentrali$ed scheduler%
$*L Per&orman#e
S#)e'uer ,es#ri%tion
S#)e'uing -utines
!he following are the scheduling outlines&
!he Node- controlling the best downlin' cell is the sole scheduling entity
#cheduling is performed at Node- every scheduling period
#cheduling period is ( ms or a multiple of )* ms
#cheduling is !ime scheduling, such that
o +obiles are prioriti$ed according to a scheduling algorithm
o ,reedy filling of the available uplin' is performed for ma-imum resource utili$ation
o !he right to transmit on the uplin' is granted to the highest priority UE first, then successively to
lower priority UEs
!he UEs are assigned the ma-imum !"C allowed in !"C# based on their #cheduling Information Update .#I/
message and available capacity
UEs are informed about the scheduling decision using the ,rant message
0ny UE that has E-1C2 has associated 1C2
If it has data and available power, each UE can autonomously transmit on 131C2 at the !"C in minimum set,
e4ual to
min
5 'bps
TFC
R %
S#)e'uing +n&ormation *%'ate
#I message is sent if&
3GPP
1
New data arrives and data in the UE6s buffer e-ceeds a certain buffer depth .Buffer_Depth
min
7 8 9 7 8 E TFC bps SCH PRD s /, and the UE has sufficient power to transmit at a non-$ero rate, or
If the #I message was sent at time t, and the current time is greater than or e4ual to t:Min_Period, and if the
UE has data in its buffer that e-ceeds the Buffer_Depth, and the UE has sufficient power to transmit at a non-
$ero rate, or
If the last #I message was sent at time t, and the current time is greater than or e4ual to t:Min_Period, and if
the current assigned rate at the UE side based on received grant is non-$ero although the UE does not have data
or power to re4uest a non-$ero rate
!he #I message contains the following information&
3ower headroom information
;ueue si$e
#I 1elay& !he uplin' #I delay associated is denoted as D_UL% !he #I delay is consisted of the following&
)% !ime elapsed between the instant UE starts transmission of the #I message and the instant Node-
receives it
(% !ime needed for Node- to process the message
Grant .essage
Information that is contained in a grant channel is&
!"C# indicator
!ransmission start time
Indication whether the grant is valid for a single or all 20R; processes
o If the grant is valid for all 20R; processes, the grant ta'es effect when a new pac'et transmission
begins
Indication whether the duration of the grant is validity%
#cheduling 0ssignment 1elay& !he downlin' assignment delay associated with rate assignment is denoted as D_DL%
!he grant delay is consisted of the following&
)% !ime needed for Node- to perform the scheduling
(% !ime elapsed between the instant Node- starts transmission of the grant message and the instance
UE receives it
<% !ime needed for UE to process the message
=% !ime needed for UE to reconfigure its !"C
S#)e'uer ,es#ri%tion an' Pro#e'ures
!he scheduler is located in Node- and it maintains a list of all UEs that are in #2> with that Node-% #cheduler
assigns resources only to the UEs for which the Node- has the best downlin'%
!he following is the summary of the scheduler procedure&
Updates 4ueue information for each UE it schedules
Computes the ma-imum !"C allowed in !"C# for each UE it schedules
Updates the available resources
3GPP
2
o Contribution of the autonomous transmissions and transmissions of the non-scheduling UEs in #2>
are ta'en into account
+a'es a priority list according to the scheduling algorithm
3erforms greedy filling for ma-imum capacity utili$ation
o !he right to transmit on the uplin' is granted to the highest priority UE first, then successively to
lower priority UEs% !he UEs are assigned the ma-imum !"C allowed in !"C# based on its #I
message and available capacity%
0ssociated with each UE, the scheduler stores estimate of UE6s 4ueue si$e . Q
?
/ and ma-imum scheduled rate
.Rm!"s#/%
!he 4ueue si$e estimate Q
?
is updated after any of the following events happen&
0n #I message is received after a delay of D_UL% Q
?
is updated to&
?
Q Queue Si$e reported in S% messge
If the re4uest is lost .D_DL @ &'tionTime/, the scheduler uses the previous, which is the latest,
information it has%
0fter each frame decoding, the 4ueue si$e is updated as&
? ?
t!
Q Q Dt
where
t!
Dt is the data transmitted in the last frame, after discounting the physical layer overhead
and RLC $ero bits padding% #ince RLC retransmissions are not modelled, data transmitted in the last
retransmission is discounted even if the pac'et is decoded in error%
0t the scheduling instant
i
t
, scheduler estimates the ma-imum !"C allowed in !"C# for the UE&
? ?
. / . / A 7ms8
ssigned
Q f Q R &'tionTimeDe(y TT% TT% 1
1
ma-
ma-
<5=
. /,
?
. / min arg ma-B C . / . 7ms8/
. 9 A 7ms8/ D
R
R )bps
R po*er
R s R Q f R TT%
EDPDCH PRD TT%






' ;




where
ssigned
R
is the ma-imum !"C allowed in !"C# assigned to E-131C2 during the current
scheduling period .EDPDCH_PRD/ and UE is allowed to transmit on the E-131C2 until the
&'tionTime of the ne-t assignment, and / .
ma-
po*er R is the ma-imum !"C allowed in !"C# that the
UE can support given its power limit%
Capacity Computation& !he +
th
cell capacity is estimated from the measured UEs6 Sinrs% !he Sinr is the
average combined Sinr per antenna% !he combining over multiple fingers is per slot% !he averaging over
different antennas of the cell of interest is over the duration of a !!I% !here is no combining over different
cells in case of UE in softer-handoff% !he following formula is used to estimate Lod contribution to a cell
antenna&
. /
. /
) . /
+ i
+
+ &'ti,eSet i
+ i
Sinr R
Lod
Sinr R

3GPP
3
where
. /
+ i
Sinr R
is the estimated Sinr if the UE transmits a rate
i
R on E-131C2
( )
(
. / . A / ) . A /
i
+ i 'p t + eu ' R
Sinr R E - +
1
1
]
%
+ t 'p
- E / A .
is the measured pilot Sinr, obtained as the frame average pilot Sinr averaged over two
antennas,
eu
and
'
are the beta factors for E-1C2 and 13CC2, respectively%
Let the Lod constraint be
Lod Lod
+
ma-
, such that the rise-over-thermal overshoot above a
certain threshold is limited to a certain value% !he available capacity is decreased by the resources
consumed by pilots or autonomous transmissions, and the estimate of the scheduled rates .
estimted
R / of
the UEs in #2> for which the Node- is not the serving .and therefore not the scheduling one/%
min
min
,
is not scheduling
.ma-.*, //
. / ma-
) .ma-.*, //
. /

) .R /
TFC
,i(b(e
TCFC
+
+ &'ti,eSet
+
+ estimded
+ &'ti,eSet
+ estimted
+
Sinr R
C + Lod
Sinr R
Sinr R
Sinr


+
+

where ma- Lod is the ma-imum Lod for which the rise-over-thermal outage criteria is satisfied% Ehen
resources ta'en in a non-scheduling Node- from a UE in #2> is computed, the simplest approach is to
account for the rate that has been transmitted in the UE6s previous 20R; process% It is not a perfect
measure, but because of 20R;, it will often be a good estimate%
#cheduling 0lgorithm& !he scheduling algorithm has two maFor characteristics
)% 3rioriti$ation of UE re4uests
(% .reedy filling for ma-imum capacity utili$ation
!he right to transmit on the uplin' is granted to the highest priority UE first, then
successively to lower priority UEs% !he UEs are assigned the ma-imum !"C allowed in
!"C# based on its re4uest and available capacity%
%niti(i$tion&
!he UE re4uests are prioriti$ed according to a priority function%
0ssociated with each UE is a priority count 3RI>RI!G%
3RI>RI!G of a UE is initiali$ed to * in the beginning of the simulation% Ehen a new UE enters the
system with cell + as the primary cell, or its buffer becomes non-empty after being idle due to the lac'
of data, its 3RI>RI!G is set to
minB3RI>RI!G, such that +# has sector as the primary sectorD i
i
i + %
&(gorithm/
)% #et 'H)
(% !he UE at the )
th
position in the 4ueue is assigned the rate
)
R given by
3GPP
4
ma-
. /
C . /
) . /
.ma-.*, //
min . /, arg ma- *I
) .ma-.*, //
is the scheduling sector
,i(b(e
uto
uto
+
+
+ )
)
R
+
Sinr R
R C +
Sinr R
Sinr R
R R s
Sinr R
+
1
+
1
+
1
1

1
' ;
+
1

1

1

1

]

If scheduling is per 20R; process, the scheduler assigns the rate
)
R as determined above if
there is no retransmission, and otherwise,
)
R is set to the corresponding previous transmission
rate%
<% !he available capacity is updated to&
. / .ma-.*, //
. / . / I
) . / ) .ma-.*, //
is the scheduling sector
uto
,i(b(e ,i(b(e
uto
+ ) +
+ ) +
Sinr R Sinr R
C + C +
Sinr R Sinr R
+
+
+ +
=% Calculate new 3RI>RI!G)
J% ) H ):)I if ) K total number of UEs in the list, ,o to #tep ), otherwise, stop%
Priority Fun'tion 1 &n E!mp(e/
3roportional "air& In order to guarantee throughput-wise fairness, the prioriti$ing function is
defined in terms of the proportional fairness&
ma-
3RI>RI!G
)
)
)
R
r
,
where
)
r is the average ma-imum !"C allowed in !"C# already allocated to the UE by the
scheduler, and
ma-
)
R is the ma-imum !"C allowed in !"C# based on UE buffer and power
constraints% !he average allocated ma-imum !"C allowed in !"C# is updated at each scheduling
interval as&
( ) ( )
) )
) .) /
) ) )
r t r t R
T' T'
+ + ,
where
'
T is the time constant of the low-pass filter and is e4ual to )*%
)
R is the current
allocated ma-imum !"C allowed in !"C# of the )
th
UE%
+GKspace@3L0N to )))
3GPP
5

Вам также может понравиться