CN106162738B - Control plane resource regulating method and device - Google Patents
Control plane resource regulating method and device Download PDFInfo
- Publication number
- CN106162738B CN106162738B CN201610860919.7A CN201610860919A CN106162738B CN 106162738 B CN106162738 B CN 106162738B CN 201610860919 A CN201610860919 A CN 201610860919A CN 106162738 B CN106162738 B CN 106162738B
- Authority
- CN
- China
- Prior art keywords
- user
- scheduling
- scheduling request
- queue
- service queue
- 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
- 238000000034 method Methods 0.000 title claims abstract description 45
- 230000001105 regulatory effect Effects 0.000 title claims abstract description 11
- 238000004364 calculation method Methods 0.000 claims 2
- 230000008569 process Effects 0.000 abstract description 18
- 238000000926 separation method Methods 0.000 abstract description 9
- 238000001514 detection method Methods 0.000 abstract description 8
- 230000007246 mechanism Effects 0.000 abstract description 5
- 238000011144 upstream manufacturing Methods 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000002452 interceptive effect Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 240000007594 Oryza sativa Species 0.000 description 1
- 235000007164 Oryza sativa Nutrition 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000021186 dishes Nutrition 0.000 description 1
- 238000012812 general test Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 235000009566 rice Nutrition 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
- H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Abstract
The present invention relates to a kind of control plane resource regulating method and devices, this method comprises: obtaining scheduling request；The corresponding user of scheduling request is put into service queue；In corresponding scheduling instance, using preset dispatching algorithm, scheduling of resource is carried out according to the user in service queue；According to scheduling result, the user that scheduling is completed is deleted from service queue, and is put into idle queues.By using the mechanism of service queue and idle queues separation management, user's separation management that the user for having dispatching requirement and dispatching requirement are completed, it only needs to detect user in service queue in scheduling process, it avoids detection online and dispatches the expense of the user finished, greatly improve control plane dispatching.
Description
Technical field
The present invention relates to wireless communication fields, more particularly to a kind of control plane resource regulating method and device.
Background technique
With the development that mobile interchange is applied, the OTT such as mobile real-time communication be widely used it is universal, due to mobile real-time communication
Software shows data and transmits discontinuous but there is the demand for frequently sending data, causes initially to connect to reduce frequently to send
Enter the problems such as pressure is excessive, overcomes the problems, such as this using elongating terminal lock-out and determine duration in current mobile communications network, i.e.,
So that terminal, after completing data transmission, if the transmission of next data is within the scope of lock-out duration, then terminal can directly be sent out
Data are sent, without re-executing access procedure, great amount of terminals are effectively overcome to frequently access cause to eat dishes without rice or wine side and core lateral pressure mistake
Big problem.
However, there are a features by user to be scheduled, that is, actually has tune after the lock-out duration for elongating terminal
The number of users of degree demand is constant, but data dispatch finishes and user that lock-out duration is also less than, still in user team to be dispatched
In column, cause scheduling process that the number of users to be dispatched detected is needed to increase sharply at double.Scheduling process need to detect in lock-out duration
All accessing users, in turn result in control plane (media access control layer control plane) scheduling pressure it is big.
Summary of the invention
Based on this, it is necessary to for the device for the control plane resource regulating method for reducing scheduling pressure.
A kind of control plane resource regulating method, comprising:
Obtain scheduling request；
The corresponding user of the scheduling request is put into service queue；
In corresponding scheduling instance, using preset dispatching algorithm, resource is carried out according to the user in the service queue
Scheduling；
According to scheduling result, the user that scheduling is completed is deleted from the service queue, and is put into idle queues.
In one of the embodiments, further include:
Lock-out judgement is carried out to the user in the idle queues；
If the not sent scheduling request in preset duration of the user in the idle queues, by the user from the sky
It is deleted in not busy queue.
It is described in one of the embodiments, that the corresponding user of the scheduling request is put into the step in service queue
Are as follows:
When the scheduling request got is the scheduling request of new user, corresponding user is added to service queue；Or
When the scheduling request got is the scheduling request of the user in idle queues, corresponding user is added to industry
Business queue.
In one of the embodiments, the acquisition scheduling request the step of before, further includes:
Establish service queue and idle queues.
In one of the embodiments, the preset dispatching algorithm include ratio be averaged dispatching algorithm, QoS scheduling calculate
Any one in method, max carrier to interference algorithm and polling dispatching algorithm.
A kind of control plane resource scheduling device, comprising:
Module is obtained, for obtaining scheduling request；
Queue management module, for the corresponding user of the scheduling request to be put into service queue；
Scheduler module is used in corresponding scheduling instance, using preset dispatching algorithm, according in the service queue
User carries out scheduling of resource；
The queue management module is also used to according to scheduling result, and the user that scheduling is completed is from the service queue
It deletes, and is put into idle queues.
In one of the embodiments, further include:
Lock-out determination module, for carrying out lock-out judgement to the user in the idle queues；
The queue management module is used to determine the user in the idle queues pre- in the lock-out determination module
If in duration when not sent scheduling request, the user is deleted from the idle queues.
The queue management module in one of the embodiments, for being new user's when the scheduling request got
When scheduling request, corresponding user is added to service queue；Or when the scheduling request got is the user in idle queues
Scheduling request when, corresponding user is added to service queue.
The queue management module in one of the embodiments, is also used to obtain scheduling request in the acquisition module
Before, service queue and idle queues are established.
In one of the embodiments, the preset dispatching algorithm include ratio be averaged dispatching algorithm, QoS scheduling calculate
Any one in method, max carrier to interference algorithm and polling dispatching algorithm.
Above-mentioned control plane resource regulating method will have the user of dispatching requirement to be put into service queue, and to business team
User in column carries out scheduling of resource using preset dispatching algorithm, and the user that dispatching requirement is completed is put into idle queues.It is logical
The mechanism using service queue and idle queues separation management is crossed, the user that the user for having dispatching requirement and dispatching requirement are completed
Separation management only needs to detect user in service queue in scheduling process, avoids detection online and scheduling finishes
User expense, greatly improve control plane dispatching.
Detailed description of the invention
Fig. 1 is the flow chart of the control plane resource regulating method of one embodiment；
Fig. 2 is the control plane scheduling process schematic diagram of one embodiment；
Fig. 3 is the structural schematic diagram of the control plane resource scheduling device of one embodiment；
Fig. 4 is the structural schematic diagram of the control plane resource scheduling device of another embodiment.
Specific embodiment
In one embodiment, a kind of control plane resource regulating method is provided, this method is executed by base station, as shown in Figure 1,
Specifically includes the following steps:
S102: scheduling request is obtained.
Scheduling request in the present embodiment include the scheduling request that is sent in its lock-out duration of the user accessed and
The scheduling request that new user generates in access procedure.Scheduling request is divided into uplink scheduling request and descending scheduling request.
S104: the corresponding user of scheduling request is put into service queue.
S106: in corresponding scheduling instance, using preset dispatching algorithm, resource is carried out according to the user in service queue
Scheduling.
In the present embodiment, preset dispatching algorithm includes that ratio is averaged dispatching algorithm, QoS dispatching algorithm, max carrier to interference
Any one in algorithm and polling dispatching algorithm.
Wherein, the basic thought of polling dispatching algorithm is exactly to think that the dispatching priority of all users in cell is all equal
, all users are periodically scheduled, and it is identical to guarantee that each user is adjusted probability.Such as have 3 users in cell, it uses
The scheduler of polling algorithm does not take into account that the location of each user and situation scheduled before, only simply according to
Some dispatching sequence fixed, as user 1, user 2, user 3, user 1, user 2, user 3 ... periodically dispatch each
User.Therefore polling algorithm is that a kind of typically pursue discloses maximized dispatching algorithm, is implemented fairly simple.
The basic thought of max carrier to interference algorithm be in each scheduling instance, scheduler can to need to be dispatched user into
The sequence of row carrier/interface ratio, the user that then scheduler can select channel quality best are scheduled, and guarantee system so always can
It is enough dispatched to best user, guarantees the maximization of system performance, resource utilization highest.As it can be seen that max carrier to interference algorithm is
A kind of maximized dispatching algorithm of pursuit system performance, it is within dispatching cycle that all resource fairy maidens lake is best to signal quality
Terminal guarantees that throughput of system can achieve maximum value.
Proportional fair scheduling while meeting the high-speed data service demand of the preferable terminal of channel quality as far as possible,
Also the usage experience of the bad terminal of giving consideration to channel quality condition, the basic thought of the algorithm consider instantaneous speed when being selection user
The ratio of rate and long-term Mean Speed, while different user is adjusted using weighted value, reach and combines system performance
With the purpose of user experience.
QoS (Quality of Service, service quality) dispatching algorithm is by controlling different types of grouping to link
The use of bandwidth makes different data flows obtain different grades of service, including fifo queue, strict priority scheduling are calculated
Method, general test paper-generating model algorithm and weighted fair queuing algorithm etc..
The dispatching algorithm of budget be it is of the above any one.
S108: according to scheduling result, the user that scheduling is completed is deleted from service queue, and be put into idle queues.
In the present embodiment, there is the user of dispatching requirement to be put into service queue, and to the user in service queue using pre-
If dispatching algorithm carry out scheduling of resource, dispatching requirement complete user be put into idle queues.By using service queue with
The mechanism of idle queues separation management, user's separation management that the user for having dispatching requirement and dispatching requirement are completed, is being dispatched
It only needs to detect user in service queue in the process, avoid detection online and dispatches the expense of the user finished, greatly
Control plane dispatching is improved greatly.
In another embodiment, further comprising the steps of:
Step 1: lock-out judgement is carried out to the user in idle queues.
Step 2: if the not sent scheduling request in preset duration of the user in idle queues, by user from idle queues
Middle deletion.
Since the user in service queue is after completing dispatching requirement, it can be deleted from service queue, be placed into the free time
In queue, thus the lock-out of the present embodiment determines that the user just for idle queues carries out.If the user in the queue of space exists
Not sent scheduling request in preset duration, then delete user from idle queues.To complete lock-out judgement.Also, by
Determine in lock-out just for the user in idle queues, without carrying out lock-out judgement to whole users of access, to mention
High judgement efficiency.
In another embodiment, step S104 includes:
When the scheduling request got is the scheduling request of new user, corresponding user is added to service queue；Or
When the scheduling request got is the scheduling request of the user in idle queues, corresponding user is added to industry
Business queue.
That is, scheduling request include the scheduling request that new user generates in access procedure and accessed be located at idle queues
The scheduling request that middle user generates.
In another embodiment, it before step S102, further comprises the steps of: and establishes service queue and idle queues.
The service queue of foundation is used to be put into the user of dispatching requirement, and idle queues are used to be put into dispatching requirement completion
User.
In another embodiment, which can be with are as follows: establishes uplink service queue, uplink idle queues, lower industry
Business queue and downlink business queue.
In this embodiment, uplink service queue is used to be put into upstream scheduling process the user for having dispatching requirement, on
Row idle queues are used to be put into the user that dispatching requirement is completed in upstream scheduling process, and downlink business queue is for being put into downlink tune
There is the user of dispatching requirement during degree, downlink idle queues are used to be put into the use of dispatching requirement completion during descending scheduling
Family.
It is understood that in this embodiment, the processing of subsequent scheduling request should be according to the class of scheduling request
Type is put into corresponding queue for example, belonging to the demand of upstream scheduling process or descending scheduling process.For example, step
S104 are as follows: determine the type of scheduling request according to scheduling request, and the corresponding user of scheduling request is put into corresponding upper industry
It is engaged in queue or downlink business queue.In another example step S108 are as follows: according to scheduling result, user that scheduling is completed is from correspondence
Uplink service queue or downlink business queue in delete, and be put into corresponding uplink idle queues or downlink idle queues.
In another example carrying out lock-out judgement to the user in column to uplink idle queues and downlink free time, other queue processings are similar,
Details are not described herein.
This implementation by establishing idle queues and service queue, the idle queues and uplink of uplink to uplink and downlink scheduling respectively
Service queue management upstream scheduling process in scheduling request user, the idle queues of downlink and the service queue pipe of downlink
The user of the scheduling request during descending scheduling is managed, so as to avoid interfering with each other for uplink and downlink data, also, uplink and downlink
Scheduling data are separately managed, and convenient for carrying out needing to adjust according to the actual situation to uplink and downlink data, adaptability is good.
In the following, control plane resource regulating method of the invention is described in detail in conjunction with specific embodiment.
Include in the present embodiment three users, be followed successively by user 0, user 1, user 2, when user's lock-out a length of (T3-
T0), if from fig. 2 it can be seen that after user completes scheduling, just user is discharged, then Fig. 2 according to prior art
In from the T0 moment to T3 this period at moment, can be discharged repeatedly due to three users then and have dispatching requirement and initiate to connect at random
Enter, and T0 to T3 is caused 12 initial access processing to have occurred in total this period, therefore, in order to reduce random access frequency,
Reducing user has frequent transmission demand to lead to problems such as initial access pressure excessive, when in current mobile communications network lock-out
Between be set as (T3-T0), at this time as can be seen that user 0 is after the T0 moment is initially accessed, other 3 times before the T3 moment
Scheduling request is effectively reduced system and is initially accessed pressure, likewise, user 1 exists then without being initially accessed and can be dispatched
The T1 moment completes after being initially accessed, and for subsequent scheduling request three times without being initially accessed, user 2 is also subsequent to complete at the T2 moment
After initial access, subsequent scheduling request three times is without being initially accessed, therefore, using the lock-out duration decision gate for elongating user
It is initially accessed number after limit, in Fig. 2 to be reduced to 3 times by original 12 times, user, which is effectively reduced, has frequent transmission demand to cause just
The problems such as beginning cut-in pressure is excessive.
Correspondingly, since the lock-out time decision threshold of user is elongated, in T0 to T3 this period, three
User is all in synchronous regime, that is to say, that each scheduling instance must detect the scheduling of 3 users according to prior art way
Request then just can determine that scheduling result, in this way certainly will be due to not having actual schedule demand and in the user of synchronous regime
The expense of detection is caused to scheduling process, and then dispatching efficiency is caused to decline, in intensive overlay area, since number is more,
This influence is difficult to bear.
In order to solve this problem, novelty of the present invention proposes queue and is in charge of scheme, i.e., first creates two queues, one is
Service queue (correspondence does not dispatch the user finished also), one is idle queues (the corresponding current scheduled user finished), T0
Moment is added to service queue, and complete to dispatch, user 0 is then moved on to idle queues after user 0 is initially accessed.When T1
It carves, user 1 completes after being initially accessed, and is added to service queue, although user 0 is in synchronous regime at this time, when due to T0
It has determined that its current scheduling demand is scheduled quarter and finishes and move on to idle queues, therefore the T1 moment is without going to detect user 0
No to have dispatching requirement, the T1 moment need to only detect only user 1 in service queue, so that it may realize scheduling, be effectively reduced meaningless
Detection overhead.Likewise, scheduler module is user 1 from business team after the T1 moment completes the dispatching requirement scheduling of user 1
Column move on to idle queues；T2 moment, user 2 complete after being initially accessed, and are added to service queue, although user 0, user 1 at this time
Idle queues are moved in synchronous regime, but since user 0,1 current scheduling of user request scheduled finish,
The T2 moment need to only detect only user 2 in service queue, so that it may realize scheduling, meaningless detection overhead is effectively reduced.According to
It is secondary to analogize, so that the scheduling at subsequent each moment is completed, when residence time is greater than lock-out to certain user in idle queues
It is long, then directly delete the user.
Therefore, in the case where elongating the reduction of user's lock-out duration and being initially accessed the application model of pressure, using side of the invention
Method, by introducing the mechanism of service queue and idle queues separation management, avoiding detection online and dispatching the user finished
The expense of state greatly improves control plane dispatching, effectively adapts to the application demand for elongating user's lock-out duration.
In one embodiment, a kind of control plane resource scheduling device is provided, as shown in Figure 3, comprising:
Module 302 is obtained, for obtaining scheduling request.
Scheduling request in the present embodiment include the scheduling request that is sent in its lock-out duration of the user accessed and
The scheduling request that new user generates in access procedure.Scheduling request is divided into uplink scheduling request and descending scheduling request.
Queue management module 304, for the corresponding user of scheduling request to be put into service queue.
Scheduler module 306 is used in corresponding scheduling instance, using preset dispatching algorithm, according in service queue
User carries out scheduling of resource.
In the present embodiment, preset dispatching algorithm includes that ratio is averaged dispatching algorithm, QoS dispatching algorithm, max carrier to interference
Any one in algorithm and polling dispatching algorithm.
Queue management module is also used to be deleted the user that scheduling is completed from service queue, and put according to scheduling result
Enter in idle queues.
In the present embodiment, there is the user of dispatching requirement to be put into service queue, and to the user in service queue using pre-
If dispatching algorithm carry out scheduling of resource, dispatching requirement complete user be put into idle queues.By using service queue with
The mechanism of idle queues separation management, user's separation management that the user for having dispatching requirement and dispatching requirement are completed, is being dispatched
It only needs to detect user in service queue in the process, avoid detection online and dispatches the expense of the user finished, greatly
Control plane dispatching is improved greatly.
In another embodiment, as shown in figure 4, control plane resource scheduling device further includes lock-out determination module 308.
Lock-out determination module 308, for carrying out lock-out judgement to the user in idle queues.
Queue management module 304 in lock-out determination module for determining the user in idle queues in preset duration not
When sending scheduling request, user is deleted from idle queues.
Since the user in service queue is after completing dispatching requirement, it can be deleted from service queue, be placed into the free time
In queue, thus the lock-out of the present embodiment determines that the user just for idle queues carries out.If the user in the queue of space exists
Not sent scheduling request in preset duration, then delete user from idle queues.To complete lock-out judgement.Also, by
Determine in lock-out just for the user in idle queues, without carrying out lock-out judgement to whole users of access, to mention
High judgement efficiency.
In another embodiment, queue management module 304, for when the scheduling that the scheduling request got is new user
When request, corresponding user is added to service queue；Or when the tune that the scheduling request got is the user in idle queues
When degree request, corresponding user is added to service queue.
In another embodiment, queue management module 304 are also used to before obtaining module and obtaining scheduling request, build
Vertical service queue and idle queues.
The service queue of foundation is used to be put into the user of dispatching requirement, and idle queues are used to be put into dispatching requirement completion
User.
In another embodiment, queue management module 304, for establish uplink service queue, uplink idle queues, under
Row service queue and downlink business queue.
In this embodiment, uplink service queue is used to be put into upstream scheduling process the user for having dispatching requirement, on
Row idle queues are used to be put into the user that dispatching requirement is completed in upstream scheduling process, and downlink business queue is for being put into downlink tune
There is the user of dispatching requirement during degree, downlink idle queues are used to be put into the use of dispatching requirement completion during descending scheduling
Family.
It is understood that in this embodiment, the processing of subsequent scheduling request should be according to the class of scheduling request
Type is put into corresponding queue for example, belonging to the demand of upstream scheduling process or descending scheduling process.For example, queue pipe
Reason module 304 is used to determine the type of scheduling request according to scheduling request, and the corresponding user of scheduling request is put into corresponding
In uplink service queue or downlink business queue.In another example queue management module 304 completes scheduling according to scheduling result
User deletes from corresponding uplink service queue or downlink business queue, and is put into corresponding uplink idle queues or downlink sky
In not busy queue.In another example carrying out lock-out judgement, other queues to the user in column to uplink idle queues and downlink free time
Handle similar, details are not described herein.
This implementation by establishing idle queues and service queue, the idle queues and uplink of uplink to uplink and downlink scheduling respectively
Service queue management upstream scheduling process in scheduling request user, the idle queues of downlink and the service queue pipe of downlink
The user of the scheduling request during descending scheduling is managed, so as to avoid interfering with each other for uplink and downlink data, also, uplink and downlink
Scheduling data are separately managed, and convenient for carrying out needing to adjust according to the actual situation to uplink and downlink data, adaptability is good.
Each technical characteristic of embodiment described above can be combined arbitrarily, for simplicity of description, not to above-mentioned reality
It applies all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, all should be considered as described in this specification.
The embodiments described above only express several embodiments of the present invention, and the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to protection of the invention
Range.Therefore, the scope of protection of the patent of the invention shall be subject to the appended claims.
Claims (8)
1. a kind of control plane resource regulating method characterized by comprising
Obtain scheduling request；
The corresponding user of the scheduling request is put into service queue；
In corresponding scheduling instance, using preset dispatching algorithm, scheduling of resource is carried out according to the user in the service queue；
According to scheduling result, the user that scheduling is completed is deleted from the service queue, and is put into idle queues；
To in the idle queues user carry out lock-out judgement, if the user in the idle queues in preset duration not
Scheduling request is sent, then is deleted the user from the idle queues.
2. the method according to claim 1, wherein described be put into business for the corresponding user of the scheduling request
Step in queue are as follows:
When the scheduling request got is the scheduling request of new user, corresponding user is added to service queue；Or
When the scheduling request got is the scheduling request of the user in idle queues, corresponding user is added to business team
Column.
3. the method according to claim 1, wherein before the acquisition scheduling request the step of, further includes:
Establish service queue and idle queues.
4. the method according to claim 1, wherein the preset dispatching algorithm includes that ratio averagely dispatches calculation
Any one in method, QoS dispatching algorithm, max carrier to interference algorithm and polling dispatching algorithm.
5. a kind of control plane resource scheduling device characterized by comprising
Module is obtained, for obtaining scheduling request；
Queue management module, for the corresponding user of the scheduling request to be put into service queue；
Scheduler module is used in corresponding scheduling instance, using preset dispatching algorithm, according to the user in the service queue
Carry out scheduling of resource；
The queue management module is also used to be deleted the user that scheduling is completed from the service queue according to scheduling result,
And it is put into idle queues；
Lock-out determination module, for carrying out lock-out judgement to the user in the idle queues；
The queue management module is used to determine the user in the idle queues when default in the lock-out determination module
In long when not sent scheduling request, the user is deleted from the idle queues.
6. device according to claim 5, which is characterized in that the queue management module, for when the scheduling got
When request is the scheduling request of new user, corresponding user is added to service queue；Or when the scheduling request got is sky
When the scheduling request of the user in not busy queue, corresponding user is added to service queue.
7. device according to claim 5, which is characterized in that the queue management module is also used in the acquisition mould
Before block obtains scheduling request, service queue and idle queues are established.
8. device according to claim 5, which is characterized in that the preset dispatching algorithm includes that ratio averagely dispatches calculation
Any one in method, QoS dispatching algorithm, max carrier to interference algorithm and polling dispatching algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610860919.7A CN106162738B (en) | 2016-09-27 | 2016-09-27 | Control plane resource regulating method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610860919.7A CN106162738B (en) | 2016-09-27 | 2016-09-27 | Control plane resource regulating method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106162738A CN106162738A (en) | 2016-11-23 |
| CN106162738B true CN106162738B (en) | 2019-09-17 |
Family
ID=57341294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610860919.7A Expired - Fee Related CN106162738B (en) | 2016-09-27 | 2016-09-27 | Control plane resource regulating method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106162738B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447943A (en) * | 2008-12-26 | 2009-06-03 | 杭州华三通信技术有限公司 | Queue scheduling system and method |
| CN102394931A (en) * | 2011-11-04 | 2012-03-28 | 北京邮电大学 | Cloud-based user visit request scheduling method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090007132A1 (en) * | 2003-10-03 | 2009-01-01 | International Business Machines Corporation | Managing processing resources in a distributed computing environment |
| CN101610551B (en) * | 2008-06-20 | 2011-12-07 | 普天信息技术研究院有限公司 | Resource scheduling method for HSUPA |
| US9671779B2 (en) * | 2013-03-15 | 2017-06-06 | Applied Materials, Inc. | Method and system for filtering lot schedules using a previous schedule |
-
2016
- 2016-09-27 CN CN201610860919.7A patent/CN106162738B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447943A (en) * | 2008-12-26 | 2009-06-03 | 杭州华三通信技术有限公司 | Queue scheduling system and method |
| CN102394931A (en) * | 2011-11-04 | 2012-03-28 | 北京邮电大学 | Cloud-based user visit request scheduling method |
Non-Patent Citations (2)
| Title |
|---|
| A QoS-Aware and Fair Resource Allocation Scheme for WPANs;Xueli An,Ramin Hekmat;《 2009 6th IEEE Consumer Communications and Networking Conference》;20090113;1-5 |
| 网络控制系统动态调度策略研究;梅志慧;《中国知网 中国优秀硕士学位论文全文数据库（电子期刊）信息技术辑》;20160315;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106162738A (en) | 2016-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102104974B (en) | Method, device and system for carrying out uplink pre-scheduling processing | |
| CN110248417B (en) | Resource allocation method and system for communication service in power Internet of things | |
| CN103068054A (en) | Controllable super-speed wireless local area network channel access method based on time delay | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| CN101730236A (en) | Resource scheduling method and system, base station and terminal therefor | |
| CN101600231A (en) | In packet scheduling, determine the method and system of the priority of subscriber equipment | |
| CN101340390A (en) | Scheduling apparatus and method for real-time service | |
| US20100208665A1 (en) | Setting token bucket parameters for scheduling of air-interface resources | |
| CN102098792B (en) | Service quality-based resource round-robin scheduling method | |
| CN104619034B (en) | Towards the grouping scheduling method of real time business in a kind of LTE communication system | |
| US20070025289A1 (en) | Method and apparatus to provide air time fairness in multiple physical transmission rate wireless systems | |
| CN113079577A (en) | Resource allocation method based on coexistence scene of EMBB and URLLC | |
| CN106572497A (en) | Heuristic D2D resource allocation method based on proportional-fair algorithm | |
| CN101400137B (en) | User equipment scheduling method and device | |
| CN100440871C (en) | Packet scheduling method and device for wireless communication system | |
| US20210274359A1 (en) | Capacity planning method and apparatus | |
| CN107197530A (en) | The downlink resource allocation algorithm that the fluctuation of LTE system lower channel is perceived | |
| CN103747432B (en) | Carrying out uplink pre-scheduling processing method, device and system | |
| CN106162738B (en) | Control plane resource regulating method and device | |
| CN110602747A (en) | Method for scheduling wide-band and narrow-band mixed service channel resources of power wireless communication system | |
| CN106060945A (en) | LTE resource scheduling algorithm based on RB feedback | |
| CN106060952B (en) | LTE dispatching method based on loaded self-adaptive | |
| CN105517178A (en) | Scheduling method for adjustable low-complexity wireless resource scheduler | |
| CN102457973B (en) | GBR (Guaranteed BitRate) service scheduling method | |
| CN101431802B (en) | Data transmission method, network node and network system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180223 Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: COMBA TELECOM SYSTEMS (CHINA) Ltd. Applicant after: COMBA TELECOM SYSTEMS (GUANGZHOU) Ltd. Applicant after: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. Applicant after: TIANJIN COMBA TELECOM SYSTEMS Ltd. Address before: 510663 Guangdong city of Guangzhou province Guangzhou economic and Technological Development Zone Jinbi Road No. 6 Applicant before: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200108 Address after: 510663 Shenzhou Road, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangdong, 10 Patentee after: COMBA TELECOM SYSTEMS (CHINA) Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Co-patentee before: COMBA TELECOM SYSTEMS (GUANGZHOU) Ltd. Patentee before: COMBA TELECOM SYSTEMS (CHINA) Ltd. Co-patentee before: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. Co-patentee before: TIANJIN COMBA TELECOM SYSTEMS Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 510663 Shenzhou Road, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangdong, 10 Patentee after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangdong, 10 Patentee before: COMBA TELECOM SYSTEMS (CHINA) Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190917 |