CN105592554B

CN105592554B - Uplink service scheduling method and base station

Info

Publication number: CN105592554B
Application number: CN201410571021.9A
Authority: CN
Inventors: 许倩倩
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2014-10-23
Filing date: 2014-10-23
Publication date: 2020-07-03
Anticipated expiration: 2034-10-23
Also published as: CN105592554A; WO2016061976A1

Abstract

The embodiment of the invention discloses a scheduling method and a base station of uplink service, wherein the method comprises the following steps: a base station receives a Buffer Status Report (BSR) reported by a terminal; the base station determines the effectiveness of the BSR according to the size of the BSR currently maintained by the base station and the size of the BSR; after the base station determines that the BSR is valid, the base station carries out time marking on the BSR and carries out first updating on the size of the BSR currently maintained by the base station according to the BSR; when the base station carries out service scheduling, acquiring the waiting time delay of the BSR according to the scheduling time and the time mark of the BSR; and the base station carries out scheduling according to a preset scheduling algorithm and the waiting time delay of the BSR, and carries out second updating on the size of the BSR which is maintained at present after the first updating according to the scheduling.

Description

Uplink service scheduling method and base station

Technical Field

The present invention relates to mobile communication technologies, and in particular, to a method and a base station for scheduling an uplink service.

Background

Currently, the third Generation Partnership Project (3 GPP) protocol divides services into different categories according to different attributes, and each type of service explicitly specifies a Packet Delay (PDB) of a service Packet, which is used to indicate a maximum Delay of a Packet data Packet transmitted between a User Equipment (UE) and a core network. The 3GPP protocol specifies that any 98% of the traffic packets should meet the PDB requirements.

At present, when a downlink service packet data packet arrives at a base station user plane, a base station can add a time identifier so that the base station can obtain the waiting time delay of the downlink service packet data packet at the base station when the downlink service packet data packet;

however, for the uplink service packet data packet, since the UE only reports the size of data waiting for scheduling in the user plane of the uplink service packet data packet to the base station, the base station does not know when the uplink service packet data packet reaches the user plane of the UE, and does not know the waiting time delay of the uplink service packet data packet in the user plane of the UE, so that the base station cannot acquire the waiting time delay information of the uplink packet data packet, and cannot select a proper scheduling policy according to the PDB requirement of the uplink service packet data packet in scheduling, which results in that the PDB requirement of the uplink service packet data packet cannot be guaranteed.

In summary, there is no technical solution for obtaining the waiting delay of the uplink service packet data packet in the prior art.

Disclosure of Invention

In order to solve the above technical problem, embodiments of the present invention desirably provide a scheduling method and a base station for an uplink service, which can estimate a waiting time delay of an uplink service packet data packet, so as to ensure a PDB requirement of the uplink service packet data packet.

The technical scheme of the invention is realized as follows:

in a first aspect, an embodiment of the present invention provides a method for scheduling an uplink service, where the method includes:

a base station receives a Buffer Status Report (BSR) reported by a terminal;

the base station determines the effectiveness of the BSR according to the total BSR size currently maintained by the base station and the size of the BSR;

after the base station determines that the BSR is valid, the base station carries out time marking on the BSR and carries out first updating on the size of the BSR currently maintained by the base station according to the BSR;

when the base station carries out service scheduling, acquiring the waiting time delay of the BSR according to the scheduling time and the time mark of the BSR;

and the base station carries out scheduling according to a preset scheduling algorithm and the waiting time delay of the BSR, and carries out second updating on the size of the BSR which is maintained at present after the first updating according to the scheduling.

Further, the determining, by the base station, the validity of the BSR according to the current BSR size maintained by the base station itself and the BSR size includes:

when the BSR size is larger than the total BSR size currently maintained by the base station, the base station determines that the BSR is valid;

and when the BSR size is less than or equal to the total BSR size currently maintained by the base station, the base station determines that the BSR is invalid.

Further, the first updating, by the base station, the current BSR size according to the BSR includes:

and the base station subtracts the difference value obtained by subtracting the total BSR size currently maintained by the base station from the BSR size to obtain the updated BSR size.

Further, the base station records the number of the BSRs which are currently maintained and the upper limit of the number of the BSRs which are maintained by the base station;

correspondingly, after the base station determines that the BSR is valid, the method further includes:

when the number of the BSRs which are maintained at present plus the number of the BSRs is greater than the upper limit of the number of the BSRs to be maintained, the base station sets the time mark of the BSR as the time mark of the BSR which is maintained at last, and incorporates the BSR into the BSR which is maintained at last;

and when the number of the BSRs which are currently maintained by the base station plus the number of the BSRs is less than or equal to the upper limit of the number of the BSRs which are maintained, the base station carries out time marking on the BSRs and carries out first updating on the size of the BSRs which are currently maintained by the base station according to the BSRs.

Further, when the base station is continuously scheduled, the waiting delay of the BSR is the scheduling time minus the time stamp of the BSR;

when the base station is in discontinuous scheduling, the waiting time delay of the BSR is the scheduling time minus the time mark of the BSR plus a discontinuous scheduling random value, the discontinuous scheduling random value is a numerical value in [1, scheduling request SR cycle ], wherein [ ] represents a closed interval, and the scheduling request SR cycle is the scheduling cycle of the scheduling request.

In a second aspect, an embodiment of the present invention provides a base station, where the base station includes: a receiving unit, a determining unit, a first updating unit, an obtaining unit, a scheduling unit and a second updating unit, wherein,

the receiving unit is used for receiving a Buffer Status Report (BSR) reported by the terminal;

the determining unit is configured to determine the validity of the BSR according to a total BSR size currently maintained by the base station and the BSR size;

the first updating unit is configured to time-stamp the BSR after the determining unit determines that the BSR is valid, and perform first updating on the current BSR size maintained by the base station according to the BSR;

when the base station performs service scheduling, the obtaining unit is configured to obtain a waiting time delay of the BSR according to a scheduling time and a time stamp of the BSR;

the scheduling unit is used for scheduling according to a preset scheduling algorithm and the waiting time delay of the BSR;

and the second updating unit is used for updating the size of the BSR currently maintained by the first updating unit for the second time according to the scheduling of the scheduling unit.

Further, the determining unit is configured to:

when the BSR size is larger than the total BSR size currently maintained by the base station, determining that the BSR is valid;

and when the BSR size is less than or equal to the total BSR size currently maintained by the base station, determining that the BSR is invalid.

Further, the first updating unit is configured to obtain the updated BSR by subtracting a difference obtained by subtracting a total BSR size currently maintained by the base station from the BSR size.

Further, the base station further includes a recording unit, configured to record the number of BSRs currently maintained by the base station itself and an upper limit of the number of BSRs maintained by the base station itself;

accordingly, the first updating unit is configured to:

after the determination unit determines that the BSR is valid,

when the number of the BSRs which are currently maintained by the base station and the number of the BSRs are more than the upper limit of the number of the BSRs to be maintained, setting the time mark of the BSR as the time mark of the BSR which is maintained by the base station at the last time, and merging the BSR into the BSR which is maintained at the last time;

and when the number of the BSRs which are currently maintained by the base station and the number of the BSRs are less than or equal to the upper limit of the number of the BSRs which are maintained, carrying out time marking on the BSRs, and carrying out first updating on the size of the BSR which is currently maintained by the base station according to the BSRs.

The embodiment of the invention provides a scheduling method of an uplink service and a base station for scheduling the uplink service according to uplink time delay estimation obtained by a base station according to BSR reported by a terminal, so that the waiting time delay of an uplink service packet data packet is estimated, and the PDB requirement of the uplink service packet data packet is ensured. .

Drawings

Fig. 1 is a flowchart illustrating a scheduling method for uplink service according to an embodiment of the present invention;

