CN105636098B

CN105636098B - Method and device for estimating waiting time delay of uplink service

Info

Publication number: CN105636098B
Application number: CN201410604136.3A
Authority: CN
Inventors: 许倩倩
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2014-10-30
Filing date: 2014-10-30
Publication date: 2020-03-13
Anticipated expiration: 2034-10-30
Also published as: JP2017532915A; EP3200505B1; WO2016065876A1; EP3200505A1; CN105636098A; EP3200505A4; JP6343715B2

Abstract

The invention provides an estimation method of waiting time delay of uplink service, which comprises the following steps: the base station compares the BSR reported by the UE with the maintained BSR of the UE to determine an effective BSR; when the BSR reported by the UE contains a time identifier, the base station updates the maintained BSR of the UE according to the effective BSR and the time identifier; when the BSR reported by the UE does not contain a time identifier, adding a time identifier for the effective BSR, and updating the maintained BSR of the UE according to the effective BSR and the time identifier; and when the base station schedules the UE, calculating service waiting time delay according to the maintained time identification of the BSR of the UE. The invention estimates the waiting time delay of the uplink service through the existing uplink reported information, and makes up for the defect that the base station cannot acquire the waiting time delay of the uplink service.

Description

Method and device for estimating waiting time delay of uplink service

Technical Field

The present invention relates to the field of mobile communications, and in particular, to a method and an apparatus for estimating uplink service delay in the field of wireless communications.

Background

In the current 3GPP (3rd Generation Partnership Project) protocol, services are classified into different categories according to different attributes, and each category of service is represented by a QCI (quality of service class identifier) index. In the 9-class QCI services provided by the current protocol, each class of QCI service explicitly specifies the Delay (PDB) of a service data Packet, which represents the maximum Delay of a Packet data Packet transmitted between a handheld terminal (UE) and a core network, and the protocol explicitly specifies that 98% of any service data Packet should meet the Delay requirement, so that the value is one of important consideration parameters of a base station scheduler in order to ensure the validity of the Packet data Packet.

The delay requirements of the packet data packets of the uplink service and the downlink service are the same, the packet data packet of the downlink service is transmitted to the UE from the core network through the base station, the packet data packet of the uplink service is transmitted to the core network from the UE through the base station, the process of transmitting the packet data packet between the base station and the core network is uncontrollable by the base station, and the base station can only control the process of transmitting the packet data packet between the base station and the UE, so the protocol clearly stipulates that the transmission delay of the packet data packet between the base station and the core network is 20ms, and the transmission delay of the packet data packet between the base station and the UE is reduced to (PDB-20.

The time mark can be added when the downlink service packet data packet arrives at the base station user plane, so that the base station can obtain the waiting time delay of the downlink service packet data packet; however, for the uplink service, the base station does not know when the packet data packet reaches the user plane of the UE, nor the waiting delay of the packet data packet in the user plane of the UE, and at present, the UE only reports the size of the data waiting for scheduling in the user plane, but the waiting delay of the uplink packet data packet is not defined by the existing protocol, so that the base station cannot acquire the waiting delay information of the uplink packet data packet, and cannot meet the requirement of the uplink packet data packet PDB in scheduling.

Disclosure of Invention

The technical problem to be solved by the present invention is to provide a method and a device for estimating the waiting time delay of an uplink service in a mobile communication network, wherein the method and the device estimate the waiting time delay of the uplink service through the existing uplink report information, and make up for the defect that a base station cannot acquire the waiting time delay of the uplink service.

In order to solve the above problem, the present invention provides a method for estimating an uplink service latency, which includes:

the base station compares the buffer state report BSR reported by the UE with the maintained BSR of the UE to determine an effective BSR;

when the BSR reported by the UE contains a time identifier, the base station updates the maintained BSR of the UE according to the effective BSR and the time identifier; when the BSR reported by the UE does not contain a time identifier, adding a time identifier for the effective BSR, and updating the maintained BSR of the UE according to the effective BSR and the time identifier;

and when the base station schedules the UE, calculating service waiting time delay according to the maintained time identification of the BSR of the UE.

Optionally, the determining, by the base station, an effective BSR by comparing the BSR reported by the UE with the BSR of the UE that is maintained by the UE includes:

the base station compares the BSR reported by the UE this time with the maintained BSR sum of the UE, and if the BSR reported this time is less than or equal to the BSR sum, the BSR reported this time is invalid; if the BSR reported this time is larger than the sum of the BSRs, the BSR reported this time is valid, and the valid BSR is determined as: and subtracting the sum of the BSRs of the UE which are maintained from the BSR which is reported this time.

Optionally, the method further comprises:

after the base station schedules the UE, updating the maintained BSR of the UE, including: and modifying the size of the scheduled BSR, updating the sum of the maintained BSRs, and clearing the BSR which is already scheduled.

Optionally, the calculating the service waiting delay according to the maintained time identifier of the BSR of the UE includes:

when the BSR reported by the UE contains a time identifier, the service waiting time delay calculated by the base station is the interval between the time of scheduling the UE and the earliest time represented by the time identifier in the maintained BSR of the UE;

when the BSR reported by the UE does not contain the time identifier, the service waiting time delay calculated by the base station is the interval between the time of scheduling the UE and the earliest time represented by the time identifier in the maintained BSR of the UE, and then the time delay estimation quantity between the buffer when the preset service reaches the UE side and the BSR reported by the UE is added.

Optionally, the delay estimator between the buffer when the service arrives at the UE side and the BSR reported by the UE is:

the delay estimator is 0 during continuous scheduling;

and randomly generating a numerical value in a closed interval [1, scheduling request period ] during discontinuous scheduling as the delay estimator.

The invention also provides an estimation device of the waiting time delay of the uplink service, which is arranged in the base station, and the device comprises:

the comparison module is used for comparing the buffer status report BSR reported by the UE with the maintained BSR of the UE and determining an effective BSR;

a maintenance module, configured to update the maintained BSR of the UE according to the valid BSR and the time identifier when the BSR reported by the UE includes the time identifier; when the BSR reported by the UE does not contain a time identifier, adding a time identifier for the effective BSR, and updating the maintained BSR of the UE according to the effective BSR and the time identifier;

and the calculation module is used for calculating service waiting time delay according to the maintained time identification of the BSR of the UE when the base station schedules the UE.

Optionally, the comparing module compares the BSR reported by the UE with the BSR of the UE maintained, and determining an effective BSR means:

the comparison module compares the BSR reported by the UE this time with the maintained BSR of the UE, and if the BSR reported this time is less than or equal to the BSR sum, the BSR reported this time is invalid; if the BSR reported this time is larger than the sum of the BSRs, the BSR reported this time is valid, and the valid BSR is determined as: and subtracting the sum of the BSRs of the UE which are maintained from the BSR which is reported this time.

Optionally, the calculating module is further configured to update the maintained BSR of the UE after the base station schedules the UE, and includes: and modifying the size of the scheduled BSR, updating the sum of the maintained BSRs, and clearing the BSR which is already scheduled.

Optionally, the calculating, by the calculating module, the service waiting time delay according to the maintained time identifier of the BSR of the UE means:

when the BSR reported by the UE contains the time identifier, the computing module computes the service waiting time delay as the interval between the time for scheduling the UE and the earliest time represented by the time identifier in the maintained BSR of the UE; and when the BSR reported by the UE does not contain the time identifier, calculating the service waiting time delay as the interval between the time for scheduling the UE and the earliest time represented by the time identifier in the maintained BSR of the UE, and then adding a preset time delay estimation quantity between the buffer when the service reaches the UE side and the BSR reported by the UE.

the delay estimator is 0 during continuous scheduling;

The invention can obtain the following benefits: the method makes up the defect that the base station cannot directly acquire the waiting time delay of the uplink service, provides uplink scheduling time delay reference for the base station scheduler, and maximally ensures the PDB time delay requirement of the uplink service packet data packet.

Drawings

Fig. 1 is a schematic flow chart of a method for estimating the waiting delay of the uplink service according to the present invention;

FIG. 2 is a schematic flow diagram of an example of the present invention.

Detailed Description

The technical solution of the present invention will be described in more detail with reference to the accompanying drawings and examples.

It should be noted that, if not conflicting, the embodiments of the present invention and the features of the embodiments may be combined with each other within the scope of protection of the present invention. Additionally, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.

A method for estimating the waiting delay of uplink service comprises the following steps:

Wherein, the comparing, by the base station, the BSR reported by the UE and the BSR of the UE that is maintained, and the determining an effective BSR specifically may include:

Wherein, the sum of the BSRs of the UE maintained is the sum of BSRs of all uncompleted scheduled UEs maintained by the base station, which is also referred to as the sum of BSRs maintained in history hereinafter. If the newly reported BSR is less than or equal to the sum of the BSRs maintained in the history, the fact that no new data is generated in the buffer (buffering) of the UE side is represented, the reported BSR is invalid, and the newly reported BSR can be ignored; if the reported BSR is larger than the sum of the BSRs maintained in the history, the fact that new data is generated in the buffer at the UE side is indicated, and the reported BSR is effective.

The method may further comprise:

And if a plurality of time-marked BSRs are scheduled at the same time, taking the maximum time delay as the service waiting time delay of the scheduling. The calculating the service waiting delay according to the maintained time identifier of the BSR of the UE may specifically include:

Currently, uplink reporting BSR of the LTE system is reported according to logical channel groups, and the service waiting delay calculation may be maintained and calculated according to the logical channel groups.

The base station cannot acquire the time delay between the arrival of the service at the UE side buffer and the BSR reported by the UE, and can estimate: if the scheduling is continuous scheduling, the time delay can be ignored, and the time delay estimator can be 0; since the BSR is reported with the scheduling once the uplink data reaches the buffer, if the scheduling is discontinuous, a value of [1, SR period ] may be randomly generated according to the SR (scheduling request) period as the delay estimator.

Considering the storage space of the base station, if the requirement for the uplink service delay is not strict, an upper limit of the number of BSR groups maintained by the base station may be defined, and after the number of BSR groups is greater than the upper limit, the subsequent delay is not accurately maintained unless the previous BSR is scheduled.

The method comprises two parts of UE (user equipment) reporting data packet time identification and base station estimation service packet data packet time delay, wherein when the BSR (buffer status report) of the base station reported by the UE comprises the time identification of the data packet, the service waiting time delay when the base station schedules the UE is estimated according to the time identification; when the time identifier of a data packet is not included in the BSR of the base station reported by the UE, estimating the service waiting time delay when the base station schedules the UE according to the time delay estimation quantity between the time when the service reaches the buffer at the UE side and the BSR reported by the UE and the time when the message reaches the base station; the base station can calculate the remaining time of the overtime scheduling of the service according to the PDB requirement of the service, and balance the remaining time of all the services according to the parameter, so that a proper scheduling strategy can be selected, and the PDB time delay requirement of all the services can be met as far as possible.

The invention specifically adopts the following technical scheme:

in the preparation stage, it is first determined whether the BSR reported by the UE contains the time identifier of the data packet.

And if the time identifier of the data packet is not included, determining the upper limit of the number of the BSR groups maintained by the base station and the time delay estimation quantity between the service reaching the buffer at the UE side and the BSR reported by the UE.

In addition, the reported BSR can be classified according to the service attributes, and the reported BSR can be classified according to corresponding classification during maintenance, comparison and updating.

In the interaction stage, if the BSR reported by the UE contains a data packet time identifier, determining an effective BSR according to the BSR size of the same service of the same type of the UE and the BSR size maintained by the base station history, and storing the effective BSR and the time identifier thereof; and if the time identifier of the data packet is not contained, determining the effective BSR and adding the time identifier for the effective BSR to be stored according to the BSR size of the same service of the same type of UE, which is maintained historically by the base station and the number of the BSR groups which are maintained.

And the base station estimates the waiting time delay of the uplink service at the scheduling moment according to the stored time identifier, calculates the remaining time of the overtime scheduling of the service by combining the PDB requirement of the service, balances the remaining time of all the services and selects a proper scheduling strategy.

A specific example is shown in FIG. 2, and comprises steps 101 to 114:

101. in the preparation stage, whether the time identifier of the data packet is contained in the BSR reported by the UE is judged; if so, then 103 is carried out; if not, proceed to 102.

102. Determining the upper limit of the BSR group number maintained by the base station and the time delay estimation quantity between the service reaching the UE side buffer and the BSR reported by the UE; proceed to 103.

103. In the interaction stage, when the US reports the BSR, the sum of the BSRs maintained in history is obtained. And the process proceeds to 104.

104. Judging whether the reported BSR is larger than the sum of the BSRs maintained historically; if so, proceed to 106; if less than or equal to 105.

105. Taking the BSR reported by the UE as an invalid BSR; proceeding to 113.

106. Taking the BSR reported by the UE as an effective BSR, and enabling the size of the BSR to be as follows: and subtracting the sum of the BSRs maintained historically from the size of the reported BSR. Proceed to 107.

107. Judging whether the BSR reported by the UE contains a time identifier of a data packet; if so, then 111 is performed; if not, proceed to 108.

108. Judging whether the number of the maintained BSR groups is smaller than the upper limit of the number of the BSR groups scheduled to be maintained; if the value is less than 109; if not, proceed to 110.

109. And numbering the BSR groups sequentially and adding time identifiers to carry out 111.

110. Merging the reported BSR into the last group of maintained BSR, wherein the time identifier of the group of BSR is unchanged; the process is carried out 111.

111. Updating the historically maintained BSR; proceed to 112.

112. Saving the effective BSR size and the time identification; proceeding to 113.

113. When the base station schedules the UE, calculating service waiting time delay, and scheduling according to a scheduling algorithm; proceed to 114.

114. And updating the sum of the BSR group maintained by the scheduled UE and the BSR maintained in history.

An estimation apparatus for uplink traffic waiting delay, which is disposed in a base station, the apparatus comprising:

Wherein, the comparing module compares the BSR reported by the UE with the BSR of the UE maintained, and the determining of the effective BSR specifically may be:

Wherein the calculating module may be further configured to update the maintained BSR of the UE after the base station schedules the UE, and the updating includes: and modifying the size of the scheduled BSR, updating the sum of the maintained BSRs, and clearing the BSR which is already scheduled.

The calculating, by the calculating module, the service waiting delay according to the maintained time identifier of the BSR of the UE may specifically be:

The delay estimator between the buffering of the service arriving at the UE side and the BSR reporting by the UE may specifically be:

the delay estimator is 0 during continuous scheduling;

The following is a description of specific examples.

Embodiment 1 includes steps 201 to 215:

step 201: and determining the time identifier containing the data packet in the BSR reported by the UE.

Step 202: the UE1 with UE Index 10 initially accesses, reports BSR of 1000bits at T1_ eNB, and carries a time identifier T1_ UE. At this time, the sum of the BSRs maintained historically is 0, so the newly reported BSR is valid, and the BSR1 maintained by the base station is 1000 bits. The sum of BSRs maintained by the updated base station history is 1000 bits.

Step 203: and the base station schedules the UE1 at the time of T2_ eNB, wherein the waiting time delay of the service is T2_ eNB-T1 _ UE.

Step 205: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay, and schedules the UE1500 bits.

Step 206: the update BSR1 is 1000-. The sum of BSRs maintained by the updated base station history is 500 bits.

Step 207: at the time of T3_ eNB, UE1 reports that BSR is 1000bits, and the carried time identifier is T2_ UE.

Step 208: the sum of BSRs maintained historically by the base station is 500bits, the newly reported BSR is larger than the BSR maintained historically by the base station, new data is generated on the UE side, the newly reported BSR is an effective BSR, the BSR maintained by the base station 2 is 1000-500 bits, the time identifier is T2_ UE, and the sum of the BSRs maintained historically by the updated base station is 1000 bits.

Step 209: at the time of T4_ eNB, UE1 reports that BSR is 1000bits, and the carried time identifier is T3_ UE.

Step 210: the sum of BSRs maintained by the base station in history is 1000bits, the newly reported BSR is equal to the BSR maintained by the base station in history, no new data is generated on the UE side, the newly reported BSR is an invalid BSR, and the newly reported BSR is ignored.

Step 211: the base station schedules the UE1 at time T5_ eNB, and the service waiting time delay is T5_ eNB-T1 _ UE at this time, and is calculated according to the maximum time.

Step 212: and the scheduling module schedules according to a scheduling algorithm and service waiting time delay and schedules the UE1800 bits.

Step 213: updating the BSR group of the UE1 maintained by the base station: when the BSR1 is 500bits, scheduling 800bits > BSR1, and the BSR1 is scheduled; the BSR2 has 500- (800-. The sum of BSRs maintained by the updated base station history is 200 bits.

Step 214: the BSR group number is updated, and when the BSR1 is scheduled, the BSR2 is updated to the BSR1, and so on.

Step 215: if the UE1 has a new BSR to report, repeat steps 207 and 208 (when the BSR is valid) or steps 209 and 210 (when the BSR is invalid); if the base station schedules the UE, steps 211-214 are repeated.

Example 2:

step 301: determining that the time identifier of the data packet is not included in the BSR reported by the UE, determining that the upper limit of the BSR group number maintained by the base station is infinite, and determining that the time delay between the service reaching the UE side buffer and the BSR reported by the UE is 0.

Step 302: the UE1 with UE Index 10 initially accesses, and reports BSR of 1000bits at time T1. At this time, the sum of the BSRs maintained historically is 0, so the newly reported BSR is valid, and the BSR1 maintained by the base station is 1000 bits; determining that the upper maintained BSR group count limit has not been exceeded.

Step 303: add a time stamp T1 to the BSR 1. The sum of BSRs maintained by the updated base station history is 1000 bits.

Step 304: and the base station schedules the UE1 at the time of T2, wherein the service waiting time delay is T2-T1.

Step 305: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay, and schedules the UE1500 bits.

Step 306: the update BSR1 is 1000-. The sum of BSRs maintained by the updated base station history is 500 bits.

Step 307: at time T3, UE1 reports a BSR of 500 bits.

Step 308: the sum of BSRs maintained by the base station in history is 500bits, the newly reported BSR is equal to the BSR maintained by the base station in history, no new data is generated on the UE side, the newly reported BSR is an invalid BSR, and the newly reported BSR is ignored.

Step 309: at time T4, UE1 reports a BSR of 1000 bits.

Step 310: the sum of BSRs maintained historically by the base station is 500bits, the newly reported BSR is larger than the BSR maintained historically by the base station, new data is generated at the UE side, the newly reported BSR is an effective BSR, and the BSR maintained by the base station 3 is 1000-500 bits; and determining that the upper limit of the number of the BSR groups which are maintained is not exceeded, adding a time identifier T4 to the BSR3, and updating the sum of the BSRs which are maintained in the base station history to be 1000 bits.

Step 311: at time T5, UE1 reports a BSR of 2000 bits.

Step 312: the sum of BSRs maintained historically by the base station is 1000bits, the newly reported BSR is larger than the BSR maintained historically by the base station, new data is generated at the UE side, the newly reported BSR is an effective BSR, and the BSR maintained by the base station 4 is 2000-1000-bits; and determining that the upper limit of the number of the BSR groups which are maintained is not exceeded, adding a time identifier T5 to the BSR4, and updating the sum of the BSRs which are maintained in the base station history to be 2000 bits.

Step 313: and the base station schedules the UE1 at the time of T6, wherein the service waiting time delay is T6-T1 and is calculated according to the maximum time.

Step 314: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay and schedules the UE1800 bits.

Step 315: updating the BSR group of the UE1 maintained by the base station: when the BSR1 is 500bits, scheduling 800bits > BSR1, and the BSR1 is scheduled; the BSR3 has the residual 500- (800-) -500-200 bits, and the time is marked as T4; BSR4 is 1000bits, time denoted T5. And updating the BSR sum maintained by the base station history to be 1200 bits.

Step 316: the number of the BSR groups is updated, the BSR1 is scheduled, the BSR2 is updated to the BSR1, the BSR3 is updated to the BSR2, and so on.

Step 317: if a new BSR is reported, repeating the steps 309/311 and 310/312 (when the BSR is valid) or the steps 307 and 308 (when the BSR is invalid); if the base station schedules the UE, the steps 313 to 316 are repeated.

Example 3:

step 401: determining that the BSR reported by the UE does not contain a time identifier of a data packet, and determining that the upper limit of the number of BSR groups maintained by the base station is 2; and determining that the time delay between the service arrival at the buffer at the UE side and the BSR reported by the UE is 0.

Step 402: the UE1 with UE Index 10 initially accesses, and reports BSR of 1000bits at time T1. At this time, the sum of the BSRs maintained historically is 0, so the newly reported BSR is valid, and the BSR1 maintained by the base station is 1000 bits; determining that the upper maintained BSR group count limit has not been exceeded.

Step 403: add a time stamp T1 to the BSR 1. The sum of BSRs maintained by the updated base station history is 1000 bits.

Step 404: at time T2, UE1 reports a BSR of 1500 bits.

Step 405: the sum of BSR maintained by the base station history is 1000bits, the newly reported BSR is larger than the BSR maintained by the base station history, new data is generated at the UE side, the newly reported BSR is an effective BSR, and the size of the new data is as follows: 1500 + 1000 ═ 500 bits.

Step 406: judging whether the BSR group number reaches the standard: at present, a base station only has one group of BSRs, and if the number of BSRs maintained by the base station is less than the upper limit 2 of the BSR group number maintained by the base station, the BSR maintained by the base station 2 is 500bits, a time identifier T2 is added to the BSR2, and the sum of the BSRs maintained by updating the base station history is 1500 bits.

Step 407: at time T3, UE1 reports a BSR of 2000 bits.

Step 408: the sum of BSR of base station historical maintenance is 1500bits, the newly reported BSR is larger than the BSR of base station historical maintenance, new data is generated at the UE side, the newly reported BSR is effective BSR, and the data size of the newly reported BSR is 2000-1500-500 bits.

Step 409: judging whether the BSR group number reaches the standard: at present, a base station has 2 BSRs, and if the upper limit of the maintained BSR group number is reached to 2, the updated BSR2 is 500+500 is 1000bits, the time identifier is T2, the reporting time T3 of the 500bits of the newly reported BSR is ignored, and the sum of the BSRs maintained in the history of the updated base station is 2000 bits.

Step 410: and the base station schedules the UE1 at the time of T4, wherein the service waiting time delay is T4-T1 and is calculated according to the maximum time.

Step 411: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay, and schedules the UE11500 bits.

Step 412: updating the BSR group of the UE1 maintained by the base station: when the BSR1 is 1000bits, the scheduling is 1500bits > BSR1, and the BSR1 is scheduled; the BSR2 has 1000- (1500-. The sum of BSRs maintained by the updated base station history is 500 bits.

Step 413: the BSR group number is updated, and when the BSR1 is scheduled, the BSR2 is updated to be the BSR1, and the BSR2 is vacant.

Step 414: if a new BSR is reported and the newly reported BSR is valid, repeating the steps 407-409 (the number of the maintained groups is not less than the upper limit) or the steps 404-406 (the number of the maintained groups is less than the upper limit); if a new BSR is reported and the newly reported BSR is invalid, ignoring the newly reported BSR; if the base station schedules the UE, repeating steps 410-413.

Example 4:

step 501: determining that the time identifier of the data packet is not contained in the BSR reported by the UE, determining that the upper limit of the group number of the BSR maintained by the base station is infinite, and determining that the time delay between the service reaching the buffer at the UE side and the BSR reported by the UE is random number of [1, 5] ms.

Step 502: the UE1 with UE Index 10 initially accesses, and reports BSR of 1000bits at time T1. At this time, the sum of the BSRs maintained historically is 0, so the newly reported BSR is valid, and the BSR1 maintained by the base station is 1000 bits; determining that the upper maintained BSR group count limit has not been exceeded.

Step 503: and adding a time identifier T1 to the BSR1, wherein the sum of BSRs maintained by updating the base station history is 1000 bits. .

Step 504: at the time of T2, the base station schedules the UE1, and randomly generates a time delay between the arrival of a service at the UE side buffer and the BSR reported by the UE to be 2, and the service waiting time delay (unit is ms) is T2-T1 + 2.

Step 505: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay, and schedules the UE1500 bits.

Step 506: the update BSR1 is 1000-. The sum of BSRs maintained by the updated base station history is 500 bits.

Step 507: at time T3, UE1 reports a BSR of 500 bits.

Step 508: the sum of BSRs maintained by the base station in history is 500bits, the newly reported BSR is equal to the BSR maintained by the base station in history, no new data is generated on the UE side, and the newly reported BSR is ignored.

Step 509: at time T4, UE1 reports a BSR of 1000 bits.

Step 510: the sum of BSRs maintained historically by the base station is 500bits, the newly reported BSR is larger than the BSR maintained historically by the base station, new data is generated at the UE side, the newly reported BSR is an effective BSR, and the BSR maintained by the base station 2 is 1000-500 bits; and determining that the upper limit of the number of the BSR groups which are maintained is not exceeded, adding a time identifier T4 to the BSR2, and updating the sum of the BSRs which are maintained by the base station history to be 1000 bits.

Step 511: and the base station schedules the UE1 at the time of T5, randomly generates a time delay between the arrival of a service at the UE side buffer and the BSR reported by the UE to be 3, and calculates the service waiting time delay from T5 to T1+3 according to the maximum time.

Step 512: and the base station carries out scheduling according to a scheduling algorithm and the service waiting time delay and schedules the UE1800 bits.

Step 513: updating the BSR group of the UE1 maintained by the base station: when the BSR1 is 500bits, scheduling 800bits > BSR1, and the BSR1 is scheduled; the BSR2 has 500- (800-. The sum of BSRs maintained by the updated base station history is 200 bits.

Step 514: and updating the BSR group number, updating the BSR2 to the BSR1 after the BSR1 is scheduled, updating to the BSR2 if the BSR3 exists, and the like.

Step 515: if a new BSR is reported, repeating steps 509 and 510 (when the BSR is valid); or steps 507 and 508 (when the BSR is invalid), if the base station schedules the UE, repeating steps 511-514.

It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the above embodiments may be implemented using one or more integrated circuits. Accordingly, each module/unit in the above embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.

The present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof, and it should be understood that various changes and modifications can be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A method for estimating the waiting delay of uplink service comprises the following steps:

the base station compares the BSR reported by the UE this time with the maintained BSR sum of the UE, and if the BSR reported this time is less than or equal to the BSR sum, the BSR reported this time is invalid; if the BSR reported this time is larger than the sum of the BSRs, the BSR reported this time is valid, and the valid BSR is determined as: subtracting the sum of the BSRs of the UE which are maintained from the BSR which is reported this time;

when the base station is scheduling the UE,

2. The method of claim 1, wherein the method further comprises:

3. The method of claim 1, wherein the delay estimate between the traffic arriving at the UE side buffer and the UE reporting a BSR is:

the delay estimator is 0 during continuous scheduling;

4. An apparatus for estimating a waiting time delay of an uplink service, which is disposed in a base station, the apparatus comprising:

a comparison module, configured to compare the BSR reported this time by the UE with the BSR of the UE that is maintained, and if the BSR reported this time is less than or equal to the BSR, the BSR reported this time is invalid; if the BSR reported this time is larger than the sum of the BSRs, the BSR reported this time is valid, and the valid BSR is determined as: subtracting the sum of the BSRs of the UE which are maintained from the BSR which is reported this time;

a calculation module, configured to calculate, when the base station schedules the UE and a BSR reported by the UE includes a time identifier, a service waiting time delay as an interval between a time at which the UE is scheduled and an earliest time represented by the time identifier in the maintained BSR of the UE; and when the BSR reported by the UE does not contain the time identifier, calculating the service waiting time delay as the interval between the time for scheduling the UE and the earliest time represented by the time identifier in the maintained BSR of the UE, and then adding a preset time delay estimation quantity between the buffer when the service reaches the UE side and the BSR reported by the UE.

5. The apparatus of claim 4, wherein:

the calculation module is further configured to update the maintained BSR of the UE after the base station schedules the UE, and includes: and modifying the size of the scheduled BSR, updating the sum of the maintained BSRs, and clearing the BSR which is already scheduled.

6. The apparatus of claim 4, wherein the delay estimate between the traffic arriving at the UE side buffer and the UE reporting BSR is:

the delay estimator is 0 during continuous scheduling;