CN101860916A - Resource scheduling method and device - Google Patents
Resource scheduling method and device Download PDFInfo
- Publication number
- CN101860916A CN101860916A CN 200910081910 CN200910081910A CN101860916A CN 101860916 A CN101860916 A CN 101860916A CN 200910081910 CN200910081910 CN 200910081910 CN 200910081910 A CN200910081910 A CN 200910081910A CN 101860916 A CN101860916 A CN 101860916A
- Authority
- CN
- China
- Prior art keywords
- algorithm
- scheduled
- user terminal
- noise ratio
- 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
Images
Abstract
The invention discloses a resource scheduling method and a resource scheduling device and solves the problem that system throughput and fairness cannot be taken into consideration at the same time in the prior art. The method comprises: when at least two user terminals exist currently, selecting a current scheduling algorithm according to the user channel condition information of the user terminals to be scheduled; and scheduling the user terminals to be scheduled by using the current scheduling algorithm. Therefore, in the scheduling policy used in the embodiment of the invention, different scheduling algorithms are selected according to a current user channel condition and the priority of the user terminals changes with the current user channel condition, so the system throughput can be improved while the fairness is taken into consideration.
Description
Technical field
The present invention relates to communication technical field, be meant a kind of resource regulating method and device especially.
Background technology
Along with the development of mobile communication technology, the type of service of support also comprises business such as low, high-speed data and image except traditional speech business.The target of mobile communications network: one will guarantee the quality of service requirement of all kinds of business, and two will guarantee the fairness between the user, and three will make the resource utilization of system reach maximum.These all need be realized by means of RRM, the packet radio dispatching algorithm of the data business being carried out resource management is the important component part of RRM, influences the key technology that systematic function guarantees QoS of customer so the packet radio dispatching algorithm will become.
In the agreement of version, the function of packet scheduling is mainly finished by radio network controller (RNC) before 3G (Third Generation) Moblie (3GPP) R4 reaches.Its main feature is: when adjusting resource between different user or Business Stream, often will notify by high-level signaling.This process is veryer long, does not consider the time varying characteristic of subscriber channel condition, thereby causes the good user of channel condition can not obtain higher service speed, has limited the performance of system and terminal capability.
3GPP R5 agreement has been introduced the high speed downlink packet access, and (HighSpeedDownlink PacketAccess, HSDPA) technology are used to improve the throughput of system and the peak rate of down direction.HSDPA has mainly adopted three kinds of technology: and adaptive modulation and coding (Adaptive Modulation and Code, AMC), mix automatic repeat requests (HARQ) and fast cell and select (FCS) technology.At present, three kinds of basic dispatching algorithms relatively paying close attention to are: polling algorithm, maximum (MAX) carrier wave/interference (C/I) algorithm, direct ratio justice (PF) algorithm.
Polling algorithm: this algorithm is that different user terminals (UE) distributes identical power and holding time, and promptly all users obtain the resource of equivalent.Fig. 1 has provided the polling algorithm resource distribution mode.
Maximum C/I algorithm: this algorithm has taken into full account the channel condition difference between the user terminal, gives the best user terminal of channel condition with the highest priority.Fig. 2 has provided MAX C/I algorithm Resource Allocation Formula.Among Fig. 2, suppose that the channel condition of UE1 in the service process is better than UE2 all the time, when the channel condition of UE1 was better than UE2 all the time, UE1 dispatched always in system.Have only the channel condition of the working as whole end of transmissions of UE1 buffer data preferably, UE2 just dispatches in system.
The PF algorithm: this algorithm is a throughput of having considered that user channel quality and the past period obtain when dispatching simultaneously.Fig. 3 has provided PF algorithm Resource Allocation Formula.As can be seen from Figure 3, although the channel condition of UE1 is better than UE2, after after a while, the average throughput of UE2 descends and causes priority to increase, and still can be scheduled.Because the PF algorithm synthesis has been considered user's channel condition and the service fairness between the user, can between throughput of system and service fairness, obtain compromise definitely, therefore be to adopt more a kind of algorithm at present.
In the traditional scheduler algorithm, the polling algorithm shortcoming is because algorithm is not considered the concrete situation of the wireless channel between different user, so the throughput of system may be very low.Though the total throughout that maximum C/I algorithm has improved system but can not guarantee the fairness between the user.The PF algorithm is obtained compromise definitely between throughput of system and service fairness, the throughput ratio polling algorithm of system is superior, but in the reality since subscriber channel experience often have different fading characteristics, the equitable proportion algorithm just can not provide the fair allocat that is directly proportional with its Mean Speed, thereby causes some users' QoS to descend.
Summary of the invention
The embodiment of the invention provides a kind of resource regulating method and device, in order to solve the problem that can not take into account throughput of system and fairness in the prior art.
A kind of resource regulating method that the embodiment of the invention provides comprises:
When at least two user terminals to be scheduled of current existence, select the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled;
Utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
A kind of resource scheduling device that the embodiment of the invention provides comprises:
The algorithm selected cell is used at least when two user terminals to be scheduled of current existence, selects the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled;
Scheduling unit is used to utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
The embodiment of the invention is when at least two user terminals to be scheduled of current existence, selects the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled; Utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.Therefore, in the embodiment of the invention, at active user's channel conditions difference, and select different dispatching algorithms, therefore, the priority of user terminal may change along with active user's channel conditions difference, this scheme can be taken into account fairness under the situation that improves throughput of system.
Description of drawings
Fig. 1 is the allocative decision schematic diagram of polling algorithm;
Fig. 2 is maximum C/I algorithm assigns scheme schematic diagram;
Fig. 3 is a PF algorithm assigns scheme schematic diagram;
Fig. 4 is the schematic flow sheet of the resource regulating method of the embodiment of the invention;
Fig. 5 is the schematic flow sheet based on the resource regulating method of area dividing of the embodiment of the invention;
Fig. 6 is the structural representation of the device of the embodiment of the invention;
Fig. 7 is that the sub-district average throughput is the emulation schematic diagram relatively after utilizing the resource regulating method and existing three kinds of dispatching algorithms based on area dividing of the embodiment of the invention;
Fig. 8 is that user terminal receives relatively emulation schematic diagram of data volume after utilizing the resource regulating method and existing three kinds of dispatching algorithms based on area dividing of the embodiment of the invention;
Fig. 9 a～9b utilizes the resource regulating method based on area dividing of the embodiment of the invention successfully to receive data volume emulation schematic diagram with existing three kinds of dispatching algorithm user terminals, wherein 9a is the simulation result of polling algorithm, 9b is the simulation result of maximum C/I algorithm, 9c is the simulation result of PF algorithm, and 9d is the simulation result based on the dispatching algorithm of area dividing of three embodiment of the invention.
Embodiment
The embodiment of the invention is when at least two user terminals to be scheduled of current existence, selects the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled; Utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched then.Described subscriber channel condition information can be to characterize or the information of reaction user channel quality, such as being signal to noise ratio, and also can be for user rate etc.
Referring to shown in Figure 4, the method for the embodiment of the invention may further comprise the steps:
Step 401: when at least two user terminals to be scheduled of current existence, select the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled.
Step 402: utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
In embodiments of the present invention, when the user channel quality difference is big, can adopt maximum C/I algorithm as the current scheduling algorithm; When user channel quality is all better, then can adopt the repeating query algorithm as the current scheduling algorithm; When user channel quality is all relatively poor, then can adopt the PF algorithm as the current scheduling algorithm; When being evenly distributed, then utilize big regional poll strategy can adopt maximum C/I algorithm, PF algorithm and polling algorithm successively as the current scheduling algorithm.
Below be example when being signal to noise ratio with the subscriber channel condition information, the implementation of selecting the current scheduling algorithm is described:
If the signal to noise ratio of each user terminal to be scheduled all less than first snr threshold of setting, when just active user's channel quality is all relatively good, then can select polling algorithm as the current scheduling algorithm.
If the signal to noise ratio of each user terminal to be scheduled all greater than second snr threshold of setting, when just active user's channel quality is all poor, then can select the PF algorithm as the current scheduling algorithm.
When if the signal to noise ratio of each user terminal to be scheduled is evenly distributed, the signal to noise ratio that is user terminal to be scheduled all has distribution in the interval of setting, then can utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm successively.
For the signal to noise ratio of part user terminal to be scheduled all greater than the 3rd snr threshold of setting, and the signal to noise ratio of all the other user terminals to be scheduled is all less than the 4th snr threshold of setting, the 4th snr threshold is greater than the 3rd snr threshold, this moment user terminal signal to noise ratio to be scheduled skewness, the user channel quality difference is bigger, then can adopt maximum C/I algorithm as the current scheduling algorithm.
Certainly, in embodiments of the present invention, the size of first snr threshold, second snr threshold and the 3rd snr threshold and the 4th snr threshold is not done concrete qualification, can choose according to the actual emulation result.Such as: in the actual mechanical process, can adopt a snr threshold zoning, also can adopt a plurality of signal to noise ratios zoning, when adopting a plurality of snr thresholds, first snr threshold can be greater than second snr threshold, also can also can equal second snr threshold less than second snr threshold.
Below adopting two snr thresholds, and second snr threshold is that example specifies specific implementation process of the present invention greater than first snr threshold.
In embodiments of the present invention, adopted two snr threshold SIR1 and SIR2, SIR1 is first snr threshold, SIR2 is second snr threshold, SIRUE is the signal to noise ratio of user terminal, divides signal to noise ratio into three zones, and SIRUE＜SIR1 is a district, SIR1＜SIRUE＜SIR2 is two districts, SIRUE＞SIR2 is three districts, according to signal to noise ratio user terminal is divided into three groups, corresponding first group an of district, corresponding second group of two districts, corresponding the 3rd group of three districts.
| One district | ??SIRUE＜SIR1 |
| Two districts | ??SIR1＜SIRUE＜SIR2 |
| Three districts | ??SIRUE＞SIR2 |
Table 1
Therefore, in the present embodiment, select the current scheduling algorithm to realize like this: to determine grouping situation under the described user terminal to be scheduled by signal to noise ratio according to the subscriber channel condition information of described user terminal to be scheduled; Determine the current scheduling algorithm according to grouping situation under the described user terminal to be scheduled.
Such as: if the subscriber channel condition information is a signal to noise ratio, when by signal to noise ratio the user terminal in one base station being divided into three groups in advance, be respectively first group, second group and the 3rd group, and first group of signal to noise ratio be less than second group of signal to noise ratio, second group of signal to noise ratio is less than the 3rd group of signal to noise ratio.
So, determine that the detailed process of current scheduling algorithm is as follows:
If current user terminal to be scheduled belongs to first group and the 3rd group respectively, then select maximum C/I algorithm as the current scheduling algorithm;
If current user terminal to be scheduled belongs to second group and the 3rd group respectively, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to first group and second group respectively, then select polling algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to same group, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to first group, second group and the 3rd group respectively, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm successively as the current scheduling algorithm.
Below in conjunction with table 1 and shown in Figure 5, describe the detailed process that present embodiment is realized scheduling of resource in detail:
Step 501: parameter value such as the resource collection that can be scheduled to current time slots, channel condition, type of service carries out initialization.
Step 502: according to the signal to noise ratio of user terminal, the user terminal in the base station is divided in some groups, and enters wait scheduling in the formation that sets in advance.
Step 503: in the current time slots free time, and have a plurality of users to wait for simultaneously when dispatching in the formation, in the following manner the selection scheduling algorithm:
When (1) signal to noise ratio of user terminal is distributed in He San district, a district, the user terminal of promptly waiting for scheduling belongs to first group and the 3rd group, channel quality between the user terminal differs bigger, it is bigger that modulation coding mode differs, cause the momentary rate difference between the user terminal very big, so, adopt maximum C/I algorithm as the current scheduling algorithm for guaranteeing throughput of system;
When (2) signal to noise ratio of user terminal is distributed in He San district, two districts, the user terminal of promptly waiting for scheduling belongs to second group and the 3rd group, user channel quality is all poor, but it is smaller that user channel quality differs, the modulation coding mode difference is less between the user, momentary rate difference between the user is less, so adopt the PF algorithm as the current scheduling algorithm, is intended to balance sysmte throughput and fairness;
When (3) signal to noise ratio of user terminal is distributed in He Er district, a district, the user terminal of promptly waiting for scheduling belongs to first group and second group, user channel quality is all relatively good, but the speed difference is less between the user terminal, and the transmitted breath amount of modulation coding mode that adopts is bigger, so adopt polling algorithm as the current scheduling algorithm, guarantee user's fairness;
(4) signal to noise ratio of user terminal is distributed in same when zone, and user terminal just to be scheduled belongs to a group, therefore adopts the PF algorithm as the current scheduling algorithm, is intended to balance sysmte throughput and fairness;
(5) signal to noise ratio of user terminal all has distribution in three zones, just exist user terminal to be scheduled to belong to first group, also have and belong to second group, also have to belong to the 3rd group, therefore adopt the big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm successively as the current scheduling algorithm.
Step 504: in the dispatching algorithm scheduling queue of selecting according to step 503 during a user terminal to be scheduled, determine dispatching priority between business according to the business of this user terminal application.
Step 505: according to the Quality of Service request of this user terminal, for the traffic assignments of this user terminal high priority resource, but when current system resource remains in addition, distribute to other business of the application of this user terminal, or dispatch the user terminal of next priority.
Certainly, can press the subscriber channel condition information again with the user terminal division group in the base station according to the time cycle of setting in the present embodiment.The user uses the variation of wireless resource with the subscriber channel situation, and affiliated grouping might change, and then can select corresponding algorithm, can take into account certain fairness when the throughput of whole sub-district is got a promotion.
Need to prove, adopt the number difference of threshold value, cause the number of signal to noise ratio zoning also different, but be identical, therefore repeat no more here according to the thought that different groups is chosen corresponding dispatching algorithm.
Referring to shown in Figure 6, a kind of resource scheduling device that the embodiment of the invention provides comprises: algorithm selected cell 61 and scheduling unit 62.Wherein,
Algorithm selected cell 61 is used at least when two user terminals to be scheduled of current existence, selects the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled;
Scheduling unit 62 is used to utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
Described subscriber channel condition information can comprise signal to noise ratio or user rate.
Described algorithm selected cell 61 can be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of each user terminal to be scheduled then selects polling algorithm as the current scheduling algorithm all less than first snr threshold of setting.
Described algorithm selected cell 61 can be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of each user terminal to be scheduled then selects the PF algorithm as the current scheduling algorithm all greater than second snr threshold of setting.
Described algorithm selected cell 61, can be used for when described subscriber channel condition information is signal to noise ratio, when if the signal to noise ratio of each user terminal to be scheduled is evenly distributed, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm respectively as the current scheduling algorithm.
Described algorithm selected cell 61, can be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of a part of user terminal to be scheduled is all greater than the 3rd snr threshold of setting, and the signal to noise ratio of all the other user terminals to be scheduled all less than the 4th snr threshold of setting, then adopts maximum C/I algorithm as the current scheduling algorithm.
As another kind of execution mode, described algorithm selected cell 61 can comprise: grouping determining unit and algorithm determining unit.
The grouping determining unit is used for determining grouping situation under the described user terminal to be scheduled by the subscriber channel condition information;
The algorithm determining unit is used for determining the current scheduling algorithm according to grouping situation under the described user terminal to be scheduled.
Described grouping determining unit can be used for belonging to first group and the 3rd group respectively at current user terminal to be scheduled, then selects maximum C/I algorithm as the current scheduling algorithm; If current user terminal to be scheduled belongs to second group and the 3rd group respectively, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to first group and second group respectively, then select polling algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to same group, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to first group, second group and the 3rd group respectively, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm respectively as the current scheduling algorithm.
Described grouping determining unit can be used for according to the time cycle of setting, and determined grouping situation under the described user terminal to be scheduled by the subscriber channel condition information.
Fig. 7 compares schematic diagram for four kinds of algorithm sub-districts of emulation average throughput, and Fig. 8 receives relatively schematic diagram of data volume for four kinds of algorithm users of emulation.Referring to Fig. 7 and shown in Figure 8, the dispatching algorithm based on area dividing of the embodiment of the invention is compared with polling algorithm, maximum C/I algorithm, PF algorithm, has obtained than polling algorithm and the higher throughput of PF algorithm, than the better fairness of maximum C/I algorithm.
Fig. 9 a～9d is that four kinds of algorithm users successfully receive data volume emulation schematic diagram.Region partitioning algorithm is bigger than the average throughput of other two kinds of algorithms as can be seen from Fig. 9 a～9d.The data volume that all users receive in the sub-district under polling algorithm is minimum, the data volume that the PF algorithm receives is more than poll, region partitioning algorithm is more than the data volume that the PF algorithm receives again, the data volume maximum that the user receives in the sub-district remain maximum C/I algorithm.But the dispatching algorithm based on area dividing of the embodiment of the invention has obtained fairness preferably as can be seen.So simulation result shows that the dispatching algorithm based on area dividing of the embodiment of the invention has guaranteed that fairness has improved throughput of system simultaneously.
Therefore, the dispatching method of the embodiment of the invention is at active user's channel conditions difference, and selects different dispatching algorithms, and the priority of user terminal may change along with active user's channel conditions difference.When the user channel quality difference is big, adopt maximum C/I algorithm as the current scheduling algorithm; When user channel quality is all better, then adopt the repeating query algorithm as the current scheduling algorithm; When user channel quality is all relatively poor, then adopt the PF algorithm as the current scheduling algorithm; When being evenly distributed, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm successively as the current scheduling algorithm.Can take into account certain fairness when therefore, the throughput of whole sub-district being got a promotion.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (18)
1. a resource regulating method is characterized in that, this method may further comprise the steps:
When at least two user terminals to be scheduled of current existence, select the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled;
Utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
2. method according to claim 1 is characterized in that, described subscriber channel condition information comprises signal to noise ratio or user rate.
3. method according to claim 1 is characterized in that, when described subscriber channel condition information was signal to noise ratio, described subscriber channel situation according to described user terminal to be scheduled was selected the current scheduling algorithm, comprising:
If the signal to noise ratio of each user terminal to be scheduled all less than first snr threshold of setting, then selects polling algorithm as the current scheduling algorithm.
4. method according to claim 1 is characterized in that, when described subscriber channel condition information was signal to noise ratio, described subscriber channel situation according to described user terminal to be scheduled was selected the current scheduling algorithm, comprising:
If the signal to noise ratio of each user terminal to be scheduled all greater than second snr threshold of setting, then selects the PF algorithm as the current scheduling algorithm.
5. method according to claim 1 is characterized in that, when described subscriber channel condition information was signal to noise ratio, described subscriber channel situation according to described user terminal to be scheduled was selected the current scheduling algorithm, comprising:
When if the signal to noise ratio of each user terminal to be scheduled is evenly distributed, then utilize big regional poll strategy to adopt maximum carrier wave/interference C/I algorithm, the fair PF algorithm of direct ratio and polling algorithm respectively as the current scheduling algorithm.
6. method according to claim 1 is characterized in that, when described subscriber channel condition information was signal to noise ratio, described subscriber channel situation according to described user terminal to be scheduled was selected the current scheduling algorithm, comprising:
If the signal to noise ratio of a part of user terminal to be scheduled is all greater than the 3rd snr threshold of setting, and the signal to noise ratio of all the other user terminals to be scheduled is all less than the 4th snr threshold of setting, then adopt maximum C/I algorithm as the current scheduling algorithm, wherein, the 4th snr threshold is greater than the 3rd snr threshold.
7. method according to claim 1 is characterized in that, by the subscriber channel condition information user terminal in one base station is divided at least two groups in advance; Then select the current scheduling algorithm, comprising according to the subscriber channel condition information of described user terminal to be scheduled:
Determine grouping situation under the described user terminal to be scheduled by the subscriber channel condition information;
Determine the current scheduling algorithm according to grouping situation under the described user terminal to be scheduled.
8. method according to claim 7, it is characterized in that, if the subscriber channel condition information is a signal to noise ratio, when by signal to noise ratio the user terminal in one base station being divided into three groups in advance, be respectively first group, second group and the 3rd group, and first group of signal to noise ratio is less than second group of signal to noise ratio, and second group of signal to noise ratio is less than the 3rd group of signal to noise ratio; Then determine that according to grouping situation under the described user terminal to be scheduled the current scheduling algorithm comprises:
If current user terminal to be scheduled belongs to first group and the 3rd group respectively, then select maximum C/I algorithm as the current scheduling algorithm;
If current user terminal to be scheduled belongs to second group and the 3rd group respectively, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to first group and second group respectively, then select polling algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to same group, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to first group, second group and the 3rd group respectively, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm respectively as the current scheduling algorithm.
9. method according to claim 1 is characterized in that, after described user terminal to be scheduled was dispatched, this method further comprised:
Time cycle according to setting, by the subscriber channel condition information user terminal in one base station is divided at least two groups again.
10. a resource scheduling device is characterized in that, this device comprises:
The algorithm selected cell is used at least when two user terminals to be scheduled of current existence, selects the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled;
Scheduling unit is used to utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
11. device according to claim 10 is characterized in that, described subscriber channel condition information comprises signal to noise ratio or user rate.
12. device according to claim 10, it is characterized in that, described algorithm selected cell, be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of each user terminal to be scheduled all less than first snr threshold of setting, then selects polling algorithm as the current scheduling algorithm.
13. device according to claim 10, it is characterized in that, described algorithm selected cell, be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of each user terminal to be scheduled all greater than second snr threshold of setting, then selects the PF algorithm as the current scheduling algorithm.
14. device according to claim 10, it is characterized in that, described algorithm selected cell, be used for when described subscriber channel condition information is signal to noise ratio, when if the signal to noise ratio of each user terminal to be scheduled is evenly distributed, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm respectively as the current scheduling algorithm.
15. device according to claim 10, it is characterized in that, described algorithm selected cell, be used for when described subscriber channel condition information is signal to noise ratio, if the signal to noise ratio of a part of user terminal to be scheduled is all greater than the 3rd snr threshold of setting, and the signal to noise ratio of all the other user terminals to be scheduled then adopts maximum C/I algorithm as the current scheduling algorithm all less than the 4th snr threshold of setting, wherein, the 4th snr threshold is greater than the 3rd snr threshold.
16. device according to claim 10 is characterized in that, described algorithm selected cell comprises:
The grouping determining unit is used for determining grouping situation under the described user terminal to be scheduled by the subscriber channel condition information;
The algorithm determining unit is used for determining the current scheduling algorithm according to grouping situation under the described user terminal to be scheduled.
17. device according to claim 16, it is characterized in that, if the subscriber channel condition information is a signal to noise ratio, when the user terminal in the base station is comprised three groups by signal to noise ratio, be respectively first group, second group and the 3rd group, and first group of signal to noise ratio be less than second group of signal to noise ratio, and second group of signal to noise ratio is during less than the 3rd group of signal to noise ratio, then
Described grouping determining unit belongs to first group and the 3rd group respectively if be used for current user terminal to be scheduled, then selects maximum C/I algorithm as the current scheduling algorithm; If current user terminal to be scheduled belongs to second group and the 3rd group respectively, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to first group and second group respectively, then select polling algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to same group, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to first group, second group and the 3rd group respectively, then utilize big regional poll strategy to adopt maximum C/I algorithm, PF algorithm and polling algorithm respectively as the current scheduling algorithm.
18. device according to claim 10 is characterized in that, described grouping determining unit was used for according to the time cycle of setting, and determined grouping situation under the described user terminal to be scheduled by the subscriber channel condition information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910081910 CN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910081910 CN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101860916A true 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 200910081910 Active CN101860916B (en) | 2009-04-08 | 2009-04-08 | Resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101860916B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457888A (en) * | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Method of carrier wave indicator domain grouping and apparatus thereof |
| 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 |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100534067C (en) * | 2007-01-19 | 2009-08-26 | 北京邮电大学 | Scheduling method for ensuring time delay stability of non-real-time business data packet for 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-08 CN CN 200910081910 patent/CN101860916B/en active Active
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457888A (en) * | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Method of carrier wave indicator domain grouping and apparatus thereof |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101860916B (en) | 2013-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100555930C (en) | The channel establishing method of multi-carrier HSDPA and multi-carrier downlink group data transmission method | |
| CN102612146B (en) | Implement and/or use the method and apparatus of Dedicated Control Channel | |
| CN101341667B (en) | For transmitting and/or use the method and apparatus of transmission power information | |
| CN101902817B (en) | Uplink radio resource dispatching method and device for wireless communication system | |
| CN100566295C (en) | A kind of Packet Service scheduling method for wireless resource based on service quality guarantee | |
| CN103313370B (en) | For the method and apparatus transmitted and/or use transmission power information | |
| CN101043638B (en) | Base station dispatcher, resource distribution module and dispatch control method for HSUPA | |
| CN101099311B (en) | Wireless communication system and method | |
| CN101835161B (en) | Dynamic resource allocation method and equipment of multi-cell wireless communication system | |
| CN100550691C (en) | The method of dispatching group data transmission | |
| CN103874125A (en) | Methods and apparatus for flexible reporting of control information | |
| CN101345647B (en) | Channel establishing method for high speed ascending packet data transmission, and network controller | |
| Cheng et al. | Joint carrier aggregation and packet scheduling in LTE-Advanced networks | |
| CN101860916B (en) | Resource scheduling method and device | |
| CN101513094A (en) | Method and apparatus for providing channel quality feedback in a wireless communication system | |
| CN101917769B (en) | Uplink resource allocation and scheduling method of OFDMA (Orthogonal Frequency Division Multiple Access) system based on 802.16m | |
| CN101170809B (en) | Method, network entity and radio access system for realizing time delay compression | |
| CN101534559A (en) | Resource allocator and resource allocation method | |
| CN102104968A (en) | Resource scheduling method and base station | |
| CN102186256A (en) | Method for determining user priority order in long term evolution (LTE) scheduling | |
| CN102104969A (en) | Resource scheduling method and base station | |
| CN102404838B (en) | Uplink resource allocation method and uplink resource allocation device | |
| CN101436921A (en) | Scheduling method and network side equipment | |
| CN104602355A (en) | Method for scheduling mixed services in LTE (long term evolution) system | |
| CN104066197A (en) | Real-time low-packet-loss service scheduling method in TD-LTE |
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 |