fig. 2 is a schematic flow chart of a specific scheduling method for uplink service according to an embodiment of the present invention;

fig. 3 is a schematic flowchart of another specific uplink service scheduling method according to an embodiment of the present invention; (ii) a

Fig. 4 is a flowchart illustrating a specific scheduling method for uplink service according to another embodiment of the present invention; (ii) a

Fig. 5 is a schematic structural diagram of a base station according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of another base station according to an embodiment of the present invention.

Detailed Description

The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.

The basic idea of the invention is as follows: and estimating uplink time delay for the service report of the UE according to a Buffer Status Report (BSR) reported by the terminal and the scheduling continuity of the UE, and performing uplink scheduling according to the estimated value, so as to meet the PDB requirement of the uplink scheduling.

Referring to fig. 1, it shows a flow of a scheduling method for uplink service provided in an embodiment of the present invention, where the method may be applied to a base station side, and the method may include:

s101: a base station receives a Buffer Status Report (BSR) reported by a terminal;

s102: the base station determines the effectiveness of the BSR according to the total BSR size currently maintained by the base station and the size of the BSR;

exemplarily, the determining, by the base station, the validity of the BSR according to the total BSR size currently maintained by the base station and the BSR size may include:

It can be understood that, when the terminal reports the BSR for the first time, the current BSR maintained by the base station itself is zero, and therefore, the BSR is always valid at this time.

It should be further noted that the base station may also maintain the currently maintained BSR number of itself and maintain the BSR number upper limit of itself;

when the number of the BSRs which are maintained at present and the number of the BSRs are more than the upper limit of the number of the BSRs to be maintained, the base station sets the time mark of the BSR as the time mark of the BSR which is maintained at last, and merges the BSR into the BSR which is maintained at last;

S103: after the base station determines that the BSR is valid, the base station carries out time marking on the BSR and carries out first updating on the size of the BSR which is maintained currently according to the BSR;

illustratively, the first updating, by the base station, the BSR size currently maintained by the base station according to the BSR may include:

S104: when a base station carries out service scheduling, acquiring the waiting time delay of the BSR according to the scheduling time and the time mark of the BSR;

optionally, when the base station is continuously scheduled, the waiting delay of the BSR is the scheduling time minus the time stamp of the BSR;

optionally, when the base station performs discontinuous Scheduling, the waiting time delay of the BSR is obtained by subtracting the time stamp of the BSR from the Scheduling time and adding a discontinuous Scheduling random value, where the discontinuous Scheduling random value is a value in [1, Scheduling Request (SR) period ], where [ ] represents a closed interval, and the SR period is a Scheduling period of the Scheduling Request.

S105: and the base station carries out scheduling according to a preset scheduling algorithm and the waiting time delay of the BSR, and carries out second updating on the size of the BSR which is maintained at present after the first updating according to the scheduling.

Specifically, the base station may start scheduling from the BSR with the longest waiting time delay according to a preset scheduling algorithm, and correspondingly, the base station performs second updating on the currently maintained BSR size after the first updating according to the scheduling, which may include:

and the base station updates the BSR currently maintained by the base station after the first updating in sequence according to the scheduling size, the length sequence of the waiting time delay and the scheduling size.

This embodiment provides a method for scheduling an uplink service, where a base station schedules an uplink service according to an uplink delay estimate obtained by a BSR reported by a terminal, so as to estimate a waiting delay of an uplink service packet data packet, thereby ensuring a PDB requirement of the uplink service packet data packet.

On the basis of the embodiment shown in fig. 1, as shown in fig. 2, the method for scheduling uplink services provided in the embodiment of the present invention may be applied to a base station, and in this embodiment, the upper limit of the number of BSRs maintained by the base station itself is set to infinity, and the base station is in continuous scheduling, that is, the time delay between the service reaching the terminal side buffer and the BSR reported by the terminal is 0, and the method may include:

s201: the UE Index is 10 of terminal initial access, and the BSR1 is reported at T1;

wherein, the size of the BSR1 is 1000 bits; because the report is after the terminal initially accesses, the BSR currently maintained by the base station is the BSR1, and the BSR size is 1000 bits.

S202: the base station adds a time identifier T1 to the BSR 1;

s203: the base station schedules the terminal at the time of T2, and calculates the waiting time delay of the BSR 1;

specifically, the latency of the BSR1 is T2-T1.

S204: the base station carries out scheduling according to a scheduling algorithm and the waiting time delay of the BSR;

specifically, the base station schedules the terminal 500bits bytes;

s205: the base station updates the BSR size maintained currently;

specifically, the time id is T1 when BSR 1' is BSR1-500 is 500 bits.

S206: at the time of T3, the terminal newly reports that the BSR is 500 bits;

s207: the total size of the BSR currently maintained by the base station is 500bits, and the newly reported BSR is less than or equal to the size of the BSR currently maintained by the base station, so that the situation that no new data is generated on the terminal side can be shown, and the BSR is ignored by the base station;

s208: at the time of T4, the terminal newly reports BSR of 1000 bits;

s209: the total BSR currently maintained by the base station is 500bits, the newly reported BSR is greater than the total BSR currently maintained by the base station, which may indicate that new data is generated at the terminal side, the newly reported BSR2 at the time of the base station maintenance T4 is 1000bits and 500bits and the time identifier is T4, and the total BSR currently maintained by the updated base station is 1000 bits.

S210: and at the time of T5, the terminal newly reports BSR of 2000 bits.

S211: the total BSR size currently maintained by the base station is 1000bits, the newly reported BSR is greater than the total BSR size currently maintained by the base station, which may indicate that new data is generated at the terminal side, the newly reported BSR3 at the time of the base station maintenance T5 is 2000-1000 bits, the time identifier is T5, and the total BSR size currently maintained by the updated base station is 2000 bits.

S212: and the base station schedules the terminal at the time T6, and the waiting time delay of the BSR1 is T6-T1 and is calculated according to the maximum time.

S213: the base station carries out scheduling according to a scheduling algorithm and the waiting time delay of the BSR;

specifically, the base station schedules the terminal 800bits bytes.

S214: the base station updates the BSR size maintained currently;

specifically, since BSR1 is 500bits, and the scheduling is 800bits > BSR1, BSR1 is scheduled completely;

scheduling the remaining 300bits, so that the BSR2 remains 500- (800-) -500-200 bits with a time stamp of T4;

BSR3 is 1000bits, time denoted T5.

S215: the base station updates the number of the BSRs which are maintained currently;

specifically, when the BSR1 is scheduled, the BSR2 is updated to the BSR 1; BSR3 is updated to BSR2, and so on.

It can be understood that if the terminal has a new BSR report, S210 and S211 are repeated; if the base station schedules the terminal, S212 to S215 are repeated.

On the basis of the embodiment shown in fig. 1, as shown in fig. 3, another specific uplink service scheduling method provided in the embodiment of the present invention may be used in a base station, where in this embodiment, the upper limit of the number of BSRs maintained by the base station itself is set to be 2, and the base station is in continuous scheduling, that is, the time delay between the service reaching the terminal side buffer and the BSR reported by the terminal is 0, and the method may include:

s301: the UE Index is 10 of terminal initial access, and the BSR1 is reported at T1;

S302: the base station adds a time identifier T1 to the BSR 1;

s303: and at the time of T2, the terminal newly reports BSR to 1500 bits.

S304: the total BSR currently maintained by the base station is 1000bits, and the newly reported BSR is larger than the total BSR currently maintained by the base station, so that it can be described that new data is generated at the terminal side, and the newly reported BSR2 at the time of the base station maintenance T2 is 1500-1000-500 bits.

S305: judging whether the BSR number reaches the standard:

specifically, at present, the base station has only one BSR, which is smaller than the upper limit of the number of BSRs maintained by the base station itself, then the BSR2 maintained by the base station is 500bits, the time identifier is T2, and the total BSR size currently maintained by the updated base station is 1500 bits.

S306: and at the time of T3, the terminal newly reports BSR of 2000 bits.

S307: the total BSR size currently maintained by the base station is 1500bits, and the newly reported BSR is larger than the currently maintained BSR size, so that it can be shown that new data is generated at the terminal side, and the newly reported BSR 3-2000-1500-500 bits at the time of the base station maintenance T3.

S308: judging whether the BSR number reaches the standard;

specifically, at present, the base station has 2 BSRs, and the upper limit of the number of BSRs maintained by the base station itself is reached, the BSR3 is merged into the BSR2, the time stamp of the BSR3 is set to be the time stamp of the BSR2, that is, the updated BSR2 is 500+500 is 1000bits, the time identifier is T2, the report time T3 of 500bits of the newly reported BSR3 is ignored, and the total BSR size currently maintained by the updated base station is 2000 bits.

S309: and the base station schedules the terminal at the time T4, and the waiting time delay of the BSR1 is T4-T1 and is calculated according to the maximum time.

S310: the base station carries out scheduling according to a scheduling algorithm and the waiting time delay of the BSR;

specifically, the base station schedules the terminal 1500 bits.

S311: the base station updates the BSR size maintained currently;

specifically, since BSR1 is 1000bits, and the scheduling is 1500bits > BSR1, BSR1 is scheduled completely;

the remaining 500bits are scheduled, so the BSR2 remains 1000- (1500-1000) — 500bits, with the time stamp T2.

S312: the base station updates the number of the BSRs which are maintained currently;

specifically, when the BSR1 is scheduled, the BSR2 is updated to the BSR1, and the BSR2 is empty.

It can be understood that if there is a new BSR report, S306 to S308 are repeated; if the base station schedules the terminal, S309 to S312 are repeated.

On the basis of the embodiment shown in fig. 1, as shown in fig. 4, another specific uplink service scheduling method provided in the embodiment of the present invention may be used in a base station, where in this embodiment, the upper limit of the number of BSRs maintained by the base station itself is set to infinity, the base station is in discontinuous scheduling, that is, a time delay between a service reaching a terminal side buffer and a terminal reporting BSR is a random number of [1, 5] ms, and 5 denotes an SR period, and the method may include:

s401: the UE with the UE Index of 10 initially accesses, and reports the BSR1 at the time of T1;

S402: the base station adds a time identity T1 to the BSR 1.

S403: the base station schedules the terminal at the time of T2, and calculates the waiting time delay of the BSR 1;

specifically, due to discontinuous scheduling, the base station may randomly generate a time delay between the arrival of a service at the terminal side buffer and the reporting of the BSR by the terminal to be 2, and the waiting time delay of the BSR1 is T2-T1+ 2.

S404: the base station carries out scheduling according to a scheduling algorithm and the waiting time delay of the BSR;

specifically, the base station schedules the terminal 500 bits.

S405: the base station updates the BSR size maintained currently;

specifically, BSR1 ═ 1000-.

S406: and at the time of T3, the terminal newly reports that the BSR is 500 bits.

S407: the total BSR size currently maintained by the base station is 500bits, and the newly reported BSR is less than or equal to the total BSR size currently maintained by the base station, so that the situation that no new data is generated at the terminal side can be shown, and the BSR is ignored by the base station;

s408: and at the time of T4, the terminal newly reports BSR of 1000 bits.

S409: the total BSR currently maintained by the base station is 500bits, the newly reported BSR is greater than the total BSR currently maintained by the base station, which may indicate that new data is generated at the terminal side, the newly reported BSR2 at the time of the base station maintenance T4 is 1000bits and 500bits and the time identifier is T4, and the total BSR currently maintained by the updated base station is 1000 bits.

S410: and the base station schedules the terminal at the time of T5, because the terminal is in discontinuous scheduling, the base station randomly generates a random number 3 of [1, 5] ms as the time delay between the arrival of the service at the terminal buffer and the reporting of the BSR by the terminal, and the waiting time delay of the BSR1 is T5-T1+3 at the time, and is calculated according to the maximum time.

S411: the base station carries out scheduling according to a scheduling algorithm and the waiting time delay of the BSR;

specifically, the base station schedules the terminal 800 bits.

S412: the base station updates the BSR size maintained currently;

specifically, since BSR1 is 500bits, the BSR1 is scheduled with 800bits, and BSR1 is scheduled completely;

the remaining 300bits are scheduled, so the BSR2 remains 500- (800-) -500-200 bits, with the time stamp T4.

S413: the base station updates the number of the BSRs which are maintained currently;

specifically, when the BSR1 is scheduled, the BSR2 is updated to the BSR1, the BSR2 is empty, and so on.

It can be understood that if the terminal has a new BSR to report, S408 and S409 may be repeated; s410 to S413 may be repeated if the base station schedules the terminal.

The embodiments shown in fig. 2 to fig. 4 are specific applications of the embodiment shown in fig. 1, and it can be seen that, in the embodiment of the present invention, the uplink service is scheduled by the base station according to the uplink delay estimation obtained by the BSR reported by the terminal, so that the waiting delay of the uplink service packet data packet is estimated, and the PDB requirement of the uplink service packet data packet is ensured.

Based on the same technical concept of the foregoing embodiment, referring to fig. 5, which shows a structure of a base station 50 provided in an embodiment of the present invention, the base station 50 may include: a receiving unit 501, a determining unit 502, a first updating unit 503, an obtaining unit 504, a scheduling unit 505 and a second updating unit 506, wherein,

the receiving unit 501 is configured to receive a buffer status report BSR reported by a terminal;

the determining unit 502 is configured to determine the validity of the BSR according to the total BSR size currently maintained by the base station 50 and the size of the BSR;

the first updating unit 503 is configured to time-stamp the BSR after the determining unit 502 determines that the BSR is valid, and perform a first update on the currently maintained BSR size of the base station 50 according to the BSR;

when the base station 50 performs service scheduling, the obtaining unit 504 is configured to obtain a waiting time delay of the BSR according to a scheduling time and a time stamp of the BSR;

the scheduling unit 505 is configured to perform scheduling according to a preset scheduling algorithm and the waiting time delay of the BSR;

the second updating unit 506 is configured to update the BSR currently maintained by the scheduling unit 505 for the second time after the first updating according to the scheduling of the scheduling unit 505.

Exemplarily, the determining unit 502 is configured to:

when the BSR size is larger than the total BSR size currently maintained by the base station 50, determining that the BSR is valid;

and when the BSR size is less than or equal to the total BSR size currently maintained by the base station 50, determining that the BSR is invalid.

Exemplarily, the first updating unit 503 is configured to obtain the updated BSR size by subtracting a difference obtained by subtracting a total BSR size currently maintained by the base station 50 from the BSR size.

Exemplarily, referring to fig. 6, the base station 50 further includes a recording unit 507, configured to record the number of BSRs currently maintained by the base station 50 itself and the upper limit of the number of BSRs maintained by the base station 50 itself;

accordingly, the first updating unit 503 is configured to:

after the determination unit 502 determines that the BSR is valid,

when the number of the currently maintained BSRs plus the number of the BSRs is greater than the upper limit of the number of the maintained BSRs, setting the time stamp of the BSRs as the time stamp of the last maintained BSR of the base station 50, and merging the BSRs into the last maintained BSRs;

and when the number of the currently maintained BSRs plus the number of the BSRs is less than or equal to the upper limit of the number of the maintained BSRs, time-stamping the BSRs, and updating the size of the currently maintained BSRs of the base station 50 for the first time according to the BSRs.

Exemplarily, when the base station 50 is continuously scheduled, the waiting delay of the BSR is the scheduling time minus the time stamp of the BSR;

when the base station 50 is in discontinuous scheduling, the waiting time delay of the BSR is the scheduling time minus the time stamp of the BSR plus a discontinuous scheduling random value, the discontinuous scheduling random value is a numerical value in [1, scheduling request SR cycle ], wherein [ ] represents a closed interval, and the scheduling request SR cycle is the scheduling cycle of the scheduling request.

In this embodiment, a base station 50 is provided, where a scheduling unit schedules an uplink service according to an uplink delay estimation obtained by an obtaining unit according to a BSR reported by a terminal, so as to achieve estimation of a waiting delay of an uplink service packet data packet, thereby ensuring a PDB requirement of the uplink service packet data packet.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.

Claims

1. A method for scheduling uplink traffic, the method comprising:

a base station receives a Buffer Status Report (BSR) reported by a terminal;

the base station determines the effectiveness of the BSR according to the total BSR size currently maintained by the base station and the size between the BSR sizes;

after the base station determines that the BSR is valid, the base station carries out time marking on the BSR, and carries out first updating on the size of the BSR currently maintained by the base station according to the difference value between the size of the BSR and the size of the BSR currently maintained by the base station;

when the base station carries out service scheduling, acquiring the waiting time delay of the BSR according to the difference between the scheduling time and the time mark of the BSR;

2. The method of claim 1, wherein the determining, by the base station, the validity of the BSR according to a currently maintained BSR size of the base station and the BSR size comprises:

3. The method of claim 1, wherein the first updating, by the base station, the current BSR size maintained by the base station according to the BSR comprises:

4. The method of claim 1, wherein the base station further records the number of BSRs currently maintained by itself and the upper limit of the number of BSRs maintained by itself;

when the number of the BSRs which are maintained at present plus the number of the BSRs is greater than the upper limit of the number of the BSRs which are maintained at present, the base station sets the time mark of the BSR as the time mark of the BSR which is maintained at last, and incorporates the BSR into the BSR which is maintained at last;

5. The method of claim 1, wherein when the base station is continuously scheduled, the waiting delay of the BSR is the scheduling time minus the time stamp of the BSR;

6. A base station, characterized in that the base station comprises: a receiving unit, a determining unit, a first updating unit, an obtaining unit, a scheduling unit and a second updating unit, wherein,

the determining unit is configured to determine the validity of the BSR according to a total BSR size currently maintained by the base station itself and a size between the BSR sizes;

the first updating unit is configured to time-stamp the BSR after the determining unit determines that the BSR is valid, and perform first updating on the BSR currently maintained by the base station according to a difference between the BSR size and the BSR size currently maintained by the base station;

when the base station performs service scheduling, the obtaining unit is configured to obtain a waiting time delay of the BSR according to a difference between a scheduling time and a time stamp of the BSR;

7. The base station according to claim 6, wherein said determining unit is configured to:

8. The base station of claim 6, wherein the first updating unit is configured to obtain the updated BSR size by subtracting a difference obtained by subtracting a total BSR size currently maintained by the base station from the BSR size.

9. The base station of claim 6, wherein the base station further includes a recording unit, configured to record the number of BSRs currently maintained by the base station and an upper limit of the number of BSRs maintained by the base station;

accordingly, the first updating unit is configured to:

after the determination unit determines that the BSR is valid,

when the number of the BSRs which are currently maintained by the base station and the number of the BSRs are greater than the upper limit of the number of the BSRs which are maintained by the base station, setting the time mark of the BSR as the time mark of the BSR which is maintained by the base station at the last time, and merging the BSR into the BSR which is maintained at the last time;

10. The base station of claim 6, wherein when the base station is continuously scheduled, the waiting delay of the BSR is the scheduling time minus the time stamp of the BSR;