CN109041247A - Adaptive resource dispatching method based on user Qos demand and queuing policy - Google Patents
Adaptive resource dispatching method based on user Qos demand and queuing policy Download PDFInfo
- Publication number
- CN109041247A CN109041247A CN201810953970.1A CN201810953970A CN109041247A CN 109041247 A CN109041247 A CN 109041247A CN 201810953970 A CN201810953970 A CN 201810953970A CN 109041247 A CN109041247 A CN 109041247A
- Authority
- CN
- China
- Prior art keywords
- user
- cqi
- queue
- service
- channel quality
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Adaptive resource dispatching method based on user Qos demand and queuing policy, belongs to the communications field.It is low that the existing classical queuing algorithm for communication request carrier resource block utilization rate occurs in the scene application of user's super-intensive, and be lined up customer service type it is more different than column when, the problem of classic algorithm can not be by the type of service ratio of system call interception service.The method of the present invention, the present invention is based on queuing policies and user's Qos demand to provide different user gradation services according to different user priority, first services the high user of User Priority；According to different types of service, user's queuing service type is adjusted with dispatching resource-adaptive than the type of service ratio with service user.The present invention can significantly improve the service number of users of system, shorten average user queue waiting time and improve user fairness, and can demand according to the actual situation adaptively adjust the type of service ratio for servicing user and the type of service ratio for not servicing user.
Description
Technical field
The present invention relates to a kind of adaptive resource dispatching method based on user Qos demand and queuing policy.
Background technique
5G proposes the vision of " all things on earth interconnection ", under the overall situation of Internet of Things (IOT), has a large amount of user and machine is whole
End needs to connect with base station.At this moment in the case where limited resources distribute, it is necessary to which reasonable resource dispatching strategy and queuing are quasi-
Then, the performance of system is improved.
The research for the algorithm being lined up at present about user is largely all based on certain and criterion is lined up to be lined up simultaneously to user
Scheduling of resource is carried out, classical queuing algorithm has maximum CQI algorithm, polling algorithm and proportional fair algorithm.And these classics row
Team's algorithm has and occupies a large amount of excellent since certain user relies on the Queuing advantages of oneself in the scene application of user's super-intensive
Elegant resource causes other users experience very poor, causes the phenomenon of system user fairness difference, and be lined up customer service class
When type is than arranging different, classic algorithm can not pass through the type of service ratio of system call interception service.
Summary of the invention
The purpose of the present invention is to solve the existing classical queuing algorithms for communication request in user's super-intensive
It is low to there is carrier resource block utilization rate in scene application, and be lined up customer service type it is more different than column when, classic algorithm without
The problem of method is by the type of service ratio of system call interception service, and propose a kind of based on user Qos demand and queuing policy
Adaptive resource dispatching method.
A kind of adaptive resource dispatching method based on user Qos demand and queuing policy, the method pass through following step
It is rapid to realize:
Step 1: calculating the value of channel quality CQI of the user of communication request on different members carrier wave, and by maximum
The queuing standard of CQI algorithm is lined up, and Subscriber Queue is obtained；
Step 2: the user of judgment step one in column with the presence or absence of with VIP grade user,
If so, the service of corresponding VIP grade is carried out to user according to the VIP grade of user；
If it is not, then carrying out step 3；
Step 3: judging whether each member carrier has resource block that can dispatch in each transmission time interval TTI；
If so, the user for coming foremost in selection Subscriber Queue services, step 6 is then carried out；
If it is not, then carrying out step 4；
Step 4: judging to be greater than maximum Connection Time t with the presence or absence of the Connection Time in Subscriber QueuecUser,
If so, breaking to the user service, the value of the CQI of the user channel quality is recalculated, and requeue, so
After carry out step 6；
If it is not, then carrying out step 5；
Step 5: judging whether there is the Connection Time greater than Smallest connection time teUser, and the user accounts for resource block
The value of average channel quality CQI on RB is less than substitute user on resource block RB and accounts for the average channel quality CQI on resource block RB
Value；Wherein, substitute user indicates the user reconnected after user broken string,
If so, substitute user is enabled to replace active user, the user that then substitutes re-starts queuing and carries out step 6；
If it is not, then carrying out step 6；
Step 6: whether the waiting time for the user that judgement is each waited in line is greater than the period of reservation of number thresholding of setting
twm,
If so, requeuing after improving the value of the channel quality CQI of the user, step 7 is carried out；
If it is not, then carrying out step 7；
Step 7: judge whether the duration of transmission time interval TTI is overtime,
If it is not, then entering the scheduling time of next transmission time interval TTI, and return step two；
If transmission time interval TTI time-out, algorithm terminate；
Wherein, the Qos is the abbreviation of quality ofservice, indicates service quality.
The invention has the benefit that
The present invention is suitable for downstream-intensive user scene, and user has different priority levels in the scene, and user has not
Same type of service.Scheduling of resource and user row proposed by the present invention suitable for different user priority and multiple business type
Team's algorithm, according to different user priority, provides different user gradation services, first services in the case where user's super-intensive
The high user of User Priority；According to different types of service, user's queuing service type ratio is adjusted with dispatching resource-adaptive
With the type of service ratio of service user.Prioritized resources scheduling can be carried out to different priority users, and in user's queuing policy
It is improved in rule, in the case where limited resources distribution, reasonable resource dispatching strategy is provided and is lined up criterion, to improve
The utilization rate of resource block in carrier wave, improves the performance of system, to significantly improve the service number of users of system, shorten average user
Queue waiting time simultaneously improves user fairness, and can demand according to the actual situation adaptively adjust service user business
Type ratio and the type of service ratio for not servicing user.
Detailed description of the invention
Fig. 1 is flow chart of the invention；
Specific embodiment
Specific embodiment 1:
The adaptive resource dispatching method based on user Qos demand and queuing policy of present embodiment, the method are logical
Cross following steps realization:
Step 1: calculating the value of channel quality CQI of the user of communication request on different members carrier wave, and by maximum
The queuing standard of CQI algorithm is lined up, and Subscriber Queue is obtained；
Step 2: the user of judgment step one in column with the presence or absence of with VIP grade user,
If so, the service of corresponding VIP grade is carried out to user according to the VIP grade of user；
If it is not, then carrying out step 3；
Step 3: judging whether each member carrier has resource block that can dispatch in each transmission time interval TTI；
If so, the user for coming foremost in selection Subscriber Queue services, step 6 is then carried out；
If it is not, then carrying out step 4；
Step 4: judging to be greater than maximum Connection Time t with the presence or absence of the Connection Time in Subscriber QueuecUser,
If so, breaking to the user service, the value of the CQI of the user channel quality is recalculated, and requeue, so
After carry out step 6；
If it is not, then carrying out step 5；
Step 5: judging whether there is the Connection Time greater than Smallest connection time teUser, and the user accounts for resource block
The value of average channel quality CQI on RB is less than substitute user on resource block RB and accounts for the average channel quality CQI on resource block RB
Value；Wherein, substitute user indicates the user reconnected after user broken string,
If so, substitute user is enabled to replace active user, the user that then substitutes re-starts queuing and carries out step 6；
If it is not, then carrying out step 6；
Step 6: whether the waiting time for the user that judgement is each waited in line is greater than the period of reservation of number thresholding of setting
twm,
If so, requeuing after improving the value of the channel quality CQI of the user, step 7 is carried out；
If it is not, then carrying out step 7；
Step 7: judge whether the duration of transmission time interval TTI is overtime,
If it is not, then entering the scheduling time of next transmission time interval TTI, and return step two；
If the duration time-out of transmission time interval TTI, algorithm terminate；
Wherein, the Qos is the abbreviation of quality of service, indicates service quality.
Specific embodiment 2:
Unlike specific embodiment one, present embodiment it is adaptive based on user Qos demand and queuing policy
Resource regulating method is answered, channel quality CQI of the request user on different members carrier wave in calculating broadband described in step 1
Value, and be lined up by the queuing standard of maximum CQI algorithm, the process for obtaining Subscriber Queue is that the letter is obtained by following formula
The maximum user of value of road quality CQI, is expressed as
In formula, M be total carrier number, m indicate m-th of carrier wave, m ∈ M,For the maximum user of CQI value of carrier wave m, U is row
Total number of users in team's queue；Then maximum CQI algorithm is pressed, by userThe value of corresponding channel quality CQI it is descending into
Row is lined up, and obtains Subscriber Queue.
Specific embodiment 3:
Unlike specific embodiment one or two, present embodiment based on user Qos demand and queuing policy
Adaptive resource dispatching method is divided into VIP1 user, VIP2 according to VIP grade with the user of VIP grade described in step 2
User, VIP3 user and four kinds of ordinary user, the user of different VIP grades have different priority, and VIP1 user has most
High priority, VIP2 user have secondary high priority, the priority that VIP3 user has third high, and ordinary user is not
There is the user of priority；The type of traffic of the user include four kinds: text services, voice service, graphic service and
Video traffic, and the quantity sequence of resource block RB needed for customer service is that text services are less than voice service, voice service is small
In graphic service, graphic service is less than video traffic；
Wherein, the user of different VIP grades, priority service form are defined as follows:
The priority service form of VIP1 user are as follows:
1) VIP1 user is highest priority, has the permission of the communication of cutting active user, when VIP1 user needs
It when access call, searches for immediately, judge the best base station of surrounding channel quality and carrier wave, and interruption is currently talking at once
User, to enable VIP1 user carry out the transmission of data；Wherein, the type of VIP1 user includes: military communication or urgent early warning,
Urgent early warning includes the forecast of natural calamity, the call of army marshal, war preparedness preparation call etc.；
2) the priority service form of VIP2 user are as follows:
VIP2 user is secondary high priority, with the permission jumped the queue, priority access communicates, when in the transmission time interval
When VIP2 user occurs in the TTI moment, and VIP2 user comes the subsequent position of queue according to queue discipline, then regardless of dispatching algorithm
How, can by etc. VIP2 user to be accessed jump the queue in the queue the positions of access communications at first, user to be had completes logical
After letter, VIP2 user is directly accessed communication without waiting；Wherein, the type of VIP2 user includes: member system user, and its business
It is not high to requirement of real-time；
3) the priority service form of VIP3 user are as follows:
VIP3 user is the high priority of third, has the permission for waiting in line to communicate with priority access, in order to guarantee
The QoS of VIP3 user, if waiting in line time delay thresholding is tw, there is VIP3 user when the transmission time interval TTI moment, judge
Whether the waiting time of VIP3 user is less than or equal to tw, if so, the user continues to wait in line, if it is not, and the user not yet
Access communications then enable VIP3 user have permission of jumping the queue identical with VIP2 user, disregard the ordering rule of its allocation algorithm, can
With the position for the override access communications in the queue of jumping the queue, its priority can be regarded as VIP2 at this time, in the currently transmitted time
It is spaced TTI and completes communication, the communication of VIP3 user's priority access；Wherein, the type of VIP3 user is the honored guest user of operator；
4) the priority service form of ordinary user are as follows:
Ordinary user does not have priority, carries out resource allocation using this basic resource allocation algorithm of maximum CQI algorithm,
If there is VIP user, ordinary user is the minimum user of priority.
Specific embodiment 4:
Unlike specific embodiment three, present embodiment it is adaptive based on user Qos demand and queuing policy
Answer resource regulating method, the user of judgment step one described in step 2 in column with the presence or absence of with VIP grade user,
If so, the service of corresponding VIP grade is carried out to user according to the VIP grade of user；
If it is not, step 3 is then carried out,
The VIP grade according to user is to the process for the service that user carries out corresponding VIP grade, according to reality
Communication user can be divided into four kinds by the requirement of problem, the algorithm: VIP1 user, VIP2 user, VIP3 user and ordinary user,
There is different priority using different users, in each scheduling transmission time interval TTI, waiting user to be communicated to have can
Can be it is any in VIP1 user, VIP2 user, VIP3 user or ordinary user, Resource Scheduler RS by resource block RB by
One is allocated, after resource block RB is fully allocated to the user of high priority, according still further to queuing algorithm (maximum CQI algorithm,
Proportional fair algorithm and polling algorithm) give priority lower user's distribution, RS is the abbreviation of Resource Scheduler, table
Show Resource Scheduler；Detailed process are as follows:
Step 2 one judges whether have user gradation to need bedding and clothing for the VIP1 user of highest priority in queue queue
Business,
If there have the VIP1 user that user gradation is highest priority to need in queue queue to be to be serviced, the use is judged
The type of traffic and call duration time at family calculate the Signal to Noise Ratio (SNR) m on the different resource block of the user, and calculate each
The value of the channel quality CQI of communication channel, the carrier wave m for selecting channel quality best by following formula:
In formula, M is total carrier number, and 1≤m≤M, CQIm indicate channel quality of the VIP1 user on carrier wave m；According to channel
The best carrier wave m of the calculated result selection channel quality of quality CQIm formula, the communication data of VIP1 user is transmitted with carrier wave m,
And the connection request for using carrier wave m transmission data user is disconnected, to meet the highest priority of VIP1 user and interrupt use
The permission of family communication；
If it is not, carrying out in next step；
Step 2 two, judge whether to have in queue queue user gradation for the VIP2 user of time advanced priority need by
Service,
It is to be serviced if there is there is user gradation to be that the user of time advanced VIP2 needs in queue queue, then no matter dispatch calculation
What the criterion of method is, all VIP2 user is placed on the position of the foremost of queue queue, is waited in line；
If it is not, carrying out in next step；
Whether step 2 three, to judge to have in queue queue user gradation to be that VIP3 user needs to be serviced,
If have in queue queue user gradation be the high priority of third VIP3 user need it is to be serviced, arranged
Team waiting time Tw is compared with the waiting thresholding duration tw of setting, if Tw < tw, which continues in Resource Scheduler RS
It is interior that waiting is ranked up together with ordinary user；If Tw > tw, which has permission identical with VIP2 user at this time, as
VIP2 user is the same, how disregards its channel quality, can be discharged to the position of the foremost of the sequence to be accessed such as queue, waits
Priority access communication；
If it is not, carrying out the transmission time interval TTI resource block scheduling step of step 3.
Specific embodiment 5:
Unlike specific embodiment one, two or four, present embodiment based on user Qos demand and queuing policy
Adaptive resource dispatching method, judge described in step 3 each member carrier in each transmission time interval TTI whether
There is resource block that can dispatch；If so, the user for coming foremost in selection Subscriber Queue services, step 6 is then carried out
Process be to judge whether each member carrier has the resource block that can be scheduled, can if had in currently transmitted time interval TTI
Scheduled resource block then selects the user of foremost in queue to service, according to maximum CQI algorithm criterion, by it is all not
Reach the VIP3 user for waiting thresholding duration tw and ordinary user to arrange according to the value sequence from big to small of channel quality CQI
Team, waits to be communicated, then carries out step 6.
Specific embodiment 6:
Unlike specific embodiment five, present embodiment it is adaptive based on user Qos demand and queuing policy
Resource regulating method is answered, the judgement Connection Time described in step 5 is greater than Smallest connection time teUser, and the user accounts for money
The value of average channel quality CQI on source block RB is less than substitute user on resource block RB and accounts for the average channel quality on resource block RB
The process of the value of CQI are as follows: the value for the average channel quality CQI that user accounts on resource block RB and substitute user account on resource block RB
The comparison of the value of average channel quality CQI is calculated by following formula, so that it is determined that user accounts for the average channel on resource block RB
Whether the value of quality CQI is less than the value that substitute user on resource block RB accounts for the average channel quality CQI on resource block RB,
In formula, UonIndicate the total number of users that may be replaced online, UreplaceIndicate the use that may be replaced in queue queue
Family sum, MneedIndicate the quantity for the resource block RB that replacement business needs, CQIm(uon) indicate m-th of resource block user uon's
CQI value, CQIm(ureplace) indicate m-th of resource block user ureplaceCQI value；ΔreplaceFor the threshold value of setting,
It is obtained by following formula:
In formula, b indicates replacement business adjustment parameter, nno-linkIndicate the number of users serviced after replacement business, nlinkExpression is replaced
Change the number of users serviced before business.
Specific embodiment 7:
Unlike specific embodiment one, two, four or six, present embodiment based on user Qos demand and queuing
The adaptive resource dispatching method of strategy, judges whether the waiting time of the user each waited in line is greater than described in step 6
The period of reservation of number thresholding t of settingwm, if so, requeuing after improving the value of the channel quality CQI of the user；If it is not, then
During carrying out step 7,
The step of requeuing after the value of the channel quality CQI of the described raising user, the channel of the user after raising
The calculation formula of the value of quality CQI are as follows:
CQInew=CQIold+[Δimprove]
In formula, [] indicates round numbers, CQIoldIndicate the original CQI value of the user, CQInewIndicate the CQI's after improving
Value, and
In formula, a indicates business service adjustment parameter, NneedIndicate resource block RB number required for current business, kno-linkTable
Show user's percentage, k shared by the business in queue queuelinkIndicate user shared by the business in the queue serviced
Percentage.
Specific embodiment 8:
Unlike specific embodiment seven, present embodiment it is adaptive based on user Qos demand and queuing policy
Resource regulating method is answered, judges whether Chao Shi process is to judge to send for the duration of transmission time interval TTI described in step 7
Whether the duration of time interval TTI is greater than the renewal time of the value of user channel quality CQI.
The present invention can also have other various embodiments, without deviating from the spirit and substance of the present invention, this field
Technical staff makes various corresponding changes and modifications in accordance with the present invention, but these corresponding changes and modifications all should belong to
The protection scope of the appended claims of the present invention.
Claims (8)
1. a kind of adaptive resource dispatching method based on user Qos demand and queuing policy, it is characterised in that: the method is logical
Cross following steps realization:
Step 1: calculating the value of channel quality CQI of the user of communication request on different members carrier wave, and calculated by maximum CQI
The queuing standard of method is lined up, and Subscriber Queue is obtained；
Step 2: the user of judgment step one in column with the presence or absence of with VIP grade user,
If so, the service of corresponding VIP grade is carried out to user according to the VIP grade of user；
If it is not, then carrying out step 3；
Step 3: judging whether each member carrier has resource block that can dispatch in each transmission time interval TTI；
If so, the user for coming foremost in selection Subscriber Queue services, step 6 is then carried out；
If it is not, then carrying out step 4；
Step 4: judging to be greater than maximum Connection Time t with the presence or absence of the Connection Time in Subscriber QueuecUser,
If so, to the user service break, recalculate the value of the CQI of the user channel quality, and requeue, then into
Row step 6；
If it is not, then carrying out step 5；
Step 5: judging whether there is the Connection Time greater than Smallest connection time teUser, and the user accounts on resource block RB
The value of average channel quality CQI is less than the value that substitute user on resource block RB accounts for the average channel quality CQI on resource block RB；Its
In, substitute user indicates the user reconnected after user broken string,
If so, substitute user is enabled to replace active user, the user that then substitutes re-starts queuing and carries out step 6；
If it is not, then carrying out step 6；
Step 6: whether the waiting time for the user that judgement is each waited in line is greater than the period of reservation of number thresholding t of settingwm,
If so, requeuing after improving the value of the channel quality CQI of the user, step 7 is carried out；
If it is not, then carrying out step 7；
Step 7: judge whether the duration of transmission time interval TTI is overtime,
If it is not, then entering the scheduling time of next transmission time interval TTI, and return step two；
If transmission time interval TTI time-out, algorithm terminate；
Wherein, the Qos is the abbreviation of quality of service, indicates service quality.
2. the adaptive resource dispatching method according to claim 1 based on user Qos demand and queuing policy, feature
It is: the value of channel quality CQI of the request user on different members carrier wave in calculating broadband described in step 1, and by maximum
The queuing standard of CQI algorithm is lined up, and the process for obtaining Subscriber Queue is to obtain the channel quality CQI's by following formula
It is worth maximum user, is expressed as
In formula, M be total carrier number, m indicate m-th of carrier wave, m ∈ M,For the maximum user of CQI value of carrier wave m, U is to be lined up team
Total number of users in column；Then maximum CQI algorithm is pressed, by userThe value of corresponding channel quality CQI is descending to be arranged
Team obtains Subscriber Queue.
3. the adaptive resource dispatching method according to claim 1 or 2 based on user Qos demand and queuing policy,
It is characterized in that: with the user of VIP grade described in step 2, being divided into VIP1 user, VIP2 user, VIP3 according to VIP grade
User and four kinds of ordinary user, the user of different VIP grades have different priority, and VIP1 user has highest preferential
Grade, VIP2 user have secondary high priority, and the priority that VIP3 user has third high, ordinary user is no priority
User；The type of traffic of the user includes four kinds: text services, voice service, graphic service and video traffic,
And the quantity sequence of resource block RB needed for customer service is that text services are less than voice service, voice service is less than image industry
Business, graphic service are less than video traffic；
Wherein, the user of different VIP grades, priority service form are defined as follows:
1) the priority service form of VIP1 user are as follows:
VIP1 user is highest priority, has the permission of the communication of cutting active user, when VIP1 user needs access logical
When words, searches for immediately, judges the best base station of surrounding channel quality and carrier wave, and interrupt the user being currently talking at once,
To enable VIP1 user carry out the transmission of data；
2) the priority service form of VIP2 user are as follows:
VIP2 user is secondary high priority, with the permission jumped the queue, priority access communicates, when in transmission time interval TTI
When VIP2 user occurs in moment, and VIP2 user comes the subsequent position of queue according to queue discipline, then by etc. it is to be accessed
VIP2 user jumps the queue in the queue the positions of access communications at first, and after having user to complete communication, VIP2 user is without waiting for straight
Connect access communications；
3) the priority service form of VIP3 user are as follows:
VIP3 user is the high priority of third, has the permission for waiting in line to communicate with priority access, if waiting in line time delay
Thresholding is tw, there is VIP3 user when the transmission time interval TTI moment, judge whether the waiting time of VIP3 user is less than
In tw, if so, the user continues to wait in line, if it is not, and user access communications not yet, then enable VIP3 user have with
The identical permission of jumping the queue of VIP2 user, the position for the override access communications in the queue of jumping the queue, in currently transmitted time interval TTI
Complete communication, the communication of VIP3 user's priority access；
4) the priority service form of ordinary user are as follows:
Ordinary user does not have priority, carries out resource allocation using maximum CQI algorithm, if there is VIP user, ordinary user is
The minimum user of priority.
4. the adaptive resource dispatching method according to claim 3 based on user Qos demand and queuing policy, feature
Be: the user of judgment step one described in step 2 in column with the presence or absence of with VIP grade user,
If so, the service of corresponding VIP grade is carried out to user according to the VIP grade of user；
If it is not, then carrying out the detailed process of step 3 are as follows:
Step 2 one judges whether have VIP1 user to be serviced in queue queue,
If there have VIP1 user to need in queue queue to be to be serviced, when judging the type of traffic and communication of the user
Between, calculate the Signal to Noise Ratio (SNR) on the different resource block of the userm, and the value of the channel quality CQI of each communication channel is calculated,
The carrier wave m for selecting channel quality best by following formula:
In formula, M is total carrier number, 1≤m≤M, CQImIndicate channel quality of the VIP1 user on carrier wave m；According to channel quality
CQImThe best carrier wave m of the calculated result selection channel quality of formula, the communication data of VIP1 user is transmitted with carrier wave m, and break
Open the connection request for using carrier wave m transmission data user；
If it is not, carrying out in next step；
Step 2 two judges whether have VIP2 user to be serviced in queue queue,
It is to be serviced if there is there is the user of VIP2 to need in queue queue, then VIP2 user is placed on the foremost of queue queue
Position, waited in line；
If it is not, carrying out in next step；
Step 2 three judges whether have VIP3 user to be serviced in queue queue,
If there have VIP3 user to need in queue queue to be to be serviced, waited in line duration TwWhen with the waiting thresholding of setting
Long twIt is compared, if Tw<tw, then the user continues to be ranked up waiting together with ordinary user in Resource Scheduler RS；If
Tw>tw, then the user has permission identical with VIP2 user at this time, it is discharged to the position of the foremost of the sequence to be accessed such as queue,
Wait priority access communication；
If it is not, the step of carrying out the transmission time interval TTI resource block scheduling of step 3.
5. according to claim 1, the 2 or 4 adaptive resource dispatching method based on user Qos demand and queuing policy,
It is characterized by: judging whether each member carrier has resource block can in each transmission time interval TTI described in step 3
With scheduling；If so, the user for coming foremost in selection Subscriber Queue services, then the process of progress step 6 is,
Judge whether each member carrier has the resource block that can be scheduled, can be scheduled if had in currently transmitted time interval TTI
Resource block then selects the user of foremost in queue to service, and according to maximum CQI algorithm criterion, not up to waits all
Thresholding duration twVIP3 user and ordinary user be lined up according to the value sequence from big to small of channel quality CQI, wait
Communication, then carries out step 6.
6. the adaptive resource dispatching method according to claim 5 based on user Qos demand and queuing policy, feature
Be: the judgement Connection Time described in step 5 is greater than Smallest connection time teUser, and the user accounts on resource block RB
The value of average channel quality CQI is less than the mistake that substitute user on resource block RB accounts for the average channel quality CQI value on resource block RB
Journey are as follows: the value for the average channel quality CQI that user accounts on resource block RB and substitute user account for the average channel matter on resource block RB
The comparison of amount CQI value is calculated by following formula, so that it is determined that the value for the average channel quality CQI that user accounts on resource block RB is
The no value that the average channel quality CQI on resource block RB is accounted for less than substitute user on resource block RB,
In formula, UonIndicate the total number of users that may be replaced online, UreplaceIndicate that the user that may be replaced in queue queue is total
Number, MneedIndicate the quantity for the resource block RB that replacement business needs, CQIm(uon) indicate m-th of resource block user uonCQI value,
CQIm(ureplace) indicate m-th of resource block user ureplaceCQI value；ΔreplaceFor the threshold value of setting, by such as
Lower formula obtains:
In formula, b indicates the adjustment parameter of replacement business, nno-linkIndicate the number of users serviced after replacement business, nlinkIndicate replacement
The number of users serviced before business.
7. according to claim 1, the adaptive resource dispatching party described in 2,4 or 6 based on user Qos demand and queuing policy
Method, it is characterised in that: judge whether the waiting time of the user each waited in line is greater than the user of setting described in step 6
Waiting time thresholding twm, if so, requeuing after improving the value of the channel quality CQI of the user；If it is not, then carrying out step 7
During,
The step of requeuing after the value of the channel quality CQI of the described raising user, the channel quality of the user after raising
The calculation formula of the value of CQI are as follows:
CQInew=CQIold+[Δimprove]
In formula, [] indicates round numbers, CQIoldIndicate the original CQI value of the user, CQInewIndicate the value of the CQI after improving, and
In formula, a indicates the adjustment parameter of business service, NneedIndicate resource block RB number required for current business, kno-linkIt indicates
User's percentage, k shared by the business in queue queuelinkIndicate user hundred shared by the business in the queue serviced
Divide ratio.
8. the adaptive resource dispatching method according to claim 7 based on user Qos demand and queuing policy, feature
It is: judges whether Chao Shi process is to judge transmission time interval for the duration of transmission time interval TTI described in step 7
Whether the duration of TTI is greater than the renewal time of the value of user channel quality CQI.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810953970.1A CN109041247B (en) | 2018-08-21 | 2018-08-21 | Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810953970.1A CN109041247B (en) | 2018-08-21 | 2018-08-21 | Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109041247A true CN109041247A (en) | 2018-12-18 |
| CN109041247B CN109041247B (en) | 2021-09-07 |
Family
ID=64627109
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810953970.1A Active CN109041247B (en) | 2018-08-21 | 2018-08-21 | Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109041247B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559144A (en) * | 2020-12-09 | 2021-03-26 | 海南大学 | Intelligent sharing device scheduling method facing data and information rights and interests exchange |
| CN113055936A (en) * | 2019-12-27 | 2021-06-29 | 大唐高鸿数据网络技术股份有限公司 | Resource selection processing method and terminal |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101400132A (en) * | 2007-09-28 | 2009-04-01 | 大唐移动通信设备有限公司 | Method and apparatus for sharing control channel resource distribution |
| CN102548009A (en) * | 2012-01-16 | 2012-07-04 | 北京邮电大学 | Radio resource scheduling method of queue service with finite length |
| CN103596285A (en) * | 2012-08-16 | 2014-02-19 | 华为技术有限公司 | Wireless resource scheduling method, wireless resource scheduler and system thereof |
| CN105120482A (en) * | 2015-09-14 | 2015-12-02 | 哈尔滨工业大学 | Delay first scheduling method based on resource utilization ratio |
| CN106028453A (en) * | 2016-07-01 | 2016-10-12 | 南京邮电大学 | Wireless virtual network resource cross-layer scheduling and mapping method based on queuing theory |
| WO2017181873A1 (en) * | 2016-04-22 | 2017-10-26 | 华为技术有限公司 | Network equipment, controller, queue management method and traffic management chip |
-
2018
- 2018-08-21 CN CN201810953970.1A patent/CN109041247B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101400132A (en) * | 2007-09-28 | 2009-04-01 | 大唐移动通信设备有限公司 | Method and apparatus for sharing control channel resource distribution |
| CN102548009A (en) * | 2012-01-16 | 2012-07-04 | 北京邮电大学 | Radio resource scheduling method of queue service with finite length |
| CN103596285A (en) * | 2012-08-16 | 2014-02-19 | 华为技术有限公司 | Wireless resource scheduling method, wireless resource scheduler and system thereof |
| CN105120482A (en) * | 2015-09-14 | 2015-12-02 | 哈尔滨工业大学 | Delay first scheduling method based on resource utilization ratio |
| WO2017181873A1 (en) * | 2016-04-22 | 2017-10-26 | 华为技术有限公司 | Network equipment, controller, queue management method and traffic management chip |
| CN106028453A (en) * | 2016-07-01 | 2016-10-12 | 南京邮电大学 | Wireless virtual network resource cross-layer scheduling and mapping method based on queuing theory |
Non-Patent Citations (2)
| Title |
|---|
| SIYUE SUN，QIYUE YU，WEIXIAO MENG，CHENG LI: "A configurable dual-mode algorithm on delay-aware low-computation scheduling and resource allocation in LTE downlink", 《2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)》 * |
| 罗宁，刘峰: "基于优先级队列的多约束无线链路资源调度算法", 《指挥控制与仿真》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113055936A (en) * | 2019-12-27 | 2021-06-29 | 大唐高鸿数据网络技术股份有限公司 | Resource selection processing method and terminal |
| CN113055936B (en) * | 2019-12-27 | 2023-02-21 | 中信科智联科技有限公司 | Resource selection processing method and terminal |
| CN112559144A (en) * | 2020-12-09 | 2021-03-26 | 海南大学 | Intelligent sharing device scheduling method facing data and information rights and interests exchange |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109041247B (en) | 2021-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101164744B1 (en) | Method for triggering the transmission of buffer status reportingbsr information | |
| CN107241134B (en) | Channel allocation method of low-earth-orbit satellite communication system | |
| EP1469641A3 (en) | Scheduler and method for scheduling transmissions in a communication network | |
| CN103596224B (en) | Resource regulating method based on multistage-mapping under a kind of high-speed mobile environment | |
| KR20020027214A (en) | Method for allocating radio resource, radio communication apparatus and radio communication system | |
| CN105897612B (en) | A kind of method and system based on the distribution of SDN multi service dynamic bandwidth | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| WO2020192604A1 (en) | Resource allocation method and apparatus, and storage medium and electronic apparatus | |
| JP2002508135A (en) | Resource controller for non-unitary service systems | |
| CN104427625A (en) | Network resource scheduling method and system based on user experience | |
| CN102868638A (en) | Method and system for dynamically regulating bandwidth | |
| CN101540716B (en) | Service quality-based method and service quality-based device for scheduling non-guaranteed bit rate service | |
| CN112637911A (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| CN109041247A (en) | Adaptive resource dispatching method based on user Qos demand and queuing policy | |
| CN109982390A (en) | Customer service support method, device, equipment and medium | |
| CN100369524C (en) | CDMA system up-bag dispatching method | |
| CN104602355B (en) | mixed service dispatching method in LTE system | |
| CN102724763A (en) | Time domain group scheduling method on basis of two-dimensional priority level | |
| CN102036378A (en) | Method and device for allocating channels as well as method for allocating available resources of base station | |
| CN105873128B (en) | A kind of LTE fairness dispatching method based on delay sensitive | |
| KR20070029065A (en) | Method and apparatus for scheduling in a communication system | |
| CN102624597A (en) | Two-way sequencing virtual network mapping method | |
| CN107005849A (en) | A kind of cell power is shared and method of adjustment and base station | |
| WO2013097712A1 (en) | Scheduling method and device, and base station | |
| CN102833786B (en) | Independent Carrier Wave dispatching method in a kind of multicarrier system |
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 |