CN109041247B - Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy - Google Patents

Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy Download PDF

Info

Publication number
CN109041247B
CN109041247B CN201810953970.1A CN201810953970A CN109041247B CN 109041247 B CN109041247 B CN 109041247B CN 201810953970 A CN201810953970 A CN 201810953970A CN 109041247 B CN109041247 B CN 109041247B
Authority
CN
China
Prior art keywords
user
service
queuing
cqi
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.)
Active
Application number
CN201810953970.1A
Other languages
Chinese (zh)
Other versions
CN109041247A (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.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN201810953970.1A priority Critical patent/CN109041247B/en
Publication of CN109041247A publication Critical patent/CN109041247A/en
Application granted granted Critical
Publication of CN109041247B publication Critical patent/CN109041247B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

A self-adaptive resource scheduling method based on user Qos requirements and queuing strategies belongs to the field of communication. The traditional classic queuing algorithm for communication requests has the problems that the utilization rate of carrier resource blocks is low in the application of a scene with ultra-dense users, and the service type proportion of services cannot be adjusted by the classic algorithm through a system when the service type proportion of the queued users is different. The method of the invention provides different user grade services according to different user priorities based on queuing strategy and user Qos requirement, and firstly serves users with high user priorities; and according to different service types, the scheduling resources adaptively adjust the user queuing service type ratio and the service user service type ratio. The invention can obviously improve the number of the service users of the system, shorten the average user queuing waiting time and improve the user fairness, and can adaptively adjust the service type proportion of the service users and the service type proportion of the non-service users according to the requirements of actual conditions.

Description

Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy
Technical Field
The invention relates to a self-adaptive resource scheduling method based on user Qos requirements and a queuing strategy.
Background
The vision of "everything interconnection" is proposed by 5G, and in a large environment of the internet of things (IOT), a large number of users and machine terminals need to be connected with a base station. In this case, under the condition of limited resource allocation, reasonable resource scheduling strategies and queuing criteria are required to improve the performance of the system.
Most of the current researches on user queuing algorithms are based on a certain queuing criterion to queue users and schedule resources, and the classic queuing algorithms include a maximum CQI algorithm, a polling algorithm and a proportional fairness algorithm. In the application of the classic queuing algorithms in the scene with ultra-dense users, some users occupy a large amount of excellent resources by virtue of own queuing advantages, so that other users experience poor, and the fairness of system users is poor.
Disclosure of Invention
The invention aims to solve the problems that the utilization rate of carrier resource blocks is low in the application of an ultra-dense user scene in the conventional classical queuing algorithm for communication requests, and the service type proportion of services cannot be adjusted by the classical queuing algorithm through a system when the service type proportion of queued users is different, and provides a self-adaptive resource scheduling method based on user Qos requirements and queuing strategies.
A self-adaptive resource scheduling method based on user Qos demand and queuing strategy is realized by the following steps:
step one, calculating channel quality CQI values of users of communication requests on different member carriers, and queuing according to a queuing criterion of a maximum CQI algorithm to obtain a user queue;
step two, judging whether the user queue in the step one has a user with a VIP level,
if so, performing corresponding VIP level service on the user according to the VIP level of the user;
if not, performing the third step;
step three, judging whether each member carrier has resource blocks which can be scheduled in each transmission time interval TTI;
if yes, selecting the user arranged at the front in the user queue for service, and then performing the step six;
if not, performing the fourth step;
step four, judging whether the connection time in the user queue is larger than the maximum connection time tcThe user of (a) is permitted to,
if yes, the service of the user is disconnected, the CQI value of the channel quality of the user is recalculated, and queuing is performed again, and then the step six is performed;
if not, performing the fifth step;
step five, judging whether the connection time is larger than the minimum connection time teThe value of the average channel quality CQI of the user occupying the resource block RB is smaller than the value of the average channel quality CQI of the replacement user occupying the resource block RB; wherein, the alternative user represents the user who is connected after the user is disconnected,
if yes, enabling the replacement user to replace the current user, and then queuing the replacement user again to perform the step six;
if not, performing the sixth step;
step six, judging whether the waiting time of each user waiting in line is greater than a set user waiting time threshold twm，
If yes, increasing the value of the channel quality CQI of the user and then queuing again, and performing the seventh step;
if not, performing the seventh step;
step seven, judging whether the time length of the transmission time interval TTI is overtime or not,
if not, entering the scheduling time of the next transmission time interval TTI, and returning to the step two;
if the transmission time interval TTI is overtime, the algorithm is ended;
wherein, the Qos is an abbreviation of quality of service, which indicates quality of service.
The invention has the beneficial effects that:
the invention is suitable for the downlink intensive user scene, the users have different priority levels in the scene, and the users have different service types. The resource scheduling and user queuing algorithm applicable to different user priorities and various service types, provided by the invention, provides different user grade services according to different user priorities under the condition that users are ultra-dense, and firstly serves the users with high user priorities; and according to different service types, the scheduling resources adaptively adjust the user queuing service type ratio and the service user service type ratio. The method can perform priority resource scheduling on users with different priorities, improve the user queuing strategy rules, provide reasonable resource scheduling strategies and queuing criteria under the condition of limited resource allocation, improve the utilization rate of resource blocks in carriers, and improve the performance of the system, thereby obviously improving the number of service users of the system, shortening the average user queuing waiting time, improving the fairness of the users, and adaptively adjusting the service type proportion of the service users and the service type proportion of the non-service users according to the requirements of actual conditions.
Drawings
FIG. 1 is a flow chart of the present invention;
Detailed Description
The first embodiment is as follows:
the self-adaptive resource scheduling method based on the user QoS requirement and the queuing strategy of the embodiment is realized by the following steps:
step one, calculating channel quality CQI values of users of communication requests on different member carriers, and queuing according to a queuing criterion of a maximum CQI algorithm to obtain a user queue;
step two, judging whether the user queue in the step one has a user with a VIP level,
if so, performing corresponding VIP level service on the user according to the VIP level of the user;
if not, performing the third step;
step three, judging whether each member carrier has resource blocks which can be scheduled in each transmission time interval TTI;
if yes, selecting the user arranged at the front in the user queue for service, and then performing the step six;
if not, performing the fourth step;
step four, judging whether the connection time in the user queue is larger than the maximum connection time tcThe user of (a) is permitted to,
if yes, the service of the user is disconnected, the CQI value of the channel quality of the user is recalculated, and queuing is performed again, and then the step six is performed;
if not, performing the fifth step;
step five,Judging whether the connection time is more than the minimum connection time teThe value of the average channel quality CQI of the user occupying the resource block RB is smaller than the value of the average channel quality CQI of the replacement user occupying the resource block RB; wherein, the alternative user represents the user who is connected after the user is disconnected,
if yes, enabling the replacement user to replace the current user, and then queuing the replacement user again to perform the step six;
if not, performing the sixth step;
step six, judging whether the waiting time of each user waiting in line is greater than a set user waiting time threshold twm，
If yes, increasing the value of the channel quality CQI of the user and then queuing again, and performing the seventh step;
if not, performing the seventh step;
step seven, judging whether the time length of the transmission time interval TTI is overtime or not,
if not, entering the scheduling time of the next transmission time interval TTI, and returning to the step two;
if the time length of the transmission time interval TTI is overtime, the algorithm is ended;
wherein, the Qos is an abbreviation of quality of service, which indicates quality of service.
The second embodiment is as follows:
different from the first specific embodiment, in the method for scheduling adaptive resources based on user Qos requirements and queuing strategy of this embodiment, the first step is to calculate the channel quality CQI values of the users requested in the broadband over different component carriers, and queue according to the queuing criterion of the maximum CQI algorithm, and the process of obtaining the user queue is to obtain the user with the maximum channel quality CQI value through the following formula, which is expressed as the user with the maximum channel quality CQI value
Figure GDA0003174801360000031
Figure GDA0003174801360000041
Wherein M is the total number of carriers, M represents the mth carrier, M is within the range of M,
Figure GDA0003174801360000042
the user with the maximum CQI value of the carrier m is identified, and U is the total number of users in the queue; then according to the maximum CQI algorithm, the users are transmitted
Figure GDA0003174801360000043
And queuing the corresponding channel quality CQI values from large to small to obtain a user queue.
The third concrete implementation mode:
different from the first or second embodiment, in the method for scheduling adaptive resources based on user Qos requirements and queuing policy of the present embodiment, the users with VIP levels in step two are divided into four types, i.e., a VIP1 user, a VIP2 user, a VIP3 user, and a normal user according to the VIP levels, the users with different VIP levels have different priorities, the VIP1 user has the highest priority, the VIP2 user has the second highest priority, the VIP3 user has the third highest priority, and the normal user is a user without priority; the communication service types of the users include four types: the method comprises the following steps that text service, voice service, image service and video service are carried out, the number sequence of resource blocks RB required by user service is that the text service is smaller than the voice service, the voice service is smaller than the image service, and the image service is smaller than the video service;
the priority service form of the users with different VIP levels is defined as follows:
the VIP1 user's priority service is in the form of:
1) the VIP1 user has the highest priority and the right of cutting off the communication of the current user, when the VIP1 user needs to access the call, the base station and the carrier with the best surrounding channel quality are immediately searched and judged, and the user currently in the call is immediately interrupted, so that the VIP1 user can transmit data; the categories of VIP1 users include: military communication or emergency early warning, wherein the emergency early warning comprises natural disaster prediction, communication of marshal of army, communication of preparation for war and the like;
2) the VIP2 user's priority service is in the form of:
the VIP2 users are of the next highest priority and have the right of queue insertion and communication access priority, when the VIP2 users appear at the moment of the sending time interval TTI, and the VIP2 users are arranged at the positions behind the queue according to the queuing rule, the VIP2 users waiting for access can be inserted into the position of the communication accessed at the first in the queue regardless of the scheduling algorithm, and after the users finish the communication, the VIP2 users do not need to wait for direct access communication; the categories of VIP2 users include: membership system users, and the requirements of the services on the real-time performance are not high;
3) the VIP3 user's priority service is in the form of:
the VIP3 user has the third highest priority and has the queue waiting and priority access communication rights, and in order to ensure the QoS of the VIP3 user, the queue waiting time delay threshold is set as twWhen a VIP3 user appears at the time of the transmission time interval TTI, whether the waiting time of the VIP3 user is less than or equal to t is judgedwIf so, the user continues to wait in a queue, if not, and the user still does not access the communication, the VIP3 user is enabled to have the same queue insertion authority as the VIP2 user, the queue insertion can be performed at the position with the highest priority for accessing the communication in the queue regardless of the sequencing rule of the distribution algorithm, at this time, the priority of the user can be regarded as the VIP2, the communication is completed in the current sending time interval TTI, and the VIP3 user accesses the communication preferentially; the type of the VIP3 user is a VIP user of an operator;
4) the priority service form of the common user is as follows:
the common users have no priority, the resource allocation is carried out by adopting a basic resource allocation algorithm of a maximum CQI algorithm, and if VIP users appear, the common users are the users with the lowest priority.
The fourth concrete implementation mode:
different from the third embodiment, in the adaptive resource scheduling method based on the user Qos requirement and the queuing policy of the present embodiment, the determination of whether there is a user with a VIP level in the user queue in the first step is described in the second step,
if so, performing corresponding VIP level service on the user according to the VIP level of the user;
if not, the third step is carried out,
the process of performing corresponding VIP level service on the user according to the VIP level of the user is that according to the requirement of an actual problem, the algorithm can divide the communication users into four types: the method comprises the following steps that VIP1 users, VIP2 users, VIP3 users and common users have different priorities, in each scheduling transmission time interval TTI, users waiting for communication are possible to be any one of VIP1 users, VIP2 users, VIP3 users or common users, a Resource Scheduler RS allocates Resource blocks RB one by one, after the Resource blocks RB are completely allocated to users with high priorities, the users with lower priorities are allocated according to a queuing algorithm (a maximum CQI algorithm, a fair proportion algorithm and a polling algorithm), and the RS is an abbreviation of Resource Scheduler and represents the Resource Scheduler; the specific process is as follows:
step one, judging whether the VIP1 user with the highest user level priority in the queue needs to be served,
if a VIP1 user with the highest user grade priority in the queue needs to be served, judging the communication service type and communication time of the user, calculating the signal-to-noise ratio SNRm on different resource blocks of the user, calculating the value of the channel quality CQI of each communication channel, and selecting the carrier m with the best channel quality according to the following formula:
Figure GDA0003174801360000051
wherein M is the total carrier number, M is more than or equal to 1 and less than or equal to M, and CQIm represents the channel quality of the VIP1 user on the carrier M; selecting a carrier m with the best channel quality according to the calculation result of the channel quality CQIm formula, transmitting the communication data of the VIP1 user by using the carrier m, and disconnecting the connection request of the user transmitting the data by using the carrier m, thereby meeting the highest priority of the VIP1 user and the authority of interrupting the communication of the user;
if not, the next step is carried out;
step two, judging whether a VIP2 user with a user level of a second-highest priority in the queuing queue needs to be served,
if a user with a user level of the next highest VIP2 in the queuing queue needs to be served, placing the VIP2 user at the forefront position of the queuing queue for queuing no matter what the criterion of the scheduling algorithm is;
if not, the next step is carried out;
step two and step three, whether the user level in the queue is that the VIP3 user needs to be served or not is judged,
if a VIP3 user with a user level of the third highest priority needs to be served in the queue, comparing the queue waiting time Tw with a set waiting threshold time Tw, and if Tw < Tw, continuing to perform sequencing waiting with the common user in the resource scheduler RS; if Tw > Tw, the user has the same authority as the VIP2 user, and like the VIP2 user, regardless of the channel quality, the user can be queued at the head position of the queue waiting for access sequence, and wait for priority access communication;
and if not, performing the step of scheduling the TTI resource block in the step three.
The fifth concrete implementation mode:
different from the first, second, or fourth specific embodiments, in the adaptive resource scheduling method based on the user Qos requirement and the queuing policy of the present embodiment, the third step is to determine whether a resource block of each component carrier can be scheduled in each transmission time interval TTI; if yes, selecting the user arranged at the front in the user queue for service, then carrying out the process of the step six, judging whether each member carrier has a resource block which can be scheduled, if the current transmission time interval TTI has the resource block which can be scheduled, selecting the user at the front in the queue for service, queuing all the VIP3 users and the common users which do not reach the waiting threshold duration tw according to the maximum CQI algorithm criterion from the largest value to the smallest value, waiting for communication, and then carrying out the step six.
The sixth specific implementation mode:
different from the fifth embodiment, in the method for adaptively scheduling resources based on the Qos requirement of the user and the queuing policy of the fifth embodiment, it is determined that the connection time is greater than the minimum connection time teAnd the process that the value of the average channel quality CQI of the user occupying the resource block RB is smaller than the value of the average channel quality CQI of the alternate user occupying the resource block RB comprises the following steps: the comparison of the value of the average channel quality CQI over the resource block RB of the user with the value of the average channel quality CQI over the resource block RB of the replacement user is calculated by the following formula, thereby determining whether the value of the average channel quality CQI over the resource block RB of the user is smaller than the value of the average channel quality CQI over the resource block RB of the replacement user,
Figure GDA0003174801360000061
in the formula of UonRepresents the total number of users, U, that are likely to be replaced onlinereplaceRepresenting the total number of possible replacement users in the queue, MneedIndicating the number of resource blocks, RBs, CQI, required for the replacement servicem(uon) Represents the mth resource block user uonCQI value of, CQIm(ureplace) Represents the mth resource block user ureplaceA CQI value of; deltareplaceThe set threshold value is obtained by the following formula:
Figure GDA0003174801360000071
where b denotes a replacement service adjustment parameter, nno-linkIndicating the number of users, n, of services after replacement of a servicelinkIndicating the number of users served before the service is replaced.
The seventh embodiment:
different from the first, second, fourth or sixth specific embodiments, the adaptive resource based on the user Qos requirement and the queuing policy of the embodimentThe scheduling method, step six said judge whether each waiting user waiting time is greater than the user waiting time threshold twmIf yes, increasing the value of the channel quality CQI of the user and then queuing again; if not, in the process of the step seven,
the step of queuing again after improving the value of the channel quality CQI of the user, wherein the calculation formula of the value of the channel quality CQI of the improved user is as follows:
CQInew＝CQIold+[△improve]
in the formula (2)]Indicating integer, CQIoldIndicating the original CQI value, CQI, of the usernewRepresents the value of the increased CQI, and
Figure GDA0003174801360000072
wherein a denotes a traffic service regulation parameter, NneedIndicates the number of resource blocks RB, k, required for the current serviceno-linkRepresenting the percentage of users in the queue, k, that the service occupieslinkRepresenting the percentage of users in the queue being served that are occupied by the traffic.
The specific implementation mode is eight:
different from the seventh specific embodiment, in the method for scheduling adaptive resources based on user Qos requirements and queuing policy of this embodiment, the step seven of determining whether the duration of the transmission time interval TTI is time out is performed by determining whether the duration of the transmission time interval TTI is greater than the update time of the value of the user channel quality CQI.
The present invention is capable of other embodiments and its several details are capable of modifications in various obvious respects, all without departing from the spirit and scope of the present invention.

Claims (8)

1. A self-adaptive resource scheduling method based on user Qos demand and queuing strategy is characterized in that: the method is realized by the following steps:
step one, calculating channel quality CQI values of users of communication requests on different member carriers, and queuing according to a queuing criterion of a maximum CQI algorithm to obtain a user queue;
step two, judging whether the user queue in the step one has a user with a VIP level,
if so, performing corresponding VIP level service on the user according to the VIP level of the user;
if not, performing the third step;
step three, judging whether each member carrier has resource blocks which can be scheduled in each transmission time interval TTI;
if yes, selecting the user arranged at the front in the user queue for service, and then performing the step six;
if not, performing the fourth step;
step four, judging whether the connection time in the user queue is larger than the maximum connection time tcThe user of (a) is permitted to,
if yes, the service of the user is disconnected, the CQI value of the channel quality of the user is recalculated, and queuing is performed again, and then the step six is performed;
if not, performing the fifth step;
step five, judging whether the connection time is larger than the minimum connection time teThe value of the average channel quality CQI of the user occupying the resource block RB is smaller than the value of the average channel quality CQI of the replacement user occupying the resource block RB; wherein, the alternative user represents the user who is connected after the user is disconnected,
if yes, enabling the replacement user to replace the current user, and then queuing the replacement user again to perform the step six;
if not, performing the sixth step;
step six, judging whether the waiting time of each user waiting in line is greater than a set user waiting time threshold twm，
If yes, increasing the value of the channel quality CQI of the user and then queuing again, and performing the seventh step;
if not, performing the seventh step;
step seven, judging whether the time length of the transmission time interval TTI is overtime or not,
if not, entering the scheduling time of the next transmission time interval TTI, and returning to the step two;
if the transmission time interval TTI is overtime, the algorithm is ended;
wherein, the Qos is an abbreviation of quality of service, which indicates quality of service.
2. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 1, wherein: step one, calculating the channel quality CQI value of the communication request user on different member carriers, and queuing according to the queuing criterion of the maximum CQI algorithm to obtain the user queue, wherein the process of obtaining the user with the maximum channel quality CQI value through the following formula is represented as the user with the maximum channel quality CQI value
Figure FDA0003174801350000021
Figure FDA0003174801350000022
Wherein M is the total number of carriers, M represents the mth carrier, M is within the range of M,
Figure FDA0003174801350000023
the user with the maximum CQI value of the carrier m is identified, and U is the total number of users in the queue; then according to the maximum CQI algorithm, the users are transmitted
Figure FDA0003174801350000024
And queuing the corresponding channel quality CQI values from large to small to obtain a user queue.
3. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 1 or 2, characterized by: the users with the VIP grades in the step two are divided into a VIP1 user, a VIP2 user, a VIP3 user and a common user according to the VIP grades, the users with different VIP grades have different priorities, the VIP1 user has the highest priority, the VIP2 user has the next highest priority, the VIP3 user has the third highest priority, and the common user is a user without priority; the communication service types of the users include four types: the method comprises the following steps that text service, voice service, image service and video service are carried out, the number sequence of resource blocks RB required by user service is that the text service is smaller than the voice service, the voice service is smaller than the image service, and the image service is smaller than the video service;
the priority service form of the users with different VIP levels is defined as follows:
1) the VIP1 user's priority service is in the form of:
the VIP1 user has the highest priority and the right of cutting off the communication of the current user, when the VIP1 user needs to access the call, the base station and the carrier with the best surrounding channel quality are immediately searched and judged, and the user currently in the call is immediately interrupted, so that the VIP1 user can transmit data;
2) the VIP2 user's priority service is in the form of:
the VIP2 user is the next highest priority and has the right of queue insertion and preferential communication access, when a VIP2 user appears at the moment of the sending time interval TTI and the VIP2 user is arranged at the position behind the queue according to the queuing rule, the VIP2 user waiting for access is inserted into the position of the first communication access in the queue, and after the user finishes communication, the VIP2 user does not need to wait for direct communication access;
3) the VIP3 user's priority service is in the form of:
the VIP3 user has the third highest priority, has the right of queuing and priority access communication, and sets the threshold of queuing delay as twWhen a VIP3 user appears at the time of the transmission time interval TTI, whether the waiting time of the VIP3 user is less than or equal to t is judgedwIf yes, the user continues to queue and wait, if no, and the user still does not access communication, the VIP3 user is enabled to have the same queue insertion authority as the VIP2 user, and queue insertion is carried out in the queueThe communication is finished at the current sending time interval TTI at the position where the communication is accessed in the highest priority, and the VIP3 user accesses the communication preferentially;
4) the priority service form of the common user is as follows:
and if the VIP user appears, the common user is the user with the lowest priority.
4. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 3, wherein: step two is described to determine whether there are users with VIP levels in the user queue of step one,
if so, performing corresponding VIP level service on the user according to the VIP level of the user;
if not, the specific process of the third step is as follows:
step one, judging whether a VIP1 user needs to be served in the queuing queue,
if a VIP1 user needs to be served in the queue, the communication service type and the communication time of the user are judged, and the SNR (signal to noise ratio) on different resource blocks of the user is calculatedmAnd calculating a value of channel quality CQI of each communication channel, and selecting a carrier m with the best channel quality by the following formula:
Figure FDA0003174801350000031
wherein M is the total number of carriers, M is more than or equal to 1 and less than or equal to M, CQImRepresents the channel quality of the VIP1 user on carrier m; CQI according to channel qualitymSelecting a carrier m with the best channel quality according to the calculation result of the formula, transmitting the communication data of the VIP1 user by using the carrier m, and disconnecting the connection request of the user transmitting the data by using the carrier m;
if not, the next step is carried out;
step two, judging whether a VIP2 user needs to be served in the queuing queue,
if a user with the VIP2 in the queuing queue needs to be served, placing the VIP2 user at the forefront position of the queuing queue for queuing;
if not, the next step is carried out;
step two, judging whether a VIP3 user needs to be served in the queuing queue,
if a VIP3 user needs to be served in the queuing queue, the queuing waiting time is TwAnd the set waiting threshold duration twMaking a comparison if Tw<twIf the user continues to perform sequencing waiting with the common user in the resource scheduler RS; if Tw>twThen the user now has the same authority as the VIP2 user, queues up to the front of the queue waiting for access to the sequence, and waits for a priority access to the communication;
and if not, performing the step of scheduling the transmission time interval TTI resource block in the step three.
5. The method of adaptive resource scheduling based on user Qos requirements and queuing strategies according to claim 1, 2 or 4, characterized by: step three, judging whether each member carrier has resource blocks which can be scheduled in each transmission time interval TTI; if yes, selecting the user arranged at the front in the user queue for service, then carrying out the process of the sixth step, judging whether each member carrier has a resource block which can be scheduled, if the current transmission time interval TTI has the resource block which can be scheduled, selecting the user at the front in the queue for service, and according to the maximum CQI algorithm criterion, all the time which does not reach the waiting threshold time twThe VIP3 users and the normal users are queued in order of decreasing channel quality CQI values, wait for communication, and then proceed to step six.
6. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 5, wherein: step five, judging that the connection time is greater than the minimum connection time teAnd the value of the average channel quality CQI of the user occupying the resource block RB is less thanThe process of the average channel quality CQI value of the resource block RB in which the alternate users occupy the resource block RB is as follows: the comparison of the value of the average channel quality CQI over the resource block RB occupied by the user with the value of the average channel quality CQI over the resource block RB occupied by the replacement user is calculated by the following formula, thereby determining whether the value of the average channel quality CQI over the resource block RB occupied by the user is smaller than the value of the average channel quality CQI over the resource block RB occupied by the replacement user,
Figure FDA0003174801350000041
in the formula of UonRepresents the total number of users, U, that are likely to be replaced onlinereplaceRepresenting the total number of possible replacement users in the queue, MneedIndicating the number of resource blocks, RBs, CQI, required for the replacement servicem(uon) Represents the mth resource block user uonCQI value of, CQIm(ureplace) Represents the mth resource block user ureplaceA CQI value of; deltareplaceThe set threshold value is obtained by the following formula:
Figure FDA0003174801350000042
where b denotes the regulation parameter of the replacement service, nno-linkIndicating the number of users, n, of services after replacement of a servicelinkIndicating the number of users served before the service is replaced.
7. The method of claim 1, 2, 4 or 6 for adaptive resource scheduling based on user Qos requirements and queuing strategies, wherein: step six, judging whether the waiting time of each user waiting in line is larger than the set user waiting time threshold twmIf yes, increasing the value of the channel quality CQI of the user and then queuing again; if not, in the process of the step seven,
the step of queuing again after improving the value of the channel quality CQI of the user, wherein the calculation formula of the value of the channel quality CQI of the improved user is as follows:
CQInew＝CQIold+[△improve]
in the formula (2)]Indicating integer, CQIoldIndicating the original CQI value, CQI, of the usernewRepresents the value of the increased CQI, and
Figure FDA0003174801350000051
where a denotes the regulation parameter of the business service, NneedIndicates the number of resource blocks RB, k, required for the current serviceno-linkRepresenting the percentage of users in the queue, k, that the service occupieslinkRepresenting the percentage of users in the queue being served that are occupied by the traffic.
8. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 7, wherein: and seventhly, judging whether the time length of the transmission time interval TTI is overtime or not, namely judging whether the time length of the transmission time interval TTI is greater than the updating time of the value of the user channel quality CQI or not.
CN201810953970.1A 2018-08-21 2018-08-21 Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy Active CN109041247B (en)

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 CN109041247A (en) 2018-12-18
CN109041247B true 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)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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

Citations (6)

* Cited by examiner, † Cited by third party
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

Patent Citations (6)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
A configurable dual-mode algorithm on delay-aware low-computation scheduling and resource allocation in LTE downlink;Siyue Sun，Qiyue Yu，Weixiao Meng，Cheng Li;《2012 IEEE Wireless Communications and Networking Conference (WCNC)》;20120611;全文 *
基于优先级队列的多约束无线链路资源调度算法;罗宁，刘峰;《指挥控制与仿真》;20121231;全文 *

Also Published As

Publication number Publication date
CN109041247A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
CN101621457B (en) Multi-service scheduling method and system
EP1469641A3 (en) Scheduler and method for scheduling transmissions in a communication network
CN106714323B (en) Priority distinguishing and scheduling method for heterogeneous streams in 4G network
WO2007022817A1 (en) Scheduling depending on quality of service and channel properties
CN102858015B (en) Multi-service scheduling method
CN106954232B (en) Time delay optimized resource allocation method
CN109905330B (en) Dynamic weighted fair queue train network scheduling method based on queue length
CN109041247B (en) Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy
US20040037286A1 (en) System and method of scheduling radio resources in a wireless communications network
CN109548164B (en) Self-adaptive scheduling switching method and system based on load demand
CN112637911A (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
CN102724763A (en) Time domain group scheduling method on basis of two-dimensional priority level
KR20040003052A (en) Multiple threshold scheduler for scheduling transmission of data packets to mobile terminals based on a relative throughput spread
CN100369524C (en) CDMA system up-bag dispatching method
CN107197530B (en) Downlink resource allocation algorithm for channel fluctuation perception in LTE system
CN1996942A (en) A method and system for traffic control
CN108738158B (en) LTE downlink scheduling method based on throughput optimization
CN107659940B (en) Multi-priority multi-channel media access control method based on channel perception
CN107071919B (en) LTE downlink real-time service scheduling improvement method based on packet loss rate
CN101568156B (en) Method and device for radio resource scheduling and base station
CN115442914B (en) WiFi6 access resource optimization method based on transmission time slot power service differentiation
CN105873128A (en) LTE fairness scheduling method based on time delay sensitivity
CN113778682B (en) Resource allocation method for MEC system
CN105517178B (en) A kind of dispatching method of adjustable low complex degree wireless resource scheduling device
CN103096490A (en) Business access method and equipment

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