CN108541067B - Resource scheduling method and device - Google Patents

Resource scheduling method and device Download PDF

Info

Publication number
CN108541067B
CN108541067B CN201710128970.3A CN201710128970A CN108541067B CN 108541067 B CN108541067 B CN 108541067B CN 201710128970 A CN201710128970 A CN 201710128970A CN 108541067 B CN108541067 B CN 108541067B
Authority
CN
China
Prior art keywords
resource block
user terminal
resource
determining
user
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710128970.3A
Other languages
Chinese (zh)
Other versions
CN108541067A (en
Inventor
高伟辰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Datang Mobile Communications Equipment Co Ltd
Original Assignee
Datang Mobile Communications Equipment Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Datang Mobile Communications Equipment Co Ltd filed Critical Datang Mobile Communications Equipment Co Ltd
Priority to CN201710128970.3A priority Critical patent/CN108541067B/en
Publication of CN108541067A publication Critical patent/CN108541067A/en
Application granted granted Critical
Publication of CN108541067B publication Critical patent/CN108541067B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/51Allocation or scheduling criteria for wireless resources based on terminal or device properties
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources

Abstract

The invention relates to the wireless communication field, in particular to a resource scheduling method and a device, which are used for solving the problems that the prior art can not consider the fairness, the channel quality and the service quality of different user terminals, the method is that firstly, based on the corresponding relation between the resource block and the user terminal, the user level resource block queue corresponding to each user terminal is determined, and allocating resource blocks for the corresponding user terminals from the user-level resource block queues corresponding to each user terminal based on the resource allocation factors determined according to the data amount to be transmitted of each user terminal, thus, all the user terminals can be allocated to the resource block, the situation that the user terminals have no resource block available can not occur, therefore, fairness is guaranteed, and the cell throughput is guaranteed due to the fact that resource block allocation is carried out through the resource allocation factors.

Description

Resource scheduling method and device
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a resource scheduling method and apparatus.
Background
In a Long Term Evolution (LTE) system, a Media Access Control (MAC) layer is mainly responsible for scheduling and allocating time domain and frequency domain resources to different user terminals, where the quality of a scheduling method directly affects the throughput of a cell in which each user terminal is located and the network service rate used by each user terminal.
Generally, on the premise of guaranteeing fairness of resource usage by each user terminal, when time domain and frequency domain resources are scheduled and allocated to the user terminals, the utilization rate of the resources is improved as much as possible so as to meet the service quality of different services.
For example, for the user terminals in a cell, each user terminal shares limited bandwidth resources, network services performed by each user terminal are different, and channel quality of each user terminal is different, so different user terminals can distinguish different scheduling priorities according to the quality of service level identification.
If the throughput of the cell is considered preferentially, when time domain and frequency domain resources are scheduled and allocated to the user terminals, more resources can be allocated to the user terminals with high channel quality, and the resources of the user terminals with poor channel quality or the user terminals at the edge of the cell are correspondingly reduced, so that the fairness of the resource use of each user terminal is influenced; if fairness is considered preferentially, the same resources are scheduled and allocated to the user terminals with different channel qualities, so that not only can resource waste be caused, but also the network service rates of other user terminals can be influenced, and the throughput of the whole cell can be influenced.
There are the following three scheduling schemes for allocation of time and frequency domain resources among the prior art.
The first scheme is a MAX Carrier/Interference (MAX C/I) algorithm, that is, when scheduling is performed for different ues, the ue with the largest Carrier to Interference ratio is considered preferentially, which is equivalent to the ue with better channel quality, and if the current channel quality of the selected ue is poor, the ue with better channel quality is reselected.
By adopting the first scheme, although the user terminal with good channel quality is preferably considered, the throughput of the cell can be ensured to the maximum, but the fairness is lost, and the perception experience of the user terminal with poor channel quality and the user terminal at the edge of the cell is reduced.
The second scheme is Round Robin (RR) algorithm, that is, time domain and frequency domain resources are cyclically scheduled for each ue, and for different ues in different cell locations, the same scheduling opportunity can be obtained regardless of the channel quality.
By adopting the second scheme, although the fairness of each user terminal can be guaranteed to the maximum extent, because different channel qualities of different user terminals are not fully considered, the user terminals with the same channel quality obtain the same scheduling allocation time, and the throughput of the whole cell is influenced.
Scheme three is a Proportional Fair (PF) algorithm, that is, the scheduling priority is measured by the ratio of the service rate requested by the user at the current moment to the accumulated average rate in a period of time (for convenience of description, hereinafter denoted by C), for example, if the current channel quality of a certain ue is better, so that the C value is increased, the corresponding scheduling priority is also increased accordingly, and after a period of time, because the scheduling priority of the user terminal is always in a high priority state, correspondingly, the accumulative average rate is increased, thereby leading to the reduction of the C value and further, the scheduling priority of the ue will also decrease, and for ues with poor channel quality, if the scheduling priority is lower all the time, the cumulative average rate is also decreased, resulting in an increase in the value of C, and thus the scheduling priority of the ue is also increased.
By adopting the third scheme, although the fairness and the channel quality of different user terminals can be considered, the third scheme does not consider the different service characteristics, the service quality and other factors of different user terminals and has certain one-sidedness.
In view of the above, a new resource scheduling scheme needs to be designed to overcome the above drawbacks.
Disclosure of Invention
The embodiment of the invention provides a resource scheduling method and a resource scheduling device, which are used for solving the problem that fairness, channel quality and service quality of different user terminals cannot be considered in the prior art.
The embodiment of the invention provides the following specific technical scheme:
a resource scheduling method comprises the following steps:
determining each resource block to be scheduled, and screening out corresponding resource blocks for each user terminal respectively based on a preset corresponding relation between each resource block and each user terminal to obtain a user-level resource block queue corresponding to each user terminal;
respectively determining a resource allocation factor corresponding to each user terminal based on the data volume to be transmitted of each user terminal;
and allocating resource blocks for the corresponding user terminals from the user-level resource block queues corresponding to the user terminals respectively based on the resource allocation factors of the user terminals.
Optionally, based on a preset correspondence between each resource block and each user terminal, screening out a corresponding resource block for each user terminal, respectively, to obtain a user-level resource block queue corresponding to each user terminal, including:
determining the priority factor of each resource block based on a preset priority algorithm, and determining the priority sequence according to the priority factor corresponding to each resource block to form a resource block queue;
and respectively screening the resource blocks corresponding to each user terminal from the resource block queue according to the priority order based on the preset corresponding relation between each resource block and each user terminal, and determining the user-level resource block queue corresponding to each user terminal.
Optionally, determining the priority factor of any resource block based on a preset priority algorithm includes:
determining a service quality factor corresponding to any one resource block, wherein the service quality factor represents the ratio of the service quality of any one resource block in the total service quality;
determining a user terminal corresponding to any one resource block based on a preset corresponding relation between each resource block and each user terminal, and determining a maximum scheduling rate corresponding to the user terminal and an average transmission rate of the user terminal in a preset time period;
determining a candidate priority factor of any one resource block based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal and the service quality factor corresponding to any one resource block;
and correspondingly adjusting the candidate priority factor based on a preset experience factor in an application scene corresponding to any resource block to obtain the priority factor.
Optionally, based on a preset correspondence between each resource block and each user terminal, respectively screening, from the resource block queue, the resource block corresponding to each user terminal according to a priority order, and determining the user-level resource block queue corresponding to each user terminal includes:
sequentially selecting one resource block from the resource block queue according to the priority order, and executing the following operations for each acquired resource block until the total number of the user terminals corresponding to each selected resource block is judged to reach a preset upper limit:
determining a user terminal corresponding to the currently acquired resource block based on a preset corresponding relation between each resource block and each user terminal;
and adding the resource block to a user-level resource block queue corresponding to the user terminal, and deleting the resource block from the corresponding position of the resource block queue.
Optionally, determining a resource allocation factor corresponding to any user terminal based on the amount of data to be transmitted by any user terminal includes:
determining a resource block required by the data volume to be transmitted based on the data volume to be transmitted of any user terminal;
and determining a resource allocation factor corresponding to any user terminal based on the resource blocks required by any user terminal and the total amount of the resource blocks required by each user terminal.
Optionally, allocating resource blocks for the corresponding user terminal from the user-level resource block queue corresponding to any user terminal based on the resource allocation factor of any user terminal, includes:
determining the proportion of the resource blocks required by any user terminal in the resource blocks contained in the corresponding user level resource block queue according to the resource allocation factor of any user terminal;
and in the user-level resource block queue, allocating resource blocks which accord with the proportion to any user terminal according to the priority sequence.
Optionally, after allocating resource blocks for the corresponding user terminals from the user-level resource block queues corresponding to any user terminal based on the resource allocation factor of any user terminal, the method further includes:
and updating the average transmission rate of any user terminal in a preset time period.
A resource scheduling apparatus, comprising:
the processing unit is used for determining each resource block to be scheduled, screening out the corresponding resource block for each user terminal respectively based on the preset corresponding relation between each resource block and each user terminal, and obtaining a user-level resource block queue corresponding to each user terminal;
a determining unit, configured to determine a resource allocation factor corresponding to each ue based on the amount of data to be transmitted by each ue;
and the allocating unit is used for allocating resource blocks for the corresponding user terminals from the user-level resource block queues corresponding to the user terminals respectively based on the resource allocation factors of the user terminals.
Optionally, based on a preset correspondence between each resource block and each user terminal, screening out a corresponding resource block for each user terminal, and when a user-level resource block queue corresponding to each user terminal is obtained, the processing unit is configured to:
determining the priority factor of each resource block based on a preset priority algorithm, and determining the priority sequence according to the priority factor corresponding to each resource block to form a resource block queue;
and respectively screening the resource blocks corresponding to each user terminal from the resource block queue according to the priority order based on the preset corresponding relation between each resource block and each user terminal, and determining the user-level resource block queue corresponding to each user terminal.
Optionally, when determining the priority factor of any resource block based on a preset priority algorithm, the processing unit is configured to:
determining a service quality factor corresponding to any one resource block, wherein the service quality factor represents the ratio of the service quality of any one resource block in the total service quality;
determining a user terminal corresponding to any one resource block based on a preset corresponding relation between each resource block and each user terminal, and determining a maximum scheduling rate corresponding to the user terminal and an average transmission rate of the user terminal in a preset time period;
determining a candidate priority factor of any one resource block based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal and the service quality factor corresponding to any one resource block;
and correspondingly adjusting the candidate priority factor based on a preset experience factor in an application scene corresponding to any resource block to obtain the priority factor.
Optionally, based on a preset correspondence between each resource block and each user terminal, the processing unit is configured to, in the resource block queue, respectively screen out the resource block corresponding to each user terminal according to a priority order, and when determining the user-level resource block queue corresponding to each user terminal,:
sequentially selecting one resource block from the resource block queue according to the priority order, and executing the following operations for each acquired resource block until the total number of the user terminals corresponding to each selected resource block is judged to reach a preset upper limit:
determining a user terminal corresponding to the currently acquired resource block based on a preset corresponding relation between each resource block and each user terminal;
and adding the resource block to a user-level resource block queue corresponding to the user terminal, and deleting the resource block from the corresponding position of the resource block queue.
Optionally, when determining the resource allocation factor corresponding to any user terminal based on the amount of data to be transmitted by any user terminal, the determining unit is configured to:
determining a resource block required by the data volume to be transmitted based on the data volume to be transmitted of any user terminal;
and determining a resource allocation factor corresponding to any user terminal based on the resource blocks required by any user terminal and the total amount of the resource blocks required by each user terminal.
Optionally, based on the resource allocation factor of any user terminal, when allocating resource blocks for the corresponding user terminal from the user-level resource block queue corresponding to any user terminal, the allocating unit is configured to:
determining the proportion of the resource blocks required by any user terminal in the resource blocks contained in the corresponding user level resource block queue according to the resource allocation factor of any user terminal;
and in the user-level resource block queue, allocating resource blocks which accord with the proportion to any user terminal according to the priority sequence.
Optionally, based on the resource allocation factor of any user terminal, after allocating a resource block to a corresponding user terminal from a user-level resource block queue corresponding to any user terminal, the method further includes an updating unit, where the updating unit is configured to:
and updating the average transmission rate of any user terminal in a preset time period.
In the embodiment of the invention, the user-level resource block queue corresponding to each user terminal is determined based on the corresponding relation between the resource blocks and the user terminals, and the resource blocks are distributed to the corresponding user terminals from the user-level resource block queue corresponding to each user terminal based on the resource distribution factors determined according to the data volume to be transmitted of each user terminal.
Drawings
FIG. 1 is a flowchart of a method for scheduling resources according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a base station side placing resource blocks into a resource block queue in the embodiment of the present invention;
fig. 3 is a schematic diagram of a process of acquiring a user-level resource block queue by a base station side in the embodiment of the present invention;
fig. 4 is a schematic structural diagram of an apparatus for resource scheduling according to an embodiment of the present invention.
Detailed Description
In order to solve the problem that fairness, channel quality and service quality of different user terminals cannot be considered in the prior art, in the embodiment of the invention, a resource scheduling method is redesigned.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The scheme of the present invention will be described in detail by way of specific examples, but the present invention is not limited to the following examples.
Specifically, before initiating a service, a user terminal submits a resource block requirement to a base station side governing a cell based on a service type, and the base station side divides corresponding resource blocks for the user terminal after receiving the resource block requirement of the user terminal.
In the embodiment of the present invention, a priority algorithm is provided, and compared with the existing priority algorithm, the priority algorithm not only can give consideration to fairness and service quality of a user terminal, but also has less traversal times and simpler operation, and specifically, a method for determining priority factors for resource blocks corresponding to different service types of different user terminals is as follows:
first, a qos factor corresponding to the resource block is determined, where the qos factor represents a ratio of the qos of the resource block to the total qosCalculating the service quality factor Y of the ith resource blocki
Figure GDA0002481081790000081
Wherein q isiThe service quality weighting factor corresponding to the ith resource block is represented, the size of the service quality weighting factor can be adjusted correspondingly according to the actual situation (such as the service emergency degree),
Figure GDA0002481081790000082
and the sum of the service quality weight factors corresponding to each resource block is represented, and I represents the total number of the resource blocks.
Of course, in the embodiment of the present invention, a Quality of Service (QoS) level parameter may also be simply used as a QoS factor to indicate a speed requirement and a delay requirement for different services.
Secondly, based on the preset corresponding relation between each resource block and each user terminal, determining the user terminal corresponding to the resource block, determining the current corresponding maximum scheduling rate of the user terminal, and the average transmission rate of the user terminal in a preset time period, and based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal, and the service quality factor corresponding to the resource block, determining the candidate priority factor of the resource block.
Preferably, in the embodiment of the present invention, the candidate priority factor X of the ith resource block can be calculated by the following formulai
Figure GDA0002481081790000091
Wherein, YiFor the quality of service factor, L, given abovej(T)Maximum scheduling rate, V, for the user terminal j corresponding to the ith resource blockj(t)And the average transmission rate of the user terminal j corresponding to the ith resource block in a preset time period.
Regarding the maximum scheduling rate, preferably, in the embodiment of the present invention, the maximum scheduling rate of the user terminal j corresponding to the ith resource block may be calculated by the following formulaLj(T)
Figure GDA0002481081790000092
Wherein Hi(T)The maximum data volume that can be transmitted for user terminal j in the preset scheduling period T is the maximum data volume H of user terminal ji(T)The current I of the user can be obtained by table look-up, specifically, determined based on the channel quality information and the signal-to-noise ratioMCSModulation and Coding Scheme (MCS) value, based on MCS value IMCSDetermination of ItbsTransport Block index numbering, finally based on ItbsDetermining NprbI.e. the number of resources required, and NbrpIs equivalent to Hi(T)And then determining Hi(T)
And finally, correspondingly adjusting the candidate priority factor based on an experience factor preset in an application scene corresponding to the resource block to obtain the priority factor, so that the situation that a certain user terminal always obtains a high priority sequence to occupy the resource block and other user terminals continuously obtain a low priority sequence and cannot obtain the resource block within a period of time can be corrected more sensitively by adopting the experience factor to correspondingly adjust the candidate priority factor.
Referring to fig. 1, in the embodiment of the present invention, a resource scheduling method flows as follows:
step 100: and the base station side determines each resource block to be scheduled.
Specifically, before the base station side schedules resource blocks for different services of different user terminals, the base station side determines each resource block to be scheduled.
Step 101: and the base station side determines the priority factor of each resource block based on a preset priority algorithm, determines the priority sequence according to the priority factor corresponding to each resource block and forms a resource block queue.
Specifically, the base station side determines priority factors of each resource block based on a preset priority algorithm, determines priority orders among the resource blocks based on the priority factors corresponding to the resource blocks, and forms a resource block queue with the resource blocks according to the priority orders.
For example, assume that the base station side determines that there are 3 resource blocks to be scheduled, and assumes that the priority factor of resource block 1 is determined to be 4, the priority factor of resource block 2 is 3, and the priority factor of resource block 3 is 5 through the calculation of the priority algorithm, then the priority of resource block 3 is the highest, the priority of resource block 1 is the second highest, and the priority of resource block 2 is the second highest, and the resource block 3, the resource block 1, and the resource block 2 are sequentially placed in a resource block queue, which is specifically shown in fig. 2.
In the embodiment of the present invention, the reason why the base station side needs to put the resource blocks to be scheduled into the queue according to the defined priority is that the base station side is limited by its own configuration or other reasons when performing resource scheduling for different user terminals at the same time, which results in a limited number of user terminals that can be scheduled, so that an equivalent priority is allocated to each resource block to be scheduled in advance according to a preset priority algorithm, and the resource scheduling is performed for the corresponding user terminals in sequence according to the priority.
Step 102: and the base station side sequentially selects one resource block from the resource block queue according to the priority order.
Specifically, after the base station side determines the resource block queue, one resource block is sequentially selected from the resource block queue according to the priority order.
For example, assume that there are 5 resource blocks in the current resource block queue, as shown in fig. 3, where resource block 3 has a higher priority than resource block 1 than resource block 2 has a higher priority than resource block 4 than resource block 5, and one resource block is selected at a time according to the priority order.
Step 103: and the base station side determines the user terminal corresponding to the currently acquired resource block based on the preset corresponding relation between each resource block and each user terminal.
Specifically, each resource block to be scheduled, which is determined by the base station side, is initiated by the user terminal to the base station side according to the service requirement of the user terminal, so that each resource block is known to specifically correspond to which user terminal, specifically, one resource block corresponds to one user terminal, and one user terminal corresponds to at least one resource block.
For example, also in the above example, assuming that resource block 3 and resource block 4 correspond to user terminal 1(UE1), resource block 1 corresponds to user terminal 2(UE2), and resource block 2 and resource block 5 correspond to user terminal 3(UE1), if the resource block extracted this time is resource block 2, it is determined that resource block 2 corresponds to user terminal 3.
Step 104: and the base station side adds the acquired resource blocks to a user-level resource block queue corresponding to the user terminal and deletes the resource blocks from the corresponding positions of the resource block queue.
Specifically, after determining the user terminal corresponding to the extracted resource block, the base station side puts the resource block into a user-level resource block queue corresponding to the corresponding user terminal, and empties the corresponding position of the resource block in the resource block queue, wherein if the resource block already exists in the user-level resource queue of the user terminal corresponding to the resource block, the newly-put resource block at the base station side can be cross-layer combined with the original existing resource block in the user-level resource block queue.
For example, still in the above example, if the resource block currently extracted by the base station side is resource block 1, and it is determined that resource block 1 corresponds to user terminal 2, the base station side dequeues resource block 1 from the resource block queue and enters the user-level resource block queue corresponding to user terminal 2, and accordingly, the position of resource block 2 in the resource block queue is cleared.
Step 105: and the base station side judges whether the total number of the user terminals corresponding to the selected resource blocks reaches a preset upper limit, if so, the step 106 is executed, and if not, the step 102 is executed.
Specifically, because the number of the user terminals simultaneously scheduled by the base station side is limited, an upper limit is preset, so that the base station side performs a judgment once when selecting one resource block, and judges whether the total number of the user terminals corresponding to each selected resource block reaches the preset upper limit, if so, step 106 is performed, otherwise, step 102 is performed.
For example, assuming that the preset upper limit is 2, still in the above example, the base station side extracts the resource block 3 for the first time, determines that the resource block 3 corresponds to the user terminal 1, and places the resource block 3 in the user-level resource block queue corresponding to the user terminal 1, because the total number of the user terminals corresponding to the selected resource block is 1 and does not reach the preset upper limit 2, step 102 is executed, that is, the base station side continues to extract the resource block 1, determines that the resource block 1 corresponds to the user terminal 2, and places the resource block 1 in the user-level resource block queue corresponding to the user terminal 2, because the total number of the user terminals corresponding to the selected resource block is 2, the preset upper limit 2 is reached, and step 106 is executed.
For another example, assuming that the preset upper limit is 3, the above example is still used for explanation, the process is similar to the previous preset upper limit being 2, and details are not repeated, since 5 resource blocks in the resource block queue only correspond to three user terminals, so that all the resource blocks in the resource block queue are selected, and finally, it is determined that the user-level resource queues of the user terminal 1, the user terminal 2, and the user terminal 3 can refer to fig. 3.
Step 106: and the base station side determines the resource allocation factor corresponding to each user terminal based on the selected data volume to be transmitted of each user terminal.
Specifically, the base station side may first determine a resource block (also referred to as a transmission block) required by the amount of data to be transmitted by each user terminal based on the selected amount of data to be transmitted by each user terminal, and then determine a resource allocation factor corresponding to each user terminal based on the resource block required by each user terminal and the total amount of the resource blocks required by each selected user terminal.
Preferably, in the embodiment of the present invention, the following formula is adopted to calculate the resource allocation factor W of the ue kk
Figure GDA0002481081790000121
Wherein r iskThe transport block size required for user terminal k,
Figure GDA0002481081790000122
is selected asThe total size of the transport blocks required by each ue, K, is the number of selected ues.
Step 107: and the base station side allocates resource blocks for the corresponding user terminals from the user-level resource block queues corresponding to the user terminals respectively based on the selected resource allocation factors of the user terminals.
Specifically, after determining the resource allocation factor of each selected user terminal, the base station side determines the proportion occupied by the resource blocks required by the user terminal in the resource blocks included in the corresponding user-level resource block queue according to the resource allocation factor of each user terminal, and then allocates the resource blocks corresponding to the proportion to the user terminals in the corresponding user-level resource block queue according to the priority order.
Preferably, in the embodiment of the present invention, the following formula is adopted to calculate the specific resource block n allocated to the user terminal kk
nk=N*WkWherein N is the total amount of schedulable resource blocks in the user-level resource block queue of the user terminal k, WkThe above-mentioned known resource allocation factor for user terminal k.
Step 108: and the base station side judges whether unprocessed resource blocks exist in the resource block queue or not, if so, the step 102 is executed, and otherwise, the resource scheduling is finished.
Specifically, because the number of the user terminals scheduled by the base station side is limited, the resource scheduling is performed for the user terminals in batches according to the priority order, and after the scheduling of each batch of resources is finished, the average transmission rate of each user terminal in a preset time period is updated.
Preferably, in the embodiment of the present invention, the following formula may be adopted to determine the average transmission rate of the ue k in the preset time period:
Figure GDA0002481081790000131
wherein, Vi(t)Indicating the average transmission rate, V, at the current timei(t-Δt)Representing the average transmission rate, P, of the last moment in timei(t)The current request rate of the user is represented, T represents a defined time window, and the formula shows that if the value of T is set to be large, the change of the average transmission rate of the user terminal tends to be smooth, so that the sensitivity of the calculated priority factor to the average transmission rate is low, otherwise, the sensitivity of the calculated priority factor to the average transmission rate is high.
Further, if there are resource blocks which are not scheduled in the resource block queue after the scheduling of the first batch of resources is finished, the resource blocks which are not scheduled are continuously obtained in sequence according to the priority until there are no resource blocks which are not scheduled in the resource block queue.
Based on the above embodiments, referring to fig. 4, in an embodiment of the present invention, a resource scheduling apparatus at least includes a processing unit 40, a determining unit 41 and an allocating unit 42, wherein,
a processing unit 40, configured to determine each resource block to be scheduled, and screen out, based on a preset correspondence between each resource block and each user terminal, a corresponding resource block for each user terminal, respectively, to obtain a user-level resource block queue corresponding to each user terminal;
a determining unit 41, configured to determine a resource allocation factor corresponding to each ue based on the amount of data to be transmitted by each ue;
and an allocating unit 42, configured to allocate resource blocks to corresponding user terminals from the user-level resource block queue corresponding to each user terminal, respectively, based on the resource allocation factor of each user terminal.
Optionally, based on the preset correspondence between each resource block and each user terminal, the processing unit 40 is configured to, when screening out a corresponding resource block for each user terminal and obtaining a user-level resource block queue corresponding to each user terminal:
determining the priority factor of each resource block based on a preset priority algorithm, and determining the priority sequence according to the priority factor corresponding to each resource block to form a resource block queue;
and respectively screening the resource blocks corresponding to each user terminal from the resource block queue according to the priority order based on the preset corresponding relation between each resource block and each user terminal, and determining the user-level resource block queue corresponding to each user terminal.
Optionally, when determining the priority factor of any resource block based on a preset priority algorithm, the processing unit 40 is configured to:
determining a service quality factor corresponding to any one resource block, wherein the service quality factor represents the ratio of the service quality of any one resource block in the total service quality;
determining a user terminal corresponding to any one resource block based on a preset corresponding relation between each resource block and each user terminal, and determining a maximum scheduling rate corresponding to the user terminal and an average transmission rate of the user terminal in a preset time period;
determining a candidate priority factor of any one resource block based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal and the service quality factor corresponding to any one resource block;
and correspondingly adjusting the candidate priority factor based on a preset experience factor in an application scene corresponding to any resource block to obtain the priority factor.
Optionally, based on a preset correspondence between each resource block and each user terminal, the processing unit 40 is configured to, in the resource block queue, respectively screen out the resource block corresponding to each user terminal according to a priority order, and when determining the user-level resource block queue corresponding to each user terminal,:
sequentially selecting one resource block from the resource block queue according to the priority order, and executing the following operations for each acquired resource block until the total number of the user terminals corresponding to each selected resource block is judged to reach a preset upper limit:
determining a user terminal corresponding to the currently acquired resource block based on a preset corresponding relation between each resource block and each user terminal;
and adding the resource block to a user-level resource block queue corresponding to the user terminal, and deleting the resource block from the corresponding position of the resource block queue.
Optionally, when determining the resource allocation factor corresponding to any user terminal based on the amount of data to be transmitted by any user terminal, the determining unit 41 is configured to:
determining a resource block required by the data volume to be transmitted based on the data volume to be transmitted of any user terminal;
and determining a resource allocation factor corresponding to any user terminal based on the resource blocks required by any user terminal and the total amount of the resource blocks required by each user terminal.
Optionally, based on the resource allocation factor of any user terminal, when allocating a resource block for a corresponding user terminal from the user-level resource block queue corresponding to any user terminal, the allocating unit 42 is configured to:
determining the proportion of the resource blocks required by any user terminal in the resource blocks contained in the corresponding user level resource block queue according to the resource allocation factor of any user terminal;
and in the user-level resource block queue, allocating resource blocks which accord with the proportion to any user terminal according to the priority sequence.
Optionally, based on the resource allocation factor of any user terminal, after allocating a resource block to a corresponding user terminal from a user-level resource block queue corresponding to any user terminal, the method further includes an updating unit 43, where the updating unit 43 is configured to:
and updating the average transmission rate of any user terminal in a preset time period.
To sum up, in the embodiments of the present invention, a resource block to be scheduled is determined, then a priority is determined for the resource block to be scheduled, and the resource blocks are sequentially selected according to a priority order to determine a user-level resource block queue of a user terminal, and each time a resource block is selected, it is determined whether the total number of the user terminals of the selected resource block exceeds a preset upper limit, if so, the resource block is allocated to each user terminal corresponding to the selected resource block in the respective corresponding user-level resource block queue based on a resource allocation factor determined according to the service quality and the data amount to be transmitted of the user terminal, so that the resource scheduling is performed for the user terminals based on the priority order, the operation flow is simplified, the scheduling duration is shortened, and because the resource allocation factor is determined based on the service quality of each user terminal, therefore, the resource blocks allocated by the base station side for each user terminal take respective service quality into consideration, and the cell throughput is ensured, and meanwhile, when the base station side allocates the resource blocks for each user terminal based on each resource allocation factor, the data volume to be transmitted of the user terminal is also taken into consideration, so that all the user terminals can allocate the resource blocks, the condition that no resource block is available for the user terminals can not occur, and the fairness is ensured.
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 an entirely hardware embodiment, an entirely 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, CD-ROM, 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.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made in the embodiments of the present invention without departing from the spirit or scope of the embodiments of the invention. Thus, if such modifications and variations of the embodiments of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to encompass such modifications and variations.

Claims (8)

1. A method for scheduling resources, comprising:
determining each resource block to be scheduled, determining priority factors of each resource block based on a preset priority algorithm, and determining a priority sequence according to the priority factors corresponding to each resource block to form a resource block queue; based on the preset corresponding relation between each resource block and each user terminal, respectively screening out the resource block corresponding to each user terminal from the resource block queue according to the priority order, and determining the user level resource block queue corresponding to each user terminal;
determining resource blocks required by the data volume to be transmitted of each user terminal based on the data volume to be transmitted of each user terminal; determining a resource allocation factor corresponding to each user terminal based on the resource block required by each user terminal and the total amount of the resource blocks required by each user terminal;
determining the proportion of the resource blocks required by each user terminal in the resource blocks contained in the corresponding user-level resource block queue according to the resource allocation factor of each user terminal; and allocating resource blocks which accord with the proportion to each user terminal according to the priority sequence in the corresponding user level resource block queue.
2. The method of claim 1, wherein determining the priority factor for any one resource block based on a preset priority algorithm comprises:
determining a service quality factor corresponding to any one resource block, wherein the service quality factor represents the ratio of the service quality of any one resource block in the total service quality;
determining a user terminal corresponding to any one resource block based on a preset corresponding relation between each resource block and each user terminal, and determining a maximum scheduling rate corresponding to the user terminal and an average transmission rate of the user terminal in a preset time period;
determining a candidate priority factor of any one resource block based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal and the service quality factor corresponding to any one resource block;
and correspondingly adjusting the candidate priority factor based on a preset experience factor in an application scene corresponding to any resource block to obtain the priority factor.
3. The method of claim 1, wherein based on a preset correspondence between each resource block and each user terminal, respectively screening out the resource block corresponding to each user terminal from the resource block queue according to a priority order, and determining the user-level resource block queue corresponding to each user terminal comprises:
sequentially selecting one resource block from the resource block queue according to the priority order, and executing the following operations for each acquired resource block until the total number of the user terminals corresponding to each selected resource block is judged to reach a preset upper limit:
determining a user terminal corresponding to the currently acquired resource block based on a preset corresponding relation between each resource block and each user terminal;
and adding the resource block to a user-level resource block queue corresponding to the user terminal, and deleting the resource block from the corresponding position of the resource block queue.
4. The method of any one of claims 1-3, wherein after allocating resource blocks for the respective user terminals from the user-level resource block queue corresponding to each user terminal based on the resource allocation factor of each user terminal, further comprising:
and updating the average transmission rate of each user terminal in a preset time period.
5. A resource scheduling apparatus, comprising:
the processing unit is used for determining each resource block to be scheduled, determining priority factors of each resource block based on a preset priority algorithm, and determining a priority sequence according to the priority factors corresponding to each resource block to form a resource block queue; based on the preset corresponding relation between each resource block and each user terminal, respectively screening out the resource block corresponding to each user terminal from the resource block queue according to the priority order, and determining the user level resource block queue corresponding to each user terminal;
a determining unit, configured to determine, based on the amount of data to be transmitted by each user terminal, a resource block required by the amount of data to be transmitted by each user terminal; determining a resource allocation factor corresponding to each user terminal based on the resource block required by each user terminal and the total amount of the resource blocks required by each user terminal;
the allocation unit is used for determining the proportion occupied by the resource block required by each user terminal in the resource blocks contained in the corresponding user-level resource block queue according to the resource allocation factor of each user terminal; and allocating resource blocks which accord with the proportion to each user terminal according to the priority sequence in the corresponding user level resource block queue.
6. The apparatus of claim 5, wherein when determining the priority factor for any one resource block based on a preset priority algorithm, the processing unit is configured to:
determining a service quality factor corresponding to any one resource block, wherein the service quality factor represents the ratio of the service quality of any one resource block in the total service quality;
determining a user terminal corresponding to any one resource block based on a preset corresponding relation between each resource block and each user terminal, and determining a maximum scheduling rate corresponding to the user terminal and an average transmission rate of the user terminal in a preset time period;
determining a candidate priority factor of any one resource block based on the maximum scheduling rate and the average transmission rate corresponding to the user terminal and the service quality factor corresponding to any one resource block;
and correspondingly adjusting the candidate priority factor based on a preset experience factor in an application scene corresponding to any resource block to obtain the priority factor.
7. The apparatus according to claim 5, wherein based on a preset correspondence between each resource block and each user terminal, the processing unit is configured to, respectively filter out the resource block corresponding to each user terminal from the resource block queue according to a priority order, and when determining the user-level resource block queue corresponding to each user terminal,:
sequentially selecting one resource block from the resource block queue according to the priority order, and executing the following operations for each acquired resource block until the total number of the user terminals corresponding to each selected resource block is judged to reach a preset upper limit:
determining a user terminal corresponding to the currently acquired resource block based on a preset corresponding relation between each resource block and each user terminal;
and adding the resource block to a user-level resource block queue corresponding to the user terminal, and deleting the resource block from the corresponding position of the resource block queue.
8. The apparatus according to any of claims 5-7, further comprising an updating unit, after allocating resource blocks for the respective user terminals from the user-level resource block queue corresponding to each user terminal based on the resource allocation factor of each user terminal, the updating unit being configured to:
and updating the average transmission rate of each user terminal in a preset time period.
CN201710128970.3A 2017-03-06 2017-03-06 Resource scheduling method and device Active CN108541067B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710128970.3A CN108541067B (en) 2017-03-06 2017-03-06 Resource scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710128970.3A CN108541067B (en) 2017-03-06 2017-03-06 Resource scheduling method and device

Publications (2)

Publication Number Publication Date
CN108541067A CN108541067A (en) 2018-09-14
CN108541067B true CN108541067B (en) 2021-02-26

Family

ID=63489430

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710128970.3A Active CN108541067B (en) 2017-03-06 2017-03-06 Resource scheduling method and device

Country Status (1)

Country Link
CN (1) CN108541067B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112399530A (en) * 2019-08-16 2021-02-23 中国移动通信有限公司研究院 Data transmission method, device, related equipment and storage medium
CN113382475B (en) * 2020-03-10 2022-12-30 大唐移动通信设备有限公司 Resource scheduling method and device based on MUMIMO

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103596285A (en) * 2012-08-16 2014-02-19 华为技术有限公司 Wireless resource scheduling method, wireless resource scheduler and system thereof
CN106301729A (en) * 2015-06-10 2017-01-04 电信科学技术研究院 Member carrier dispatching method under a kind of carrier aggregation scene and device

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101227695A (en) * 2007-01-16 2008-07-23 华为技术有限公司 Apparatus and method for distributing district communication resource
CN101291514B (en) * 2007-04-20 2012-01-11 中兴通讯股份有限公司 Method and device for resource distribution in wireless communication system
CN101384066B (en) * 2008-10-31 2012-02-22 华为技术有限公司 Resource distribution method, system and apparatus
CN104980934B (en) * 2015-07-08 2018-08-21 北京邮电大学 Multi-service resource dispatching method and device
CN105517179B (en) * 2015-12-25 2019-05-07 上海华为技术有限公司 A kind of method and scheduler of wireless resource scheduling

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103596285A (en) * 2012-08-16 2014-02-19 华为技术有限公司 Wireless resource scheduling method, wireless resource scheduler and system thereof
CN106301729A (en) * 2015-06-10 2017-01-04 电信科学技术研究院 Member carrier dispatching method under a kind of carrier aggregation scene and device

Also Published As

Publication number Publication date
CN108541067A (en) 2018-09-14

Similar Documents

Publication Publication Date Title
CN112637911B (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
MX2012010882A (en) Traffic scheduling method of guaranteed bit rate based on quality of service.
WO2015139651A1 (en) Method and apparatus for scheduling and allocating resources
US20160278111A1 (en) Service scheduling method and device
CN108541067B (en) Resource scheduling method and device
CN105722151B (en) Method and device for balancing control channel load
CN105846974B (en) Method and equipment for configuring control channel resources
CN111356244A (en) Resource allocation method and device
EP3243287A1 (en) Coordinated scheduling in a cellular network
KR20160089139A (en) Method and apparatus for scheduling terminal based on terminal level in mobile communication system
CN107155220B (en) Resource scheduling method and device
CN105873128B (en) A kind of LTE fairness dispatching method based on delay sensitive
CN108882383B (en) Modulation and coding scheme-based uplink residual resource allocation method and base station
EP2912798B1 (en) Queue splitting for parallel carrier aggregation scheduling
CN108243449B (en) User terminal grouping scheduling method and device
CN106060945A (en) LTE resource scheduling algorithm based on RB feedback
WO2018210129A1 (en) Resource allocation method and device in wireless mobile communication system
CN112543510A (en) Resource allocation method and device
CN108124313B (en) Resource allocation method and base station
CN105916205B (en) A kind of method and device for distributing resource
CN108337731B (en) Method and device for controlling format indication adjustment
CN108337732B (en) Uplink frequency selection scheduling method and device
CN111385900A (en) Uplink scheduling method and device
US20220124738A1 (en) Assigning a service quality to a wireless connection
CN111132242B (en) Terminal scheduling method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant