CN102647788B - Resource distribution method - Google Patents
Resource distribution method Download PDFInfo
- Publication number
- CN102647788B CN102647788B CN201110039634.4A CN201110039634A CN102647788B CN 102647788 B CN102647788 B CN 102647788B CN 201110039634 A CN201110039634 A CN 201110039634A CN 102647788 B CN102647788 B CN 102647788B
- Authority
- CN
- China
- Prior art keywords
- user
- deeply
- declines
- declining
- recover
- 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.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a resource distribution method. By tracking of the channel quality of a user, when the channel quality of the user is very bad, the resources are not distributed, and when the channel quality of the user becomes good from bad, more resources are distributed to the user preferentially. By adoption of the method disclosed by the invention, the maximization of system throughput and the fairness among users can be better considered.
Description
Technical field
The present invention relates to field of wireless communication, particularly a kind of resource allocation methods.
Background technology
Along with developing rapidly of mobile communication, the Radio Resource of air interface has become one of Main Bottleneck that moving-limiting communication system further develops, how Radio Resource reasonably being dispatched, configure, to be managed, is very important for maximized system capacity and As soon as possible Promising Policy system requirements.
In mobile communication system, there is multiple resources distribution method, three kinds of classical resource allocation methods for example: poll (RR) algorithm, maximum (Max) C/I, equitable proportion (PF) algorithm etc., these schemes, according to certain criterion, are given intrasystem user by time-frequency resource allocating constantly in each scheduling.
Below the general principles of these three kinds of algorithms is introduced: RR algorithm loops resource to intrasystem user and distributes.Max C/I algorithm select current scheduling constantly the maximum user of carrier/interface ratio (C/I) as the highest user of priority, allow more pre-empt resources of the better user of channel condition.PF algorithm considers that two factors of throughput of user's current scheduling moment channel quality and the past period acquisition decide the priority orders of user's minute resource simultaneously.
Yet, all there is defect in above-mentioned three kinds of methods, specifically: RR algorithm is not usingd the priority that the quality of user channel quality is distributed as resource, although PF algorithm is considered user's current scheduling channel quality constantly, but require not strict to user channel quality, when user channel quality, cross when poor, still can give these user resource allocations.Visible, when adopting RR algorithm or PF algorithm, all have the possibility to the user resource allocation of bad channel quality, and the user of bad channel quality is lower to the utilance of resource, can affect the performance of system, reduce throughput.And Max C/I algorithm is only considered user's channel quality, realized high resource utilization, promote entire system performance, but can be able to cause the poor user of some channel quality (as edge customer) to can not get resource always, distributed, made the fairness between user very poor.
Visible, resource allocation methods of the prior art cannot be taken into account the fairness between throughput of system maximization and user preferably.
Summary of the invention
In view of this, the invention provides a kind of resource allocation methods, can take into account preferably the fairness between throughput of system maximization and user.
For achieving the above object, technical scheme of the present invention is achieved in that
A resource allocation methods, the method comprises:
A, when each scheduling constantly starts, judge whether each user's channel quality is less than the first thresholding setting in advance, if be less than, by this user ID, be the user that deeply declines, if be more than or equal to, this user is considered as to the non-user that deeply declines;
B, judge in the non-user that deeply declines whether have the user with the user ID that deeply declines, if existed, the non-user that deeply declines with the user ID that deeply declines is considered as deeply declining and recovers user, then perform step C; If there is no, directly perform step F;
C, be the recovery user resource allocation that deeply declines;
D, judge that each declines deeply and recover the current service quality of user and whether reach service quality QoS requirements, for reaching deeply declining of qos requirement, recover user, perform step E; For reaching deeply declining of qos requirement, do not recover user, perform step F;
E, removal deeply decline and recover user's the user ID that deeply declines;
F, for except non-deeply the decline user resource allocation of recovery user that deeply decline.
Described judgement deeply declines and recovers the method whether current service quality of user reach service quality QoS requirements and be: whether the judgement current throughput of recovering user that deeply declines is more than or equal to qos requirement.
Described judgement deeply declines and recovers the method whether current service quality of user reach service quality QoS requirements and be: whether the judgement Packet Delay that recovers user that deeply declines is less than or equal to qos requirement.
The method of recovering user resource allocation described in step C for deeply declining is: when deeply declining, recover the current service quality of user when far away apart from qos requirement, many minutes resources; When the current service quality of recovery user that deeply declines is near apart from qos requirement, divide less resource.
The method of recovering user resource allocation described in step C for deeply declining is: when deeply declining, recover the current buffer memory of user when large, many minutes resources; When deeply declining, recover the current buffer memory hour of user, divide less resource.
Described in steps A, user's channel quality obtains by reporting of user; Or, by base station measurement, obtain.
Described in steps A, the criterion of user's channel quality is channel quality indicator (CQI) grade.
According to technical scheme provided by the present invention, by following the tracks of user's channel quality, when user channel quality is very poor, do not give its Resources allocation, it is preferential to its Resources allocation when user channel quality is improved by difference, and overabsorption resource, finally takes into account the fairness between throughput of system maximization and user preferably.
Accompanying drawing explanation
Fig. 1 is the flow chart of the embodiment of a kind of resource allocation methods provided by the present invention.
Embodiment
For making object of the present invention, technical scheme and advantage clearer, referring to the accompanying drawing embodiment that develops simultaneously, scheme of the present invention is described in further detail.
Core concept of the present invention is: by following the tracks of user's channel quality, when user channel quality is very poor, do not give its Resources allocation, preferential to its Resources allocation when user channel quality is improved by difference, and overabsorption resource, finally reach raising throughput of system, and improve the object of user fairness.
Fig. 1 is the flow chart of the embodiment of a kind of resource allocation methods provided by the present invention.As shown in Figure 1, the method comprises the following steps:
Step 101, when each scheduling starts constantly, judges whether each user's channel quality is less than the first thresholding setting in advance, if be less than, by this user ID, is the user that deeply declines, if be more than or equal to, this user is considered as to the non-user that deeply declines.
In this step, by the poor user ID of channel quality, be the user that deeply declines, remaining user is for regarding the non-user that deeply declines as, the numerical value of the first thresholding is concrete restriction not, determine according to the actual requirements, by changing the numerical values recited of the first thresholding, can reach the adjustability between throughput-maximized and fairness.
When more paying close attention to fairness, can the first thresholding be arranged littlely, when more paying close attention to when throughput-maximized, can the first thresholding be arranged more greatly.
Can illustrate this step: supposing the system comprises 5 users: user 1, user 2, user 3, user 4, user 5, when this scheduling starts constantly, judge whether user 1 channel quality is less than the first thresholding, judge CQI
1< CQI
thresholdwhether set up, if set up, user 1 is designated to the user that deeply declines, if be false, user 1 is considered as to the non-user that deeply declines, according to the method described above, successively user 2,3,4,5 is judged.Suppose that user 1,2 is for the user that deeply declines, user 3,4,5 is the non-user that deeply declines.
In step 101, user's channel quality can obtain by reporting of user or base station measurement.In addition, channel quality criterion can be indicated for channel quality (CQI) grade, but in actual applications, and be not only confined to this.
Step 102, judges in the non-user that deeply declines whether have the user with the user ID that deeply declines, if existed, the non-user that deeply declines with the user ID that deeply declines is considered as deeply declining and recovers user, then performs step 103; If there is no, directly perform step 106.
The recovery user that deeply declines refers to that current is the non-user that deeply declines, be that current channel quality is relatively good, but be once identified as in last or front several dispatching cycles the user that deeply declines, once channel quality is poor, visible, deeply decline and recover the user that user refers to that channel quality is improved by difference.
This step is illustrated, suppose that user 3,4 has the user ID that deeply declines in the non-user that deeply declines (user 3,4,5), user 3,4 recovers user for deeply declining.
Each is dispatched constantly, first carries out user's screening, if user's channel quality is poor, does not temporarily give this user resource allocation.Here consider if resource has been distributed to the very poor user of channel quality, very low owing to distributing to this user's resource utilization, in order to reach service quality (QoS) requirement, have ample resources and distribute to this user, can make entire system performance be affected, resource can not get efficient utilization, so temporarily do not give the user resource allocation that deeply declines, by the time user recovers from the environment that deeply declines, and system is preferentially carried out resource distribution to it, and overabsorption resource.
Step 103 is the recovery user resource allocation that deeply declines.
The method of recovering user resource allocation for deeply declining can adopt the content of prior art, is not construed as limiting herein, for example, can adopt PF algorithm of the prior art for the recovery user resource allocation that deeply declines.
In addition, when recovering user resource allocation for deeply declining, also can recover according to deeply declining user's present case overabsorption resource or few Resources allocation, for example, when deeply declining, recover the current service quality of user when distant apart from qos requirement, can many minutes some resources, or, when the current buffer memory of recovery user that deeply declines is larger, can many minutes some resources.
The example of following previous step, the implication of this step is: be user's 3,4 Resources allocation.
Step 104, judges whether each current service quality of recovery user that deeply declines reaches qos requirement, for reaching deeply declining of qos requirement, recovers user, performs step 105; For reaching deeply declining of qos requirement, do not recover user, perform step 106.
In this step, the criterion whether described current service quality of recovery user that deeply declines reaches qos requirement may be diversified, for example, whether the current throughput of recovering user that deeply declines is more than or equal to qos requirement, or whether the recovery user's that deeply declines Packet Delay is less than or equal to qos requirement.
Step 105, removing declines deeply recovers user's the user ID that deeply declines.
After being assumed to be user's 3,4 Resources allocation, if the current service quality of user 3 has reached qos requirement, remove user 3 the user ID that deeply declines, if the current service quality of user 4 does not reach qos requirement, perform step 106.
Step 106 is the non-user resource allocation that deeply declines except the recovery user that deeply declines.
Follow above-mentioned example and illustrate, in step 101, the determined non-user that deeply declines is user 3,4,5, and in step 102, the determined recovery user that deeply declines is user 3,4, and the non-user that deeply declines except the recovery user that deeply declines is user 5.
The content that can adopt prior art for recover the method for the non-user resource allocation that deeply declines user except deeply declining is not construed as limiting herein, for example, can adopt PF algorithm of the prior art for the non-user resource allocation that deeply declines except the recovery user that deeply declines.
Deeply decline and recover after the complete resource of user assignment, if also have surplus resources, according to predetermined rule, carry out prioritization to the good user of other channel qualities, then according to the priority of discharging, these users are carried out to resource distribution.And, when deeply declining, recover user and reach after certain qos requirement, no longer enjoy the priority of priority allocation resource and many minutes resources.
So far, this flow process finishes.
To sum up, in the present invention, by following the tracks of user's channel quality, when user channel quality is very poor, do not give its Resources allocation, it is preferential to its Resources allocation when user channel quality is improved by difference, and overabsorption resource, finally takes into account the fairness between throughput of system maximization and user preferably.
The above, be only preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (5)
1. a resource allocation methods, is characterized in that, the method comprises:
A, when each scheduling constantly starts, judge whether each user's channel quality is less than the first thresholding setting in advance, if be less than, by this user ID, be the user that deeply declines, if be more than or equal to, this user is considered as to the non-user that deeply declines;
B, judge in the non-user that deeply declines whether have the user with the user ID that deeply declines, if existed, the non-user that deeply declines with the user ID that deeply declines is considered as deeply declining and recovers user, then perform step C; If there is no, directly perform step F;
C, be the recovery user resource allocation that deeply declines;
D, judge that each declines deeply and recover the current service quality of user and whether reach service quality QoS requirements, for reaching deeply declining of qos requirement, recover user, perform step E; For reaching deeply declining of qos requirement, do not recover user, perform step F;
E, removal deeply decline and recover user's the user ID that deeply declines;
F, for except non-deeply the decline user resource allocation of recovery user that deeply decline;
The method of recovering user resource allocation described in step C for deeply declining is: when deeply declining, recover the current service quality of user when far away apart from qos requirement, many minutes resources; When the current service quality of recovery user that deeply declines is near apart from qos requirement, divide less resource;
Or,
The method of recovering user resource allocation described in step C for deeply declining is: when deeply declining, recover the current buffer memory of user when large, many minutes resources; When deeply declining, recover the current buffer memory hour of user, divide less resource.
2. method according to claim 1, is characterized in that, described judgement deeply declines and recovers the method whether current service quality of user reach service quality QoS requirements and be: whether the judgement current throughput of recovering user that deeply declines is more than or equal to qos requirement.
3. method according to claim 1, is characterized in that, described judgement deeply declines and recovers the method whether current service quality of user reach service quality QoS requirements and be: whether the judgement Packet Delay that recovers user that deeply declines is less than or equal to qos requirement.
4. method according to claim 1, is characterized in that, user's channel quality obtains by reporting of user described in steps A; Or, by base station measurement, obtain.
5. method according to claim 1, is characterized in that, the criterion of user's channel quality is channel quality indicator (CQI) grade described in steps A.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110039634.4A CN102647788B (en) | 2011-02-17 | 2011-02-17 | Resource distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110039634.4A CN102647788B (en) | 2011-02-17 | 2011-02-17 | Resource distribution method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102647788A CN102647788A (en) | 2012-08-22 |
| CN102647788B true CN102647788B (en) | 2014-10-22 |
Family
ID=46660318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110039634.4A Expired - Fee Related CN102647788B (en) | 2011-02-17 | 2011-02-17 | Resource distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102647788B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1879422A2 (en) * | 2006-07-11 | 2008-01-16 | Fujitsu Ltd. | Scheduler, radio base station apparatus including the scheduler and scheduling method |
| CN101286971A (en) * | 2008-05-30 | 2008-10-15 | 北京北方烽火科技有限公司 | System and method for adaptive frame length control in OFDM system |
| CN101483927A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Method and apparatus for detecting wireless link failure, and reducing failure loss of wireless link |
-
2011
- 2011-02-17 CN CN201110039634.4A patent/CN102647788B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1879422A2 (en) * | 2006-07-11 | 2008-01-16 | Fujitsu Ltd. | Scheduler, radio base station apparatus including the scheduler and scheduling method |
| CN101483927A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Method and apparatus for detecting wireless link failure, and reducing failure loss of wireless link |
| CN101286971A (en) * | 2008-05-30 | 2008-10-15 | 北京北方烽火科技有限公司 | System and method for adaptive frame length control in OFDM system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102647788A (en) | 2012-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102415034B (en) | Uplink radio resource allocation in the presence of power limited users | |
| CN102448147A (en) | Method and device for accessing wireless service | |
| CN105813218A (en) | Service scheduling method of wireless Ad hoc network | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| CN102594663A (en) | Queue scheduling method and device | |
| CN108260160A (en) | Dispatch the method and system of user | |
| CN102076097B (en) | Resource scheduling method and base station | |
| CN105554886A (en) | Method and device for resource scheduling | |
| CN102387586B (en) | TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) system-based resource allocation method | |
| CN111356244A (en) | Resource allocation method and device | |
| CN105873128B (en) | A kind of LTE fairness dispatching method based on delay sensitive | |
| CN102647788B (en) | Resource distribution method | |
| CN102984717A (en) | Method and system for system capacity estimation | |
| WO2013044468A1 (en) | Scheduling and allocation method and device in coordinated multiple point system | |
| KR20120041899A (en) | Apparatus and method for scheduling in wireless communication system | |
| CN103139780B (en) | inter-cell interference coordination method and device | |
| CN102469524B (en) | Method, terminal, equipment and system for realizing carrier load balance | |
| US8705494B2 (en) | WiMAX scheduling algorithm for co-located WiFi and WiMAX central points | |
| CN108419271A (en) | A kind of car networking resource allocation methods | |
| CN104010374B (en) | A kind of method and device carrying out traffic scheduling | |
| CN101715235B (en) | Method for allocating resources and scheduling downlink of LTE FDD system | |
| CN108541067B (en) | Resource scheduling method and device | |
| EP3466169B1 (en) | Method and apparatus for frequency selective scheduling in ofdma based wlans | |
| CN105992381B (en) | A kind of dispatching method | |
| CN102480734B (en) | Time-frequency resource distributing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHINA POTEVIO CO., LTD. Free format text: FORMER OWNER: PUTIAN IT TECH INST CO., LTD. Effective date: 20130912 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20130912 Address after: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant after: China Potevio Information Industry Co., Ltd. Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant before: Putian IT Tech Inst Co., Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: PUTIAN IT TECH INST CO., LTD. Free format text: FORMER OWNER: CHINA POTEVIO CO., LTD. Effective date: 20131128 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20131128 Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant after: Putian IT Tech Inst Co., Ltd. Address before: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant before: China Potevio Information Industry Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141022 Termination date: 20210217 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |