CN101860916B - Resource scheduling method and device - Google Patents
Resource scheduling method and device Download PDFInfo
- Publication number
- CN101860916B CN101860916B CN 200910081910 CN200910081910A CN101860916B CN 101860916 B CN101860916 B CN 101860916B CN 200910081910 CN200910081910 CN 200910081910 CN 200910081910 A CN200910081910 A CN 200910081910A CN 101860916 B CN101860916 B CN 101860916B
- Authority
- CN
- China
- Prior art keywords
- algorithm
- group
- user terminal
- scheduled
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
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, refer to especially a kind of resource regulating method and device.
Background technology
Along with the development of mobile communication technology, the type of service of support also comprises the 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 to 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, affects 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: during adjustresources, often will notify by high-level signaling between different user or Business Stream.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 high speed downlink packet access (HighSpeedDownlink Packet Access, HSDPA) technology, is used for improving throughput of system and the peak rate of down direction.HSDPA has mainly adopted three kinds of technology: adaptive modulation and coding (Adaptive Modulation and Code, AMC), mixed automatic retransfer request (HARQ) and fast cell are selected (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, fair (PF) algorithm of direct ratio.
Polling algorithm: this algorithm is that different user terminals (UE) distributes identical power and holding time, and namely 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.Only have the preferably whole end of transmissions of UE1 buffer data of the channel condition of working as, UE2 just dispatches in system.
The PF algorithm: this algorithm is the throughput of having considered simultaneously that user channel quality and the past period obtain when dispatching.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 definitely compromise, therefore be to adopt at present more a kind of algorithm.
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.Although 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 definitely compromise 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 user channel quality of user terminal to be scheduled, comprising:
If the user channel quality difference is larger, then adopt maximum carrier wave/interference C/I algorithm as the current scheduling algorithm;
If user channel quality is all better, then adopt the repeating query algorithm as the current scheduling algorithm;
If user channel quality is all relatively poor, then adopt the fair PF algorithm of direct ratio as the current scheduling algorithm;
If the user channel quality of described user terminal to be scheduled is evenly distributed, then utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm;
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 user channel quality of user terminal to be scheduled, comprising:
If the user channel quality difference is larger, then adopt maximum C/I algorithm as the current scheduling algorithm;
If user channel quality is all better, then adopt the repeating query algorithm as the current scheduling algorithm;
If user channel quality is all relatively poor, then adopt the PF algorithm as the current scheduling algorithm;
If the user channel quality of described user terminal to be scheduled is evenly distributed, then utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm;
Scheduling unit is used for utilizing 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, different for active user's channel conditions, 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 in the situation that the raising throughput of system be taken into account fairness.
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 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 of the resource regulating method of dividing based on the zone 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 residential quarter average throughput is the emulation schematic diagram relatively after utilizing the resource regulating method and existing three kinds of dispatching algorithms based on the zone division of the embodiment of the invention;
Fig. 8 is that user terminal receive data amount is the emulation schematic diagram relatively after utilizing the resource regulating method and existing three kinds of dispatching algorithms based on the zone division of the embodiment of the invention;
Fig. 9 a～9b is the resource regulating method and existing three kinds of dispatching algorithm user terminals success receive data amount emulation schematic diagrames based on the zone division that utilizes the embodiment of the invention, 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 of the dispatching algorithm of dividing based on the zone 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; Then utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.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 larger, 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 large regional poll strategy can adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.
Below be example during take the subscriber channel condition information as signal to noise ratio, the implementation of selecting the current scheduling algorithm is described:
If the signal to noise ratio of each user terminal to be scheduled is less than the first snr threshold of setting, when namely 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 is greater than the second snr threshold of setting, when namely 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 has distribution in the interval of setting, then can utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.
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 larger, then can adopt maximum C/I algorithm as the current scheduling algorithm.
Certainly, in embodiments of the present invention, the size of the first snr threshold, the second snr threshold and the 3rd snr threshold and the 4th snr threshold is not done concrete restriction, 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, the first snr threshold can be greater than the second snr threshold, also can less than the second snr threshold, also can equal the second snr threshold.
The below is adopting two snr thresholds, and the second snr threshold is that example specifies specific implementation process of the present invention greater than the first snr threshold.
In embodiments of the present invention, adopted two snr threshold SIR1 and SIR2, SIR1 is the first snr threshold, SIR2 is the second snr threshold, SIRUE is the signal to noise ratio of user terminal, divides signal to noise ratio into Three regions, 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 according to the subscriber channel condition information of described user terminal to be scheduled: to determine grouping situation under the described user terminal to be scheduled by signal to noise ratio; 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 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 respectively first group and the 3rd group, then select sudden and violent large C/I algorithm as the current scheduling algorithm;
If current user terminal to be scheduled belongs to respectively second group and the 3rd group, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to respectively first group and second group, 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 respectively first group, second group and the 3rd group, then utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.
Below in conjunction with table 1 and shown in Figure 5, describe the detailed process that the present embodiment is realized scheduling of resource in detail:
Step 501: the 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, namely wait user terminal to be scheduled to belong to first group and the 3rd group, channel quality between the user terminal differs larger, it is larger that modulation coding mode differs, cause the momentary rate difference between the user terminal very large, therefore for guaranteeing throughput of system, adopt maximum C/I algorithm as the current scheduling algorithm;
When (2) signal to noise ratio of user terminal is distributed in He San district, two districts, namely wait user terminal to be scheduled to belong 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, therefore 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, namely wait user terminal to be scheduled to belong 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 larger, therefore adopt polling algorithm as the current scheduling algorithm, guarantee user's fairness;
When (4) signal to noise ratio of user terminal was distributed in same zone, namely user terminal to be scheduled belonged to a group, therefore adopted the PF algorithm as the current scheduling algorithm, was intended to balance sysmte throughput and fairness;
(5) signal to noise ratio of user terminal all has distribution in three zones, namely 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 large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm 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 quality of service (QoS) request of this user terminal, for the traffic assignments of this user terminal high priority resource, but when the 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 according to the time cycle of setting, again press the subscriber channel condition information with the user terminal division group in the base station in the present embodiment.The user uses the priority of Radio Resource with the variation of 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 residential quarter is got a promotion.
Need to prove, adopt the number of threshold value different, cause the number of signal to noise ratio zoning also different, but be identical according to the thought that different groups is chosen corresponding dispatching algorithm, therefore repeat no more here.
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 for utilizing 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 less than the 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 greater than the 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 large regional poll strategy to adopt respectively maximum C/I algorithm, PF algorithm and polling algorithm 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 respectively first group and the 3rd group 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 respectively second group and the 3rd group, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to respectively first group and second group, 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 respectively first group, second group and the 3rd group, then utilize large regional poll strategy to adopt respectively maximum C/I algorithm, PF algorithm and polling algorithm 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 is relatively schematic diagram of four kinds of algorithm residential quarters of emulation average throughput, and Fig. 8 is relatively schematic diagram of four kinds of algorithm users of emulation receive data amount.Referring to Fig. 7 and shown in Figure 8, the dispatching algorithm based on the zone division 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 four kinds of algorithm user success receive data amount emulation schematic diagrames.Can find out that from Fig. 9 a～9d region partitioning algorithm is larger than the average throughput of other two kinds of algorithms.The data volume that all users receive in the residential quarter 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 residential quarter remain maximum C/I algorithm.But the dispatching algorithm of dividing based on the zone that can find out the embodiment of the invention has obtained preferably fairness.So simulation result shows, the dispatching algorithm of dividing based on the zone 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 different for active user's channel conditions, and selects different dispatching algorithms, and the priority of user terminal may change along with active user's channel conditions is different.When the user channel quality difference is larger, 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 large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.Can take into account certain fairness when therefore, the throughput of whole residential quarter 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 (8)
1. a resource regulating method is characterized in that, the 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 user channel quality of user terminal to be scheduled, comprising:
If the user channel quality difference is larger, then adopt maximum carrier wave/interference C/I algorithm as the current scheduling algorithm;
If user channel quality is all better, then adopt the repeating query algorithm as the current scheduling algorithm;
If user channel quality is all relatively poor, then adopt the fair PF algorithm of direct ratio as the current scheduling algorithm;
If the user channel quality of described user terminal to be scheduled is evenly distributed, then utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm;
Utilize described current scheduling algorithm that described user terminal to be scheduled is dispatched.
2. method according to claim 1 is characterized in that, in advance by in order to the subscriber channel condition information that characterizes user channel quality the user terminal in one base station being divided at least two groups; Then select the current scheduling algorithm according to the subscriber channel condition information of described user terminal to be scheduled, comprising:
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.
3. method according to claim 2, it is characterized in that, if the subscriber channel condition information is 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 respectively first group and the 3rd group, then select maximum C/I algorithm as the current scheduling algorithm;
If current user terminal to be scheduled belongs to respectively second group and the 3rd group, then select the PF algorithm as the current scheduling algorithm;
If current user terminal user to be scheduled belongs to respectively first group and second group, 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 respectively first group, second group and the 3rd group, then utilize large regional poll strategy to adopt respectively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.
4. each described method is characterized in that according to claim 1～3, and after described user terminal to be scheduled was dispatched, the method further comprised:
According to the time cycle of setting, again by in order to the subscriber channel condition information that characterizes user channel quality the user terminal in one base station being divided at least two groups.
5. 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 user channel quality of user terminal to be scheduled, comprising:
If the user channel quality difference is larger, then adopt maximum carrier wave/interference C/I algorithm as the current scheduling algorithm;
If user channel quality is all better, then adopt the repeating query algorithm as the current scheduling algorithm;
If user channel quality is all relatively poor, then adopt the fair PF algorithm of direct ratio as the current scheduling algorithm;
If the user channel quality of described user terminal to be scheduled is evenly distributed, then utilize large regional poll strategy to adopt successively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm;
Scheduling unit is used for utilizing described current scheduling algorithm that described user terminal to be scheduled is dispatched.
6. device according to claim 5 is characterized in that, described algorithm selected cell comprises:
The grouping determining unit is used for by determine grouping situation under the described user terminal to be scheduled in order to the subscriber channel condition information that characterizes user channel quality;
The algorithm determining unit is used for determining the current scheduling algorithm according to grouping situation under the described user terminal to be scheduled.
7. device according to claim 6, it is characterized in that, if the subscriber channel condition information is 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 respectively first group and the 3rd group 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 respectively second group and the 3rd group, then select the PF algorithm as the current scheduling algorithm; If current user terminal user to be scheduled belongs to respectively first group and second group, 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 respectively first group, second group and the 3rd group, then utilize large regional poll strategy to adopt respectively maximum C/I algorithm, PF algorithm and polling algorithm as the current scheduling algorithm.
8. each described device according to claim 5～7, it is characterized in that, described grouping determining unit was used for according to the time cycle of setting, by determine grouping situation under the described user terminal to be scheduled in order to the subscriber channel condition information that characterizes user channel quality.
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 CN101860916A (en) | 2010-10-13 |
| CN101860916B true 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) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457888B (en) * | 2010-10-18 | 2015-08-19 | 中兴通讯股份有限公司 | A kind of method of carrier wave indicator field grouping and device |
| CN102752763B (en) * | 2012-07-09 | 2014-07-23 | 北京北方烽火科技有限公司 | Realistic type proportional fair scheduling metric calculation method and device in LTE (Long Time Evolution) system |
| CN104581970B (en) * | 2014-12-05 | 2018-05-29 | 大唐移动通信设备有限公司 | A kind of self-adapting dispatching method and equipment |
| CN106998590B (en) * | 2015-12-28 | 2020-08-21 | 中国信息通信研究院 | Uplink resource 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 |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101026577A (en) * | 2007-01-19 | 2007-08-29 | 北京邮电大学 | Scheduling method for ensuring time delay stability of non-real-time business data packet for OFDMA system |
| CN101072085A (en) * | 2007-05-25 | 2007-11-14 | 华为技术有限公司 | Method and system for obtaining high-speed uplink packet scheduling capacity, and method and device for obtaining 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
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101026577A (en) * | 2007-01-19 | 2007-08-29 | 北京邮电大学 | Scheduling method for ensuring time delay stability of non-real-time business data packet for OFDMA system |
| CN101072085A (en) * | 2007-05-25 | 2007-11-14 | 华为技术有限公司 | Method and system for obtaining high-speed uplink packet scheduling capacity, and method and device for obtaining link effective data rate |
| CN101080032A (en) * | 2007-05-25 | 2007-11-28 | 华为技术有限公司 | A high-speed downlink packet access capacity estimation method and device |
Non-Patent Citations (1)
| Title |
|---|
| JP特开2008-306732A 2008.12.18 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101860916A (en) | 2010-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100555930C (en) | The channel establishing method of multi-carrier HSDPA and multi-carrier downlink group data transmission method | |
| CN103138890B (en) | The method and apparatus of the channel-quality feedback in wireless communication system is provided | |
| CN101341667B (en) | For transmitting and/or use the method and apparatus of transmission power information | |
| JP5054029B2 (en) | Method and apparatus for selecting between multiple dictionaries | |
| CN100566295C (en) | A kind of Packet Service scheduling method for wireless resource based on service quality guarantee | |
| CN101099311B (en) | Wireless communication system and method | |
| CN103313370B (en) | For the method and apparatus transmitted and/or use transmission power information | |
| CN101902817A (en) | Uplink radio resource dispatching method and device for wireless communication system | |
| CN101835161B (en) | Dynamic resource allocation method and equipment of multi-cell wireless communication system | |
| CN103874125A (en) | Methods and apparatus for flexible reporting of control information | |
| CN101860916B (en) | Resource scheduling method and device | |
| Cheng et al. | Joint carrier aggregation and packet scheduling in LTE-Advanced networks | |
| CN103260258A (en) | Resource distribution and resource reuse combination method in cellular terminal device-to-device (D2D) system | |
| CN101917769B (en) | Uplink resource allocation and scheduling method of OFDMA (Orthogonal Frequency Division Multiple Access) system based on 802.16m | |
| CN101345647A (en) | Channel establishing method for high speed ascending packet data transmission, and network controller | |
| CN101170809B (en) | Method, network entity and radio access system for realizing time delay compression | |
| 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 | |
| CN104602355B (en) | mixed service dispatching method in LTE system | |
| CN102291825B (en) | Method for allocating time slot resources | |
| CN101222730B (en) | CSIT collection method, cross-layer scheduling algorithm, and its system and equipment | |
| CN102123508B (en) | Time slot resource allocation method and device | |
| CN100536603C (en) | Mobile communication system scheduling method |
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 |