CN101860916A - Resource scheduling method and device - Google Patents
Resource scheduling method and deviceDownload PDFInfo
- Publication number
- CN101860916A CN101860916ACN 200910081910CN200910081910ACN101860916ACN 101860916 ACN101860916 ACN 101860916ACN 200910081910CN200910081910CN 200910081910CN 200910081910 ACN200910081910 ACN 200910081910ACN 101860916 ACN101860916 ACN 101860916A
- Authority
- CN
- China
- Prior art keywords
- algorithm
- scheduled
- user
- current scheduling
- group
- 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.)
- Granted
Links
- 238000000034methodMethods0.000titleclaimsabstractdescription33
- 238000010586diagramMethods0.000description10
- 238000004088simulationMethods0.000description10
- 101000654471Mus musculus NAD-dependent protein deacetylase sirtuin-1Proteins0.000description6
- 238000005516engineering processMethods0.000description5
- 101150026756sir1 geneProteins0.000description5
- 238000005192partitionMethods0.000description4
- 238000007726management methodMethods0.000description3
- 238000010295mobile communicationMethods0.000description3
- 238000012986modificationMethods0.000description3
- 230000004048modificationEffects0.000description3
- 238000013468resource allocationMethods0.000description3
- 241001522296Erithacus rubeculaSpecies0.000description2
- 230000003044adaptive effectEffects0.000description1
- 238000004891communicationMethods0.000description1
- 230000007423decreaseEffects0.000description1
- 238000005562fadingMethods0.000description1
- 230000011664signalingEffects0.000description1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a resource scheduling method and apparatus.
Background
With the development of mobile communication technology, the supported service types include low and high speed data and image services, in addition to the conventional voice service. Objectives of mobile communication networks: firstly, the service quality requirements of various services are ensured, secondly, the fairness among users is ensured, and thirdly, the resource utilization rate of the system is maximized. These are all realized by means of radio resource management, and the radio packet scheduling algorithm for resource management of data services is an important component of radio resource management, so that the radio packet scheduling algorithm will become a key technology for ensuring user service quality by affecting system performance.
In the third generation mobile communications (3GPP) R4 and previous versions of the protocol, the functions of packet scheduling are mainly performed by the Radio Network Controller (RNC). The main characteristics are as follows: when resources are adjusted between different users or service flows, notification is often performed through higher layer signaling. The process is relatively long, and the time-varying characteristic of the channel condition of the user is not considered, so that the user with good channel condition can not obtain higher service rate, and the exertion of the system and the terminal capability is limited.
The 3GPP R5 protocol introduces a High Speed Downlink Packet Access (HSDPA) technology for improving the system throughput and peak rate in the downlink direction. HSDPA mainly employs three technologies: adaptive Modulation and Coding (AMC), hybrid automatic repeat request (HARQ), and Fast Cell Selection (FCS) techniques. Currently, three basic scheduling algorithms that are of more interest are: a polling algorithm, a Maximum (MAX) carrier/interference (C/I) algorithm, a Proportional Fair (PF) algorithm.
And (3) a polling algorithm: the algorithm allocates the same power and occupied time to different user terminals (UEs), i.e. all users get the same amount of resources. Fig. 1 shows a resource allocation manner of the polling algorithm.
Maximum C/I algorithm: the algorithm takes full account of the channel condition differences among the user terminals and gives the user terminal with the best channel condition the highest priority. Figure 2 shows a MAX C/I algorithm resource allocation scheme. In fig. 2, assuming that the channel condition of UE1 is always better than UE2 during service, the system always schedules UE1 when the channel condition of UE1 is always better than UE 2. The system schedules UE2 only when all of the data in the buffer of UE1 with better channel conditions has been transmitted.
PF algorithm: the algorithm is to take the channel quality of the user and the throughput obtained in the past period of time into consideration when scheduling. Figure 3 shows a PF algorithm resource allocation scheme. As can be seen from fig. 3, although the channel condition of UE1 is better than that of UE2, the average throughput of UE2 decreases over time resulting in an increased priority, which can still be scheduled. The PF algorithm comprehensively considers the channel condition of the user and the service fairness among the users, and can obtain a certain compromise between the system throughput and the service fairness, so that the PF algorithm is currently more adopted.
The disadvantage of the conventional scheduling algorithm is that the throughput of the system may be low because the algorithm does not take into account the specific conditions of the radio channel between different users. The max C/I algorithm, although improving the overall throughput of the system, does not guarantee fairness among users. The PF algorithm makes a certain compromise between system throughput and service fairness, and the system throughput is superior to the round-robin algorithm, but in practice, because the user channels experience different fading characteristics, the proportional fairness algorithm cannot give fair distribution proportional to the average rate, and thus QoS of some users is reduced.
Disclosure of Invention
The embodiment of the invention provides a resource scheduling method and device, which are used for solving the problem that the prior art cannot give consideration to both system throughput and fairness.
The resource scheduling method provided by the embodiment of the invention comprises the following steps:
when at least two user terminals to be scheduled exist currently, selecting a current scheduling algorithm according to user channel condition information of the user terminals to be scheduled;
and scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm.
The resource scheduling device provided by the embodiment of the invention comprises:
the system comprises an algorithm selection unit, a scheduling unit and a scheduling unit, wherein the algorithm selection unit is used for selecting a current scheduling algorithm according to user channel condition information of at least two user terminals to be scheduled when the user terminals to be scheduled currently exist;
and the scheduling unit is used for scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm.
The method comprises the steps that when at least two user terminals to be scheduled exist currently, a current scheduling algorithm is selected according to user channel condition information of the user terminals to be scheduled; and scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm. Therefore, in the embodiment of the present invention, different scheduling algorithms are selected for different current user channel conditions, so that the priority of the user terminal may change with different current user channel conditions, and this scheme may give consideration to fairness while improving system throughput.
Drawings
FIG. 1 is a schematic diagram of an allocation scheme for a polling algorithm;
FIG. 2 is a schematic diagram of a maximum C/I algorithm allocation scheme;
FIG. 3 is a schematic diagram of a PF algorithm assignment scheme;
FIG. 4 is a flowchart illustrating a resource scheduling method according to an embodiment of the present invention;
fig. 5 is a flowchart illustrating a resource scheduling method based on region partition according to an embodiment of the present invention;
FIG. 6 is a schematic structural diagram of an apparatus according to an embodiment of the present invention;
fig. 7 is a schematic diagram illustrating comparison simulation of average throughput of a cell after the resource scheduling method based on region division and three existing scheduling algorithms according to an embodiment of the present invention are utilized;
fig. 8 is a simulation diagram showing comparison of the received data amount of the user terminal after the resource scheduling method based on the region division according to the embodiment of the present invention and the existing three scheduling algorithms;
fig. 9a to 9b are simulation diagrams illustrating that a user terminal successfully receives data amount by using the resource scheduling method based on region partition according to the embodiment of the present invention and three scheduling algorithms in the prior art, where 9a is a simulation result of a polling algorithm, 9b is a simulation result of a maximum C/I algorithm, 9C is a simulation result of a PF algorithm, and 9d is simulation results of three scheduling algorithms based on region partition according to the embodiments of the present invention.
Detailed Description
The method comprises the steps that when at least two user terminals to be scheduled exist currently, a current scheduling algorithm is selected according to user channel condition information of the user terminals to be scheduled; and then scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm. The user channel condition information may be information characterizing or reflecting the user channel quality, such as a signal-to-noise ratio, a user rate, or the like.
Referring to fig. 4, a method of an embodiment of the present invention includes the steps of:
step 401: and when at least two user terminals to be scheduled exist currently, selecting a current scheduling algorithm according to the user channel condition information of the user terminals to be scheduled.
Step 402: and scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm.
In the embodiment of the invention, when the quality difference of user channels is large, a maximum C/I algorithm can be adopted as a current scheduling algorithm; when the user channel quality is good, a round robin algorithm can be adopted as the current scheduling algorithm; when the user channel quality is poor, the PF algorithm can be adopted as the current scheduling algorithm; when the distribution is uniform, the maximum C/I algorithm, the PF algorithm and the polling algorithm can be adopted as the current scheduling algorithm in sequence by utilizing the large-area polling strategy.
The following describes an implementation manner of selecting a current scheduling algorithm, taking the user channel condition information as the signal-to-noise ratio as an example:
if the snr of each ue to be scheduled is smaller than the set first snr threshold, that is, the channel quality of the current user is better, the polling algorithm may be selected as the current scheduling algorithm.
If the signal-to-noise ratio of each user terminal to be scheduled is greater than the set second signal-to-noise ratio threshold, that is, the channel quality of the current user is poor, the PF algorithm may be selected as the current scheduling algorithm.
If the signal-to-noise ratio of each user terminal to be scheduled is uniformly distributed, that is, the signal-to-noise ratios of the user terminals to be scheduled are distributed in a set interval, the maximum C/I algorithm, the PF algorithm and the polling algorithm can be sequentially adopted as the current scheduling algorithm by using the large-area polling strategy.
The signal-to-noise ratio of a part of user terminals to be scheduled is greater than a set third signal-to-noise ratio threshold, the signal-to-noise ratios of the rest of user terminals to be scheduled are less than a set fourth signal-to-noise ratio threshold, the fourth signal-to-noise ratio threshold is greater than the third signal-to-noise ratio threshold, the signal-to-noise ratios of the user terminals to be scheduled are distributed unevenly, the quality difference of user channels is large, and then a maximum C/I algorithm can be adopted as the current scheduling algorithm.
Of course, in the embodiment of the present invention, the sizes of the first signal-to-noise ratio threshold, the second signal-to-noise ratio threshold, the third signal-to-noise ratio threshold, and the fourth signal-to-noise ratio threshold are not specifically limited, and may be selected according to an actual simulation result. Such as: in the actual operation process, one signal-to-noise ratio threshold value may be used for dividing the region, or a plurality of signal-to-noise ratio threshold values may be used for dividing the region, and when a plurality of signal-to-noise ratio threshold values are used, the first signal-to-noise ratio threshold value may be greater than the second signal-to-noise ratio threshold value, may also be smaller than the second signal-to-noise ratio threshold value, or may also be equal to the second signal.
The following takes two snr thresholds and the second snr threshold is greater than the first snr threshold as an example to specifically describe the specific implementation process of the present invention.
In the embodiment of the invention, two signal-to-noise ratio threshold values SIR1 and SIR2 are adopted, SIR1 is a first signal-to-noise ratio threshold value, SIR2 is a second signal-to-noise ratio threshold value, SIRUE is the signal-to-noise ratio of a user terminal, the signal-to-noise ratio is divided into three regions, SIRUE < SIR1 is a region,SIRUE 1 < SIRUE < SIR2 is a region, SIRUE > SIR2 is a region, the user terminal is divided into three groups according to the signal-to-noise ratio, the first region corresponds to a first group, the second region corresponds to a second group.
| A region | SIRUE＜SIR1 |
| Two zones | SIR1＜SIRUE＜SIR2 |
| Three zones | SIRUE＞SIR2 |
TABLE 1
Therefore, in this embodiment, selecting the current scheduling algorithm according to the user channel condition information of the user terminal to be scheduled may be implemented as follows: determining the grouping condition of the user terminal to be scheduled according to the signal-to-noise ratio; and determining a current scheduling algorithm according to the grouping condition of the user terminal to be scheduled.
Such as: if the user channel condition information is the signal-to-noise ratio, when the user terminals in a base station are divided into three groups according to the signal-to-noise ratio in advance, the three groups are respectively a first group, a second group and a third group, the signal-to-noise ratio of the first group is smaller than that of the second group, and the signal-to-noise ratio of the second group is smaller than that of the third group.
Then, the specific process of determining the current scheduling algorithm is as follows:
if the user terminal to be scheduled currently belongs to the first group and the third group respectively, selecting a maximum C/I algorithm as a current scheduling algorithm;
if the user terminals to be scheduled currently belong to the second group and the third group respectively, selecting a PF algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled currently belong to the first group and the second group respectively, selecting a polling algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled belong to the same group, selecting a PF algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled currently belong to the first group, the second group and the third group respectively, the maximum C/I algorithm, the PF algorithm and the polling algorithm are adopted as the current scheduling algorithm in sequence by utilizing the large-area polling strategy.
The following describes in detail a specific process for implementing resource scheduling in this embodiment, with reference to table 1 and fig. 5:
step 501: and initializing parameter values of a resource set, channel conditions, service types and the like which can be scheduled in the current time slot.
Step 502: and dividing the user terminals in the base station into a plurality of groups according to the signal-to-noise ratio of the user terminals, and entering a preset queue to wait for scheduling.
Step 503: when the current time slot is idle and a plurality of users in the queue wait for scheduling at the same time, selecting a scheduling algorithm according to the following mode:
(1) when the signal-to-noise ratios of the user terminals are distributed in a first area and a third area, namely the user terminals waiting for scheduling belong to a first group and a third group, the channel quality difference between the user terminals is large, the modulation coding mode difference is large, so that the instantaneous rate difference between the user terminals is large, and therefore, in order to ensure the system throughput, a maximum C/I algorithm is adopted as the current scheduling algorithm;
(2) when the signal-to-noise ratio of the user terminals is distributed in a second area and a third area, namely the user terminals waiting for scheduling belong to a second group and a third group, the user channel quality is poor, but the difference of the user channel quality is small, the difference of modulation and coding modes between users is small, and the difference of instantaneous rates between the users is small, so that a PF algorithm is adopted as the current scheduling algorithm, and the aim of balancing the system throughput and the fairness is fulfilled;
(3) the signal-to-noise ratio of the user terminal is distributed in a first zone and a second zone, namely the user terminal waiting for scheduling belongs to a first group and a second group, the user channel quality is better, but the rate difference between the user terminals is smaller, and the information quantity transmitted by the adopted modulation coding mode is larger, so that the polling algorithm is adopted as the current scheduling algorithm, and the fairness of the user is ensured;
(4) when the signal-to-noise ratios of the user terminals are distributed in the same area, namely the user terminals to be scheduled belong to the same group, the PF algorithm is adopted as the current scheduling algorithm, and the aim is to balance the throughput and fairness of the system;
(5) the signal-to-noise ratios of the user terminals are distributed in three areas, namely, the user terminals to be scheduled belong to a first group, a second group and a third group, so that a large-area polling strategy is adopted to sequentially adopt a maximum C/I algorithm, a PF algorithm and a polling algorithm as a current scheduling algorithm.
Step 504: and when the user terminal to be scheduled in the queue is scheduled according to the scheduling algorithm selected in thestep 503, determining the scheduling priority among the services according to the services applied by the user terminal.
Step 505: according to the service quality (QoS) request of the user terminal, allocating resources for the high priority service of the user terminal, and when the current system resources are left, allocating the resources to other services applied by the user terminal or scheduling the user terminal with the next priority.
Of course, in this embodiment, the ues in a base station may be grouped again according to the user channel status information according to the set time period. The priority of the wireless resource used by the user is changed along with the change of the channel condition of the user, the belonged grouping possibly changes, and then a corresponding algorithm can be selected, so that the throughput of the whole cell is improved, and certain fairness can be considered at the same time.
It should be noted that the number of the thresholds is different, which causes the number of the snr regions to be different, but the idea of selecting the corresponding scheduling algorithm according to different groups is the same, and therefore, the details are not described herein.
Referring to fig. 6, a resource scheduling apparatus provided in an embodiment of the present invention includes: an algorithm selection unit 61 and a scheduling unit 62. Wherein,
an algorithm selecting unit 61, configured to select a current scheduling algorithm according to user channel condition information of at least two user terminals to be scheduled when the at least two user terminals to be scheduled currently exist;
and a scheduling unit 62, configured to schedule the user terminal to be scheduled by using the current scheduling algorithm.
The user channel condition information may include a signal-to-noise ratio or a user rate.
The algorithm selecting unit 61 may be configured to select a polling algorithm as the current scheduling algorithm if the snr of each to-be-scheduled user terminal is less than a set first snr threshold when the user channel condition information is the snr.
The algorithm selecting unit 61 may be configured to, when the user channel condition information is a signal-to-noise ratio, select a PF algorithm as the current scheduling algorithm if the signal-to-noise ratio of each user terminal to be scheduled is greater than a set second signal-to-noise ratio threshold.
The algorithm selecting unit 61 may be configured to, when the user channel condition information is a signal-to-noise ratio, if the signal-to-noise ratio of each to-be-scheduled user terminal is uniformly distributed, use a large-area polling policy to respectively adopt a maximum C/I algorithm, a PF algorithm, and a polling algorithm as a current scheduling algorithm.
The algorithm selecting unit 61 may be configured to, when the user channel condition information is a signal-to-noise ratio, if the signal-to-noise ratios of a part of the user terminals to be scheduled are all greater than a set third signal-to-noise ratio threshold, and the signal-to-noise ratios of the remaining user terminals to be scheduled are all less than a set fourth signal-to-noise ratio threshold, adopt a maximum C/I algorithm as the current scheduling algorithm.
As another embodiment, the algorithm selecting unit 61 may include: a grouping determination unit and an algorithm determination unit.
A grouping determining unit, configured to determine a grouping situation to which the user terminal to be scheduled belongs according to the user channel condition information;
and the algorithm determining unit is used for determining the current scheduling algorithm according to the grouping condition of the user terminal to be scheduled.
The grouping determination unit may be configured to select a maximum C/I algorithm as the current scheduling algorithm if the current user terminal to be scheduled belongs to the first group and the third group, respectively; if the user terminals to be scheduled currently belong to the second group and the third group respectively, selecting a PF algorithm as a current scheduling algorithm; if the user terminal users to be scheduled currently belong to the first group and the second group respectively, selecting a polling algorithm as a current scheduling algorithm; if the user terminal users to be scheduled belong to the same group, selecting a PF algorithm as a current scheduling algorithm; if the user terminal users to be scheduled currently belong to the first group, the second group and the third group respectively, the maximum C/I algorithm, the PF algorithm and the polling algorithm are adopted as the current scheduling algorithm by utilizing the large-area polling strategy respectively.
The grouping determining unit may be configured to determine, according to a set time period and according to the user channel condition information, a grouping situation to which the user terminal to be scheduled belongs.
Fig. 7 is a schematic diagram illustrating comparison of average throughput of simulated cells in four algorithms, and fig. 8 is a schematic diagram illustrating comparison of user received data amount in four algorithms. Referring to fig. 7 and 8, in the scheduling algorithm based on region partition according to the embodiment of the present invention, compared with the round-robin algorithm, the maximum C/I algorithm, and the PF algorithm, a higher throughput and a better fairness are obtained than the round-robin algorithm and the PF algorithm.
Fig. 9a to 9d are simulation diagrams illustrating the successful receiving of data amount by a user in four algorithms. It can be seen from fig. 9a to 9d that the region division algorithm has a larger average throughput than the other two algorithms. Under the polling algorithm, the data volume received by all users in the cell is the minimum, the data volume received by the PF algorithm is more than that received by polling, the data volume received by the area division algorithm is more than that received by the PF algorithm, and the data volume received by the users in the cell is the maximum C/I algorithm. However, it can be seen that the scheduling algorithm based on region division according to the embodiment of the present invention obtains better fairness. Therefore, simulation results show that the scheduling algorithm based on the region division ensures fairness and improves system throughput.
Therefore, the scheduling method of the embodiment of the invention selects different scheduling algorithms according to different channel conditions of the current user, and the priority of the user terminal may change along with the different channel conditions of the current user. When the difference of the user channel quality is large, the maximum C/I algorithm is adopted as the current scheduling algorithm; when the user channel quality is good, adopting a round robin algorithm as a current scheduling algorithm; when the user channel quality is poor, adopting a PF algorithm as a current scheduling algorithm; when the distribution is uniform, a large-area polling strategy is utilized to sequentially adopt a maximum C/I algorithm, a PF algorithm and a polling algorithm as a current scheduling algorithm. Therefore, the throughput of the whole cell can be improved, and certain fairness can be considered at the same time.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations 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 include such modifications and variations.
Claims (18)
1. A method for scheduling resources, the method comprising:
when at least two user terminals to be scheduled exist currently, selecting a current scheduling algorithm according to user channel condition information of the user terminals to be scheduled;
and scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm.
2. The method of claim 1, wherein the user channel condition information comprises a signal-to-noise ratio or a user rate.
3. The method of claim 1, wherein when the user channel condition information is a signal-to-noise ratio, the selecting the current scheduling algorithm according to the user channel condition of the user terminal to be scheduled comprises:
and if the signal-to-noise ratio of each user terminal to be scheduled is smaller than the set first signal-to-noise ratio threshold, selecting a polling algorithm as the current scheduling algorithm.
4. The method of claim 1, wherein when the user channel condition information is a signal-to-noise ratio, the selecting the current scheduling algorithm according to the user channel condition of the user terminal to be scheduled comprises:
and if the signal-to-noise ratio of each user terminal to be scheduled is greater than the set second signal-to-noise ratio threshold, selecting the PF algorithm as the current scheduling algorithm.
5. The method of claim 1, wherein when the user channel condition information is a signal-to-noise ratio, the selecting the current scheduling algorithm according to the user channel condition of the user terminal to be scheduled comprises:
and if the signal-to-noise ratio of each user terminal to be scheduled is uniformly distributed, respectively adopting a maximum carrier/interference C/I algorithm, a proportional fair PF algorithm and a polling algorithm as the current scheduling algorithm by utilizing a large-area polling strategy.
6. The method of claim 1, wherein when the user channel condition information is a signal-to-noise ratio, the selecting the current scheduling algorithm according to the user channel condition of the user terminal to be scheduled comprises:
and if the signal-to-noise ratios of a part of the user terminals to be scheduled are all larger than a set third signal-to-noise ratio threshold value, and the signal-to-noise ratios of the rest of the user terminals to be scheduled are all smaller than a set fourth signal-to-noise ratio threshold value, adopting a maximum C/I algorithm as a current scheduling algorithm, wherein the fourth signal-to-noise ratio threshold value is larger than the third signal-to-noise ratio threshold value.
7. The method of claim 1, wherein the user terminals in a base station are divided into at least two groups according to the user channel condition information in advance; selecting a current scheduling algorithm according to the user channel condition information of the user terminal to be scheduled, wherein the current scheduling algorithm comprises the following steps:
determining the grouping condition of the user terminal to be scheduled according to the user channel condition information;
and determining a current scheduling algorithm according to the grouping condition of the user terminal to be scheduled.
8. The method of claim 7, wherein if the user channel condition information is SNR, when the user terminals in a base station are divided into three groups according to SNR in advance, the three groups are a first group, a second group and a third group, respectively, and the SNR of the first group is smaller than the SNR of the second group, and the SNR of the second group is smaller than the SNR of the third group; determining the current scheduling algorithm according to the grouping situation of the user terminal to be scheduled comprises:
if the user terminal to be scheduled currently belongs to the first group and the third group respectively, selecting a maximum C/I algorithm as a current scheduling algorithm;
if the user terminals to be scheduled currently belong to the second group and the third group respectively, selecting a PF algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled currently belong to the first group and the second group respectively, selecting a polling algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled belong to the same group, selecting a PF algorithm as a current scheduling algorithm;
if the user terminal users to be scheduled currently belong to the first group, the second group and the third group respectively, the maximum C/I algorithm, the PF algorithm and the polling algorithm are adopted as the current scheduling algorithm by utilizing the large-area polling strategy respectively.
9. The method of claim 1, wherein after scheduling the user terminal to be scheduled, the method further comprises:
and dividing the user terminals in the base station into at least two groups according to the user channel condition information again according to the set time period.
10. An apparatus for scheduling resources, the apparatus comprising:
the system comprises an algorithm selection unit, a scheduling unit and a scheduling unit, wherein the algorithm selection unit is used for selecting a current scheduling algorithm according to user channel condition information of at least two user terminals to be scheduled when the user terminals to be scheduled currently exist;
and the scheduling unit is used for scheduling the user terminal to be scheduled by utilizing the current scheduling algorithm.
11. The apparatus of claim 10, wherein the user channel condition information comprises a signal-to-noise ratio or a user rate.
12. The apparatus of claim 10, wherein the algorithm selecting unit is configured to select a polling algorithm as the current scheduling algorithm if the snr of each ue to be scheduled is less than a first snr threshold when the channel condition information of the user is the snr.
13. The apparatus of claim 10, wherein the algorithm selecting unit is configured to select a PF algorithm as the current scheduling algorithm if the snr of each ue to be scheduled is greater than a second snr threshold when the channel condition information of the user is the snr.
14. The apparatus of claim 10, wherein the algorithm selecting unit is configured to, when the user channel condition information is a signal-to-noise ratio, if the signal-to-noise ratio of each user terminal to be scheduled is uniformly distributed, use a large-area polling strategy to respectively use a maximum C/I algorithm, a PF algorithm, and a polling algorithm as the current scheduling algorithm.
15. The apparatus of claim 10, wherein the algorithm selecting unit is configured to, when the user channel condition information is an snr, if snrs of some ues to be scheduled are all greater than a third snr threshold and snrs of the remaining ues to be scheduled are all less than a fourth snr threshold, adopt a maximum C/I algorithm as the current scheduling algorithm, where the fourth snr threshold is greater than the third snr threshold.
16. The apparatus of claim 10, wherein the algorithm selection unit comprises:
a grouping determining unit, configured to determine a grouping situation to which the user terminal to be scheduled belongs according to the user channel condition information;
and the algorithm determining unit is used for determining the current scheduling algorithm according to the grouping condition of the user terminal to be scheduled.
17. The apparatus of claim 16 wherein if the user channel condition information is snr, when the ue in a base station includes three sets of snrs, i.e., a first set, a second set and a third set, respectively, and the snr of the first set is less than the snr of the second set and the snr of the second set is less than the snr of the third set, then
The grouping determining unit is used for selecting the maximum C/I algorithm as the current scheduling algorithm if the current user terminal to be scheduled belongs to the first group and the third group respectively; if the user terminals to be scheduled currently belong to the second group and the third group respectively, selecting a PF algorithm as a current scheduling algorithm; if the user terminal users to be scheduled currently belong to the first group and the second group respectively, selecting a polling algorithm as a current scheduling algorithm; if the user terminal users to be scheduled belong to the same group, selecting a PF algorithm as a current scheduling algorithm; if the user terminal users to be scheduled currently belong to the first group, the second group and the third group respectively, the maximum C/I algorithm, the PF algorithm and the polling algorithm are adopted as the current scheduling algorithm by utilizing the large-area polling strategy respectively.
18. The apparatus of claim 10, wherein the grouping determining unit is configured to determine the grouping situation of the ue to be scheduled according to the channel condition information of the ue according to a set time period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910081910CN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910081910CN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101860916Atrue CN101860916A (en) | 2010-10-13 |
| CN101860916B CN101860916B (en) | 2013-01-23 |
Family
ID=42946500
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910081910ActiveCN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101860916B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457888A (en)* | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Carrier indicator domain grouping method and device |
| CN102752763A (en)* | 2012-07-09 | 2012-10-24 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN104581970A (en)* | 2014-12-05 | 2015-04-29 | 大唐移动通信设备有限公司 | Adaptive-scheduling method and equipment |
| CN106998590A (en)* | 2015-12-28 | 2017-08-01 | 中国信息通信研究院 | A kind of uplink scheduling method and device |
| CN108011844A (en)* | 2017-12-14 | 2018-05-08 | 郑州云海信息技术有限公司 | A kind of PWDRR methods applied to exchange chip |
| WO2022151493A1 (en)* | 2021-01-18 | 2022-07-21 | 华为技术有限公司 | Scheduling transmission method and apparatus |
| CN119520416A (en)* | 2025-01-15 | 2025-02-25 | 中科亿海微电子科技（苏州）有限公司 | Ethernet multi-queue traffic scheduling method, device, computer-readable storage medium and electronic device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100534067C (en)* | 2007-01-19 | 2009-08-26 | 北京邮电大学 | Scheduling method to ensure the stability of non-real-time service data packet delay in OFDMA system |
| CN100574175C (en)* | 2007-05-25 | 2009-12-23 | 华为技术有限公司 | The method and apparatus that obtains the method and system of high-speed uplink packet scheduling capacity and obtain link effective data rate |
| CN101080032A (en)* | 2007-05-25 | 2007-11-28 | 华为技术有限公司 | A high-speed downlink packet access capacity estimation method and device |
- 2009
- 2009-04-08CNCN 200910081910patent/CN101860916B/enactiveActive
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457888A (en)* | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Carrier indicator domain grouping method and device |
| CN102457888B (en)* | 2010-10-18 | 2015-08-19 | 中兴通讯股份有限公司 | A kind of method of carrier wave indicator field grouping and device |
| CN102752763A (en)* | 2012-07-09 | 2012-10-24 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN102752763B (en)* | 2012-07-09 | 2014-07-23 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN104581970A (en)* | 2014-12-05 | 2015-04-29 | 大唐移动通信设备有限公司 | Adaptive-scheduling method and equipment |
| CN104581970B (en)* | 2014-12-05 | 2018-05-29 | 大唐移动通信设备有限公司 | A kind of self-adapting dispatching method and equipment |
| CN106998590A (en)* | 2015-12-28 | 2017-08-01 | 中国信息通信研究院 | A kind of uplink scheduling method and device |
| CN108011844A (en)* | 2017-12-14 | 2018-05-08 | 郑州云海信息技术有限公司 | A kind of PWDRR methods applied to exchange chip |
| WO2022151493A1 (en)* | 2021-01-18 | 2022-07-21 | 华为技术有限公司 | Scheduling transmission method and apparatus |
| US12418690B2 (en) | 2021-01-18 | 2025-09-16 | Huawei Technologies Co., Ltd. | Scheduling transmission method and apparatus |
| CN119520416A (en)* | 2025-01-15 | 2025-02-25 | 中科亿海微电子科技（苏州）有限公司 | Ethernet multi-queue traffic scheduling method, device, computer-readable storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101860916B (en) | 2013-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101902817B (en) | Uplink radio resource dispatching method and device for wireless communication system | |
| US8514703B2 (en) | Scheduling of logical channels in a wireless communication system | |
| JP5413631B2 (en) | Load estimation to meet specified service quality | |
| US8837284B2 (en) | Method for scheduling guaranteed bit rate service based on quality of service | |
| JP2012239176A (en) | Method and apparatus of implementing and/or using dedicated control channel | |
| CN101238685A (en) | OFDMA Reverse Link Scheduling | |
| CN101835161A (en) | Dynamic resource allocation method and equipment of multi-cell wireless communication system | |
| CN101686196A (en) | Service scheduling method and service scheduling device | |
| CN101860916A (en) | Resource scheduling method and device | |
| WO2007003122A1 (en) | Multi-carrier hsdpa downlink traffic channel resource-allocating method and data transmitting method | |
| WO2012079529A1 (en) | Shared channel resource allocation method and system based on sdma | |
| Lei et al. | Adaptive connection admission control algorithm for LTE systems | |
| Meucci et al. | Spectrum aggregation with multi-band user allocation over two frequency bands | |
| CN102083222B (en) | Distribution method of adjoint channels of HSPA (High Speed Packet Access) system, base station and system | |
| Saglam et al. | 5G enhanced mobile broadband downlink scheduler | |
| Wang et al. | Carrier load balancing methods with bursty traffic for LTE-Advanced systems | |
| CN104602355B (en) | Mixed service scheduling method in LTE system | |
| Yildiz et al. | A novel mobility aware downlink scheduling algorithm for LTE-A networks | |
| Iosif et al. | LTE uplink analysis using two packet scheduling models | |
| Lee et al. | Sub-channel Allocation Based on Multi-level Priority in OFDMA Systems. | |
| Ayhan et al. | Utilizing geometric mean in proportional fair scheduling: Enhanced throughput and fairness in LTE DL | |
| Shen et al. | Opportunistic scheduling for heterogeneous services in downlink OFDMA system | |
| Chao et al. | An enhanced proportional fair scheduling algorithm to maximize QoS traffic in downlink OFDMA systems | |
| CN111246585B (en) | A 5G resource scheduling method based on channel state | |
| CN100369502C (en) | A Proportional Fair Scheduling Method for Base Stations to Select Serving Terminals |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |