CN107155220B - Resource scheduling method and device - Google Patents
Resource scheduling method and device Download PDFInfo
- Publication number
- CN107155220B CN107155220B CN201610118458.6A CN201610118458A CN107155220B CN 107155220 B CN107155220 B CN 107155220B CN 201610118458 A CN201610118458 A CN 201610118458A CN 107155220 B CN107155220 B CN 107155220B
- Authority
- CN
- China
- Prior art keywords
- scheduled
- current
- subframe
- nth
- ues
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to the field of communication, in particular to a resource scheduling method and a resource scheduling device, the method comprises the steps of firstly obtaining the scheduling priority of each current UE to be scheduled according to a preset MAC scheduling algorithm, when the number of the current UE to be scheduled is determined to be larger than N, scheduling the first N-1 UEs in sequence according to the scheduling priority, and then determining the best UE as the current Nth UE to be scheduled from each other UE to be scheduled except the first N-1 UEs, wherein N represents the maximum number of the UEs which can be scheduled by a subframe, so that the processing performance of the MAC scheduling algorithm and eNodeB (eNodeB), namely the limit of the maximum number of the UEs which can be scheduled by a subframe, is combined, the maximum PRB resource utilization rate or the maximum PRB resource efficiency is realized, and the system throughput and the user perception are improved.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a resource scheduling method and apparatus.
Background
In a Long Term Evolution (LTE) wireless communication network, Physical Resource Block (PRB) resources are one of the most precious wireless resources, and a shared channel mechanism is adopted in an LTE system, so that in order to more effectively utilize and allocate shared resources, scheduling needs to be performed between different User Equipments (UEs) or between Data Radio Bearers (DRBs) of different UEs, and a main purpose of scheduling is to allocate and recover resources for packet Data of a User plane and a control plane. How to fully utilize limited PRB resources (e.g. 20M bandwidth corresponds to 100 PRB resources) directly determines the throughput of the system and how good the user perceives. However, in the prior art, due to the limitation of system processing capacity, that is, the number of scheduled users per subframe, and the influence of the size difference of data volume between users, it is difficult to fully utilize all PRB resources, which causes the waste of PRB resources and affects the system throughput and user perception. For example: the system bandwidth is 20M, the number of available PRB resources is 100, the number of schedulable users per subframe of the system is 3, the number of current online UEs is 10, after the UEs are queued according to the scheduling algorithm, the data volume of the first UE can occupy 10 PRBs, the data volume of the second UE can occupy 30 PRBs, and the data volume of the third UE can occupy 4 PRBs. The scheduling processing capability has been reached, but the PRBs used in the current subframe are only 10+30+ 4-44, and other 100-44-56 PRB resources are wasted.
The existing Media Access Control (MAC) scheduling algorithm has three kinds as follows:
1) maximum carrier-to-interference ratio algorithm: when each sub-frame selects the scheduled user, only the user with the largest carrier-to-interference ratio is selected, namely the user with the best channel condition occupies the resource to transmit data, if the channel condition of the user is poor, the users with the better channel condition are selected to be scheduled, and the system always serves the user with the best channel condition at the current moment.
2) The round robin algorithm: considering the fairness among users, the round robin algorithm circularly schedules each user, and the probability that each user occupies the service resource is the same.
3) Proportional fairness algorithm: the scheduling algorithm is a scheduling algorithm comprehensively considering system throughput and user fairness, adopts the concept of time sliding window as a parameter for measuring the scheduling algorithm, and assumes that the average transmission rate of a user k at a time t is RK(t), K1.., K, which requests DRC as the real-time rate of transmission from the base station (Evolved Node B, eNodeB)k(t), the eNodeB selects the serving UE at time t as
Therefore, in the above three scheduling algorithms, when scheduling is performed on each subframe, only the queuing method of the UE is considered, and the eNodeB processing performance, i.e. the limit of the number of UEs that can be scheduled in each subframe, is not considered, but actually each system is inevitably limited by the processing performance. If the three algorithms are used, the N UEs arranged in front are all small data services, so that it cannot be guaranteed that PRB resources can be fully utilized, which may cause waste of PRB resources of the system and affect user perception of system throughput and large data traffic.
Disclosure of Invention
The embodiment of the invention provides a resource scheduling method and a resource scheduling device, and aims to solve the problems that PRB resources cannot be fully utilized in the prior art, so that the PRB resources are wasted, and the system throughput and user perception are influenced.
The embodiment of the invention provides the following specific technical scheme:
a method of resource scheduling, comprising:
when UE scheduling is carried out on a subframe, calculating and obtaining the scheduling priority of each current UE to be scheduled according to a preset MAC scheduling algorithm;
judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs and a scheduling and Coding Scheme (MCS) value, and allocating the PRB resources to the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe.
In the embodiment of the invention, a preset MAC scheduling algorithm is used, and when the number of the current UE to be scheduled is larger than N, for the last scheduled UE of a subframe, the Nth UE to be scheduled determined according to the scheduling priority is not directly scheduled, but the best UE to be scheduled is selected from each UE to be scheduled except the first N-1 UEs to be scheduled as the current Nth UE to be scheduled, so that the resource utilization rate or the efficiency of a PRB (physical resource block) of a system is maximized, the system throughput and the user perception are improved, the scheduling priority of only one UE is changed at most for one subframe, and the Qos of the UE service is not influenced.
Preferably, the MAC scheduling algorithm at least includes any one of the following: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
Preferably, when determining whether the number of the UEs to be currently scheduled is greater than N, the method further includes:
and when the scheduling priority is not greater than the preset scheduling priority, sequentially scheduling each UE to be scheduled according to the scheduling priority of each UE to be scheduled.
Preferably, the determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value specifically includes:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and if so, further screening the UE to be scheduled, of which the required PRB resource is not less than the current residual PRB resource of the subframe, from each UE to be scheduled except the first N-1 UEs;
and respectively comparing the MCS values of the screened required PRB resources not less than the UE to be scheduled of the current residual PRB resource of the subframe, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
Preferably, further comprising:
and if the UE to be scheduled, the required PRB resource of which is not less than the current residual PRB resource of the subframe, is not screened from each UE to be scheduled except the first N-1 UEs, taking the UE to be scheduled, the PRB resource of which is the largest, required by each UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled.
Preferably, the determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value specifically includes:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and when the PRB resource required by the Nth UE to be scheduled is determined to be less than the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe;
respectively comparing the current remaining transmittable data volume of the subframe aiming at each UE to be scheduled with the data volume required to be transmitted by the corresponding UE to be scheduled to obtain the minimum value of the two data volumes;
and comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
Preferably, when determining whether the PRB resource required by the nth UE to be scheduled is not less than the current remaining PRB resource of the subframe, the method further includes:
and when the current UE to be scheduled is determined to be not smaller than the preset threshold, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled.
An apparatus of resource scheduling, comprising:
the calculating unit is used for calculating and obtaining the scheduling priority of each current UE to be scheduled according to a preset MAC scheduling algorithm when the UE is scheduled on one subframe;
and the processing unit is used for judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual PRB resource of the subframe, the PRB resource required by each UE to be scheduled except the first N-1 UEs and the MCS value, and allocating the PRB resource to the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe.
In the embodiment of the invention, a preset MAC scheduling algorithm is used, and when the number of the current UE to be scheduled is larger than N, for the last scheduled UE of a subframe, the Nth UE to be scheduled determined according to the scheduling priority is not directly scheduled, but the best UE to be scheduled is selected from each UE to be scheduled except the first N-1 UEs to be scheduled as the current Nth UE to be scheduled, so that the resource utilization rate or the efficiency of a PRB (physical resource block) of a system is maximized, the system throughput and the user perception are improved, the scheduling priority of only one UE is changed at most for one subframe, and the Qos of the UE service is not influenced.
Preferably, the MAC scheduling algorithm at least includes any one of the following: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
Preferably, when determining whether the number of the UEs to be currently scheduled is greater than N, the processing unit is further configured to:
and when the scheduling priority is not greater than the preset scheduling priority, sequentially scheduling each UE to be scheduled according to the scheduling priority of each UE to be scheduled.
Preferably, when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and if so, further screening the UE to be scheduled, of which the required PRB resource is not less than the current residual PRB resource of the subframe, from each UE to be scheduled except the first N-1 UEs;
and respectively comparing the MCS values of the screened required PRB resources not less than the UE to be scheduled of the current residual PRB resource of the subframe, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
Preferably, the processing unit is further configured to:
and if the UE to be scheduled, the required PRB resource of which is not less than the current residual PRB resource of the subframe, is not screened from each UE to be scheduled except the first N-1 UEs, taking the UE to be scheduled, the PRB resource of which is the largest, required by each UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled.
Preferably, when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and when the PRB resource required by the Nth UE to be scheduled is determined to be less than the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe;
respectively comparing the current remaining transmittable data volume of the subframe aiming at each UE to be scheduled with the data volume required to be transmitted by the corresponding UE to be scheduled to obtain the minimum value of the two data volumes;
and comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
Preferably, when determining whether the PRB resource required by the nth UE to be scheduled is not less than the currently remaining PRB resource of the subframe, the processing unit is further configured to:
and when the current UE to be scheduled is determined to be not smaller than the preset threshold, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled.
Drawings
FIG. 1 is a flowchart of a resource scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present invention.
Detailed Description
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.
In order to fully utilize PRB resources and improve system throughput and user perception, in the embodiment of the invention, the scheduling priority of each current UE to be scheduled is obtained according to a preset MAC scheduling algorithm, when the number of the current UE to be scheduled is determined to be larger than N, the first N-1 UEs are scheduled in sequence according to the scheduling priority, and then the best UE is selected from each other UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled, so that the utilization rate of the PRB resources is maximum or the efficiency of the PRB resources is maximum, wherein N represents the maximum number of UEs which can be scheduled in one subframe.
The present invention will be described in detail with reference to specific examples, but it is to be understood that the present invention is not limited to the examples.
Referring to fig. 1, in the embodiment of the present invention, a specific process of the resource scheduling method is as follows:
step 100: when UE scheduling is carried out on a subframe, the scheduling priority of each current UE to be scheduled is calculated and obtained according to a preset MAC scheduling algorithm.
Wherein, the MAC scheduling algorithm at least includes any one of the following: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
When step 100 is executed, a preset MAC scheduling algorithm is used, the MAC scheduling algorithm is not limited, and any existing MAC scheduling algorithm, such as the maximum carrier-to-interference ratio algorithm and the round-robin algorithm, may be used to calculate and obtain the scheduling priority of each current UE to be scheduled, that is, each current UE to be scheduled is queued, with the higher scheduling priority ranked in front and the lower scheduling priority ranked in the back.
In the embodiment of the invention, because the preset MAC scheduling algorithm is the existing algorithm, the specific process of calculating and obtaining the scheduling priority is not described in detail.
Step 110: judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs and the MCS value, and allocating the PRB resources to the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe.
The value of N here is related to the eNodeB system processing performance.
When step 110 is executed, the method specifically includes:
firstly, judging whether the number of the current UE to be scheduled is larger than N, and when the number is larger than N, scheduling the first N-1 UEs in sequence according to the scheduling priority of each UE to be scheduled.
That is, after step 100 is executed, each UE to be scheduled has a scheduling priority, and each scheduled UE is queued according to the scheduling priority, so that when scheduling is performed, the first N-1 UEs are sequentially scheduled according to the sequence of the scheduling priorities from high to low, that is, the queuing sequence, and PRB resources are respectively allocated to the UEs. For example, the number of UEs to be scheduled currently is M (assuming that M > N), the order after queuing is 1,2, …, N-1, N +1, …, M, and the 1 st, 2 th, … th, N-1 th UEs to be scheduled are sequentially scheduled in order.
Further, when the number of the current UE to be scheduled is determined not to be larger than N, each UE to be scheduled is sequentially scheduled directly according to the scheduling priority of each UE to be scheduled, and adjustment is not needed. This is because, if the number of the current UEs to be scheduled is not greater than the maximum number of UEs that can be scheduled in the subframe, all the UEs to be scheduled can be scheduled, that is, PRB resources can be allocated for data that needs to be transmitted by the UEs to be scheduled, and thus the problem of PRB resource waste does not exist.
Then, determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, which specifically includes:
a) and determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled. That is, the nth UE to be scheduled queued according to the scheduling priority is found first.
b) And judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, if so, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled, and otherwise, further determining the current Nth UE to be scheduled.
When the current remaining PRB resource of the subframe is used for scheduling the Nth UE to be scheduled, the PRB resource is not wasted.
And finally, scheduling the determined current Nth UE to be scheduled, and allocating PRB resources for the current Nth UE to be scheduled.
When determining the current nth UE to be scheduled, the method may specifically be divided into the following two manners:
the first mode is as follows:
firstly, the UE to be scheduled, the required PRB resource of which is not less than the current remaining PRB resource of the subframe, is screened from each UE to be scheduled except the first N-1 UEs.
Further, if the UE to be scheduled, whose required PRB resources are not less than the currently remaining PRB resources of the subframe, is not screened from each of the UEs to be scheduled other than the first N-1 UEs, the UE to be scheduled, whose required PRB resources are the largest for each of the UEs to be scheduled other than the first N-1 UEs, is taken as the current nth UE to be scheduled.
And then, respectively comparing the MCS values of the screened required PRB resources which are not less than the current residual PRB resources of the subframe of the UE to be scheduled, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
The first mode will be described in detail with reference to a specific embodiment:
1) if it is not
n＝[N,N+1.....M]Wherein
For the PRB resources required for the nth UE to be scheduled,
and if so, putting the corresponding UE to be scheduled into the set S, and screening out the UE to be scheduled, of which the required PRB resource is not less than the PRB resource currently remaining in the subframe, for example, S pieces of UE to be scheduled meeting the conditions in the set S.
2) If the set S is empty, no match is screened
And if the UE to be scheduled is in the condition, selecting the UE to be scheduled with the largest PRB resource as the current Nth UE to be scheduled, wherein the UEselectedIs composed of
Corresponding UE to be scheduled, i.e. UE to be scheduledselectedAnd replacing the Nth UE to be scheduled determined according to the scheduling priority as the current Nth UE to be scheduled.
3) If the set S is not empty, selecting the UE to be scheduled with the maximum MCS value in the set S as the current Nth UE to be scheduled, wherein the UEselectedIs composed of
Corresponding UE to be scheduled, i.e. UE to be scheduledselectedAnd replacing the Nth UE to be scheduled determined according to the scheduling priority as the current Nth UE to be scheduled.
Thus, the Nth scheduled UE is finally the UEselectedThe number of the scheduled UEs in one subframe is still N, but the PRB resources are maximally utilized by adopting the first mode, and the throughput of the system is improved.
The second mode is as follows:
firstly, according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled.
Then, the current remaining transmittable data volume of the subframe for each UE to be scheduled is compared with the corresponding data volume to be transmitted by the UE to be scheduled, so as to obtain the minimum value of the two.
And finally, comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
The second mode is described in detail below with reference to a specific embodiment:
1) computing
And will calculate each kiPut into the set K, the set K has M-N +1 elements in common.
Wherein the content of the first and second substances,
for the currently remaining transmittable data amount of the one sub-frame for each UE to be scheduled, which is calculated according to the MCS value of each UE to be scheduled and the currently remaining PRB resource of the one sub-frame,
the amount of data to be transmitted for each UE to be scheduled. For example, if the current remaining PRB resource of the one subframe is 10, the MCS value of the UE1 is 4, and the MCS value of the UE2 is 20, the current remaining transmittable data amount of the one subframe for the UE1 is 696, the current remaining transmittable data amount of the one subframe for the UE2 is 4008, that is, if the one subframe is to schedule the UE1, the current remaining transmittable data amount is 696, and if the one subframe is to schedule the UE2, the current remaining transmittable data amount is 4008.
2) Each K in the set KiComparing every two and taking the UE to be scheduled corresponding to the maximum value as the current Nth UE to be scheduled, namely the UEselectedIs composed of
And the corresponding UE to be scheduled.
Likewise, the last Nth scheduled UE is a UEselectedThe number of the scheduled UEs in the subframe is still N, but the second method maximizes the efficiency of PRB resources and improves the throughput of the system.
Thus, in the embodiment of the present invention, step 100 and step 200 are executed to perform resource scheduling, which not only uses the MAC scheduling algorithm to schedule the UE to be scheduled, but also considers the processing performance of the eNodeB, that is, the limit of the maximum number of UEs that can be scheduled in one subframe, and selects the best UE to be scheduled as the last scheduled UE in one subframe, so that the PRB resource utilization rate or efficiency is maximized, the system throughput and the user perception are improved, and the scheduling priority of only one UE is changed at most for one subframe, which does not affect the Quality of Service (Qos) of the UE Service.
Based on the foregoing embodiments, referring to fig. 2, in an embodiment of the present invention, an apparatus for resource scheduling specifically includes:
a calculating unit 20, configured to calculate and obtain a scheduling priority of each current UE to be scheduled according to a preset MAC scheduling algorithm when the UE is scheduled on one subframe;
and the processing unit 21 is configured to determine whether the number of the current UE to be scheduled is greater than N, and when it is determined that the number of the current UE to be scheduled is greater than N, sequentially schedule the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is completed, determine the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources and the MCS value required by each UE to be scheduled except the first N-1 UEs, and allocate PRB resources to the current nth UE to be scheduled, where N represents the maximum number of UEs that can be scheduled by the subframe.
Preferably, the MAC scheduling algorithm at least includes any one of the following: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
Preferably, when determining whether the number of UEs to be currently scheduled is greater than N, the processing unit 21 is further configured to:
and when the scheduling priority is not greater than the preset scheduling priority, sequentially scheduling each UE to be scheduled according to the scheduling priority of each UE to be scheduled.
Preferably, when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit 21 is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and if so, further screening the UE to be scheduled, of which the required PRB resource is not less than the current residual PRB resource of the subframe, from each UE to be scheduled except the first N-1 UEs;
and respectively comparing the MCS values of the screened required PRB resources not less than the UE to be scheduled of the current residual PRB resource of the subframe, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
Preferably, the processing unit 21 is further configured to:
and if the UE to be scheduled, the required PRB resource of which is not less than the current residual PRB resource of the subframe, is not screened from each UE to be scheduled except the first N-1 UEs, taking the UE to be scheduled, the PRB resource of which is the largest, required by each UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled.
Preferably, when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit 21 is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and when the PRB resource required by the Nth UE to be scheduled is determined to be less than the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe;
respectively comparing the current remaining transmittable data volume of the subframe aiming at each UE to be scheduled with the data volume required to be transmitted by the corresponding UE to be scheduled to obtain the minimum value of the two data volumes;
and comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
Preferably, when determining whether the PRB resource required by the nth UE to be scheduled is not less than the currently remaining PRB resource of the subframe, the processing unit 21 is further configured to:
and when the current UE to be scheduled is determined to be not smaller than the preset threshold, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled.
In summary, in the embodiment of the present invention, when UE scheduling is performed on one subframe, a scheduling priority of each current UE to be scheduled is calculated and obtained according to a preset MAC scheduling algorithm; judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual PRB resource of the subframe, the PRB resource required by each UE to be scheduled except the first N-1 UEs and the MCS value, and distributing the PRB resource for the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe, so that a preset MAC scheduling algorithm is used, and when the number of the current UE to be scheduled is larger than N, the last scheduled UE of the subframe is not directly scheduled with the Nth UE to be scheduled determined according to the scheduling priority, but the best UE to be scheduled is selected from each UE to be scheduled except the first N-1 UEs And scheduling the UE as the current Nth UE to be scheduled, so that the resource utilization rate or efficiency of a system PRB is maximized, the system throughput and user perception are improved, the scheduling priority of at most one UE is changed for one subframe, and the Qos of the UE service is not influenced.
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 (14)
1. A method for resource scheduling, comprising:
when User Equipment (UE) scheduling is carried out on a subframe, calculating and obtaining the scheduling priority of each current UE to be scheduled according to a preset Media Access Control (MAC) scheduling algorithm;
judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual Physical Resource Block (PRB) resource of the subframe, the PRB resource required by each UE to be scheduled except the first N-1 UEs and the scheduling coding scheme (MCS) value, and allocating the PRB resource to the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe.
2. The method of claim 1, wherein the MAC scheduling algorithm comprises at least any one of: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
3. The method of claim 2, wherein when determining whether the number of UEs currently to be scheduled is greater than N, further comprising:
and when the UE is determined not to be larger than the preset scheduling priority, sequentially scheduling each UE to be scheduled according to the scheduling priority of each UE to be scheduled.
4. The method of claim 1, wherein determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value specifically includes:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and if so, further screening the UE to be scheduled, of which the required PRB resource is not less than the current residual PRB resource of the subframe, from each UE to be scheduled except the first N-1 UEs;
and respectively comparing the MCS values of the screened required PRB resources not less than the UE to be scheduled of the current residual PRB resources of the subframe, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
5. The method of claim 4, further comprising:
and if the UE to be scheduled, the required PRB resource of which is not less than the current residual PRB resource of the subframe, is not screened from each UE to be scheduled except the first N-1 UEs, taking the UE to be scheduled, the PRB resource of which is the largest, required by each UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled.
6. The method of claim 1, wherein determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value specifically includes:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and when the PRB resource required by the Nth UE to be scheduled is determined to be less than the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled except the first N-1 UEs according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe;
respectively comparing the current remaining transmittable data quantity of the subframe aiming at each UE to be scheduled except the first N-1 UEs with the corresponding data quantity to be transmitted by the UE to be scheduled to obtain the minimum value of the two data quantities;
and comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
7. The method according to claim 4 or 6, wherein when determining whether the PRB resource required by the nth UE to be scheduled is not less than the currently remaining PRB resource of the subframe, the method further comprises:
and when the current UE to be scheduled is determined to be not smaller than the preset threshold, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled.
8. An apparatus for resource scheduling, comprising:
the calculating unit is used for calculating and obtaining the scheduling priority of each current UE to be scheduled according to a preset Media Access Control (MAC) scheduling algorithm when the UE is scheduled on one subframe;
and the processing unit is used for judging whether the number of the current UE to be scheduled is larger than N, when the number is larger than N, sequentially scheduling the first N-1 UEs according to the scheduling priority of each UE to be scheduled, and after the scheduling of the first N-1 UEs is finished, further determining the current Nth UE to be scheduled according to the current residual Physical Resource Block (PRB) resource of the subframe, the PRB resource required by each UE to be scheduled except the first N-1 UEs and a scheduling coding scheme (MCS) value, and allocating the PRB resource to the current Nth UE to be scheduled, wherein N represents the maximum number of the UE which can be scheduled by the subframe.
9. The apparatus of claim 8, wherein the MAC scheduling algorithm comprises at least any one of: a maximum carrier-to-interference ratio algorithm, a polling algorithm and a proportional fairness algorithm.
10. The apparatus of claim 9, wherein when determining whether the number of UEs currently to be scheduled is greater than N, the processing unit is further configured to:
and when the UE is determined not to be larger than the preset scheduling priority, sequentially scheduling each UE to be scheduled according to the scheduling priority of each UE to be scheduled.
11. The apparatus of claim 8, wherein when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and if so, further screening the UE to be scheduled, of which the required PRB resource is not less than the current residual PRB resource of the subframe, from each UE to be scheduled except the first N-1 UEs;
and respectively comparing the MCS values of the screened required PRB resources not less than the UE to be scheduled of the current residual PRB resources of the subframe, and taking the UE to be scheduled with the maximum MCS value as the current Nth UE to be scheduled.
12. The apparatus as recited in claim 11, said processing unit to further:
and if the UE to be scheduled, the required PRB resource of which is not less than the current residual PRB resource of the subframe, is not screened from each UE to be scheduled except the first N-1 UEs, taking the UE to be scheduled, the PRB resource of which is the largest, required by each UE to be scheduled except the first N-1 UEs as the current Nth UE to be scheduled.
13. The apparatus of claim 8, wherein when determining the current nth UE to be scheduled according to the currently remaining PRB resources of the subframe, the PRB resources required by each UE to be scheduled except the first N-1 UEs, and the MCS value, the processing unit is specifically configured to:
determining the Nth UE to be scheduled according to the scheduling priority of each current UE to be scheduled;
judging whether the PRB resource required by the Nth UE to be scheduled is not less than the current residual PRB resource of the subframe, and when the PRB resource required by the Nth UE to be scheduled is determined to be less than the current residual PRB resource of the subframe, respectively calculating and obtaining the current residual transmittable data volume of the subframe aiming at each UE to be scheduled except the first N-1 UEs according to the MCS value of each UE to be scheduled except the first N-1 UEs and the current residual PRB resource of the subframe;
respectively comparing the current remaining transmittable data quantity of the subframe aiming at each UE to be scheduled except the first N-1 UEs with the corresponding data quantity to be transmitted by the UE to be scheduled to obtain the minimum value of the two data quantities;
and comparing every two obtained minimum values, and taking the UE to be scheduled corresponding to the maximum value in the minimum values as the current Nth UE to be scheduled.
14. The apparatus according to claim 11 or 13, wherein when determining whether the PRB resource required by the nth UE to be scheduled is not less than the currently remaining PRB resource of the subframe, the processing unit is further configured to:
and when the current UE to be scheduled is determined to be not smaller than the preset threshold, directly taking the Nth UE to be scheduled as the current Nth UE to be scheduled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610118458.6A CN107155220B (en) | 2016-03-02 | 2016-03-02 | Resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610118458.6A CN107155220B (en) | 2016-03-02 | 2016-03-02 | Resource scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107155220A CN107155220A (en) | 2017-09-12 |
| CN107155220B true CN107155220B (en) | 2020-05-05 |
Family
ID=59791296
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610118458.6A Active CN107155220B (en) | 2016-03-02 | 2016-03-02 | Resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107155220B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769995B (en) * | 2018-05-29 | 2023-04-18 | 武汉虹信科技发展有限责任公司 | Service scheduling processing method and device |
| CN111385899B (en) * | 2018-12-28 | 2023-03-14 | 中兴通讯股份有限公司 | Resource scheduling method and device, network equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103096485A (en) * | 2011-11-08 | 2013-05-08 | 普天信息技术研究院有限公司 | Method of multi-user multi-input multi-output frequency selection scheduling of local thermodynamic equilibrium (LTE) system |
| CN103415081A (en) * | 2013-08-28 | 2013-11-27 | 北京北方烽火科技有限公司 | Resource dispatching method and base station |
| CN103987120A (en) * | 2014-06-06 | 2014-08-13 | 哈尔滨工业大学 | Downlink radio resource scheduling method of cluster multimedia business under LTE (long term evolution) public network |
| CN104602355A (en) * | 2015-02-13 | 2015-05-06 | 哈尔滨工业大学 | Method for scheduling mixed services in LTE (long term evolution) system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9247561B2 (en) * | 2012-09-20 | 2016-01-26 | Qualcomm Incorporated | Apparatus and method for prioritizing non-scheduled data in a wireless communications network |
-
2016
- 2016-03-02 CN CN201610118458.6A patent/CN107155220B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103096485A (en) * | 2011-11-08 | 2013-05-08 | 普天信息技术研究院有限公司 | Method of multi-user multi-input multi-output frequency selection scheduling of local thermodynamic equilibrium (LTE) system |
| CN103415081A (en) * | 2013-08-28 | 2013-11-27 | 北京北方烽火科技有限公司 | Resource dispatching method and base station |
| CN103987120A (en) * | 2014-06-06 | 2014-08-13 | 哈尔滨工业大学 | Downlink radio resource scheduling method of cluster multimedia business under LTE (long term evolution) public network |
| CN104602355A (en) * | 2015-02-13 | 2015-05-06 | 哈尔滨工业大学 | Method for scheduling mixed services in LTE (long term evolution) system |
Non-Patent Citations (1)
| Title |
|---|
| TD-LTE系统的无线资源调度算法研究;李韧;《北京邮电大学硕士研究生学位论文》;20100112;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107155220A (en) | 2017-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2830380B1 (en) | Uplink transmission scheduling of non-Guaranteed Bit Rate bearers based on quality class indicator | |
| US20140282769A1 (en) | Systems and Methods for Quality of Experience Aware Joint Scheduling of Buffered Video on Demand and Best Effort Flows | |
| US20120026986A1 (en) | Downlink frequency selective scheduling based on channel quality feedback | |
| CN107872892B (en) | Wireless resource allocation method and device | |
| EP2749122B1 (en) | Method and system for wireless communication baseband processing | |
| CN104981017B (en) | Uplink resource allocating method and base station | |
| US20160278111A1 (en) | Service scheduling method and device | |
| CN112543508A (en) | Wireless resource allocation method and network architecture for 5G network slice | |
| CN112637911A (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| CN105846974B (en) | Method and equipment for configuring control channel resources | |
| CN108243506B (en) | L TE system service scheduling method and device | |
| CN104066197B (en) | A kind of real time scheduling of traffic method of low packet loss ratio in TD LTE | |
| CN107155220B (en) | Resource scheduling method and device | |
| WO2013026403A1 (en) | Resource allocation method and device | |
| KR102363164B1 (en) | Method and apparatus for scheduling terminal based on terminal level in mobile communication system | |
| CN107147475B (en) | Modulation coding mode adjusting method and base station | |
| CN112543510A (en) | Resource allocation method and device | |
| CN108882383B (en) | Modulation and coding scheme-based uplink residual resource allocation method and base station | |
| CN108541067B (en) | Resource scheduling method and device | |
| EP2912798B1 (en) | Queue splitting for parallel carrier aggregation scheduling | |
| WO2018210129A1 (en) | Resource allocation method and device in wireless mobile communication system | |
| CN111385900B (en) | Uplink scheduling method and device | |
| US9072079B2 (en) | Method for controlling channel access, access point and user equipment | |
| CN109121165B (en) | Load balancing processing method and device based on uplink big packet service | |
| CN106550471B (en) | Parameter adjusting 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 |