CA2330848A1 - Method and means for processing information - Google Patents
Method and means for processing information Download PDFInfo
- Publication number
- CA2330848A1 CA2330848A1 CA002330848A CA2330848A CA2330848A1 CA 2330848 A1 CA2330848 A1 CA 2330848A1 CA 002330848 A CA002330848 A CA 002330848A CA 2330848 A CA2330848 A CA 2330848A CA 2330848 A1 CA2330848 A1 CA 2330848A1
- Authority
- CA
- Canada
- Prior art keywords
- data
- radio
- transmission
- data frames
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1874—Buffer management
- H04L1/1877—Buffer management for semi-reliable protocols, e.g. for less sensitive applications like streaming video
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Abstract
The present invention relates to methods and means for processing data frames in a packet data radio system. Data frames (A1, B1-B2) with specified time out periods are submitted to a second protocol layer (PL2) and segmented into radio blocks (Rb) which are transmitted to users (A, B) over a radio link (L). Radio blocks (Rb) not correctly received are re-transmitted. The number of retransmissions is recorded to calculate the BLER. A transmission time for each data frame (A1, B1-B2) in the second protocol layer (PL2) is estimated. Data frames (A1, B1-B2) with transmission times exceeding a remaining time of their respective time out periods are flushed. The remaining data frames are scheduled to minimise the number of time outs before they are transmitted. The flushed data frames are re-submitted from a first protocol layer (PL1) to the second protocol layer (PL2).
Description
' CA 02330848 2000-10-30 METHOD AND MEANS FOR PROCESSING INFORMATION
TECHNICAL FIELD OF THE :INVENTION
The present invention. relates to methods and means for .'i processing data frames :i:~ a packet data radio system.
DESCRIPTION OF RELATED ART
By "radio unit" is meant. all portable and non-portable equipment intended for radio communication, like mobile phones, transceivers, pagers, telex, electronic notebooks, laptops with l~ integrated radios, communicators, computers, routers, tailored microchips connecting to radios or any other electronic equipment using a radio link as a mean of communication. These equipments can be used in any type of radio communication system, such as cellular networks, satellite or small local 15 networks.
In a new generation of wireless data communication services, e.g., GPRS (General Packet Radio Service) in GSM, data packets are transferred across a radio interface. Typically, several 20 users share one or mare physical radio channels, and the network is confronted with the delicate task of processing the transfer of data packets in a way that optimizes the overall performance of the system. The situation is complicated by the fact that even though cfi.fferent users share the same physical 25 medium, the probability of successfully transferring a data packet across the radio interface is different for different users. This is due to local conditions, e.g., geographical location, coding and output powers used.
A known successful architecture in cellular radio systems is to 30 divide the system into a switching system (SS) and a base station system (BSS) . Sc:hematically, the SS is responsible for switching traffic to the intended BSS destination but does not need to know which radio protocols are utilized, or how the physical (radio) resources are used. In contrast, the BSS is ignorant about the overall network and switching structure. The BSS simply receives addressed data entities from the SS, and uses its radio resources, as it seems fit to transfer the received entities to the correct address. The benefit of this separation into SS and BSS parts is that one part can be improved, or even replaced, without affecting the other.
In for instance a GPRS-system, incoming data packets (e.g. IP
packets) are in an LLC protocol layer in the SS segmented into lU smaller data packets, "LLC frames". The LLC frames are then addressed and submitted to an RLC protocol layer in the BSS
where the LLC frames are segmented into smaller data units, "RLC blocks". The RLC blocks are transferred one by one across a radio link to a rad_Lo unit. When all RLC blocks in an LLC
l:i frame have been successfully received by the radio unit, the LLC frame is reconstructed in an RLC protocol layer in the radio unit and passed c>n to an LLC protocol layer in the radio unit. When a radio unit has received a complete and ccrrect LLC
frame, an acknowledgment is sent back to the LLC protocol layer 2U in the SS.
An LLC frame that is not acknowledged within a stipulated time (in GPRS typically 3 seconds) is regarded as lost and is re submitted to the BSS from the SS. Likewise, an LLC frame that is negatively acknowledged by the radio unit is re-transmitted 2_'. from the BSS to the radio unit.
From a user perspective, the total throughput is the number of LLC frames successfully transferred across the GPRS system per unit time.
Existing data packets processing methods are based on quality 3C of service, data packet arrival times and possibly data packet deadlines that are allocated to data packets based on the associated quality of service.
WO 99/57840 PC1'/SE99/00611 These processing methods do not consider the two-level protocol structure (with an LLC protocol layer and an RLC
protocol layer) in a GPRS-like system.
The existing art in a GPRS-like radio data system does not fully optimize the use oi= the radio resources, which leads to a poor throughput.
The US patent 5440545 describes a packet switching system and a method for acknowledging receipt of a plurality of packet fragments. A source device allocates additional bandwidth resources in order to re-transmit packet fragments that have been lost or corrupted during the first transmission.
The US patent 5515385 describes a device and a method for limiting the delay in a communication system by eliminating the risk for duplicate data :E.rames.
The US patent 548706~B describes a method for reducing transmission delays in a packet-switched data communication system by eliminating the need to make an additional request to allocate a channel when ~~ retransmission of segments is needed.
As will be seen herein, each of the device and methods disclosed in these patents is of d~_fferent types and construction than the methods and means of the present invention.
TECHNICAL FIELD OF THE :INVENTION
The present invention. relates to methods and means for .'i processing data frames :i:~ a packet data radio system.
DESCRIPTION OF RELATED ART
By "radio unit" is meant. all portable and non-portable equipment intended for radio communication, like mobile phones, transceivers, pagers, telex, electronic notebooks, laptops with l~ integrated radios, communicators, computers, routers, tailored microchips connecting to radios or any other electronic equipment using a radio link as a mean of communication. These equipments can be used in any type of radio communication system, such as cellular networks, satellite or small local 15 networks.
In a new generation of wireless data communication services, e.g., GPRS (General Packet Radio Service) in GSM, data packets are transferred across a radio interface. Typically, several 20 users share one or mare physical radio channels, and the network is confronted with the delicate task of processing the transfer of data packets in a way that optimizes the overall performance of the system. The situation is complicated by the fact that even though cfi.fferent users share the same physical 25 medium, the probability of successfully transferring a data packet across the radio interface is different for different users. This is due to local conditions, e.g., geographical location, coding and output powers used.
A known successful architecture in cellular radio systems is to 30 divide the system into a switching system (SS) and a base station system (BSS) . Sc:hematically, the SS is responsible for switching traffic to the intended BSS destination but does not need to know which radio protocols are utilized, or how the physical (radio) resources are used. In contrast, the BSS is ignorant about the overall network and switching structure. The BSS simply receives addressed data entities from the SS, and uses its radio resources, as it seems fit to transfer the received entities to the correct address. The benefit of this separation into SS and BSS parts is that one part can be improved, or even replaced, without affecting the other.
In for instance a GPRS-system, incoming data packets (e.g. IP
packets) are in an LLC protocol layer in the SS segmented into lU smaller data packets, "LLC frames". The LLC frames are then addressed and submitted to an RLC protocol layer in the BSS
where the LLC frames are segmented into smaller data units, "RLC blocks". The RLC blocks are transferred one by one across a radio link to a rad_Lo unit. When all RLC blocks in an LLC
l:i frame have been successfully received by the radio unit, the LLC frame is reconstructed in an RLC protocol layer in the radio unit and passed c>n to an LLC protocol layer in the radio unit. When a radio unit has received a complete and ccrrect LLC
frame, an acknowledgment is sent back to the LLC protocol layer 2U in the SS.
An LLC frame that is not acknowledged within a stipulated time (in GPRS typically 3 seconds) is regarded as lost and is re submitted to the BSS from the SS. Likewise, an LLC frame that is negatively acknowledged by the radio unit is re-transmitted 2_'. from the BSS to the radio unit.
From a user perspective, the total throughput is the number of LLC frames successfully transferred across the GPRS system per unit time.
Existing data packets processing methods are based on quality 3C of service, data packet arrival times and possibly data packet deadlines that are allocated to data packets based on the associated quality of service.
WO 99/57840 PC1'/SE99/00611 These processing methods do not consider the two-level protocol structure (with an LLC protocol layer and an RLC
protocol layer) in a GPRS-like system.
The existing art in a GPRS-like radio data system does not fully optimize the use oi= the radio resources, which leads to a poor throughput.
The US patent 5440545 describes a packet switching system and a method for acknowledging receipt of a plurality of packet fragments. A source device allocates additional bandwidth resources in order to re-transmit packet fragments that have been lost or corrupted during the first transmission.
The US patent 5515385 describes a device and a method for limiting the delay in a communication system by eliminating the risk for duplicate data :E.rames.
The US patent 548706~B describes a method for reducing transmission delays in a packet-switched data communication system by eliminating the need to make an additional request to allocate a channel when ~~ retransmission of segments is needed.
As will be seen herein, each of the device and methods disclosed in these patents is of d~_fferent types and construction than the methods and means of the present invention.
SUI~ARY
The present invention meets some problems related to optimising the processing of framed packet data where a data frame comprises of a number of data blocks.
S One problem occurs when a data frame which is being transmitted to a user/system across a radio link times out before it is completely transmitted.
Another problem occurs when data blocks which have been transmitted to a user/'system across a radio interface a first l~ time have to be re-transmitted again over the radio link when the associated data frame times out.
In light of the foregoing, a primary object of the present invention is to provide methods and means for processing data blocks in a packet data radio system.
1',i Another object of the present invention is to provide methods and means for efficiently utilising the bandwidth of the system.
Still another object is to process the data b socks in a packet data radio system in such a manner that a maxi:"um number of the 2U corresponding data frannes transferred across a radio interface are acknowledged before they time out:
Yet another object of the present invention is to minimise the number of unnecessary re-transmissions over a radio link due to time outs of data frame's.
2_'. In a method according to the present invention a transmission time to completely transmit a data frame over a radio link is estimated and this information is used to judge if the data frame can be completely transmitted before it times out. The method also uses said information to schedule the order in 30 which the data frames are to be transmitted.
' CA 02330848 2000-10-30 According to one embodiment of the method a second protocol layer transmits data frames to a user. The Block Error Rate (BLER) is measured in the second protocol layer by rE:cording what fraction of the radio blocks transmitted to the user that S have to be re-transmitted. Using this information, and information about the radio resources to be allocated for the transmission, the transmission time for each data frame stored in or under transmission from the second protocol layer is estimated. If the estimated transmission time of any data frame is larger than a remaining time of a time out period of that data frame, that data frame shall be flushed in the second protocol layer. The transmission of the remaining data games from the second protocol layer are scheduled to minimise the number of data frames that time out in the second protocol layer. In accordance with a re-transmission protocol of a first protocol layer, the first protocol layer re-submits a new data frame, identical to the flushed data frame, to the second protocol layer.
A system and a radio unit comprise means for utilising the method according to the present invention.
According to one embodiment of the radio unit, the =ad:io unit comprises means for: estimating radio resources to be allocated for transmissions; measuring the Block Error Rate (BLER);
estimating the transmission time for each data frame in the 2.'i second protocol layer _Ln the radio unit; detecting in advance if time outs will occur'; and scheduling the order in which the data frames are to be transmitted from the radio unit.
If a time out for a data frame is detected in advance, the radio unit has means to immediately stop and flush that data frame.
According to one embodiment of the system, the system comprises means for: estimating radio resources to be allocated for transmissions; measuring the Block Error Rate (BLER);
estimating the transmission time for each data frame in the second protocol layer in the system; scheduling the order in which the data frames are to be transmitted from the system; , and detecting in advance if a time out will occur.
If a time out is detE~cted in advance for a data frame, the -system has means to imnnediately stop and flush that data frame.
An advantage with the present invention is that radio resources are not wasted on data frames that are estimated to time out and to be re-transmitted anyway. Thus, the bandwidth of the system 1~ is more often used for useful transmission, which in turn increases data throughput and reduces delay.
Another advantage is that the transmission is less sensitive to periodical interference which can completely block a connection to a user, hence causing long delays to other users in the 1.'i system.
Yet another advantage is that the risk of transmitting the same data frame twice due to re-submission to a second protocol layer of a data frame that is anyway being transmitted t:he first time is eliminated.
Figure 1 is a view of a. block diagram of a GPRS system.
Figure 2 is illustrating an LLC frame segmented into a number of RLC blocks.
Figures 3a-c are illusl_rating an example of a known data frame processing scenario.
Figures 4a-b are illustrating a flow chart of a first embodiment of a method according to the present invention.
Figures Sa-d are illusi_.rating a data frame .processing scenario 1() utilising the first embodiment of the method according to figures 4a-b.
Figures 6a-b are illustrating a flow chart of a third embodiment of a method .according to the present invention.
Figure 7 is illustrating a block diagram of an embodiment of 1.'i means according to the ;present invention.
DETAILED DESCRIPTION OF EMBODI~TTS
The present invention relates to methods and means for processing data frames in a packet data radio system in a way that leads to an efficient use of the radio resources and a good throughput.
The packet data radio system shall preferably comprise a protocol layered structure, where in a specified layer, a first packet data unit submitted to the specified _ayer is further segmented (divided) into smaller second packet data units before transmission over a radio link to a user/system.
The first packet data unit submitted to the specified layer is resubmitted to that specified layer if it is not acknowledged to have been correctly received by the user/system within a 1.'i stipulated time.
The packet data radio system can as an example comprise a first sub-system and a second sub-system serving a number of users with radio units, where the first sub-system, the second sub system and the radio units comprise a firs and a second protocol layer.
Figure 1 illustrates a schematic block diagram of a GPRS system 100 which is an example of a packet data radio system comprising an LLC protocol layer PL1 as the first protocol layer, and an RLC protocol layer PL~'. as the second protocol layer (LLC -2~ Logical Link Control and RLC = Radio Link Control).
The GPRS system 100 in this example comprise a switching system SS, a base station system BSS and a number of users A-C with radio units RU1-RU3.
The LLC and RLC protocol layers PL1, PL2 respectively in radio unit RU2 and RU3 are noi= illustrated in figure 1.
At least one radio link L is used for radio transmissions between the base station system BSS and the users A-C. The base ~
station system BSS is connected to the switching system SS via a trunk line T1. The switching system SS can as an example be connected via a trunk line T2 to a fixed data communications network, e.g. an Intranet, the Internet, or to the public switched telephone network (PSTN).
In the GPRS system 100, .incoming data packets (e. g. IP packets) over the trunk line T2 t:o the SS are segmented into data frames (LLC frames) of maximum. length 1.5 Kbytes. The LLC frames are processed in the LLC protocol layer PL1 within the SS. The LLC
frames are submitted ovE:r the trunk line T1 to the RLC protocol layer PL2 in the BSS whe re they are segmented into data blocks, RLC blocks. The number of RLC blocks comprising an LLC frame depends on the size of the LLC frame and the (radio block) coding used. In GPRS, a:n LLC frame is typically segmented into 30 to 80 RLC blocks. Tt;ue RLC blocks are fit to be transferred one by one across the radio link L.
The LLC protocol layer, defined in the technical specifications for GPRS TS GSM 04.64, is a protocol layer that works between a switching node and a radio unit. In one aspect of GPRS, the LLC
protocol layer segments, and addresses incoming data packets from any application u~;ing GPRS (e. g., TCP/IP) to LLC packet data units ("LLC frames"). The LLC protocol layer then uses more primitive radio interface protocols, e.g. an RLC protocol, as a bearer service for transporting the LLC frames to the peer LLC
logical unit in the radio unit. In the LLC protocol layer of the radio unit, the LLC frames are received, the application data units are reconstructed and forwarded to the application. The LLC protocol layer can run in acknowledge mode, in which case each LLC frame is acknowledged at successful reception in the receiving end. In this mode, LLC frames that have not been acknowledged to the sending side within a stipulated time are said to time out, and are retransmitted to the receiving side.
The RLC protocol layer, defined in the technical specifications for GPRS TS GSM 04.60, is a protocol layer that works between a WO 99/57840 PC'T/SE99/00611 BSS node and the radio unit. In one aspect of GPRS, the RLC
protocol layer segments, and addresses LLC frames received from the LLC protocol layer into radio blocks ("RLC blocks"). The radio blocks are then transmitted over the radio interface, 5 possibly using an acknowledgement mechanism in the RLC
protocol. In a receiving radio unit, the RLC protocol layer is responsible for reconstructing the LLC frames and for forwarding the LLC frames to the LLC protocol layer in that unit.
1.0 Figure 2 shows an illustration of radio blocks Rb belonging to a segmented LLC frame Lf in a packet data radio system, e.g. a GPRS system. The LLC frame Lf and its radio blocks Rb is an example of a data frame comprising a number of data blocks.
Figures 3a-c show an illustration of an example of a data frame 7.5 processing scenario according to prior art utilised in the GPRS
system 100 according to figure 1. The details of the SS, the first protocol layer P~L1, user C and the radio units of user A, B, C respectively are not shown in these figures.
The users A and B sharE=_ one radio link L with a capacity of SO _ ~0 radio blocks per second.
The block error rate (BLER) is 25o for both users.
An ARQ (Automatic Repeat Request) protocol is used, so that a radio block that is not received correctly by a radio unit in the system is re-transmitted.
a'.5 The LLC frames Al and B1-B2 have a time-out period that is set to 3 seconds. If the SS does not receive an acknowledgement from the BSS within 3 seconds from that an LLC frame is submitted from the SS to the BBS, that LLC frame will be re-submitted to the BSS.
30 Points of time T are introduced in the text below to make the description of the sc<~nario more clear and easy to understand.
The points of time T acre not shown in the figures.
~
According to figure 3a (T=0), the BSS is busy transmitting an LLC frame B1, one radio block Rb at the time, to user B over the radio link L. The RLC protocol layer PL2 in t:he BSS
receives an LLC frame ;~l addressed to user A from the SS. The .'p LLC frame A1 is stored. and segmented into 60 radio blocks in the RLC protocol layer PL2. The radio blocks are not shown in the figure.
At completion of the transfer of the LLC frame B1, according to figure 3b (T=1.6 seconds) , the BSS starts to transmit the LLC
frame A1, one radio block Rb at the time, to user A over the radio link L. At the same time, following the acknowledgement from an LLC protocol layer in the radio unit of user B to the SS of a successfully transmitted LLC: frame B1 to usE:r B, a second LLC frame B2 to user B is submitted to the RLC protocol layer PL2 in the BSS from the SS.
With a BLER of 25~, it: will take 80 radio blocks to complete the transfer of the LLC: frame A1.
According to figure 3c (T=3.0 seconds), the BSS is still busy transmitting the LLC frame A1. Three seconds have now passed since the LLC frame A:l was submitted from the SS to the RLC
protocol layer PL2 in the BSS, and no acknowledgement of: A1 has been sent to the SS. In accordance with the GPRS protocol, the time out period of 3 seconds for the LLC frame Al has elapsed (timed out). The remaining radio blocks Rb in the RLC protocol layer PL2 in the BSS belonging to the LLC frame A1 are flushed (deleted). The LLC frame A1 is re-submitted to the RLC protocol layer PL2 in the BSS from the SS and stored. The flushed data frame A1 is marked with an X in the figure. The BSS starts to transmit the LLC frame B2 to user B.
The only useful radio blocks that have been transmitted across the radio interface at the period of time T=3 seconds are those belonging to the LLC frame B1, see user B in figure 3c. Useful radio blocks are defined as undamaged radio blocks belonging to complete LLC frames forwarded to a radio unit. No radio block from the LLC frame A1 is useful, since the LLC frame A1 is not transmitted across the radio kink L in its completeness.
The LLC frame A1 has to be re-transmitted.
In the example, both users A and B experience a BLER of 25%, meaning that on the average 25% of the radio blocks have to be re-transmitted over the radio link L. This rakes the maximum -effective throughput aver the radio link 75% of the full link capacity. With prior a.rt according to figure 3a-c, 60 out of 1C1 150 radio blocks transmitted between T=0 and T=3 seconds are useful, which leads to a throughput of 40% curing that period of time. This is largely due to the waste of radio resources on LLC frames that time out. (in the example the PLC frame A1).
Figures 4a-b illustrate>.s a flow chart of a first embodiment of the method according t.o the present invention for processing data frames in a packet data radio system comprising the LLC
protocol layer PL1 and the RLC protocol layer PL2. The LLC
protocol layer PL1 and the RLC protocol layer PL2 are examples of a first and a second protocol layer.
Some of the steps in the first embodiment will also be described in conjunction with figures 5a-d below where the method is utilised in a data frame processing scenario.
According to a step 401a in figure 4a, the LLC protocol .layer PL1 in the SS submits new LLC frames to the RLC protocol layer PL2 in the BSS.
According to a step 401b, the RLC protocol layer PL2 segments each LLC frame into a number of radio blocks, e.g. 50 radio blocks, and stores the LLC frames in the same order as they are received.
According to a step 402a, the LLC protocol layer PL1 re-submits previously timed out LLC: frames (see step 407 and 410) to the RLC protocol layer PL2.
' CA 02330848 2000-10-30 According to a step 402b, the RLC protocol layer PL2 segments and stores the re-submitted LLC frames together with the new LLC frames.
According to a step 903,. the RLC protocol layer PL2 estimates S the radio resources to be allocated over a period of time, e.g.
3 seconds, for transmission of each LLC frame stored in the RLC
protocol layer PL2.
According to a step 404,. the RLC protocol layer PL2 estimates a remaining transmission time for each LLC frame presently being transmitted from the RLC protocol layer. The remaining transmission time is t:he time to successfully transmit all remaining RLC blocks in the BSS belonging to an LLC frames under transmission. The LLC frames are transmitted one RLC block at the time. The BSS can as an example use previously acquired information about the BhER, new information about the BLER (see step 415) and the estimated radio resources according to step 403 to estimate the remaining transmission time.
If, according to a step 405, an LLC frame has an estimated remaining transmission time exceeding a remaining time of its time out period, the LhC frame is detected in advance to time out (i.e., the detection of the impending time our is done before the actual time out occurs) and the method continues with a step 406.
If, according to step 405, no time out is detected ~'.n advance, the method continues to transmit remaining data blocks of the LLC frame under transmission and continues with a step 408.
According to step 406, the RLC protocol layer PL2 interrupts the transmission of the LLC frame detected in advance to time out (step 405) before any more RLC blocks belonging to that LLC
frame are transmitted.
According to a step 407, the RLC protocol layer PL2 flushes (deletes) all the remaining RLC blocks belonging to the LLC
frame detected to be timed out in step 405. The method continues with step 408.
According to the step 408, the RLC protocol layer PL2 estimates a transmission time for each LLC frame presently being stored in the RLC protocol layer. The transmission time for an LLC
frame is the time it would take to successfully transmit over the radio link L, all t=he RLC blocks comprising that LLC frame.
IO As in step 409, previously acquired information about t:he BLER
(Block Error Rate), new information about the BLER (see step 415) and the estimated radio resources according to step 404 is used to estimate the tz-ansmission time.
If, according to a step 409 in figure 4b, a stored LLC frame 1!p has an estimated transmission time exceeding its time out period, that LLC frame is detected in advance to time out and the method continues with a step 410.
If, according to step 409, no time out is detected in advance, the method continues with a step 411.
20 According to step 410, the RLC protocol layer PL2 flushes (deletes) all the LLC frames that in step 409 are detected to time out. The method continues with step 411.
According to step 411, the RLC protocol layer PL2 schedules the order in which the stored LLC frames will be transmitted to 2'_i their respective user. The scheduling is made in such a way that a maximum number. of the LLC frames in the RLC protocol layer are going to be transmitted in their completeness before they time out. The method uses the estimated transmission times acquired in step 908 and the remaining time of the LLC frames 30 time out periods to schedule the stored LLC frames.
According to a step 412, the RLC protocol layer PL2 transmits one or more RLC blocks belonging to one or more LLC
frames to one or more users according to the scheduling in step 411.
According to a step 413x, the RLC protocol layer PL2 receives an ACK or NACK for each one of the RLC blocks transmitted according to step 412 (,ACK = a positive acknowledge, NACK = a negative acknowledge according to the ARQ protocol).
According to a step 413b, transmitted RLC blocks for which a 10 NACK is received are re-transmitted according to known ARQ
protocols.
According to a step 414, the RLC protocol layer PL2 records the number of re-transmissions needed to transmit each radio block.
According to a step 415, the RLC protocol layer PL2 calculates 15 the BLEB for each transmission where an ACK or NACK according to step 413a is received, by using the number of re-transmissions recorded _i.n step 414. These BLER values are then used in step 404 and 40E3 to estimate the transmission times.
In a second embodiment of the method according to the present invention, not illust=rated in any figure, a negative acknowledgement is tran:~mitted from the RLC protocol layer PL2 to the LLC protocol layer PL1 after an LLC frame is detected in advance to time out and flushed according to step 407 or step 410.
An identical LLC frame t.o the flushed LLC frame is re-submitted from the LLC protocol layer PL1 to the RLC protocol layer PL2 immediately after the negative acknowledgement is received due to the flushed LLC frame. The method continues as in the first embodiment in figure 4a--b with step 408 or step 411.
Figures 5a-d show an illustration of a data frame processing scenario where the first embodiment of the method according to figures 4a-b is utilised. The scenario is identical to that in figure 3. References are made both to figures 5a-d and to the corresponding steps in figure 4a-b.
Points of time T are introduced in the text below to make the .'i description of the scenario more clear and easy to understand.
The points of time T are not shown in the figures.
According to figure 5a (T=0), the RLC protocol :gayer PL2 has received, according to step 401a, the new LLC =came A1 from the LLC protocol layer PL1. The RLC protocol layer PL2 segments the f 1C1 LLC frame A1 into 60 radio blocks according to step 401b. The RLC protocol layer PL2 is busy transmitting the LLC frame B1, one radio block Rb at the time, to user B according to step 412.
According to figure 5b ('r=1.6 seconds), the transmission of the 1~~ LLC frame B1 to user B is completed.
Following an acknowledgement from user B of the successfully transmitted LLC frame B1, the LLC protocol layer PL1 submits the LLC frame B2 to the RLC protocol layer PL2, according to step 901a. The LLC frame B2 is segmented into 60 radio blocks 2C~ and stored in the RLC protocol layer PL2, according t o step 401b. There are now two LLC frames (A1 and B2) , stored in the RLC protocol layer PL2. No timed out LLC frame is submitted according to step 402a.
The RLC protocol layer PL2 estimates.the radio resources to be 25 one GPRS channel, corresponding to a bare bandwidth of 50 radio blocks per second, according to step 403.
No LLC frame is presently being transmitted, and the method proceeds to step 408 where the RLC protocol layer PL2 estimates the transmission times of the stored LLC frames A1 and B2.
30 During the previous transmission of the LLC frame B1, the BLER
of user B was measured to 25~, and hence the RLC protocol layer PL2 estimates the transmission time of B2 to be 1.6 seconds (80 radio blocks, including' 25$ re-transmissions). No BLEB-related information is available for user A, so the transmission time ' CA 02330848 2000-10-30 for A1 is optimistically estimated to i.2 seconds (60 radio blocks, no re-transmissions).
The time remaining before time outs occur, are for A1 and B2 1.4 seconds and 3.0 seconds respectively. These are larger than the estimated transmission times, hence no time out is detected in advance in step 409.
In step 411, the LLC frame Al is scheduled for immediate transmission, and the LhC frame B2 is scheduled to follow. With this scheduling, according to the estimated transmission times in step 408, both A1 and B2 will be transmitted in their completeness before the~~.r respective time outs.
The method proceeds with steps 412-415, where the RLC protocol layer starts to transmit the LLC frame Al, one radio block Rb at the time, to user A over the radio link L. AC:K/NACK
information for each transmitted RLC block is received from user A. The RLC protocol layer PL2 records the number of re-transmissions and calcuT.ates the BLER.
According to the scenario in figure 5c (T=1.84 seconds) 12 radio blocks of the LLC frame A1 have been transmitted. With an actual BLER of 25~, 9 of the 12 radio blocks have been correctly received, whi.Le 3 have been damaged when 'ransmitted over the radio link L. Based on this success rate, the RLC
protocol layer PL2 haves calculated the BLER for user A to be 25~.
The method once again follows the flow diagram in figure 4a-b.
No new LLC frames are submitted according to steps 401a and 402a. T_n step 403, the radio resources are once more estimated to be 50 radio blocks pE~r second.
With a BLEB of 25~ for user A, the estimated transmission time, according to step 404, for the 51 remaining radio blocks belonging to the LLC frame A1 under transmission is 1.36 seconds. Since the remaining time of the time out period for the LLC frame A1 is now 1.16 seconds, a time out of the LLC
frame A1 is detected (in advance) in step 905.
The transmission of tl~e LLC frame Al is interrupted, and the remaining radio blocks in PL2 belonging to the LLC frame Al are flushed according to step 406 and 407 respectively. The flushed part of the LLC frame A1 in the RLC protocol layer PL2 is marked with an X in figure 5c.
In step 408, the transmission time of the stored LLC frame B2 is again estimated to 1.6 seconds. Since the remaining time of its time out period is 2.76 seconds, there is no time out of the LLC frame B2 detected in step 409. With only the LhC frame B2 stored in the RLC protocol layer PL2, the scheduling in step 411 is trivial, and the method proceeds with steps 412-415 to transmit RLC blocks belonging to the LLC frame B2.
1~ According to the scenario in figure 5d (T=3 seconds), the BSS
is busy transmitting tlae LLC frame B2. Three seconds have now passed since the LLC protocol layer PL1 submitted the LLC frame A1 to the RLC protocol Iayer PL2. User A has not received the LLC frame A1 (which was flushed at T=1.84 seconds, see figure 5c), and accordingly, no acknowledgement-of-reception of the LLC frame A1 has been transmitted from user A to t:he LLC
protocol layer PL1. Th~~ time out period of 3 seconds for the acknowledgement of the LLC frame A1 has elapsed (timed out), and consequently the L:LC frame A1 is re-submitted to the RLC
protocol PL2 according to step 402a.
The useful radio bloc k; that have been transmitted across the radio link are those lbelonging to the LLC frame B1 and B2 (provided that the remaining radio blocks of the LLC frame B2 in figure 5d are completely transmitted within the next 1.6 seconds) to user B.
Out of the total of 150 radio blocks transmitted during the 3 second period depicted in figures 5a-d, with 25$ BLER, 75$ of the 138 radio blocks transmitted to user B contributed to the ' CA 02330848 2000-10-30 throughput. The through~,put is hence 67%, which is to be compared to the throughput of 40% in the same scenario using prior art in figure 3a-c. The improvement is entirely due to the inventive method, which enables the BSS to stop the .'i transfer of A1.
The Block Error Rate (BLER) is an example of a transmission parameter the RLC protocol layer PL2 can use to estimate the transmission time to successfully transmit a stored LLC frame, according to step 408 :in figure 4a, or an LLC frame presently 1C~ being transmitted, according to step 404.
As previously mentioned, the BLER for a user/system is calculated by recording what fraction of the radio blocks transmitted over the radio link L to a user/system haves to be re-transmitted, according to step 414.
15 The method can as an example use the BLER of the latest transmitted LLC frame oz- radio block over the radio link L or an average value of the BLER of a number of previous transmitted LLC frames or radio blocks.
The transmission time can as an example be calculated as (time 20 to transmit one block)x(number of remaining blocks)/(1-BLER).
Other examples of transmission parameters an RLC protocol layer PL2 can use to estimate the transmission time according to step 404 and step 408 in figure 4a are the bit error rate (BER), and the cell average of BLEB and BER. A lower bound on the 25 transmission time for any given LLC frame is always given by the number of remaining radio blocks of that LLC frame divided by the bare capacity of the packet data radio system (radio blocks/second) in that cell.
If no current information about the BLEB, BER or time delays is 30 available, e.g. after a long break in the transmission over the radio link L, the RLC protocol layer can use, e.g. an old BLER
value, a measured cell average or a fixed default value.
The first and second embodiment of the method have been described for a down-link transmission, see figure 5a-d, where at least one u~>er with a radio unit is a receiver of transmitted LLC frames from a BSS. The methods can also be 5 applied on an up-link 'transmission where a BSS is a receiver of transmitted LLC frames from at least one radio unit.
The method according tc> figure 9a-b can be applied on an up-link transmission where a radio unit schedules the transmission of its LLC frames in a situation where the LLC frames belong to 1~~~ different data flows.
One example of such a situation is when a user is running several applications simultaneously over one GPRS channel, so that LLC frames belonging to different data flows compete for resources on the radio link L.
1'i Another example of such a situation is when several users are sharing one radio unit. The radio unit schedule the LLC frames of the different users over the tby the BSS) allocated up-link resources.
The main difference from the down-link transmission is that only 2() one radio link L is used, so that the estimated BLEB is identical for all users.
A radio unit for utilising the first and second embodiment of the method can as an example comprise an LLC layer as the first W
protocol layer and an RLC protocol layer as the second protocol 2'i layer. On top of the LLC layer, one or more applications can run in parallel.
The method according to figure 9a-b can also be applied on an up-link transmission where the BSS schedules up-link transfers from different radio units, i.e. determines which user shall access the radio link for up-link transmission.
Figures 6a-b illustrates a flow chart of a third embodiment of the method according to the present invention for processing data frames in a packet data radio system, where the BSS schedules up-link transmissions from different radio units.
The up-link workflow acr_ording to figures 6a-b runs in the BSS
which needs exactly th<~ same information regarding the up-link transmissions as it do~as regarding the down-link transmissions illustrated in figure 4a-b.
According to a step 601, the BSS receives information (about length and time to time-out) from the radio units for new data frames submitted to the RLC protocol layer PL2 in each radio unit.
According to a step 602, the BSS receives information (about length and time to lime-out) from the radio units. about 1.'~ previously timed out data frames that are being re-submitted to the RLC protocol layer 1?L2 in each radio unit.
Step 603-605 are the same as step 403-405 respectively according to figure 4a. In case of a detected time out in step 605 the BSS
instructs the radio i.mit in a step 606 to interrupt the transmission of the LLC frame to be timed out. This automatically induces a flush of that LLC frame in the radio unit at the time of time-out.
Alternatively, at the dE~tection of a frame from a user/system to time out in step 605, the BSS may simply not allocate radio 2.'i resources to that user/system until the frame has indeed timed out . Also this will induce a flush and a re-submissions of the frame to PL1 in the radio unit.
According to a step 60'7, the BSS estimates transmission times for data frames stored in the RLC protocol layer in each radio unit. The estimation is made in the same way as in step 408 according to figure 4a.
According to a step 608, the BSS schedules the transfers of the data frames stored in each radio unit. The scheduling is made in the same way as in step 411 according to figure 4b.
According to a step 609, the BSS instructs each radio unit to '> transmit one or more data blocks from scheduled data frames.
According to a step 610, the RLC protocol layer PL2 in each radio unit re-transmit damage radio blocks to the BSS.
According to a step 61:1, the BSS records the number of damaged radio blocks received from the radio units.
According to a step 6:12, the BSS calculates the BLER of the transmissions from each radio unit. The calculation is made in the same way as in step 415 according to figure 4b.
The crucial difference in the up-link transmission according to figures 6a-b as compared to the down-link transmission in 1'~ figures 4a-b is that for each LLC frame submitted to the RLC
protocol layer PL2 in each radio unit, information about the LLC
frame length and time to time out have to be reported to the BSS.
The methods according t:o the present invention may be repeated 2G automatically to give a continuos re-evaluation of which LLC
frame to transmit next. As an example the methods can be repeated once every 240ms.
The methods may as an .alternative be event-initiated, e.g. the arrival of an LLC frame to the RLC protocol layer PL2 or after a 25 determined number of tr<~nsmitted radio blocks Rb.
Figure 7 illustrates a block diagram of an embodiment of means 700 for utilising the method according to the present invention.
A radio resource estimator 701, to allocate radio resources for transmission of LLC frames, is connected to a transmission time ~
estimator 702, for estimating the transmission times for the LLC frames.
The transmission time estimator ?02 is connected to a frame deleting unit 703 and a scheduler 704.
'i The frame deleting unit 703 is arranged to detect in advance if a time out occurs, interrupt the transmission of LLC frames and flush LLC frames. The frame deleting unit 703 can also as an alternative transmit negative acknowledgements to a frame submitting unit 709 when data frames are detected in advance to time out. The frame deleting unit 703 is connected to a queue device 705.
The frame submitting unit 709 is also connected to the queue device 705. The frame ~:ubmitting unit 709 is arranged to submit data frames to the queue device 705 and to re-submit identical 1.'i data frames to flushed data frames wlhen the time out periods for the flushed data frames have elapsed and/or when a negative acknowledgement is received from the frame deleting unit 703.
The scheduler 704, for determining the order in which the LLC
frames are going to be transmitted from the queue device 705, is also connected to the queue device 705.
The queue device 705, i.n which the LLC frames to be transmitted are stored in a queue and segmented into RLC blocks, is connected to a transmitter 706, for transmitting and re-transmitting RLC blocks.
2.'i A receiver 707, arranged to receive ACK/NACK signals, is connected to a link quality estimator 708, which records the number of re-transmissions needed to successfully transmit each RLC block and calculates the BLER.
The link quality estimator 708 is connected to the transmission 3s) time estimator 702.
The invention cam be completely or partially implemented as software in at least one microprocessor.
As an example, the radio resource estimator 7U1, the transmission time estimator 702, the frame deleting unit 703, the scheduler 704, the queue device 705 and the link quality estimator 708 can be logical units in at least one computer system.
The packet data radio system described in conjunction with figure 4a-6b is a GPRS system comprising an LLC protocol layer PL1 and an RLC protocol layer PL2. As mentioned before this is just one example of a packet data radio system where the invention can be utilised and one example of how such a system can be arranged. The invention applies to any packet data radio system that has a protocol layered structure.
A system or device in which the invention is utilised can be divided into any number of protocol layers, function blocks, units, sub-systems or similar to transfer packet data from one place to another.
As an example the switching system SS and the base station system BSS, according to figure l, can be integrated in one single system.
The present invention meets some problems related to optimising the processing of framed packet data where a data frame comprises of a number of data blocks.
S One problem occurs when a data frame which is being transmitted to a user/system across a radio link times out before it is completely transmitted.
Another problem occurs when data blocks which have been transmitted to a user/'system across a radio interface a first l~ time have to be re-transmitted again over the radio link when the associated data frame times out.
In light of the foregoing, a primary object of the present invention is to provide methods and means for processing data blocks in a packet data radio system.
1',i Another object of the present invention is to provide methods and means for efficiently utilising the bandwidth of the system.
Still another object is to process the data b socks in a packet data radio system in such a manner that a maxi:"um number of the 2U corresponding data frannes transferred across a radio interface are acknowledged before they time out:
Yet another object of the present invention is to minimise the number of unnecessary re-transmissions over a radio link due to time outs of data frame's.
2_'. In a method according to the present invention a transmission time to completely transmit a data frame over a radio link is estimated and this information is used to judge if the data frame can be completely transmitted before it times out. The method also uses said information to schedule the order in 30 which the data frames are to be transmitted.
' CA 02330848 2000-10-30 According to one embodiment of the method a second protocol layer transmits data frames to a user. The Block Error Rate (BLER) is measured in the second protocol layer by rE:cording what fraction of the radio blocks transmitted to the user that S have to be re-transmitted. Using this information, and information about the radio resources to be allocated for the transmission, the transmission time for each data frame stored in or under transmission from the second protocol layer is estimated. If the estimated transmission time of any data frame is larger than a remaining time of a time out period of that data frame, that data frame shall be flushed in the second protocol layer. The transmission of the remaining data games from the second protocol layer are scheduled to minimise the number of data frames that time out in the second protocol layer. In accordance with a re-transmission protocol of a first protocol layer, the first protocol layer re-submits a new data frame, identical to the flushed data frame, to the second protocol layer.
A system and a radio unit comprise means for utilising the method according to the present invention.
According to one embodiment of the radio unit, the =ad:io unit comprises means for: estimating radio resources to be allocated for transmissions; measuring the Block Error Rate (BLER);
estimating the transmission time for each data frame in the 2.'i second protocol layer _Ln the radio unit; detecting in advance if time outs will occur'; and scheduling the order in which the data frames are to be transmitted from the radio unit.
If a time out for a data frame is detected in advance, the radio unit has means to immediately stop and flush that data frame.
According to one embodiment of the system, the system comprises means for: estimating radio resources to be allocated for transmissions; measuring the Block Error Rate (BLER);
estimating the transmission time for each data frame in the second protocol layer in the system; scheduling the order in which the data frames are to be transmitted from the system; , and detecting in advance if a time out will occur.
If a time out is detE~cted in advance for a data frame, the -system has means to imnnediately stop and flush that data frame.
An advantage with the present invention is that radio resources are not wasted on data frames that are estimated to time out and to be re-transmitted anyway. Thus, the bandwidth of the system 1~ is more often used for useful transmission, which in turn increases data throughput and reduces delay.
Another advantage is that the transmission is less sensitive to periodical interference which can completely block a connection to a user, hence causing long delays to other users in the 1.'i system.
Yet another advantage is that the risk of transmitting the same data frame twice due to re-submission to a second protocol layer of a data frame that is anyway being transmitted t:he first time is eliminated.
Figure 1 is a view of a. block diagram of a GPRS system.
Figure 2 is illustrating an LLC frame segmented into a number of RLC blocks.
Figures 3a-c are illusl_rating an example of a known data frame processing scenario.
Figures 4a-b are illustrating a flow chart of a first embodiment of a method according to the present invention.
Figures Sa-d are illusi_.rating a data frame .processing scenario 1() utilising the first embodiment of the method according to figures 4a-b.
Figures 6a-b are illustrating a flow chart of a third embodiment of a method .according to the present invention.
Figure 7 is illustrating a block diagram of an embodiment of 1.'i means according to the ;present invention.
DETAILED DESCRIPTION OF EMBODI~TTS
The present invention relates to methods and means for processing data frames in a packet data radio system in a way that leads to an efficient use of the radio resources and a good throughput.
The packet data radio system shall preferably comprise a protocol layered structure, where in a specified layer, a first packet data unit submitted to the specified _ayer is further segmented (divided) into smaller second packet data units before transmission over a radio link to a user/system.
The first packet data unit submitted to the specified layer is resubmitted to that specified layer if it is not acknowledged to have been correctly received by the user/system within a 1.'i stipulated time.
The packet data radio system can as an example comprise a first sub-system and a second sub-system serving a number of users with radio units, where the first sub-system, the second sub system and the radio units comprise a firs and a second protocol layer.
Figure 1 illustrates a schematic block diagram of a GPRS system 100 which is an example of a packet data radio system comprising an LLC protocol layer PL1 as the first protocol layer, and an RLC protocol layer PL~'. as the second protocol layer (LLC -2~ Logical Link Control and RLC = Radio Link Control).
The GPRS system 100 in this example comprise a switching system SS, a base station system BSS and a number of users A-C with radio units RU1-RU3.
The LLC and RLC protocol layers PL1, PL2 respectively in radio unit RU2 and RU3 are noi= illustrated in figure 1.
At least one radio link L is used for radio transmissions between the base station system BSS and the users A-C. The base ~
station system BSS is connected to the switching system SS via a trunk line T1. The switching system SS can as an example be connected via a trunk line T2 to a fixed data communications network, e.g. an Intranet, the Internet, or to the public switched telephone network (PSTN).
In the GPRS system 100, .incoming data packets (e. g. IP packets) over the trunk line T2 t:o the SS are segmented into data frames (LLC frames) of maximum. length 1.5 Kbytes. The LLC frames are processed in the LLC protocol layer PL1 within the SS. The LLC
frames are submitted ovE:r the trunk line T1 to the RLC protocol layer PL2 in the BSS whe re they are segmented into data blocks, RLC blocks. The number of RLC blocks comprising an LLC frame depends on the size of the LLC frame and the (radio block) coding used. In GPRS, a:n LLC frame is typically segmented into 30 to 80 RLC blocks. Tt;ue RLC blocks are fit to be transferred one by one across the radio link L.
The LLC protocol layer, defined in the technical specifications for GPRS TS GSM 04.64, is a protocol layer that works between a switching node and a radio unit. In one aspect of GPRS, the LLC
protocol layer segments, and addresses incoming data packets from any application u~;ing GPRS (e. g., TCP/IP) to LLC packet data units ("LLC frames"). The LLC protocol layer then uses more primitive radio interface protocols, e.g. an RLC protocol, as a bearer service for transporting the LLC frames to the peer LLC
logical unit in the radio unit. In the LLC protocol layer of the radio unit, the LLC frames are received, the application data units are reconstructed and forwarded to the application. The LLC protocol layer can run in acknowledge mode, in which case each LLC frame is acknowledged at successful reception in the receiving end. In this mode, LLC frames that have not been acknowledged to the sending side within a stipulated time are said to time out, and are retransmitted to the receiving side.
The RLC protocol layer, defined in the technical specifications for GPRS TS GSM 04.60, is a protocol layer that works between a WO 99/57840 PC'T/SE99/00611 BSS node and the radio unit. In one aspect of GPRS, the RLC
protocol layer segments, and addresses LLC frames received from the LLC protocol layer into radio blocks ("RLC blocks"). The radio blocks are then transmitted over the radio interface, 5 possibly using an acknowledgement mechanism in the RLC
protocol. In a receiving radio unit, the RLC protocol layer is responsible for reconstructing the LLC frames and for forwarding the LLC frames to the LLC protocol layer in that unit.
1.0 Figure 2 shows an illustration of radio blocks Rb belonging to a segmented LLC frame Lf in a packet data radio system, e.g. a GPRS system. The LLC frame Lf and its radio blocks Rb is an example of a data frame comprising a number of data blocks.
Figures 3a-c show an illustration of an example of a data frame 7.5 processing scenario according to prior art utilised in the GPRS
system 100 according to figure 1. The details of the SS, the first protocol layer P~L1, user C and the radio units of user A, B, C respectively are not shown in these figures.
The users A and B sharE=_ one radio link L with a capacity of SO _ ~0 radio blocks per second.
The block error rate (BLER) is 25o for both users.
An ARQ (Automatic Repeat Request) protocol is used, so that a radio block that is not received correctly by a radio unit in the system is re-transmitted.
a'.5 The LLC frames Al and B1-B2 have a time-out period that is set to 3 seconds. If the SS does not receive an acknowledgement from the BSS within 3 seconds from that an LLC frame is submitted from the SS to the BBS, that LLC frame will be re-submitted to the BSS.
30 Points of time T are introduced in the text below to make the description of the sc<~nario more clear and easy to understand.
The points of time T acre not shown in the figures.
~
According to figure 3a (T=0), the BSS is busy transmitting an LLC frame B1, one radio block Rb at the time, to user B over the radio link L. The RLC protocol layer PL2 in t:he BSS
receives an LLC frame ;~l addressed to user A from the SS. The .'p LLC frame A1 is stored. and segmented into 60 radio blocks in the RLC protocol layer PL2. The radio blocks are not shown in the figure.
At completion of the transfer of the LLC frame B1, according to figure 3b (T=1.6 seconds) , the BSS starts to transmit the LLC
frame A1, one radio block Rb at the time, to user A over the radio link L. At the same time, following the acknowledgement from an LLC protocol layer in the radio unit of user B to the SS of a successfully transmitted LLC: frame B1 to usE:r B, a second LLC frame B2 to user B is submitted to the RLC protocol layer PL2 in the BSS from the SS.
With a BLER of 25~, it: will take 80 radio blocks to complete the transfer of the LLC: frame A1.
According to figure 3c (T=3.0 seconds), the BSS is still busy transmitting the LLC frame A1. Three seconds have now passed since the LLC frame A:l was submitted from the SS to the RLC
protocol layer PL2 in the BSS, and no acknowledgement of: A1 has been sent to the SS. In accordance with the GPRS protocol, the time out period of 3 seconds for the LLC frame Al has elapsed (timed out). The remaining radio blocks Rb in the RLC protocol layer PL2 in the BSS belonging to the LLC frame A1 are flushed (deleted). The LLC frame A1 is re-submitted to the RLC protocol layer PL2 in the BSS from the SS and stored. The flushed data frame A1 is marked with an X in the figure. The BSS starts to transmit the LLC frame B2 to user B.
The only useful radio blocks that have been transmitted across the radio interface at the period of time T=3 seconds are those belonging to the LLC frame B1, see user B in figure 3c. Useful radio blocks are defined as undamaged radio blocks belonging to complete LLC frames forwarded to a radio unit. No radio block from the LLC frame A1 is useful, since the LLC frame A1 is not transmitted across the radio kink L in its completeness.
The LLC frame A1 has to be re-transmitted.
In the example, both users A and B experience a BLER of 25%, meaning that on the average 25% of the radio blocks have to be re-transmitted over the radio link L. This rakes the maximum -effective throughput aver the radio link 75% of the full link capacity. With prior a.rt according to figure 3a-c, 60 out of 1C1 150 radio blocks transmitted between T=0 and T=3 seconds are useful, which leads to a throughput of 40% curing that period of time. This is largely due to the waste of radio resources on LLC frames that time out. (in the example the PLC frame A1).
Figures 4a-b illustrate>.s a flow chart of a first embodiment of the method according t.o the present invention for processing data frames in a packet data radio system comprising the LLC
protocol layer PL1 and the RLC protocol layer PL2. The LLC
protocol layer PL1 and the RLC protocol layer PL2 are examples of a first and a second protocol layer.
Some of the steps in the first embodiment will also be described in conjunction with figures 5a-d below where the method is utilised in a data frame processing scenario.
According to a step 401a in figure 4a, the LLC protocol .layer PL1 in the SS submits new LLC frames to the RLC protocol layer PL2 in the BSS.
According to a step 401b, the RLC protocol layer PL2 segments each LLC frame into a number of radio blocks, e.g. 50 radio blocks, and stores the LLC frames in the same order as they are received.
According to a step 402a, the LLC protocol layer PL1 re-submits previously timed out LLC: frames (see step 407 and 410) to the RLC protocol layer PL2.
' CA 02330848 2000-10-30 According to a step 402b, the RLC protocol layer PL2 segments and stores the re-submitted LLC frames together with the new LLC frames.
According to a step 903,. the RLC protocol layer PL2 estimates S the radio resources to be allocated over a period of time, e.g.
3 seconds, for transmission of each LLC frame stored in the RLC
protocol layer PL2.
According to a step 404,. the RLC protocol layer PL2 estimates a remaining transmission time for each LLC frame presently being transmitted from the RLC protocol layer. The remaining transmission time is t:he time to successfully transmit all remaining RLC blocks in the BSS belonging to an LLC frames under transmission. The LLC frames are transmitted one RLC block at the time. The BSS can as an example use previously acquired information about the BhER, new information about the BLER (see step 415) and the estimated radio resources according to step 403 to estimate the remaining transmission time.
If, according to a step 405, an LLC frame has an estimated remaining transmission time exceeding a remaining time of its time out period, the LhC frame is detected in advance to time out (i.e., the detection of the impending time our is done before the actual time out occurs) and the method continues with a step 406.
If, according to step 405, no time out is detected ~'.n advance, the method continues to transmit remaining data blocks of the LLC frame under transmission and continues with a step 408.
According to step 406, the RLC protocol layer PL2 interrupts the transmission of the LLC frame detected in advance to time out (step 405) before any more RLC blocks belonging to that LLC
frame are transmitted.
According to a step 407, the RLC protocol layer PL2 flushes (deletes) all the remaining RLC blocks belonging to the LLC
frame detected to be timed out in step 405. The method continues with step 408.
According to the step 408, the RLC protocol layer PL2 estimates a transmission time for each LLC frame presently being stored in the RLC protocol layer. The transmission time for an LLC
frame is the time it would take to successfully transmit over the radio link L, all t=he RLC blocks comprising that LLC frame.
IO As in step 409, previously acquired information about t:he BLER
(Block Error Rate), new information about the BLER (see step 415) and the estimated radio resources according to step 404 is used to estimate the tz-ansmission time.
If, according to a step 409 in figure 4b, a stored LLC frame 1!p has an estimated transmission time exceeding its time out period, that LLC frame is detected in advance to time out and the method continues with a step 410.
If, according to step 409, no time out is detected in advance, the method continues with a step 411.
20 According to step 410, the RLC protocol layer PL2 flushes (deletes) all the LLC frames that in step 409 are detected to time out. The method continues with step 411.
According to step 411, the RLC protocol layer PL2 schedules the order in which the stored LLC frames will be transmitted to 2'_i their respective user. The scheduling is made in such a way that a maximum number. of the LLC frames in the RLC protocol layer are going to be transmitted in their completeness before they time out. The method uses the estimated transmission times acquired in step 908 and the remaining time of the LLC frames 30 time out periods to schedule the stored LLC frames.
According to a step 412, the RLC protocol layer PL2 transmits one or more RLC blocks belonging to one or more LLC
frames to one or more users according to the scheduling in step 411.
According to a step 413x, the RLC protocol layer PL2 receives an ACK or NACK for each one of the RLC blocks transmitted according to step 412 (,ACK = a positive acknowledge, NACK = a negative acknowledge according to the ARQ protocol).
According to a step 413b, transmitted RLC blocks for which a 10 NACK is received are re-transmitted according to known ARQ
protocols.
According to a step 414, the RLC protocol layer PL2 records the number of re-transmissions needed to transmit each radio block.
According to a step 415, the RLC protocol layer PL2 calculates 15 the BLEB for each transmission where an ACK or NACK according to step 413a is received, by using the number of re-transmissions recorded _i.n step 414. These BLER values are then used in step 404 and 40E3 to estimate the transmission times.
In a second embodiment of the method according to the present invention, not illust=rated in any figure, a negative acknowledgement is tran:~mitted from the RLC protocol layer PL2 to the LLC protocol layer PL1 after an LLC frame is detected in advance to time out and flushed according to step 407 or step 410.
An identical LLC frame t.o the flushed LLC frame is re-submitted from the LLC protocol layer PL1 to the RLC protocol layer PL2 immediately after the negative acknowledgement is received due to the flushed LLC frame. The method continues as in the first embodiment in figure 4a--b with step 408 or step 411.
Figures 5a-d show an illustration of a data frame processing scenario where the first embodiment of the method according to figures 4a-b is utilised. The scenario is identical to that in figure 3. References are made both to figures 5a-d and to the corresponding steps in figure 4a-b.
Points of time T are introduced in the text below to make the .'i description of the scenario more clear and easy to understand.
The points of time T are not shown in the figures.
According to figure 5a (T=0), the RLC protocol :gayer PL2 has received, according to step 401a, the new LLC =came A1 from the LLC protocol layer PL1. The RLC protocol layer PL2 segments the f 1C1 LLC frame A1 into 60 radio blocks according to step 401b. The RLC protocol layer PL2 is busy transmitting the LLC frame B1, one radio block Rb at the time, to user B according to step 412.
According to figure 5b ('r=1.6 seconds), the transmission of the 1~~ LLC frame B1 to user B is completed.
Following an acknowledgement from user B of the successfully transmitted LLC frame B1, the LLC protocol layer PL1 submits the LLC frame B2 to the RLC protocol layer PL2, according to step 901a. The LLC frame B2 is segmented into 60 radio blocks 2C~ and stored in the RLC protocol layer PL2, according t o step 401b. There are now two LLC frames (A1 and B2) , stored in the RLC protocol layer PL2. No timed out LLC frame is submitted according to step 402a.
The RLC protocol layer PL2 estimates.the radio resources to be 25 one GPRS channel, corresponding to a bare bandwidth of 50 radio blocks per second, according to step 403.
No LLC frame is presently being transmitted, and the method proceeds to step 408 where the RLC protocol layer PL2 estimates the transmission times of the stored LLC frames A1 and B2.
30 During the previous transmission of the LLC frame B1, the BLER
of user B was measured to 25~, and hence the RLC protocol layer PL2 estimates the transmission time of B2 to be 1.6 seconds (80 radio blocks, including' 25$ re-transmissions). No BLEB-related information is available for user A, so the transmission time ' CA 02330848 2000-10-30 for A1 is optimistically estimated to i.2 seconds (60 radio blocks, no re-transmissions).
The time remaining before time outs occur, are for A1 and B2 1.4 seconds and 3.0 seconds respectively. These are larger than the estimated transmission times, hence no time out is detected in advance in step 409.
In step 411, the LLC frame Al is scheduled for immediate transmission, and the LhC frame B2 is scheduled to follow. With this scheduling, according to the estimated transmission times in step 408, both A1 and B2 will be transmitted in their completeness before the~~.r respective time outs.
The method proceeds with steps 412-415, where the RLC protocol layer starts to transmit the LLC frame Al, one radio block Rb at the time, to user A over the radio link L. AC:K/NACK
information for each transmitted RLC block is received from user A. The RLC protocol layer PL2 records the number of re-transmissions and calcuT.ates the BLER.
According to the scenario in figure 5c (T=1.84 seconds) 12 radio blocks of the LLC frame A1 have been transmitted. With an actual BLER of 25~, 9 of the 12 radio blocks have been correctly received, whi.Le 3 have been damaged when 'ransmitted over the radio link L. Based on this success rate, the RLC
protocol layer PL2 haves calculated the BLER for user A to be 25~.
The method once again follows the flow diagram in figure 4a-b.
No new LLC frames are submitted according to steps 401a and 402a. T_n step 403, the radio resources are once more estimated to be 50 radio blocks pE~r second.
With a BLEB of 25~ for user A, the estimated transmission time, according to step 404, for the 51 remaining radio blocks belonging to the LLC frame A1 under transmission is 1.36 seconds. Since the remaining time of the time out period for the LLC frame A1 is now 1.16 seconds, a time out of the LLC
frame A1 is detected (in advance) in step 905.
The transmission of tl~e LLC frame Al is interrupted, and the remaining radio blocks in PL2 belonging to the LLC frame Al are flushed according to step 406 and 407 respectively. The flushed part of the LLC frame A1 in the RLC protocol layer PL2 is marked with an X in figure 5c.
In step 408, the transmission time of the stored LLC frame B2 is again estimated to 1.6 seconds. Since the remaining time of its time out period is 2.76 seconds, there is no time out of the LLC frame B2 detected in step 409. With only the LhC frame B2 stored in the RLC protocol layer PL2, the scheduling in step 411 is trivial, and the method proceeds with steps 412-415 to transmit RLC blocks belonging to the LLC frame B2.
1~ According to the scenario in figure 5d (T=3 seconds), the BSS
is busy transmitting tlae LLC frame B2. Three seconds have now passed since the LLC protocol layer PL1 submitted the LLC frame A1 to the RLC protocol Iayer PL2. User A has not received the LLC frame A1 (which was flushed at T=1.84 seconds, see figure 5c), and accordingly, no acknowledgement-of-reception of the LLC frame A1 has been transmitted from user A to t:he LLC
protocol layer PL1. Th~~ time out period of 3 seconds for the acknowledgement of the LLC frame A1 has elapsed (timed out), and consequently the L:LC frame A1 is re-submitted to the RLC
protocol PL2 according to step 402a.
The useful radio bloc k; that have been transmitted across the radio link are those lbelonging to the LLC frame B1 and B2 (provided that the remaining radio blocks of the LLC frame B2 in figure 5d are completely transmitted within the next 1.6 seconds) to user B.
Out of the total of 150 radio blocks transmitted during the 3 second period depicted in figures 5a-d, with 25$ BLER, 75$ of the 138 radio blocks transmitted to user B contributed to the ' CA 02330848 2000-10-30 throughput. The through~,put is hence 67%, which is to be compared to the throughput of 40% in the same scenario using prior art in figure 3a-c. The improvement is entirely due to the inventive method, which enables the BSS to stop the .'i transfer of A1.
The Block Error Rate (BLER) is an example of a transmission parameter the RLC protocol layer PL2 can use to estimate the transmission time to successfully transmit a stored LLC frame, according to step 408 :in figure 4a, or an LLC frame presently 1C~ being transmitted, according to step 404.
As previously mentioned, the BLER for a user/system is calculated by recording what fraction of the radio blocks transmitted over the radio link L to a user/system haves to be re-transmitted, according to step 414.
15 The method can as an example use the BLER of the latest transmitted LLC frame oz- radio block over the radio link L or an average value of the BLER of a number of previous transmitted LLC frames or radio blocks.
The transmission time can as an example be calculated as (time 20 to transmit one block)x(number of remaining blocks)/(1-BLER).
Other examples of transmission parameters an RLC protocol layer PL2 can use to estimate the transmission time according to step 404 and step 408 in figure 4a are the bit error rate (BER), and the cell average of BLEB and BER. A lower bound on the 25 transmission time for any given LLC frame is always given by the number of remaining radio blocks of that LLC frame divided by the bare capacity of the packet data radio system (radio blocks/second) in that cell.
If no current information about the BLEB, BER or time delays is 30 available, e.g. after a long break in the transmission over the radio link L, the RLC protocol layer can use, e.g. an old BLER
value, a measured cell average or a fixed default value.
The first and second embodiment of the method have been described for a down-link transmission, see figure 5a-d, where at least one u~>er with a radio unit is a receiver of transmitted LLC frames from a BSS. The methods can also be 5 applied on an up-link 'transmission where a BSS is a receiver of transmitted LLC frames from at least one radio unit.
The method according tc> figure 9a-b can be applied on an up-link transmission where a radio unit schedules the transmission of its LLC frames in a situation where the LLC frames belong to 1~~~ different data flows.
One example of such a situation is when a user is running several applications simultaneously over one GPRS channel, so that LLC frames belonging to different data flows compete for resources on the radio link L.
1'i Another example of such a situation is when several users are sharing one radio unit. The radio unit schedule the LLC frames of the different users over the tby the BSS) allocated up-link resources.
The main difference from the down-link transmission is that only 2() one radio link L is used, so that the estimated BLEB is identical for all users.
A radio unit for utilising the first and second embodiment of the method can as an example comprise an LLC layer as the first W
protocol layer and an RLC protocol layer as the second protocol 2'i layer. On top of the LLC layer, one or more applications can run in parallel.
The method according to figure 9a-b can also be applied on an up-link transmission where the BSS schedules up-link transfers from different radio units, i.e. determines which user shall access the radio link for up-link transmission.
Figures 6a-b illustrates a flow chart of a third embodiment of the method according to the present invention for processing data frames in a packet data radio system, where the BSS schedules up-link transmissions from different radio units.
The up-link workflow acr_ording to figures 6a-b runs in the BSS
which needs exactly th<~ same information regarding the up-link transmissions as it do~as regarding the down-link transmissions illustrated in figure 4a-b.
According to a step 601, the BSS receives information (about length and time to time-out) from the radio units for new data frames submitted to the RLC protocol layer PL2 in each radio unit.
According to a step 602, the BSS receives information (about length and time to lime-out) from the radio units. about 1.'~ previously timed out data frames that are being re-submitted to the RLC protocol layer 1?L2 in each radio unit.
Step 603-605 are the same as step 403-405 respectively according to figure 4a. In case of a detected time out in step 605 the BSS
instructs the radio i.mit in a step 606 to interrupt the transmission of the LLC frame to be timed out. This automatically induces a flush of that LLC frame in the radio unit at the time of time-out.
Alternatively, at the dE~tection of a frame from a user/system to time out in step 605, the BSS may simply not allocate radio 2.'i resources to that user/system until the frame has indeed timed out . Also this will induce a flush and a re-submissions of the frame to PL1 in the radio unit.
According to a step 60'7, the BSS estimates transmission times for data frames stored in the RLC protocol layer in each radio unit. The estimation is made in the same way as in step 408 according to figure 4a.
According to a step 608, the BSS schedules the transfers of the data frames stored in each radio unit. The scheduling is made in the same way as in step 411 according to figure 4b.
According to a step 609, the BSS instructs each radio unit to '> transmit one or more data blocks from scheduled data frames.
According to a step 610, the RLC protocol layer PL2 in each radio unit re-transmit damage radio blocks to the BSS.
According to a step 61:1, the BSS records the number of damaged radio blocks received from the radio units.
According to a step 6:12, the BSS calculates the BLER of the transmissions from each radio unit. The calculation is made in the same way as in step 415 according to figure 4b.
The crucial difference in the up-link transmission according to figures 6a-b as compared to the down-link transmission in 1'~ figures 4a-b is that for each LLC frame submitted to the RLC
protocol layer PL2 in each radio unit, information about the LLC
frame length and time to time out have to be reported to the BSS.
The methods according t:o the present invention may be repeated 2G automatically to give a continuos re-evaluation of which LLC
frame to transmit next. As an example the methods can be repeated once every 240ms.
The methods may as an .alternative be event-initiated, e.g. the arrival of an LLC frame to the RLC protocol layer PL2 or after a 25 determined number of tr<~nsmitted radio blocks Rb.
Figure 7 illustrates a block diagram of an embodiment of means 700 for utilising the method according to the present invention.
A radio resource estimator 701, to allocate radio resources for transmission of LLC frames, is connected to a transmission time ~
estimator 702, for estimating the transmission times for the LLC frames.
The transmission time estimator ?02 is connected to a frame deleting unit 703 and a scheduler 704.
'i The frame deleting unit 703 is arranged to detect in advance if a time out occurs, interrupt the transmission of LLC frames and flush LLC frames. The frame deleting unit 703 can also as an alternative transmit negative acknowledgements to a frame submitting unit 709 when data frames are detected in advance to time out. The frame deleting unit 703 is connected to a queue device 705.
The frame submitting unit 709 is also connected to the queue device 705. The frame ~:ubmitting unit 709 is arranged to submit data frames to the queue device 705 and to re-submit identical 1.'i data frames to flushed data frames wlhen the time out periods for the flushed data frames have elapsed and/or when a negative acknowledgement is received from the frame deleting unit 703.
The scheduler 704, for determining the order in which the LLC
frames are going to be transmitted from the queue device 705, is also connected to the queue device 705.
The queue device 705, i.n which the LLC frames to be transmitted are stored in a queue and segmented into RLC blocks, is connected to a transmitter 706, for transmitting and re-transmitting RLC blocks.
2.'i A receiver 707, arranged to receive ACK/NACK signals, is connected to a link quality estimator 708, which records the number of re-transmissions needed to successfully transmit each RLC block and calculates the BLER.
The link quality estimator 708 is connected to the transmission 3s) time estimator 702.
The invention cam be completely or partially implemented as software in at least one microprocessor.
As an example, the radio resource estimator 7U1, the transmission time estimator 702, the frame deleting unit 703, the scheduler 704, the queue device 705 and the link quality estimator 708 can be logical units in at least one computer system.
The packet data radio system described in conjunction with figure 4a-6b is a GPRS system comprising an LLC protocol layer PL1 and an RLC protocol layer PL2. As mentioned before this is just one example of a packet data radio system where the invention can be utilised and one example of how such a system can be arranged. The invention applies to any packet data radio system that has a protocol layered structure.
A system or device in which the invention is utilised can be divided into any number of protocol layers, function blocks, units, sub-systems or similar to transfer packet data from one place to another.
As an example the switching system SS and the base station system BSS, according to figure l, can be integrated in one single system.
Claims (31)
1. A method for processing data frames (Lf, A1, B1-B2) in a packet data radio system, where each of said data frames (Lf, A1, B1-B2) has a specified time out period for a complete transmission to a receiver (A,B,C,RU1-RU3,BSS), said data frames (Lf, A1, B1-B2) being segmented into a number of data blocks (Rb) which are transmitted (412) one by one across a transmission medium to their respective receiver (A,B,C,RU1-RU3,BSS), characterised in that the transmission time for at least one of said data frames (Lf, A1, B1-B2) is estimated (409,408,604,607) based an at least one transmission parameter to detect in advance of a time out will occur (405,909,605), where said data frame (Lf, A1, B1-B2) is determined in advance to time out if said estimated transmission time exceeds the remaining time of its time out period.
2. The method as claimed in claim 1, characterised in that the transmission order of said data frames (Lf, A1, B1-B2) is scheduled (411,608) in order for said data frames to be transmitted to their respective receiver (A,B,C,RU1-RU3,BSS) in .such an order that the number of data frames to be timed out (A1) is minimised, where said scheduling (411,608) is based on said estimated transmission times (408,607) and said remaining time of said time out periods.
3. The method as claimed in claim 1 or 2, characterised in that a data frame (A1) detected in advance to time out (405,909,605) is flushed (407,410,606).
4. The method as claimed in one of claims 1-3, characterised in that if some of said data blocks (Rb) are not correctly received by said receiver (A,B,C,RU1-RU3,BSS) they are re-transmitted (413b,610) and that the number of re-transmissions needed to successfully transmit each data block (Rb) to its receiver (A,B,C,RU1-RU3,BSS) is recorded (414,611), where said recorded number is used to calculate (415,612) said transmission parameter used when estimating (404,408,604,607) said transmission time.
5. The method as claimed in one of claims 1-4, characterised in that said estimated transmission time is the transmission time to successfully transmit all data blocks (Rb) belonging to one data frame (Lf, A1, B1-B2).
6. The method as claimed in one of claims 1-5, characterised in that an identical data frame to said flushed data frame (A1) is re-submitted (402a) when said time out period for said flushed data frame (A1) has elapsed.
7. The method as claimed in one of claims 1-5, characterised in that a negative acknowledgement is transmitted if a data :Frame (Lf, A1, B1-B2) is detected in advance to be timed out.
8. The method as claimed in claim 7, characterised in that an identical data frame to said flushed data frame (A1) is re-submitted (402a) if said negative acknowledgement is received.
9. The method as claimed in one of claims 3-8, characterised in that said data frame (B2) which is flushed (410) is flushed before any of the data blocks (Rb) belonging to said data frame are transmitted.
10. The method as claimed in one of claims 1-9, characterised in that said method uses transmission parameters including a bit error rate when estimating (409,408,604,607) said transmission time.
11. The method as claimed in one of claims 1-10, characterised in that said method uses transmission parameters including a transmission delay time when estimating (409,408,609,607) said transmission time.
12. The method as claimed in one of claims 1-11, characterised in that said transmission medium is a radio link (L).
13. The method as claimed in one of claims 1-12, characterised in that the transmission of a data frame (A1) under transmission which is detected in advance to time out (405, 605) is interrupted (406, 606).
14. The method as claimed in one of claims 1-13, characterised in that radio resources to be allocated for said transmission is estimated (403,603).
15. The method as claimed in one of claims 1-14, characterised in that information about the length of said data frames (Lf, A1, B1-B2) and their time out periods are received (601,602).
16. The method as claimed in one of claims 1-15, characterised in that instructions regarding the order in which to transmit one or more data blocks from scheduled data frames are received (609).
17. An arrangement for processing data frames (Lf, A1, B1-B2) in a packet data radio system, where each of said data frames (Lf, A1, B1-B2) has a specified time out period for a complete transmission to a receiver (A,B,C,RU1-RU3,BSS), said arrangement includes means for:
storing (705) said data frames (Lf, A1, B1-B2);
segmenting (705) said data frames (Lf, A1, B1-B2) into a number of data blocks (Rb);
transmitting (706) said data frames (Lf, A1, B1-B2) across at least one radio link (L) to at least one receiver (A,B,C,RU1-RU3,BSS); and re-transmitting (706) data blocks (Rb) not correctly received by said receiver (A,B,C,RU1-RU3,BSS);
characterised in that said arrangement comprises means for estimating (702) the transmission time for at least one of said data frames (Lf, A1, B1-B2) and means to detect (703) in advance if a time out will occur for any of said data frames (Lf, A1, B1-B2), where said estimating is based an at least one transmission parameter, and where said data frame (Lf, A1, B1-B2) is determined to be timed out in advance if said estimated transmission time exceeds the remaining time of its time out period.
storing (705) said data frames (Lf, A1, B1-B2);
segmenting (705) said data frames (Lf, A1, B1-B2) into a number of data blocks (Rb);
transmitting (706) said data frames (Lf, A1, B1-B2) across at least one radio link (L) to at least one receiver (A,B,C,RU1-RU3,BSS); and re-transmitting (706) data blocks (Rb) not correctly received by said receiver (A,B,C,RU1-RU3,BSS);
characterised in that said arrangement comprises means for estimating (702) the transmission time for at least one of said data frames (Lf, A1, B1-B2) and means to detect (703) in advance if a time out will occur for any of said data frames (Lf, A1, B1-B2), where said estimating is based an at least one transmission parameter, and where said data frame (Lf, A1, B1-B2) is determined to be timed out in advance if said estimated transmission time exceeds the remaining time of its time out period.
18. The arrangement as claimed in claim 17, characterised in that said arrangement comprises means for scheduling (704) the transmission order of said data frames (Lf, A1, B1-B2) in order for said data frames to be transmitted to their respective receiver (A,B,C,RU1-RU3,BSS) in such an order that the number of data frames (Lf, A1, B1-B2) to be timed out is minimised, where said scheduling is based on said estimated transmission times and said remaining time of said time out periods.
19. The arrangement as claimed in claim 17 or 18, characterised in that said arrangement comprises means for flushing (703) said data frames (A1) detected in advance to be timed out.
20. The arrangement as claimed in one of claims 17-19, characterised in that said arrangement comprises means for recording (708) the number of re-transmissions needed to transmit each data block (Rb) to said receiver (A,B,C,RU1-RU3,BSS), and means to calculate (708) said transmission parameter used when estimating said transmission time by using said recorded number of re-transmissions.
21. The arrangement as claimed in one of claims 17-20, characterised in that said arrangement comprises means for interrupting (703) transmissions of data frames (A1) which are detected in advance to be timed out.
22. The arrangement as claimed in one of claims 17-21, characterised in that said arrangement comprises means for re-submitting (709) identical data frames to said flushed data frames (A1) when said time out period for said flushed data frame has elapsed.
23. The arrangement as claimed in one of claims 17-21, characterised in that said arrangement comprises means for transmitting negative acknowledgements (703) for data frames (A1) detected in advance to be timed out.
24. The arrangement as claimed in claim 23, characterised in that said arrangement comprises means for re-submitting data (709) frames identical to said flushed data frames (Al) if negative acknowledgements are received due to data frames (A1) detected in advance to be timed out.
25. The arrangement as claimed in one of claims 17-24, characterised in that said arrangement comprises means for estimating radio resources (701) to be allocated for said transmission.
26. A base station system in a packet data radio system for processing data frames (Lf, A1, B1-B2), characterised in that said base station system (BSS) includes an arrangement according to one of claims 17-25.
27. The base station system as claimed in claim 26, characterised in that said base station system (BSS) comprises means for receiving information from radio units (RU1-RU3) regarding the length and time out periods of data frames (Lf, A1, B1-B2) to be transmitted from said radio units (RU1-RU3).
28. The base station system as claimed in claim 26 or 27, characterised in that said base station system (BSS) comprises means for transmitting (706) instructions regarding scheduling of said data frames (Lf, A1, B1-B2) to said radio units (RU1-RU3).
29. A radio unit for processing data frames (Lf, A1, B1-B2) in a packet data radio system, characterised in that said radio unit (RU1-RU3) includes an arrangement according to one of claims 17-25.
30. The radio unit as claimed in claim 29, characterised in that said radio unit (RU1-RU3) comprises means for transmitting (706) information to a base station system (BSS) regarding time out periods and the length of data frames (Lf, A1, B1-B2) in said radio unit (RU1-RU3).
31. The radio unit as claimed in claim 29 or 30, characterised in that said radio unit (RU1-RU3) comprises means for receiving instructions from said base station system (BSS) regarding scheduling of data frames (Lf, A1, B1-B2) to be transmitted to said base station system (BSS).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| SE9801529A SE512310C3 (en) | 1998-04-30 | 1998-04-30 | Procedure device base station system and radio unit for processing data frames in a packet data radio system |
| SE9801529-0 | 1998-04-30 | ||
| PCT/SE1999/000611 WO1999057840A1 (en) | 1998-04-30 | 1999-04-16 | Method and means for processing information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2330848A1 true CA2330848A1 (en) | 1999-11-11 |
Family
ID=20411157
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002330848A Abandoned CA2330848A1 (en) | 1998-04-30 | 1999-04-16 | Method and means for processing information |
Country Status (7)
| Country | Link |
|---|---|
| CN (1) | CN1308800A (en) |
| AU (1) | AU4400799A (en) |
| CA (1) | CA2330848A1 (en) |
| DE (1) | DE19983161T1 (en) |
| GB (1) | GB2352946B (en) |
| SE (1) | SE512310C3 (en) |
| WO (1) | WO1999057840A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1482710A4 (en) * | 2002-04-08 | 2009-12-09 | Mitsubishi Electric Corp | Data transmission apparatus and data transmission method |
| CN100471146C (en) * | 2004-09-06 | 2009-03-18 | 乐金电子(天津)电器有限公司 | Household network system |
| CN103002484A (en) * | 2011-09-13 | 2013-03-27 | 中兴通讯股份有限公司 | Method and device for acquiring base station hardware information |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS58153436A (en) * | 1982-03-08 | 1983-09-12 | Fuji Xerox Co Ltd | Method for resending error |
| US4616359A (en) * | 1983-12-19 | 1986-10-07 | At&T Bell Laboratories | Adaptive preferential flow control for packet switching system |
| US5515385A (en) * | 1994-03-09 | 1996-05-07 | Motorola, Inc. | Device and method for limiting delay by substantial elimination of duplicate synchronous data frames in a communication system |
| JPH10105485A (en) * | 1996-08-30 | 1998-04-24 | Texas Instr Inc <Ti> | Radio network |
-
1998
- 1998-04-30 SE SE9801529A patent/SE512310C3/en not_active IP Right Cessation
-
1999
- 1999-04-16 CN CN99808198A patent/CN1308800A/en active Pending
- 1999-04-16 AU AU44007/99A patent/AU4400799A/en not_active Abandoned
- 1999-04-16 CA CA002330848A patent/CA2330848A1/en not_active Abandoned
- 1999-04-16 WO PCT/SE1999/000611 patent/WO1999057840A1/en active Application Filing
- 1999-04-16 DE DE19983161T patent/DE19983161T1/en not_active Withdrawn
- 1999-04-16 GB GB0026223A patent/GB2352946B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| SE9801529D0 (en) | 1998-04-30 |
| AU4400799A (en) | 1999-11-23 |
| DE19983161T1 (en) | 2001-05-10 |
| GB0026223D0 (en) | 2000-12-13 |
| GB2352946A (en) | 2001-02-07 |
| GB2352946B (en) | 2003-04-23 |
| SE9801529L (en) | 1999-10-31 |
| WO1999057840A1 (en) | 1999-11-11 |
| SE512310C3 (en) | 2000-03-20 |
| CN1308800A (en) | 2001-08-15 |
| SE512310C2 (en) | 2000-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1613233B (en) | Method and system of retransmission | |
| EP1314328B1 (en) | Method and apparatus for supporting radio acknowledgement information for a uni-directional user data channel | |
| AU753060B2 (en) | Automatic repeat request protocol | |
| CN101084654B (en) | For method, the Apparatus and system of the repeating transmission in wireless communication system | |
| EP1777865B1 (en) | Method for handling timers after an RLC reset or re-establishment in a wireless communications system | |
| TWI357744B (en) | Cognitive flow control based on channel quality co | |
| EP1315341B1 (en) | Receiver polling for data transmission with sliding window data flow control | |
| US8214710B2 (en) | Methods and apparatus for processing error control messages in a wireless communication system | |
| JP3962246B2 (en) | Data transmission method and base station apparatus using adaptive coding in physical layer of asynchronous mobile communication system | |
| RU2487485C2 (en) | Method of controlling transmission window and retransmission and transmitting device | |
| US7028094B2 (en) | Data communication method, system, and transmitter and receiver constituting the system | |
| US20080298322A1 (en) | Data Transmission Method and Data Re-Transmission Method | |
| US20040013114A1 (en) | Methods and devices for the retransmission of data packets | |
| CN1423869A (en) | Link Layer acknowledgement and retransmission for cellular telecommunications | |
| CN1682501A (en) | System for efficient recovery of node-B buffered data following MAC layer reset | |
| US20040246898A1 (en) | Method and system for flow control for route switching | |
| CN107360592B (en) | PDCP downlink transmission method, device, storage medium and its computer equipment | |
| CN101132257B (en) | Condition report transmission method and sending terminal equipment thereof | |
| Wong et al. | Improving end-to-end performance of TCP using link-layer retransmissions over mobile internetworks | |
| US20090312007A1 (en) | Re-establishment of a rlc entity | |
| US8848617B2 (en) | Method and system of channel resource allocation | |
| CN102201901A (en) | Data retransmission method and device | |
| KR101197887B1 (en) | Method and apparatus for transmitting and receiving status report of automatic repeat request in mobile telecommunication system | |
| CA2330848A1 (en) | Method and means for processing information | |
| WO2005112489A1 (en) | A method of transmitting status report |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |