CN108243119A - A kind of method and device for the scheduling for promoting RB resource utilizations - Google Patents

A kind of method and device for the scheduling for promoting RB resource utilizations Download PDF

Info

Publication number
CN108243119A
CN108243119A CN201611215076.1A CN201611215076A CN108243119A CN 108243119 A CN108243119 A CN 108243119A CN 201611215076 A CN201611215076 A CN 201611215076A CN 108243119 A CN108243119 A CN 108243119A
Authority
CN
China
Prior art keywords
scheduling
message
sent
queue
scheduling 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.)
Granted
Application number
CN201611215076.1A
Other languages
Chinese (zh)
Other versions
CN108243119B (en
Inventor
孙雷
张汉超
詹俊鹏
杨佩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201611215076.1A priority Critical patent/CN108243119B/en
Publication of CN108243119A publication Critical patent/CN108243119A/en
Application granted granted Critical
Publication of CN108243119B publication Critical patent/CN108243119B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a kind of method and devices for the scheduling for promoting RB resource utilizations, are related to wireless communication technique field, method includes：When receiving the message to be sent of each user terminal UE, the message total amount size to be sent of each UE is determined；It, will be in the message classification to be sent to the different scheduling queues with the different access period of all UE according to the message total amount size to be sent of identified each UE；In each dispatching message, according to the access cycle of each scheduling queue, it accesses successively to multiple scheduling queues, a UE is selected from least one scheduling queue being accessed to and is scheduled, assigned resource block RB is fully used so as to the message to be sent of scheduled UE.Present invention reduces the possibility that single TTI dispatches multiple small buffer size UE simultaneously, so as to effectively improve utilization rate of air interface resource, throughput of system.

Description

A kind of method and device for the scheduling for promoting RB resource utilizations
Technical field
The present invention relates to wireless communication technique field, the method for more particularly to a kind of scheduling for promoting RB resource utilizations and Device.
Background technology
Due to the development of internet, the type of service type sent by wireless system is various, results in each UE in this way It is also not quite similar etc. message total amount (buffer size) to be sent.Meanwhile single TTI (transmission time Interval, Transmission Time Interval) scheduling UE numbers limited by many reasons, have (1) PDCCH than more typical (Physical Downlink Control Channel, Physical Downlink Control Channel) inadequate resource；(2) processor ability Limitation；In this way, if several UE message total amounts to be sent of current TTI scheduling are all smaller, it will cause the RB that eats dishes without rice or wine (Resource Block, resource block) wasting of resources, as shown in Figure 1.
Invention content
When the technical issues of scheme provided according to embodiments of the present invention solves is multi-service type, utilization rate of air interface resource The problem of low.
The method of the scheduling of a kind of promotion RB resource utilizations provided according to embodiments of the present invention, including：
When receiving the message to be sent of each user terminal UE, the message total amount size to be sent of each UE is determined；
According to the message total amount size to be sent of identified each UE, by the message classification to be sent of all UE to having In the different scheduling queues in different access period；
In each dispatching message, according to the access cycle of each scheduling queue, multiple scheduling queues are visited successively It asks, a UE is selected from least one scheduling queue being accessed to and is scheduled, so that scheduled the pending of UE is delivered newspaper It is literary fully to use assigned resource block RB.
Preferably, the scheduling team includes the first scheduling queue, the second scheduling queue and third scheduling queue.
Preferably, the message total amount size to be sent according to identified each UE, pending by all UE are delivered newspaper Text is categorized into the different scheduling queues with the different access period and includes：
The message total amount to be sent of each UE and the preset first classification thresholding and the second classification thresholding are compared respectively Compared with；
If the message total amount to be sent of the UE is less than or equal to the described first classification thresholding, by the to be sent of the UE In message classification to the first scheduling queue；
The thresholding if the message total amount to be sent of the UE is classified higher than the described first classification thresholding and less than described second, It will be in the message classification to be sent to the second scheduling queue of the UE；
If the message total amount to be sent of the UE is greater than or equal to the described second classification thresholding, by the to be sent of the UE In message classification to third scheduling queue；
Wherein, the first classification thresholding is less than the described second classification thresholding.
Preferably, the access cycle of first scheduling queue is maximum, and the access cycle of the third scheduling queue is minimum.
Preferably, it is described in each dispatching message, according to the access cycle of each scheduling queue, to multiple scheduling queues Access successively, selected from least one scheduling queue being accessed to a UE be scheduled including：
In each dispatching message, determine whether current scheduling queue is that may have access to scheduling queue；
If it is determined that current scheduling queue is that may have access to scheduling queue, then one is selected from the addressable scheduling queue UE is scheduled, and counts current scheduled UE number；
If current scheduled UE number is less than the upper limit of preset UE number of schedulable, scheduling queue is may have access to from other In select a UE and be scheduled.
Preferably, it is described in each dispatching message, determine whether current scheduling queue is that may have access to scheduling queue to include：
In each dispatching message, judge whether current scheduling time reaches the scheduling week of the current scheduling queue Phase；
If current scheduling time reaches the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is can Access scheduling queue；
If current scheduling time does not reach the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is Inaccessible scheduling queue.
The device of the scheduling of a kind of promotion RB resource utilizations provided according to embodiments of the present invention, including：
Determining module during for receiving the message to be sent of each user terminal UE, determines the message to be sent of each UE Total amount size；
Sort module, for according to the message total amount size to be sent of identified each UE, by the to be sent of all UE In message classification to the different scheduling queues with the different access period；
Scheduler module, in each dispatching message, according to the access cycle of each scheduling queue, to multiple scheduling teams Leie accesses, and a UE is selected from least one scheduling queue being accessed to and is scheduled, so as to what is be scheduled The message to be sent of UE is fully using assigned resource block RB.
Preferably, the scheduling queue includes the first scheduling queue, the second scheduling queue and third scheduling queue.
Preferably, the sort module includes：
Comparing unit, for by the message total amount to be sent of each UE with preset first classification thresholding and second classification door Limit is compared respectively；
Taxon for working as the message total amount to be sent of the UE less than or equal to the described first classification thresholding, then will In the message classification to be sent to the first scheduling queue of the UE, when the message total amount to be sent of the UE is higher than described first point Class thresholding and less than the described second classification thresholding, then by the message classification to be sent to the second scheduling queue of the UE and When the UE message total amount to be sent greater than or equal to described second classification thresholding, then by the message classification to be sent of the UE Into third scheduling queue；
Wherein, the first classification thresholding is less than the described second classification thresholding.
Preferably, the access cycle of first scheduling queue is maximum, and the access cycle of the third scheduling queue is minimum.
The scheme provided according to embodiments of the present invention in the cell that large capacity multiple business type coexists, reduces single TTI The possibility of multiple small buffer size UE is dispatched simultaneously, so as to effectively improve utilization rate of air interface resource, throughput of system, It also has a certain upgrade to cell entirety KPI (Key Performance Indicators, KPI Key Performance Indicator) index simultaneously.
Description of the drawings
Fig. 1 is the scheduling schematic diagram for the RB wastings of resources that the prior art provides；
Fig. 2 is a kind of method flow diagram of scheduling for promoting RB resource utilizations provided in an embodiment of the present invention；
Fig. 3 is a kind of schematic device of scheduling for promoting RB resource utilizations provided in an embodiment of the present invention；
Fig. 4 is the scheduling schematic diagram provided in an embodiment of the present invention for promoting RB resource utilizations；
Fig. 5 is the scheduling system schematic provided in an embodiment of the present invention for promoting RB resource utilizations.
Specific embodiment
Below in conjunction with attached drawing to a preferred embodiment of the present invention will be described in detail, it should be understood that described below is excellent Embodiment is selected to be merely to illustrate and explain the present invention, is not intended to limit the present invention.
Fig. 2 is a kind of method flow diagram of scheduling for promoting RB resource utilizations provided in an embodiment of the present invention, such as Fig. 2 institutes Show, including：
Step S201：When receiving the message to be sent of each user terminal UE, the message total amount to be sent of each UE is determined Size；
Step S202：According to the message total amount size to be sent of identified each UE, by the message to be sent of all UE It is categorized into the different scheduling queues with the different access period；
Step S203：In each dispatching message, according to the access cycle of each scheduling queue, to multiple scheduling queues according to It is secondary to access, a UE is selected from least one scheduling queue being accessed to and is scheduled, so as to scheduled UE's Message to be sent is fully using assigned resource block RB.
Wherein, the scheduling queue includes the first scheduling queue, the second scheduling queue and third scheduling queue.Specifically It says, the message total amount size to be sent according to identified each UE, by the message classification to be sent of all UE to having The different scheduling queues in different access period include：By the message total amount to be sent of each UE and the preset first classification thresholding It is compared respectively with the second classification thresholding；If the message total amount to be sent of the UE is less than or equal to the described first classification door Limit, then will be in the message classification to be sent to the first scheduling queue of the UE；If the message total amount to be sent of the UE is higher than institute State the first classification thresholding and less than the described second classification thresholding, then by the message classification to be sent of the UE to the second scheduling queue In；If the message total amount to be sent of the UE is greater than or equal to the described second classification thresholding, by the message to be sent of the UE It is categorized into third scheduling queue；Wherein, the first classification thresholding is less than the described second classification thresholding.The first scheduling team The access cycle of row is maximum, and the access cycle of the third scheduling queue is minimum.
Wherein, it is described in each dispatching message, according to the access cycle of each scheduling queue, to multiple scheduling queues according to It is secondary to access, selected from least one scheduling queue being accessed to a UE be scheduled including：In each message tune When spending, determine whether current scheduling queue is that may have access to scheduling queue；If it is determined that current scheduling queue is may have access to scheduling team Row, then select a UE from the addressable scheduling queue and be scheduled, and counts current scheduled UE number；If currently UE number of scheduling is less than the upper limit of preset UE number of schedulable, then may have access to from other and a UE progress is selected in scheduling queue Scheduling.Specifically, it is described in each dispatching message, determine whether current scheduling queue is that may have access to scheduling queue to include： In each dispatching message, judge whether current scheduling time reaches the dispatching cycle of the current scheduling queue；It is if current Scheduling time reach the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is that may have access to scheduling queue； If current scheduling time does not reach the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is inaccessible Scheduling queue.
Fig. 3 is a kind of schematic device of scheduling for promoting RB resource utilizations provided in an embodiment of the present invention, such as Fig. 3 institutes Show, including：Determining module 301 during for receiving the message to be sent of each user terminal UE, determines that the pending of each UE is delivered newspaper Literary total amount size；Sort module 302, for according to the message total amount size to be sent of identified each UE, by all UE's In message classification to be sent to the different scheduling queues with the different access period；Scheduler module 303, in each message tune It when spending, according to the access cycle of each scheduling queue, accesses successively to multiple scheduling queues, from least one be accessed to A UE is selected in a scheduling queue to be scheduled, and assigned resource is fully used so as to the message to be sent of scheduled UE Block RB.Wherein, the scheduling queue includes the first scheduling queue, the second scheduling queue and third scheduling queue.
Wherein, the sort module 302 includes：Comparing unit, for by the message total amount to be sent of each UE with it is default First classification thresholding and second classification thresholding be compared respectively；Taxon, it is total for working as the message to be sent of the UE Amount, then by the message classification to be sent to the first scheduling queue of the UE, works as institute less than or equal to the described first classification thresholding The message total amount to be sent of UE is stated higher than the described first classification thresholding and less than the described second classification thresholding, then is treated the UE It sends in message classification to the second scheduling queue and when the message total amount to be sent of the UE is greater than or equal to described second point Class thresholding, then will be in the message classification to be sent to third scheduling queue of the UE；Wherein, the first classification thresholding is less than institute State the second classification thresholding.The access cycle of first scheduling queue is maximum, and the access cycle of the third scheduling queue is minimum.
Fig. 4 is the scheduling schematic diagram provided in an embodiment of the present invention for promoting RB resource utilizations, as shown in figure 4, including：It is first First, it is divided into several sections by Buffer Size sizes, such as be divided into three sections:A=(0,2000], b=[2001,5000], C=[5001 ,+∞]；The factors such as the division in section and the channel quality of system bandwidth and UE, UE abilities are related.Above three area Between empirical value under the scene based on 20M.Hereafter all it is described by taking these three sections as an example.
Scheduler setting 3 queues A, B and C correspond to tri- sections of a, b, c of Buffer Size.Scheduler is according to each The BSR (Buffer Status Report, Buffer Status Report) of UE, these UE is categorized into different queues；That is, team All it is the UE that Buffer Size are in section a in row A, is the UE that Buffer Size are in section b in queue B, is in queue C Buffer Size are in the UE of section c；
Wherein, queue A can be accessed once every n TTI, and queue B can be accessed once every m TTI, and queue C is every TTI can be accessed；Wherein, 1<m<n；M and n is positive integer.
During each TTI scheduling, each queue that can be accessed of repeating query, from repeating query to queue in select a UE and adjust Degree, then the next accessible queue of repeating query, selects a UE to dispatch again from next queue.UE is selected from some queue Method also preferentially use repeating query mode.
After finishing scheduling, the Buffer Size of each UE are updated according to scheduling result；Meanwhile there is the arrival of new data It can real-time update Buffer Size.Scheduler is according to the Buffer Size state reports newly received, where adjusting each UE Queue, preparation are dispatched next time.
If there is the higher business of delay requirement, queue A and B are extended to can respectively two queues, one is Delay requirement is relatively low, and one is that delay requirement is higher, and access cycle is reduced in the high queue of delay requirement, that is, improves and access frequency Degree.
Fig. 5 is the scheduling system schematic provided in an embodiment of the present invention for promoting RB resource utilizations, as shown in figure 5, packet It includes：UE data buffer zones maintenance module, UE queue maintenances module, scheduling UE numbers decision-making module, sorting module and resource allocation Module.
UE data buffer zones maintenance module, for the Buffer size sizes of each UE of real-time servicing, i.e., according to new The data volume that the data volume of arrival and scheduling are walked is updated, and generates BSR, and being reported to scheduler, (reporting schemes can be used altogether Enjoy memory and message unidirectional queue).
The UE queue maintenances module includes：
Module initialization：
(1) queue tri- queues of A, B, C are set according to Buffer size sections a, b, c.The UE numbers initialization of each queue NA=0, NB=0, NC=0；
(2) while the access cycle of each queue is set, queue A is set as n, and queue B is set as m, and queue C is set as 1； Wherein, (n>=m>=1).
Module mainly completes following task：
Task 1：It safeguards queue, and updates the UE numbers N of each queueA、NB、NC；
(1) information is reported according to the BSR of module 1, UE is from no data to when there are data, according to the affiliated areas of buffer size Between be added in corresponding queue, UE numbers add 1 in the queue；
(2) UE then removes the UE from queue, UE numbers subtract 1 in the queue from when having data to no data；
(3) information is reported according to the BSR of module 1 before sequence per TTI, if the affiliated sections of the buffer size of UE occur It during variation, then needs UE from original regulator to new queue, and updates the UE numbers of two queues；
Task 2：Each queue accesses state is set；
(1) whether queue A is judged to access cycle, if arrived, puts queue A as " addressable ", otherwise, being set to " can not It accesses "；
(2) whether queue B is judged to access cycle, if arrived, puts queue B as " addressable ", otherwise, being set to " can not It accesses ".
The scheduling UE number decision-making modules：For exporting UE number upper limit N of current TTI schedulabletti。
The sorting module：For every each queue of TTI repeating queries, such as the repeating query since A of z moment；The z+1 moment is from queue B starts repeating query ....
Inner queue is using the preferential sortord (being equivalent to repeating query mode) of maximum latency, PriorityRR= (TCurrent time-TUE the last time scheduling instances), current Priority is selected every timeRRMaximum UE.
Sequence step is following (assuming that this TTI repeating queries since queue A)：The UE numbers N selectedselectedIt is initialized as zero, That is Nselected=0；UE numbers in current each queue are respectively：NA、NB、NC；The number of UE to be selected is respectively in each queue NAS=NA、NBS=NB、NCS=NC。
Step 1：Access queue A if quene state is " inaccessible ", enters step 2；If it waits to select in queue UE numbers NAS be zero, then also enter step 2；Otherwise, a UE, N are selected from queueselected=Nselected+1；NAS=NAS- 1；If NselectedEqual to Ntti, then sort and terminate, otherwise, enter step 2；
Step 2：Access queue B if quene state is " inaccessible ", enters step 3；If it waits to select in queue UE numbers NBS be zero, then also enter step 3；Otherwise, a UE, N are selected from queueselected=Nselected+1；NBS=NBS- 1；If NselectedEqual to Ntti, then sort and terminate, otherwise, enter step 3；
Step 3：Access queue C if quene state is " inaccessible ", enters step 4；If it waits to select in queue UE numbers NCS be zero, then also enter step 4；Otherwise, a UE, N are selected from queueselected=Nselected+1；NCS=NCS- 1；If NselectedEqual to Ntti, then sort and terminate, otherwise, enter step 4；
Step 4：If A, B, C cannot select UE (quene state is zero for " inaccessible " or UE to be selected), Sequence terminates；Otherwise, 1 is entered step.
The resource distribution module：For the UE sequences exported according to sorting module, according to its buffer size size and Other relevant parameters distribute RB resources.The last scheduling instance of UE updates of resource is distributed：TUE the last time scheduling instances=TCurrent time。
The scheme provided according to embodiments of the present invention, main improvement are embodied at following 3 points：
(1) UE of tti scheduling due to being selected respectively from the queue repeating query of large, medium and small buffer Size every time, and is reduced The ue dispatcher meetings of small buffer Size.In this way, the UE of size buffer Size is reasonably distributed, be not in small Buffer The situation that Size UE flock together；
(2) UE of small Buffer Size also has dispatcher meeting, and dispatches frequency and can configure (according to type of service The parameters such as time delay, packet loss), i.e., by the way that the access interval n values of queue A and the access interval m of queue B is configured；
(3) such as queue A, n TTI can just be accessed once, and the UE dispatchers in such queue can reduce, for continuous Business, have the effects of Buffer Size accumulations, accumulation has reformed into larger Buffer Size, reduced money to a certain extent The probability of source waste.
Although the present invention is described in detail above, but the invention is not restricted to this, those skilled in the art of the present technique It can be carry out various modifications with principle according to the present invention.Therefore, all modifications made according to the principle of the invention, all should be understood to Fall into protection scope of the present invention.

Claims (10)

1. a kind of method for the scheduling for promoting RB resource utilizations, including：
When receiving the message to be sent of each user terminal UE, the message total amount size to be sent of each UE is determined；
According to the message total amount size to be sent of identified each UE, by the message classification to be sent of all UE to difference In the different scheduling queues of access cycle；
In each dispatching message, according to the access cycle of each scheduling queue, access successively to multiple scheduling queues, from It selects a UE at least one scheduling queue being accessed to be scheduled, so that the message to be sent of scheduled UE is abundant Use assigned resource block RB.
2. according to the method described in claim 1, the scheduling queue includes the first scheduling queue, the second scheduling queue and third Scheduling queue.
3. according to the method described in claim 2, the message total amount size to be sent according to identified each UE, by institute The message classification to be sent for having UE includes to the different scheduling queues with the different access period：
The message total amount to be sent of each UE and the preset first classification thresholding and the second classification thresholding are compared respectively；
If the message total amount to be sent of the UE is less than or equal to the described first classification thresholding, by the message to be sent of the UE It is categorized into the first scheduling queue；
If the message total amount to be sent of the UE is higher than the described first classification thresholding and less than the described second classification thresholding, by institute In the message classification to be sent to the second scheduling queue for stating UE；
If the message total amount to be sent of the UE is greater than or equal to the described second classification thresholding, by the message to be sent of the UE It is categorized into third scheduling queue；
Wherein, the first classification thresholding is less than the described second classification thresholding.
4. according to the method in claim 2 or 3, the access cycle of first scheduling queue is maximum, the third scheduling The access cycle of queue is minimum.
5. according to the method described in claim 4, described in each dispatching message, according to the access week of each scheduling queue Phase accesses successively to multiple scheduling queues, and a UE is selected from least one scheduling queue being accessed to and is adjusted Degree includes：
In each dispatching message, determine whether current scheduling queue is that may have access to scheduling queue；
If it is determined that current scheduling queue be may have access to scheduling queue, then selected from the addressable scheduling queue UE into Row scheduling, and count current scheduled UE number；
If current scheduled UE number is less than the upper limit of preset UE number of schedulable, it may have access in scheduling queue and select from other Go out a UE to be scheduled.
6. according to the method described in claim 5, described in each dispatching message, determine whether current scheduling queue is that can visit Ask that scheduling queue includes：
In each dispatching message, judge whether current scheduling time reaches the dispatching cycle of the current scheduling queue；
If current scheduling time reaches the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is addressable Scheduling queue；
If current scheduling time does not reach the dispatching cycle of the current scheduling queue, it is determined that current scheduling queue is can not Access scheduling queue.
7. a kind of device for the scheduling for promoting RB resource utilizations, including：
Determining module during for receiving the message to be sent of each user terminal UE, determines the message total amount to be sent of each UE Size；
Sort module, for according to the message total amount size to be sent of identified each UE, by the message to be sent of all UE It is categorized into the different scheduling queues with the different access period；
Scheduler module, in each dispatching message, according to the access cycle of each scheduling queue, to multiple scheduling queues according to It is secondary to access, a UE is selected from least one scheduling queue being accessed to and is scheduled, so as to scheduled UE's Message to be sent is fully using assigned resource block RB.
8. device according to claim 7, the scheduling queue includes the first scheduling queue, the second scheduling queue and third Scheduling queue.
9. device according to claim 8, the sort module includes：
Comparing unit, for the message total amount to be sent of each UE and the preset first classification thresholding and the second classification thresholding to be divided It is not compared；
Taxon, for working as the message total amount to be sent of the UE less than or equal to the described first classification thresholding, then by described in In the message classification to be sent to the first scheduling queue of UE, when the message total amount to be sent of the UE is higher than the described first classification door Limit and less than the described second classification thresholding then in the message classification to be sent to the second scheduling queue of the UE and will work as institute The message total amount to be sent of UE is stated greater than or equal to the described second classification thresholding, then by the message classification to be sent of the UE to the In three scheduling queues；
Wherein, the first classification thresholding is less than the described second classification thresholding.
10. device according to claim 8 or claim 9, the access cycle of first scheduling queue is maximum, the third scheduling The access cycle of queue is minimum.
CN201611215076.1A 2016-12-26 2016-12-26 Scheduling method and device for improving RB resource utilization rate Active CN108243119B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611215076.1A CN108243119B (en) 2016-12-26 2016-12-26 Scheduling method and device for improving RB resource utilization rate

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611215076.1A CN108243119B (en) 2016-12-26 2016-12-26 Scheduling method and device for improving RB resource utilization rate

Publications (2)

Publication Number Publication Date
CN108243119A true CN108243119A (en) 2018-07-03
CN108243119B CN108243119B (en) 2023-07-11

Family

ID=62704745

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611215076.1A Active CN108243119B (en) 2016-12-26 2016-12-26 Scheduling method and device for improving RB resource utilization rate

Country Status (1)

Country Link
CN (1) CN108243119B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008095397A1 (en) * 2007-02-05 2008-08-14 Huawei Technologies Co., Ltd. Traffic scheduling method and apparatus thereof
CN102195885A (en) * 2011-05-27 2011-09-21 成都市华为赛门铁克科技有限公司 Message processing method and device
CN104507169A (en) * 2014-12-15 2015-04-08 东南大学 Three-dimensional resource dynamic allocation method and device for reducing system uplink transmission time delay
CN104579962A (en) * 2015-01-23 2015-04-29 盛科网络（苏州）有限公司 Method and device for differentiating QoS strategies of different messages

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008095397A1 (en) * 2007-02-05 2008-08-14 Huawei Technologies Co., Ltd. Traffic scheduling method and apparatus thereof
CN102195885A (en) * 2011-05-27 2011-09-21 成都市华为赛门铁克科技有限公司 Message processing method and device
CN104507169A (en) * 2014-12-15 2015-04-08 东南大学 Three-dimensional resource dynamic allocation method and device for reducing system uplink transmission time delay
CN104579962A (en) * 2015-01-23 2015-04-29 盛科网络（苏州）有限公司 Method and device for differentiating QoS strategies of different messages

Also Published As

Publication number Publication date
CN108243119B (en) 2023-07-11

Similar Documents

Publication Publication Date Title
CN102065552B (en) Method and device for reporting BSR (Buffer Status Report)
CN103931262B (en) A kind of data dispatching method and equipment
Kumar et al. A delay optimal MAC and packet scheduler for heterogeneous M2M uplink
CN106793133A (en) The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system
CN110087324B (en) Resource allocation method, device, access network equipment and storage medium
CN103068051A (en) Distribution method and distribution device of downstream resources
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN104619034B (en) Towards the grouping scheduling method of real time business in a kind of LTE communication system
CN106358295A (en) Resource distribution method and device
WO2014070937A1 (en) System and methods to achieve optimum efficiency-jain fairness in wireless systems
CN103428883A (en) Dispatching method and equipment of physical downlink control channel resources
CN108055701A (en) A kind of resource regulating method and base station
CN104981014B (en) Descending resource allocation method and base station
CN107493607A (en) Network resource allocation method and Internet resources distributor
CN101827446B (en) Radio bearer scheduling method and device
WO2016188057A1 (en) Unicast/multicast traffic scheduling management method and apparatus
CN112714081B (en) Data processing method and device
JP2000069548A (en) Communication band assignment method
CN101925181B (en) Method and device for scheduling multi-carrier system
CN102143053A (en) Method, device and system for transmitting data
CN108243119A (en) A kind of method and device for the scheduling for promoting RB resource utilizations
CN102594654A (en) Method and device for queue scheduling
CN102594670B (en) Multiport multi-flow scheduling method, device and equipment
CN100459743C (en) High-speed downlink packet access service scheduling method
CN104917692B (en) A kind of method and apparatus for distributing token

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant