CN101540716B

CN101540716B - Service quality-based method and service quality-based device for scheduling non-guaranteed bit rate service

Info

Publication number: CN101540716B
Application number: CN2008101020806A
Authority: CN
Inventors: 齐薇; 刘兵; 邓伟; 许芳丽
Original assignee: China Academy of Telecommunications Technology CATT
Current assignee: China Academy of Telecommunications Technology CATT; Datang Mobile Communications Equipment Co Ltd
Priority date: 2008-03-17
Filing date: 2008-03-17
Publication date: 2012-07-04
Anticipated expiration: 2028-03-17
Also published as: CN101540716A

Abstract

The invention discloses a service quality-based method for scheduling non-guaranteed bit rate services, which relates to non-guaranteed bit rate service GBR service scheduling technology and is provided to solve the problem of low non-GBR air interface scheduling efficiency. The invention adopts a technical proposal that the method comprises the following steps of: A, according to user ends UEs of radio barrier block RBs, determining physical resource blocks PRB assignable to the RBs and pre-assigning the PRBs to the current RB and determining the priority of the RBs; B, assigning the PRBs to an RB with top priority and then returning to the step A; and scheduling the RBs according to the PRB modulation modes at all time frequencies in the PRBs assigned to the RBs. At the same time, the invention discloses a device for implementing the method. The method achieves high utilization rate of the PRB resources and high data transmission rate of air interfaces, saves the PRB resources and improves the utilization rate of the PRB resources.

Description

Non-guaranteed bit rate service scheduling method and device based on service quality

Technical Field

The present invention relates to a technique for scheduling non-Guaranteed Bit Rate (GBR) services, and more particularly, to a Quality of Service (QOS) based method and apparatus for scheduling non-Guaranteed Bit Rate services.

Background

In a single-user multiple-input multiple-output (SU-MIMO) system, each antenna is configured with Physical Resource Blocks (PRBs), the number of PRBs configured for each antenna by the system is the same, and they belong to different time frequencies, and once a PRB on a certain antenna is allocated to a certain radio bearer block (RB) of a UE, then PRBs of the time frequency on other antennas cannot be reallocated to RBs of other UEs. The following describes the current resource allocation method of the system.

Assuming that the system has N transmitting antennas, N data streams can be transmitted simultaneously, and the Channel Quality Indicator (CQI) corresponding to the PRB on antenna 1 is { c }_u ¹，c_u ²，…，c_u ^quThe CQI corresponding to the PRB on the antenna 2 is { d }_u ¹，d_u ²，…，d_u ^qu… …, CQI corresponding to PRB on antenna N is { e_u ¹，e_u ²，…，e_u ^quU is UE set with down business in system, q_uThe number of all PRBs allocated by the system on each antenna. The set of PRBs available at that time

Wherein PRB_i ¹PRB on antenna 1, PRB_i ²Is a PRB, on antenna 2_i ^NIs PRB on antenna N, where 1 is ≦ i, r, s, t is ≦ q_u。

For the current RB, the UE to which the current RB belongs is determined to be in omega_DLDetermining the best CQI value corresponding to the PRB; and determining the antenna with the maximum number of PRBs containing the best CQI, wherein the PRB with the best CQI on the antenna is the pre-allocated resource of the RB.

According to the determined best CQI, searching the highest-order Modulation mode corresponding to the best CQI in a Modulation and Coding Scheme (MCS) table, and determining the maximum data size TBS which can be carried by the PRB with the best CQI_max ^uAssuming that the number of PRBs with the best CQI is M, the maximum data size that these PRBs can carry on the antenna is TBS_max ^u×M。

And the amount of data TBS of the current RB in the radio Link control RLC transmission buffer^RComparison of TBS_max ^uX M and TBS^RSize of (D), if TBS_max ^uX M is less than or equal to TBS^RThen use TBS_max ^uBy x M to determine the priority of the current RB, i.e. calculation

Wherein Tr is the actual amount of scheduling data in the last scheduling period RB, if TBS_max ^uX M is greater than TBS^RUsing TBS^RTo determine the priority of the current RB, i.e. calculation

The priority of each RB is determined according to the calculated ratio.

And allocating PRBs to the RBs in the descending order of the priority of the RBs. For the RBs to be allocated with resources, determining the available PRBs of the RBs, and determining the best CQI values corresponding to the PRBs in the available PRBs; determining the antenna with the highest number of PRBs containing the best CQI, and the antenna with the best CQThe PRB of the I and the PRB in the same time frequency are the distributed resources of the RB; according to the determined best CQI, the highest-order modulation mode corresponding to the best CQI is searched in a system MCS table, and the maximum data size TBS which can be carried by the PRB with the best CQI is determined_max ^uAssuming that the number of PRBs with the best CQI is M, the maximum data size that these PRBs can carry on the antenna is TBS_max ^uAnd (4) x M. Comparison TBS_max ^uX M and TBS^RSize of (D), if TBS^RLess than TBS_max ^uxM, the number Q of PRBs allocated for the current RB is greater than or equal to

Is an integer of (i), i.e.

In the case of an integer, the number of the carbon atoms,

Q = \frac{{TBS}^{R}}{{TBS}_{\max}^{u}},

otherwise Q is

Rounding up, that is, selecting Q PRBs from M PRBs as the resource allocated to the current RB, and allocating the Q PRBs and the co-frequency PRBs to the current RB. If TBS^RGreater than or equal to TBS_max ^uX M, Q ═ M, that is, all M PRBs are allocated to the current RB, and the concurrent frequency PRBs of the M PRBs are also allocated to the current RB.

The existing PRB allocation method considers the characteristics of non-GBR services, introduces a resource pre-allocation algorithm, ensures that the air interface resources are reasonably and effectively utilized, and carries out priority sequencing and scheduling on users strictly according to the QoS requirements of the users. However, the existing PRB allocation method only sorts the user priorities according to a primary resource pre-allocation algorithm, and there is a certain unfairness, and the transmission rate of the air interface still cannot be maximized; the current resource allocation mode allocates resources only according to the PRB with the best CQI on the antenna, so that the situation of resource waste exists, and precious resources of an air interface cannot be fully utilized.

Disclosure of Invention

In view of the above, the main objective of the present invention is to provide a method and an apparatus for scheduling a non-guaranteed bit rate service based on qos, which are more fair in priority ordering of RBs, more reasonable in allocated PRBs, and capable of improving RB scheduling efficiency.

In order to achieve the purpose, the technical scheme of the invention is realized as follows:

a method for scheduling non-guaranteed bit rate service based on service quality comprises the following steps:

A. determining Physical Resource Blocks (PRBs) which can be allocated to radio bearer blocks (RBs) according to User Equipment (UE) to which the RBs belong, performing PRB pre-allocation on the current RBs, and determining the priority of the RBs;

B. and B, after allocating the PRB for the RB with the highest priority, returning to the step A.

Preferably, step B is followed by:

and scheduling the RB according to the modulation mode of each time-frequency PRB in the PRBs allocated by the RB.

Preferably, the determining PRBs allocatable by RBs in step a specifically includes:

determining PRBs available for the RBs on each antenna, and determining the best Channel Quality Indicator (CQI) corresponding to the PRBs in the PRBs;

and determining the antenna with the maximum number of PRBs distributed with the best CQI, wherein the PRB with the best CQI on the antenna is the pre-allocated resource of the RB.

Preferably, the determining the priority of each RB in step a specifically includes:

according to the CQI corresponding to the RB pre-allocated PRB, determining a highest-order modulation mode corresponding to the CQI, and calculating the data volume borne by the RB pre-allocated PRB in the modulation mode;

comparing the RB actual data volume with the data volume size of the RB pre-allocated PRB bearer, if the RB actual data volume is less than or equal to the data volume of the RB pre-allocated PRB bearer, calculating the ratio of the RB actual data volume to the RB scheduling data volume in the previous scheduling period, otherwise, calculating the ratio of the RB actual data volume to the RB scheduling data volume in the previous scheduling period;

and determining the RB priority according to the ratio, wherein the larger the ratio is, the higher the corresponding RB priority is.

Preferably, allocating PRBs for the RB with the highest priority in step B specifically includes:

b1, determining available PRBs of the RBs on each antenna, and determining the best Channel Quality Indicator (CQI) corresponding to the PRBs in the PRBs;

b2, determining the antenna with the most distributed PRBs (resource blocks) with the best CQI, and taking the PRBs with the best CQI and the PRBs with the same time frequency on the antenna as the allocable resources of the RBs;

b3, selecting a time-frequency PRB from the allocable resources, finding out the PRB with the CQI not less than the set threshold value, and allocating the PRB to the RB;

b4, when the RB can be scheduled by the allocated PRB or the allocable resource of the RB is empty, the RB resource allocation is finished, otherwise, the step B3 is returned.

Preferably, when the number of the PRBs with the best CQI distributed in step B2 is more than one, the PRBs with the best CQI distributed on the antenna with the highest data carrying capacity of the PRBs in the same time and frequency of other antennas and the PRBs in the same time and frequency thereof are used as allocable resources of the RB.

Preferably, the method further comprises:

and after the resource allocation is finished, allocating the whole time-frequency PRB to the RB which can not be scheduled by the allocated PRB, or allocating the partial PRB of which the CQI is not less than a set threshold value in the available time-frequency PRB to the RB.

A non-guaranteed bit rate service scheduler based on quality of service, comprising:

an RB allocable resource determining unit, configured to determine, according to a UE to which an RB belongs, a PRB to which the RB is allocable;

the RB resource pre-allocation unit is used for performing PRB pre-allocation on each current RB;

the RB priority determining unit is used for determining the priority of each RB according to the pre-allocation result of the RB resource pre-allocation unit; and

and the RB resource allocation unit is used for allocating PRBs to the RBs with the highest priority according to the priorities determined by the RB priority determination unit.

Preferably, the apparatus further comprises:

and the scheduling unit is used for scheduling the RB according to the modulation mode of each time-frequency PRB in the PRBs allocated to the RB by the RB resource allocation unit.

Preferably, the RB resource pre-allocation unit includes:

a best CQI determining module, configured to determine a best CQI corresponding to a PRB from PRBs that can be allocated to the RB; and

and the pre-allocation resource determining module is used for determining the antenna with the most PRBs distributed with the best CQI, and the PRBs with the best CQI on the antenna are the pre-allocation resources of the RBs.

Preferably, the RB priority determining unit includes:

the pre-allocated PRB data carrying amount calculation module is used for determining the highest-order modulation mode corresponding to the CQI according to the CQI corresponding to the PRB pre-allocated to the RB by the pre-allocated resource determination module and calculating the data carrying amount of the PRB pre-allocated to the RB in the modulation mode;

a priority ratio calculation module, configured to compare the RB actual data size with the data size calculated by the pre-allocated PRB loaded data size calculation module, if the RB actual data size is smaller than or equal to the data size of the pre-allocated PRB loaded by the RB, calculate a ratio between the RB actual data size and the RB scheduling data size in a previous scheduling period, otherwise calculate a ratio between the RB loaded data size of the pre-allocated PRB and the RB scheduling data size in the previous scheduling period; and

and the priority determining module is used for determining the priority of the RB according to the ratio calculated by the priority ratio calculating module, wherein the larger the ratio is, the higher the corresponding RB priority is.

Preferably, the RB resource allocation unit includes:

a best CQI determining module, configured to determine a best CQI corresponding to a PRB from PRBs that can be allocated to the RB;

an allocable resource determining module, configured to determine an antenna with the largest number of PRBs with the best CQI distributed thereon, and use the PRBs with the best CQI and PRBs with simultaneous frequency on the antenna as allocable resources of the RB;

an RB resource allocation module configured to optionally select a time-frequency PRB from the allocable resources determined by the allocable resource determination module, find out a PRB of which CQI is not less than a set threshold, and allocate the PRB to the RB; and

and the termination judging module is used for judging whether the RB can be scheduled by the allocated PRB or not or whether the allocable resource of the RB is empty or not after the RB resource allocation module finishes allocating one RB resource, if so, finishing the RB resource allocation, and otherwise, triggering the RB resource allocation module to perform resource allocation on the next RB.

Preferably, when the allocable resource determining module determines that the antenna with the largest number of PRBs with the best CQI is distributed is more than one, the PRBs with the best CQI distributed on the antenna with the largest data carrying capacity of the PRBs in the same time frequency of other antennas and the PRBs in the same time frequency are used as the allocable resources of the RB.

Preferably, the apparatus further comprises:

and the resource reallocation unit is used for allocating the whole time-frequency PRB to the RB which can not be scheduled by the allocated PRB after the resource allocation is finished, or allocating the PRB of which the CQI is not less than a set threshold value in part of the available time-frequency PRB to the RB.

In the invention, after the resource pre-allocation is carried out on the RBs for priority sequencing each time, the resource is allocated to the RB with the highest priority at present, and then the priority sequencing is carried out on the rest RBs again to allocate the resource to the RB with the highest priority next time. When resource allocation is carried out on the RBs, the same-time-frequency PRBs are allocated to the RBs one by one, and the same-time-frequency PRBs with CQI smaller than a set threshold value cannot be allocated to the RBs. The invention has higher utilization efficiency of PRB resources, higher transmission data rate of the air interface, saves the PRB resources and improves the utilization efficiency of the PRB resources.

Drawings

FIG. 1 is a flow chart of a QoS-based non-guaranteed bit rate service scheduling method according to the present invention;

FIG. 2 is a schematic diagram of a QoS-based non-guaranteed bitrate service scheduling apparatus according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a RB resource pre-allocation unit according to the present invention;

FIG. 4 is a schematic diagram illustrating a structure of an RB priority determination unit according to the present invention;

fig. 5 is a schematic diagram of a structure of an RB resource allocation unit according to the present invention.

Detailed Description

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

Fig. 1 is a flowchart of a non-guaranteed bit rate service scheduling method based on qos according to the present invention, and as shown in fig. 1, the non-guaranteed bit rate service scheduling method based on qos according to the present invention includes the following steps:

step 101: and determining the distributable PRBs of the RBs according to the UE to which the RBs belong, performing PRB pre-allocation on the current RBs, and determining the priority of each RB.

For any RB in the system, the UE to which the RB belongs is determined, for the whole time-frequency unallocated PRB, the RB is available resources, and for a part of the whole time-frequency PRB allocated to the RB, other RBs corresponding to the UE to which the RB belongs can still use the unallocated resources in the whole time-frequency PRB. That is, a PRB allocated to a certain UE is only used by the UE in the whole time-frequency PRB in which the PRB is located. The resource pre-allocation of the RB is based on the available resources of the RB.

The RB resource pre-allocation method of the invention is the same as the allocation method in the background technology: available PRB set

Wherein PRB_i ¹PRB on antenna 1, PRB_i ²Is a PRB, on antenna 2_i ^NIs PRB on antenna N, where 1 is ≦ i, r, s, t is ≦ q_u，q_uThe number of all PRBs allocated to the system on each antenna is 1 to q, r, s and t_u。

For the current RB, at Ω_DLDetermining the best CQI value corresponding to the PRB; and determining the antenna with the maximum number of PRBs containing the best CQI, wherein the PRB with the best CQI on the antenna is the pre-allocated resource of the RB. Wherein the CQI is fed back to the system by the UE.

Each CQI in the system MCS table corresponds to at least one available modulation mode, according to the determined best CQI, the highest-order modulation mode corresponding to the best CQI is searched in the system MCS table, and the maximum data size TBS which can be carried by the PRB with the best CQI is determined_max ^uAssuming that the number of PRBs with the best CQI is M, the maximum data size that these PRBs can carry on the antenna is TBS_max ^u×M。

The priority of each RB is determined according to the calculated ratio. Wherein,

or

The higher the ratio, the higher the priority corresponding to the RB.

Step 102: allocating PRBs to the RBs with the highest priority determined in step 101, returning to step 101, and re-prioritizing the remaining RBs.

And according to the pre-allocation mode of the PRBs in step 101, determining the antenna with the most PRBs including the best CQI for the RB with the highest priority, where the PRBs with the best CQI and the PRBs in the same time frequency on the antenna are allocable resources of the RB. Here, the PRB with the best CQI and the PRB in the same time frequency belong to the set Ω_DLAre all PRBs available for the highest priority RB. And when the number of the PRBs distributed with the best CQI is more than one, taking the PRBs distributed with the best CQI on the antenna with the maximum same-time-frequency PRB bearing data quantity on other antennas and the PRBs distributed with the best CQI on the same time-frequency antenna as the allocable resources of the RBs.

Selecting a time-frequency PRB from the allocable resources optionally, finding out the PRB of which the CQI is not less than a set threshold value, and allocating the PRB to the RB. When the method allocates resources for the RBs, the PRBs which contain the best CQI and have the most number on the antenna are not allocated to the RBs with the highest current priority, but determined according to the actual data volume of the RBs, and if a plurality of time-frequency PRBs can completely bear the RBs, the rest PRBs are not allocated to the RBs. Selecting a certain time-frequency PRB from allocable resources, namely selecting PRBs with the same number on a plurality of antennas in the system, finding out the PRBs with the same time-frequency on each antenna, wherein the CQI corresponding to the PRBs with the same time-frequency on each antenna is not less than a set threshold, allocating the PRBs with the CQI not less than the set threshold to the RB, and if the CQI of all the available PRBs with the time-frequency is not less than the set threshold, allocating the PRBs in the whole time-frequency to the RB with the highest priority. When one PRB on a certain time frequency is allocated to an RB of a certain UE, PRBs on other antennas of the time frequency cannot be allocated to other UEs. The main factor determining the data carrying capacity of the PRBs is the coding modulation mode of the data, and the adopted modulation modes are also the same for the available PRBs in the same time frequency, so that if the modulation mode corresponding to the PRB on a certain antenna in a certain time frequency PRB is poor, the total data carrying capacity of the time frequency PRB is not very high, and therefore, the PRBs with CQI smaller than a set threshold value are removed in the method, so as to ensure that the data carrying capacity of the allocated time frequency PRB is larger. It should be noted that the CQI setting threshold may be dynamically set with reference to the best CQI currently determined, or an average value of each CQI in the time frequency may be used as the setting threshold, or may be set empirically.

And finishing the RB resource allocation when the RB can be scheduled by the allocated PRB or the allocable resource of the RB is empty.

And after the resource allocation is finished, allocating the whole time-frequency PRB to the RB which can not be scheduled by the allocated PRB, or allocating the partial PRB of which the CQI is not less than a set threshold value in the available time-frequency PRB to the RB. After the resource allocation is performed on the RBs in the foregoing manner, there may be a case where the whole time-frequency PRB is not allocated, and thus, these PRBs may be allocated to RBs that cannot be scheduled by the allocated PRBs, so that the PRB resources are fully utilized. And for the time-frequency PRB allocated by the existing partial PRB, allocating the PRB of which the available CQI exceeds the set threshold value to the RB which is corresponding to the UE occupying part of the time-frequency PRB and can not be scheduled by the allocated PRB.

The invention pre-allocates the resource for the RB through the iterative algorithm, improves the fairness of the scheduling priority ordering of the RB between users and in the users, improves the sending rate of the air interface, and more effectively utilizes the air interface resource.

Step 103: and scheduling the RB according to the modulation mode of each time-frequency PRB in the PRBs allocated by the RB. And processing the PRBs allocated to the RBs according to time and frequency, namely determining the lowest modulation mode of the PRBs in the allocated certain time and frequency PRBs, carrying the data of the RBs by the whole time and frequency PRBs according to the determined lowest modulation mode, and carrying out data scheduling.

For non-GBR services, although the time delay requirement is not very high, the requirement on the error rate is relatively high, and the service scheduling method provided by the invention improves the data transmission quantity of an air interface as much as possible on the premise of ensuring the data transmission accuracy so as to more effectively utilize air interface resources.

FIG. 2 is a schematic diagram of a structure of a QoS-based non-guaranteed bit rate service scheduler of the present invention, and as shown in FIG. 2, the QoS-based non-guaranteed bit rate service scheduler of the present invention includes an RB allocable resource determination unit 20, an RB resource pre-allocation unit 21, an RB priority determination unit 22, an RB resource allocation unit 23, and a scheduling unit 24, where the RB allocable resource determination unit 20 is configured to determine the RBs allocable according to the UEs to which the RBs belong, i.e., to determine the set Ω in step 101_DLThe determination is made in the same manner as in step 101. The RB resource pre-allocation unit 21 is used for performing PRB pre-allocation on each current RB, i.e. calculating TBS in step 101_max ^u×M、TBS^RAnd Tr, thereby calculating

OrThe RB priority determining unit 22 is configured to determine the priority of each RB according to the pre-allocation result of the RB resource pre-allocating unit 21, specifically,

or

The higher the ratio is,the higher the priority corresponding to the RB. The RB resource allocation unit 23 is configured to allocate PRBs to the highest priority RB according to the priority determined by the RB priority determination unit 22. The scheduling unit 24 is configured to schedule the RB according to a modulation mode of each time-frequency PRB in the PRBs allocated for the RB by the RB resource allocation unit 23. The scheduling unit 24 performs processing according to the allocated PRBs of the RBs on a time-frequency basis, that is, determines the lowest modulation mode of the PRBs in a certain allocated time-frequency PRB, and performs data scheduling on the PRBs in the whole time-frequency according to the determined lowest modulation mode.

Fig. 3 is a schematic structural diagram of an RB resource pre-allocation unit of the present invention, and as shown in fig. 3, the RB resource pre-allocation unit 21 of the present invention includes a best CQI determining module 210 and a pre-allocation resource determining module 211, where the best CQI determining module 210 is configured to determine a best CQI corresponding to PRBs among the PRBs that can be allocated by the RB. The pre-allocation resource determining module 211 is configured to determine an antenna with the largest number of PRBs having the best CQI, where the PRBs having the best CQI on the antenna are the pre-allocation resources of the RBs.

Fig. 4 is a schematic structural diagram of the RB priority determining unit according to the present invention, and as shown in fig. 4, the RB priority determining unit 22 according to the present invention includes a pre-allocated PRB carrying data amount calculating module 220, a priority ratio calculating module 221, and a priority determining module 222, where the pre-allocated PRB carrying data amount calculating module 220 is configured to determine a highest-order modulation scheme corresponding to a CQI according to the CQI corresponding to a PRB pre-allocated to an RB by the pre-allocated resource determining module 211, and calculate a data amount carried by the PRB pre-allocated in the modulation scheme. The priority ratio calculating module 221 is configured to compare the RB actual data size with the data size calculated by the pre-allocated PRB carrying data size calculating module, and if the RB actual data size is smaller than or equal to the data size of the pre-allocated PRB carrying by the RB, calculate a ratio of the RB actual data size to the RB scheduling data size in a previous scheduling period, otherwise calculate a ratio of the RB scheduling data size in the previous scheduling period by the data size of the pre-allocated PRB carrying by the RB. The priority determining module 222 is configured to determine the priority of the RB according to the ratio calculated by the priority ratio calculating module 221, where the higher the ratio is, the higher the priority corresponding to the RB is.

Fig. 5 is a schematic structural diagram of the RB resource allocation unit of the present invention, and as shown in fig. 5, the RB resource allocation unit 23 of the present invention includes a best CQI determining module 230, an allocable resource determining module 231, an RB resource allocating module 232, and a termination determining module 233, where the best CQI determining module 230 is configured to determine a best CQI corresponding to PRBs in the RB allocable PRBs, and is completely the same as the function implemented by the best CQI determining module 210. The allocable resource determining module 231 is configured to determine an antenna with the largest number of PRBs with the best CQI distributed thereon, and use the PRBs with the best CQI and the PRBs with simultaneous frequencies on the antenna as allocable resources of the RBs. The RB resource allocation module 232 is configured to optionally select a time-frequency PRB from the allocable resources determined by the allocable resource determination module 231, find out a PRB whose CQI is not less than a set threshold, and allocate the PRB. For a specific allocation manner of the RB resource allocation module 232, reference may be made to the related description in step 102. The termination determining module 233 is configured to determine whether the RB can be scheduled by the allocated PRB or whether the allocable resource of the RB is empty after the RB resource allocating module 232 finishes allocating one RB resource, if yes, terminate resource allocation of the RB, and otherwise, trigger the RB resource allocating module 232 to perform resource allocation on the next RB. When the allocable resource determining module 231 determines that the antenna with the maximum number of PRBs with the best CQI is more than one, the PRBs with the best CQI distributed on the antenna with the maximum time-frequency PRB carrying data volume of other antennas and the PRBs with the same time-frequency PRB are used as allocable resources of the RB.

As shown in fig. 2, the apparatus for scheduling a non-guaranteed bit rate service based on qos further includes a resource reallocation unit 25, which allocates PRBs in the whole time domain to RBs that cannot be scheduled by allocated PRBs after resource allocation is completed as described above, or allocates PRBs in part of available time-frequency PRBs, of which CQIs are not less than a set threshold, to the RBs. And for the RB which cannot be scheduled by the allocated PRB, allocating the whole time-frequency PRB to the RB or allocating the PRB of which the CQI is not less than a set threshold value in the partial available time-frequency PRB to the RB. After the resource allocation is performed on the RBs in the foregoing manner, there may be a case where the whole time-frequency PRB is not allocated, and thus, these PRBs may be allocated to RBs that cannot be scheduled by the allocated PRBs, so that the PRB resources are fully utilized. And for the time-frequency PRB allocated by the existing partial PRB, allocating the PRB of which the available CQI exceeds the set threshold value to the RB which is corresponding to the UE occupying part of the time-frequency PRB and can not be scheduled by the allocated PRB.

Those skilled in the art will understand that the above units and modules can be implemented by corresponding software and can also be implemented by corresponding circuits. The roles of the units and modules are in one-to-one correspondence with the functions described in the aforementioned non-guaranteed bit rate service scheduling method based on quality of service, and the units and modules can be understood by referring to the aforementioned description.

The invention improves the fairness of the RB scheduling priority ordering between users and in the users, improves the sending rate of the air interface, and more effectively utilizes the air interface resources. For non-GBR services, although the delay requirement is not very high, the requirements on the bit error rate and the like exist, and the service scheduling method provided by the invention can improve the data sending efficiency of an air interface as much as possible under the condition of ensuring the data transmission quality so as to more effectively utilize air interface resources.

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 non-guaranteed bit rate services based on quality of service, the method comprising:

B. allocating PRBs to the RB with the highest priority, judging whether the RB can be scheduled by the allocated PRBs or whether the allocable resources of the RB are empty or not, and if so, ending the allocation of the RB resources; otherwise, returning to the step A;

and, after ending the RB resource allocation, further comprising: and scheduling the RB according to the modulation mode of each time-frequency PRB in the PRBs allocated by the RB.

2. The method according to claim 1, wherein the determining the PRBs to which RBs can be allocated in step a specifically includes:

3. The method according to claim 2, wherein the priority of each RB is determined in step a by:

4. The method according to claim 1, wherein the step B allocates PRBs for the highest priority RB, specifically:

5. The method of claim 4, further comprising:

6. An apparatus for scheduling non-guaranteed bit rate services based on quality of service, the apparatus comprising:

the RB priority determining unit is used for determining the priority of each RB according to the pre-allocation result of the RB resource pre-allocation unit;

an RB resource allocation unit, configured to allocate PRBs to the RBs with the highest priority according to the priorities determined by the RB priority determination unit; and

7. The apparatus of claim 6, wherein the RB resource pre-allocation unit comprises:

8. The apparatus of claim 7, wherein the RB priority determination unit comprises:

9. The apparatus of claim 6, wherein the RB resource allocation unit comprises:

10. The apparatus of claim 6, further comprising: