WO2006126920A1

WO2006126920A1 - Uplink scheduling in a mobile telecommunication network

Info

Publication number: WO2006126920A1
Application number: PCT/SE2005/000786
Authority: WO
Inventors: Joakim BERGSTRÖM; Johan Torsner
Original assignee: Telefonaktiebolaget Lm Ericsson (Publ)
Priority date: 2005-05-26
Filing date: 2005-05-26
Publication date: 2006-11-30
Also published as: US8005481B2; EP1884037A1; EP1884037B1; US20090143071A1

Abstract

The present invention relates to a node B (200) comprising a downlink data scheduler (202) and an uplink data scheduler (204), wherein the node B comprises means (203) for transferring information associated with a downlink data transfer from said downlink data scheduler (202) to said uplink data scheduler (204), and that the uplink data scheduler comprises means for scheduling an uplink data transfer as a result of the transmission of said downlink data transfer.

Description

Uplink scheduling in a mobile telecommunication network

Field of the invention

The present invention relates to a method and arrangements in a mobile telecommunication network. In particular, the present invention relates to a

Node B that facilitates an improved performance for implemented applications in said network.

Background of the invention

The present invention relates to methods and arrangements in a Node B in a UMTS terrestrial radio access network (UTRAN). The UTRAN is illustrated in figure 1 and comprises at least one Radio Network System 100 connected to the Core Network (CN) 200. The CN is connectable to other networks such as the Internet, other mobile networks e.g. GSM systems and fixed telephony networks. The RNS 100 comprises at least one Radio Network Controller 110. Furthermore, the respective RNC 110 controls a plurality of

Node-Bs 120,130 that are connected to the RNC by means of the Iub interface 140. Each Node B covers one or more cells and is arranged to serve the User Equipment (UE) 300 within said cell. Finally, the UE 300, also referred to as mobile terminal, is connected to one or more Node Bs over the Wideband Code Division Multiple Access (WCDMA) based radio interface 150.

In 3GPP Release 6, the WCDMA standard is extended with the Enhanced Uplink concept - the Enhanced Dedicated Transport Channel, E-DCH. A further description can be found in 3GPP TS 25.309 "FDD Enhanced Uplink; Overall description". This concept introduces considerably higher peak data-rates in the WCDMA uplink. Features introduced with E-DCH include fast scheduling and fast hybrid ARQ with soft combining, both of these features are located in the Node B. HARQ is a more advanced form of an ARQ retransmission scheme. In conventional ARQ schemes the receiver checks if a packet is received correctly. If it is not received correctly, the erroneous packet is discarded and a retransmission is requested. With HARQ the erroneous packet is not discarded. Instead the packet is kept and combined with a result of the retransmission. That implies that even if both the first transmission and the retransmission are erroneous, they may be combined to a correct packet. This means that fewer retransmissions are required.

Fast scheduling means that the Node B can indicate to each UE the rate the UE is allowed to transmit with. This can be done every TTI, i.e. fast. Thus, the network is able to control the interference in the system very well.

In HS-DSCH (High Speed Downlink Shared Channel), that is described in 3GPP TS 25.308 "UTRA High Speed Downlink Packet Access (HSDPA);

Overall description; Stage 2, the scheduling is also located in the Node B. In HS-DSCH the scheduling is rather straight forward since the Node B scheduler has full knowledge of the data that needs to be transmitted in downlink. Based on the amount of data available for different UEs, the priority of the data and the radio channel quality which is indicated by the

UE through the Channel Quality Indicator (CQI) measurements, the scheduler determines which data that should be transmitted to each UE.

On E-DCH the situation is different. The Node B scheduler has no direct information about the data that is to be transmitted from the UEs. Thus the UEs are required to indicate the amount of data available, the priority of the data, the transmitter power available etc. to the Node B through scheduling requests. When the Node B has received the scheduling request from the UE and has decided to schedule the UE based on the received scheduling requests, it transmits an absolute grant (AG), also denoted scheduling grant indicator herein, to the UE, indicating the amount of data or actually with which power the UE is allowed to transmit. Before an uplink data burst can be transmitted, the UE must first transmit a scheduling request to the Node B, to inform the Node B that data is available for transmission. First after a reception of the AG from the Node B the data burst can be transmitted. Thus, this procedure causes a delay in the beginning of a data transfer and potentially for each bust that is transmitted in uplink, depending on how long the absolute grant is valid.

The delay caused by scheduling can partly be avoided by either using non- scheduled transmissions or issuing permanent absolute grants to all UEs. The non scheduled transmissions imply that the network configures a certain rate statistically that the UE is allowed to use instantaneously without sending a scheduling request. The drawback of this solution is that the configured rate must be rather high in order to support all possible traffic scenarios and may therefore require a large hardware allocation in the network and cause high interference. In the other solution, to permanently issue an absolute grant, it is possible to quickly change the value of the grant or remove the grant if the load of the network increases. However, this other solution has the drawback that the network does not know which users that really need the permanent grant and the risk is therefore that the perofrmance of the uplink data transmission is impacted. Accordingly, it would be desired to avoid said delay and at the same time avoid the drawbacks mentioned above.

Many applications mainly involve downlink data transfer, e.g. file download, video streaming, and web surfing. The downlink scheduling only impose a small delay unless the system load is very high. However, since most applications involve sending feedback messages in uplink such as Transfer Control Protocol (TCP) acknowledgements (ACK) and Radio Link Control (RLC) ACKs, the delay in uplink scheduling will affect the performance significantly of the downlink data traffic.

Summary of the invention

Thus, the objective problem is to improve application performance. The objective problem is solved by the Node B according to claim 1 and by the method of claim 11.

The Node B, according to the present invention, makes it possible to improve application performance. The Node B comprises a downlink data scheduler (202) and an uplink data scheduler (204), and means (203) for transferring information associated with a downlink data transfer from said downlink data scheduler (202) to said uplink data scheduler (204). Moreover, the uplink data scheduler comprises means for scheduling an uplink data transfer as a result of the transmission of said downlink data transfer.

The method according to the present invention, makes it possible to improve application performance. The method comprises the steps ofrtransferring information associated with a downlink data transfer from said downlink data scheduler to said uplink data scheduler, and-scheduling an uplink data transfer as a result of the transmission of said downlink data transfer.

According to an embodiment of the present invention, the uplink transfer is a response of the downlink data transfer.

According to a further embodiment of the present invention, the means for scheduling an uplink data transfer comprises means for transmitting a scheduling grant indicator indicating when and/ or how the UE is allowed to transmit uplink data. I.e. the scheduling grant indicator may comprise information about allowed transmit power for the UE and that the UE is allowed to transmit until further notice.

An advantage with the present invention is that it allows uplink response messages such as TCP ACKs, RLC ACKs and RRC response messages to be transmitted without scheduling delay, i.e. the scheduling request phase can be omitted. This will improve the performance for a large range of applications. Detailed Technical Description of the Invention

As stated above it would be desirable to be able to start an uplink transmission without performing a preceding scheduling request, in particular when the uplink transmission is a response of a previously transmitted downlink transmission.

That is achieved by the Node B of the present invention comprising a downlink data scheduler, an uplink data scheduler and means for transferring information associated with a downlink data from said downlink data scheduler to said uplink data scheduler. The uplink data scheduler comprises means for scheduling an uplink data transfer, as a result of the transmission of said downlink data transfer

According to the present invention, the scheduler for the downlink traffic is located in the same Node B as the scheduler for the uplink traffic. That is the case when the HS-DSCH serving Node B is the same as the E-DCH serving Node B. For HS-DSCH and E-DCH, the serving Node B is that Node

B that is adapted to schedule the UE. For HS-DSCH, the serving Node B also transmits data to the UE.

Thus, the basic idea of the present invention is that when the HS-DSCH scheduler schedules a data burst in downlink to a UE it informs the E-DCH uplink scheduler that the downlink data has been scheduled, or will be scheduled within a certain time period. When the E-DCH scheduler receives this indication it allocates a scheduling grant, also denoted absolute grant, for the UE for uplink resources. It is then possible for the UE to send response messages such as TCP ACKs, RLC ACKs, RRC response messages on the scheduled uplink resources. That would imply that the uplink response messages can be transmitted without a prior scheduling request phase, which results in a decreased delay.

According to a preferred embodiment, the uplink transfer is a response of said downlink data transfer, i.e. the response may be a response message such as TCP ACKs, RLC ACKs and RRC response messages.

The means for scheduling an uplink data transfer comprises according to embodiments of the present invention means for transmitting a scheduling channel adapted to schedule the uplink data transfer. The scheduling grant indicator indicates when and/or how the UE is allowed to transmit uplink data. The scheduling grant indicator may comprise information about allowed transmit power for the UE and that the UE is allowed to transmit until further notice. The scheduling grant indicator may also indicate that the UE is allowed to transmit during a specific time interval.

The scheduling grant indicator may be transmitted simultaneously as the transmission of said downlink data transfer.

According to embodiments of the present invention the scheduling grant indicator for the uplink scheduling is sent on the existing scheduling channel adapted to schedule the uplink, the enhanced Absolute Grant Channel (E-AGCH). However, the absolute grant indicator for the uplink may also be included in a downlink message transmitted together with the downlink data transmission, i.e. on the same channel e.g. on the HS-DSCH.

The E-DCH scheduler may allocate a fixed preconfigured uplink resource to a UE that already is scheduled in the downlink. If the UE needs to transmit uplink information, e.g. TCP ACK, RLC ACK, or a RRC response message, in response to the received downlink data, the absolute grant indicator allocates uplink resources for the uplink data within a rather short time period after the downlink data was received e.g. within 200 ms. After that time period has elapsed or after the first transmission in uplink, the scheduler can reduce the absolute grant to zero to free uplink resources for other UEs.

According to a further embodiment, the absolute grant allocated to the UE in uplink may depend on the amount of data, or the data rate used, in downlink. In a preferred embodiment the absolute grant allocated to the UE in uplink may depend on the amount of data, or the data rate used, in downlink in addition to the time aspect described above. As an example the amount of allocated uplink resources indicated by the absolute grant indicator may be proportional to the amount of downlink data, i.e. the amount of uplink data that is allowed to be transmitted is proportional to the amount of transmitted downlink data. Preferably, a rule for TCP applications is that roughly 1-3% of the downlink data rate is needed for

TCP ACKs in unlink if no header comnression is used. It should be noted that for applications using TCP the first request for data is transmitted in uplink and that request will not benefit from this invention. However, once the TCP data transfer has started, the data is transmitted in bursts separated by some time (in the slow start phase). Each of these bursts will benefit from the invention and the total time to e.g. download a file will thus be decreased.

In the drawings and specification, there have been disclosed typical preferred embodiments of the invention and, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation, the scope of the invention being set forth in the following claims.

Claims

1. A node B (200) comprising a downlink data scheduler (202) and an uplink data scheduler (204), characterised in that the node B comprises means (203) for transferring information associated with a downlink data transfer from said downlink data scheduler (202) to said uplink data scheduler (204), and that the uplink data scheduler comprises means for scheduling an uplink data transfer as a result of the transmission of said downlink data transfer.

2. The node B (200) according to claim 1, wherein the uplink transfer is a response of the downlink data transfer.

3. The node B (200) according to any of previous claims, wherein the means

(204) for scheduling an uplink data transfer comprises means for transmitting a scheduling grant indicator indicating when and/or how the UE is allowed to transmit uplink data

4. The node B (200) according to the previous claim, wherein the means

(204) for scheduling an uplink data transfer comprises means for transmitting a scheduling grant indicator simultaneously as the transmission of said downlink data transfer.

5. The node B (200) according to the previous claim, wherein the means

(204) for scheduling an uplink data transfer comprises means for transmitting a scheduling grant indicator included in a downlink message transmitted together with, i.e. on the same channel as, the downlink data transmission.

6. The node B (200) according to any of claims 1-3, wherein the means (204) for scheduling an uplink data transfer comprises means for transmitting a scheduling grant indicator on a downlink channel adapted to schedule the uplink data transfer.

7. The node B (200) according to the previous claim, wherein the downlink channel adapted to schedule the uplink is the enhanced Absolute Grant Channel.

8. The node B (200) according to any of the previous claims, wherein the means (204) for scheduling an uplink data transfer comprises means for scheduling the uplink data transfer within a predefined time period after the downlink data is received.

9. The node B (200) according to any of the previous claims, wherein the means (204) for scheduling an uplink data transfer comprises means for allocating an amount of uplink resources in relation to the amount of transmitted downlink data.

10. The node B (200) according to any of the previous claims, wherein the node B is implemented in a Universal Mobile Telephone System.

11. A method in a Node B comprising a downlink data scheduler (202) and an uplink data scheduler (204), characterised in that the method comprises the steps of:

-transferring information associated with a downlink data transfer from said downlink data scheduler (202) to said uplink data scheduler (204), and

-scheduling an uplink data transfer as a result of the transmission of said downlink data transfer.

12. The method according to claim 11, wherein the uplink transfer is a response of the downlink data transfer.

13. The method according to any of previous claims 11-12, wherein the step of scheduling an uplink data transfer comprises the further step of transmitting a scheduling grant indicator indicating when and/ or how the UE is allowed to transmit uplink data.

14. The method according to the previous claim, wherein the step of scheduling an uplink data transfer comprises the step of transmitting a scheduling grant indicator simultaneously as the transmission of said downlink data transfer.

15. The method according to the previous claim, wherein the step of scheduling an uplink data transfer comprises the step of transmitting a scheduling grant indicator included in a downlink message transmitted together with, i.e. on the same channel as, the downlink data transmission.

16. The method according to any of claims 11-13, wherein the step of scheduling an uplink data transfer comprises the step of transmitting a scheduling grant indicator on a downlink channel adapted to schedule the uplink data transfer.

17. The method according to the previous claim, wherein the downlink channel adapted to schedule the uplink is the enhanced Absolute Grant Channel.

18. The method according to any of the previous claims 11-17, wherein the step of scheduling an uplink data transfer comprises the step of scheduling the uplink data transfer within a predefined time period after the downlink data is received.

19. The method according to any of the previous claims 11-18, wherein the step of scheduling an uplink data transfer comprises the step of allocating an amount of uplink resources in relation to the amount of transmitted downlink data.