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 PDF

Info

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
users
queue
queuing
cqi
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
CN201810953970.1A
Other languages
Chinese (zh)
Other versions
CN109041247B (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 Shenzhen
Original Assignee
Harbin Institute of Technology Shenzhen
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 Shenzhen filed Critical Harbin Institute of Technology Shenzhen
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

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/535Allocation or scheduling criteria for wireless resources based on resource usage policies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation 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)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

基于用户Qos需求和排队策略的自适应资源调度方法,属于通信领域。现有的用于通信请求的经典排队算法在用户超密集的场景应用中出现载波资源块利用率低,以及在排队用户业务类型比列不同时,经典算法无法通过系统调整服务的业务类型比例的问题。本发明方法,本发明基于排队策略和用户Qos需求,根据不同用户优先级,提供不同的用户等级服务,先服务用户优先级高的用户;根据不同的业务类型,调度资源自适应地调整用户排队业务类型比和服务用户的业务类型比。本发明能够显著提高系统的服务用户数、缩短平均用户排队等待时间并提高用户公平性,且能够根据实际情况的需求自适应调整服务用户的业务类型比例和未服务用户的业务类型比例。

The invention relates to an adaptive resource scheduling method based on user Qos requirements and queuing policies, belonging to the communication field. The existing classic queuing algorithm for communication requests has a low utilization rate of carrier resource blocks in the application of ultra-intensive user scenarios, and when the ratio of business types of queuing users is different, the classic algorithm cannot adjust the proportion of business types of services through the system. question. The method of the present invention, based on the queuing policy and user Qos requirements, provides different user level services according to different user priorities, and serves users with high user priority first; according to different service types, scheduling resources adaptively adjust user queuing Business type ratio and service user's business type ratio. The invention can significantly increase the number of service users of the system, shorten the average user queuing waiting time and improve user fairness, and can adaptively adjust the service type ratio of service users and non-service users according to actual needs.

Description

基于用户Qos需求和排队策略的自适应资源调度方法Adaptive Resource Scheduling Method Based on User Qos Requirement and Queuing Policy

技术领域technical field

本发明涉及一种基于用户Qos需求和排队策略的自适应资源调度方法。The invention relates to an adaptive resource scheduling method based on user Qos requirements and queuing strategies.

背景技术Background technique

5G提出“万物互联”的愿景,在物联网(IOT)的大环境下,会有大量的用户和机器终端需要与基站连接。这时在有限资源分配的情况下,就需要合理的资源调度策略和排队准则,来提高系统的性能。5G proposes the vision of "Internet of Everything". In the context of the Internet of Things (IOT), a large number of users and machine terminals will need to be connected to base stations. At this time, in the case of limited resource allocation, a reasonable resource scheduling strategy and queuing criteria are needed to improve system performance.

目前关于用户排队的算法的研究大部分都是基于某种排队准则来给用户排队并进行资源调度,经典的排队算法有最大CQI算法、轮询算法和比例公平算法。而这些经典排队算法在用户超密集的场景应用中,会有由于某些用户凭借自己的排队优势而占据大量优秀的资源,导致其他用户体验很差,致使系统用户公平性差的现象,而且在排队用户业务类型比列不同时,经典算法无法通过系统调整服务的业务类型比例。At present, most of the researches on user queuing algorithms are based on certain queuing criteria to queue users and perform resource scheduling. The classic queuing algorithms include maximum CQI algorithm, round robin algorithm and proportional fairness algorithm. However, in the application of these classic queuing algorithms in ultra-intensive user scenarios, some users will occupy a large number of excellent resources by virtue of their queuing advantages, resulting in poor experience for other users, resulting in poor fairness for system users, and in queuing When the proportion of user business types is different, the classic algorithm cannot adjust the proportion of business types served through the system.

发明内容Contents of the invention

本发明的目的是为了解决现有的用于通信请求的经典排队算法在用户超密集的场景应用中出现载波资源块利用率低,以及在排队用户业务类型比列不同时,经典算法无法通过系统调整服务的业务类型比例的问题,而提出一种基于用户Qos需求和排队策略的自适应资源调度方法。The purpose of the present invention is to solve the problem that the existing classic queuing algorithm for communication requests has a low carrier resource block utilization rate in the application of ultra-intensive user scenarios, and when the queuing user service type ratio is different, the classic algorithm cannot pass the system. To solve the problem of adjusting the proportion of business types of services, an adaptive resource scheduling method based on user Qos requirements and queuing policies is proposed.

一种基于用户Qos需求和排队策略的自适应资源调度方法,所述方法通过以下步骤实现:A method for adaptive resource scheduling based on user Qos requirements and queuing strategies, said method is implemented through the following steps:

步骤一、计算通信请求的用户在不同成员载波上的信道质量CQI的值,并按最大CQI算法的排队准进行排队,获得用户队列;Step 1, calculate the value of the channel quality CQI of the user of the communication request on different component carriers, and queue up according to the queuing criterion of the maximum CQI algorithm, obtain the user queue;

步骤二、判断步骤一的用户对列中是否存在具有VIP等级的用户,Step 2, judging whether there is a user with a VIP level in the user pair column of step 1,

若是,则根据用户的VIP等级对用户进行相应的VIP等级的服务;If so, provide corresponding VIP level services to the user according to the user's VIP level;

若否,则进行步骤三;If not, go to step three;

步骤三、判断每个成员载波在每个发送时间间隔TTI中是否有资源块可以调度;Step 3, judging whether each component carrier has resource blocks that can be scheduled in each transmission time interval TTI;

若是,则选择用户队列中排在最前面的用户进行服务,然后进行步骤六;If so, then select the user who ranks first in the user queue to serve, and then proceed to step six;

若否,则进行步骤四;If not, go to step 4;

步骤四、判断用户队列中是否存在连接时间大于最大连接时间tc的用户,Step 4, determine whether there is a user whose connection time is greater than the maximum connection time tc in the user queue,

若是,则给该用户服务断线,重新计算该用户信道质量的CQI的值,并重新排队,然后进行步骤六;If so, then disconnect the service to the user, recalculate the value of the CQI of the channel quality of the user, and requeue, and then proceed to step 6;

若否,则进行步骤五;If not, go to step five;

步骤五、判断是否存在连接时间大于最小连接时间te的用户,且该用户占资源块RB上的平均信道质量CQI的值小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值;其中,替补用户表示当该用户断线后再连接上的用户,Step 5. Determine whether there is a user whose connection time is greater than the minimum connection time t e , and the value of the average channel quality CQI of the user on the resource block RB is less than the value of the average channel quality CQI of the resource block RB occupied by the substitute user on the resource block RB Value; among them, the substitute user means the user who connects after the user disconnects,

若是,则令替补用户替换当前用户,然后替补用户重新进行排队进行步骤六;If so, make the substitute user replace the current user, and then the substitute user re-queues and proceeds to step 6;

若否,则进行步骤六;If not, proceed to step six;

步骤六、判断每个排队等待的用户的等待时间是否大于设定的用户等待时间门限twmStep 6, judging whether the waiting time of each user waiting in line is greater than the set user waiting time threshold t wm ,

若是,则提高该用户的信道质量CQI的值后重新排队,进行步骤七;If so, then increase the value of the user's channel quality CQI and re-queue, and proceed to step 7;

若否,则进行步骤七;If not, proceed to step seven;

步骤七、判断发送时间间隔TTI的时长是否超时,Step 7, determine whether the duration of the sending time interval TTI is overtime,

若否,则进入下一个发送时间间隔TTI的调度时间,并返回步骤二;If not, then enter the scheduling time of the next transmission time interval TTI, and return to step 2;

如果发送时间间隔TTI超时,则算法结束;If the sending time interval TTI is overtime, the algorithm ends;

其中,所述的Qos是quality ofservice的缩写,表示服务质量。Wherein, the Qos is an abbreviation of quality of service, which means the quality of service.

本发明的有益效果为:The beneficial effects of the present invention are:

本发明适用于下行密集用户场景,在场景中用户有不同的优先等级,且用户有不同的业务类型。本发明提出的适用于不同用户优先级和多种业务类型的资源调度和用户排队算法,在用户超密集的情况下,根据不同用户优先级,提供不同的用户等级服务,先服务用户优先级高的用户;根据不同的业务类型,调度资源自适应地调整用户排队业务类型比和服务用户的业务类型比。能够对不同优先级用户进行优先资源调度,并在用户排队策略规则上进行改进,在有限资源分配的情况下,提供合理的资源调度策略和排队准则,来提高载波中资源块的利用率,提高系统的性能,从而显著提高系统的服务用户数、缩短平均用户排队等待时间并提高用户公平性,且能够根据实际情况的需求自适应调整服务用户的业务类型比例和未服务用户的业务类型比例。The present invention is suitable for downlink intensive user scenarios, in which users have different priority levels and users have different service types. The resource scheduling and user queuing algorithm suitable for different user priorities and various business types proposed by the present invention provides different user level services according to different user priorities in the case of ultra-intensive users, and serves users with higher priority first. users; according to different service types, the scheduling resource adaptively adjusts the user queuing service type ratio and the service user service type ratio. It can perform priority resource scheduling for users with different priorities, and improve user queuing policy rules. In the case of limited resource allocation, provide reasonable resource scheduling policies and queuing criteria to improve the utilization of resource blocks in the carrier and improve The performance of the system, thereby significantly increasing the number of service users of the system, shortening the average user queuing time and improving user fairness, and can adaptively adjust the business type ratio of service users and non-service users according to the actual situation.

附图说明Description of drawings

图1为本发明的流程图;Fig. 1 is a flowchart of the present invention;

具体实施方式Detailed ways

具体实施方式一:Specific implementation mode one:

本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,所述方法通过以下步骤实现:The self-adaptive resource scheduling method based on user Qos requirements and queuing strategy of the present embodiment, described method is realized through the following steps:

步骤一、计算通信请求的用户在不同成员载波上的信道质量CQI的值,并按最大CQI算法的排队准进行排队,获得用户队列;Step 1, calculate the value of the channel quality CQI of the user of the communication request on different component carriers, and queue up according to the queuing criterion of the maximum CQI algorithm, obtain the user queue;

步骤二、判断步骤一的用户对列中是否存在具有VIP等级的用户,Step 2, judging whether there is a user with a VIP level in the user pair column of step 1,

若是,则根据用户的VIP等级对用户进行相应的VIP等级的服务;If so, provide corresponding VIP level services to the user according to the user's VIP level;

若否,则进行步骤三;If not, go to step three;

步骤三、判断每个成员载波在每个发送时间间隔TTI中是否有资源块可以调度;Step 3, judging whether each component carrier has resource blocks that can be scheduled in each transmission time interval TTI;

若是,则选择用户队列中排在最前面的用户进行服务,然后进行步骤六;If so, then select the user who ranks first in the user queue to serve, and then proceed to step six;

若否,则进行步骤四;If not, go to step 4;

步骤四、判断用户队列中是否存在连接时间大于最大连接时间tc的用户,Step 4, determine whether there is a user whose connection time is greater than the maximum connection time tc in the user queue,

若是,则给该用户服务断线,重新计算该用户信道质量的CQI的值,并重新排队,然后进行步骤六;If so, then disconnect the service to the user, recalculate the value of the CQI of the channel quality of the user, and requeue, and then proceed to step 6;

若否,则进行步骤五;If not, go to step five;

步骤五、判断是否存在连接时间大于最小连接时间te的用户,且该用户占资源块RB上的平均信道质量CQI的值小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值;其中,替补用户表示当该用户断线后再连接上的用户,Step 5. Determine whether there is a user whose connection time is greater than the minimum connection time t e , and the value of the average channel quality CQI of the user on the resource block RB is less than the value of the average channel quality CQI of the resource block RB occupied by the substitute user on the resource block RB Value; among them, the substitute user means the user who connects after the user disconnects,

若是,则令替补用户替换当前用户,然后替补用户重新进行排队进行步骤六;If so, make the substitute user replace the current user, and then the substitute user re-queues and proceeds to step 6;

若否,则进行步骤六;If not, proceed to step six;

步骤六、判断每个排队等待的用户的等待时间是否大于设定的用户等待时间门限twmStep 6, judging whether the waiting time of each user waiting in line is greater than the set user waiting time threshold t wm ,

若是,则提高该用户的信道质量CQI的值后重新排队,进行步骤七;If so, then increase the value of the user's channel quality CQI and re-queue, and proceed to step 7;

若否,则进行步骤七;If not, proceed to step seven;

步骤七、判断发送时间间隔TTI的时长是否超时,Step 7, determine whether the duration of the sending time interval TTI is overtime,

若否,则进入下一个发送时间间隔TTI的调度时间,并返回步骤二;If not, then enter the scheduling time of the next transmission time interval TTI, and return to step 2;

如果发送时间间隔TTI的时长超时,则算法结束;If the duration of the sending time interval TTI times out, the algorithm ends;

其中,所述的Qos是quality of service的缩写,表示服务质量。Wherein, the Qos is an abbreviation of quality of service, which means the quality of service.

具体实施方式二:Specific implementation mode two:

与具体实施方式一不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤一所述的计算宽带中请求用户在不同成员载波上的信道质量CQI的值,并按最大CQI算法的排队准进行排队,获得用户队列的过程为,通过下式获取所述的信道质量CQI的值最大的用户,表示为 The difference from Embodiment 1 is that in the adaptive resource scheduling method based on user QoS requirements and queuing policies in this embodiment, the calculation of the channel quality CQI value of the requested user on different component carriers in the broadband is calculated in step 1, and Queue according to the queuing standard of the maximum CQI algorithm, and the process of obtaining the user queue is to obtain the user with the largest value of the channel quality CQI by the following formula, expressed as

式中,M为总载波数,m表示第m个载波,m∈M,为载波m的CQI值最大的用户,U为排队队列中的用户总数;然后按最大CQI算法,将用户对应的信道质量CQI的值由大到小进行排队,获得用户队列。In the formula, M is the total number of carriers, m represents the mth carrier, m∈M, is the user with the largest CQI value of the carrier m, and U is the total number of users in the queuing queue; then according to the maximum CQI algorithm, the user Corresponding channel quality CQI values are queued from large to small to obtain a user queue.

具体实施方式三:Specific implementation mode three:

与具体实施方式一或二不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤二所述的具有VIP等级的用户,按照VIP等级分为VIP1用户、VIP2用户、VIP3用户和普通用户四种,不同VIP等级的用户具有不同的优先级,VIP1用户具有最高的优先级,VIP2用户具有次高的优先级,VIP3用户具有第三高的优先级,普通用户即为没有优先级的用户;所述的用户的通信业务类型包括四种:文本业务、语音业务、图像业务和视频业务,且用户业务所需的资源块RB的数量顺序为,文本业务小于语音业务,语音业务小于图像业务,图像业务小于视频业务;Different from the first or second specific embodiment, in the adaptive resource scheduling method based on user Qos requirements and queuing policies in this embodiment, the users with VIP levels described in step 2 are divided into VIP1 users and VIP2 users according to the VIP level , VIP3 users and ordinary users. Users with different VIP levels have different priorities. VIP1 users have the highest priority, VIP2 users have the second highest priority, VIP3 users have the third highest priority, and ordinary users are It is a user without priority; the user’s communication service type includes four types: text service, voice service, image service and video service, and the order of the number of resource blocks RB required by the 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;

其中,不同VIP等级的用户,优先级服务形式的定义如下:Among them, the definition of priority service form for users of different VIP levels is as follows:

VIP1用户的优先级服务形式为:The priority service form of VIP1 users is:

1)VIP1用户为最高的优先级,具有切断当前用户的通信的权限,当VIP1用户需要接入通话时,立即搜索、判断周围信道质量最好的基站及载波,并立刻中断当前正在通话的用户,以令VIP1用户进行数据的传输;其中,VIP1用户的种类包括:军事通信或者紧急预警,紧急预警包括自然灾害的预报、军队元帅的通话、战备准备通话等;1) The VIP1 user has the highest priority and has the right to cut off the communication of the current user. When the VIP1 user needs to connect to the call, it will immediately search and judge the base station and carrier with the best channel quality around it, and immediately interrupt the current user who is talking , so that VIP1 users can transmit data; among them, the types of VIP1 users include: military communications or emergency warnings, emergency warnings include natural disaster forecasts, calls from military marshals, calls for combat readiness, etc.;

2)VIP2用户的优先级服务形式为:2) The priority service form of VIP2 users is:

VIP2用户为次高的优先级,具有插队、优先接入通信的权限,当在该发送时间间隔TTI时刻出现VIP2用户时,且VIP2用户按照排队规则排在队列后面的位置,则不管调度算法如何,都可以将等待接入的VIP2用户插队在队列中最先接入通信的位置,待有用户完成通信后,VIP2用户无需等待直接接入通信;其中,VIP2用户的种类包括:会员制用户,且其业务对实时性要求不高;VIP2 users have the second highest priority and have the right to jump in the queue and access communication first. When a VIP2 user appears at the time interval TTI of the sending time, and the VIP2 user is ranked at the back of the queue according to the queuing rules, no matter what the scheduling algorithm is , the VIP2 users who are waiting for access can be queued at the first position in the queue to access the communication. After the user completes the communication, the VIP2 user does not need to wait to directly access the communication; among them, the types of VIP2 users include: membership users, And its business does not require high real-time performance;

3)VIP3用户的优先级服务形式为:3) The priority service form of VIP3 users is:

VIP3用户为第三高的优先级,具有排队等待和优先接入通信的权限,为了保证VIP3用户的QoS,设排队等待时延门限为tw,当该发送时间间隔TTI时刻出现VIP3用户,判断VIP3用户的等待时间是否小于等于tw,若是,则该用户继续排队等待,若否,且该用户仍未接入通信,则令VIP3用户具有与VIP2用户相同的插队权限,不计其分配算法的排序规则,可以插队在队列中最优先接入通信的位置,此时可以将其优先级看做VIP2,在当前发送时间间隔TTI完成通信,VIP3用户优先接入通信;其中,VIP3用户的种类为运营商的贵宾用户;VIP3 users have the third highest priority and have the right to wait in line and to access communication first. In order to ensure the QoS of VIP3 users, set the waiting delay threshold as t w . Whether the waiting time of the VIP3 user is less than or equal to t w , if yes, the user continues to wait in line, if not, and the user has not yet connected to the communication, the VIP3 user has the same queue jumping authority as the VIP2 user, regardless of the allocation algorithm Sorting rules, you can jump in the queue at the most priority access communication position in the queue. At this time, its priority can be regarded as VIP2, and the communication is completed in the current sending time interval TTI, and VIP3 users have priority to access communication; among them, the type of VIP3 users is VIP users of the operator;

4)普通用户的优先级服务形式为:4) The priority service form of ordinary users is:

普通用户没有优先级,采用最大CQI算法这种基本的资源分配算法进行资源分配,若出现VIP用户,则普通用户为优先级最低的用户。Ordinary users have no priority, and the basic resource allocation algorithm such as the maximum CQI algorithm is used for resource allocation. If VIP users appear, ordinary users are users with the lowest priority.

具体实施方式四:Specific implementation mode four:

与具体实施方式三不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤二所述的判断步骤一的用户对列中是否存在具有VIP等级的用户,The difference from Embodiment 3 is that in the adaptive resource scheduling method based on user Qos requirements and queuing policies in this embodiment, step 2 determines whether there is a user with a VIP level in the user pair in step 1,

若是,则根据用户的VIP等级对用户进行相应的VIP等级的服务;If so, provide corresponding VIP level services to the user according to the user's VIP level;

若否,则进行步骤三,If not, go to step three,

所述的根据用户的VIP等级对用户进行相应的VIP等级的服务的过程为,根据实际问题的要求,该算法可以将通信用户分为四种:VIP1用户、VIP2用户、VIP3用户及普通用户,利用不同的用户具有不同的优先级,在每个调度发送时间间隔TTI内,等待通信的用户有可能为VIP1用户、VIP2用户、VIP3用户或者普通用户中任何一种,资源调度器RS将资源块RB逐一进行分配,当资源块RB完全分配给高优先级的用户以后,再按照排队算法(最大CQI算法,比例公平算法和轮询算法)给优先级较低的用户分配,RS为Resource Scheduler的缩写,表示资源调度器;具体过程为:According to the VIP level of the user, the process of performing the corresponding VIP level service to the user is, according to the requirements of the actual problem, the algorithm can divide the communication users into four types: VIP1 users, VIP2 users, VIP3 users and ordinary users, Utilizing that different users have different priorities, in each scheduling transmission time interval TTI, the user waiting for communication may be any one of VIP1 user, VIP2 user, VIP3 user or ordinary user, and the resource scheduler RS assigns the resource block RBs are allocated one by one. When resource blocks RB are completely allocated to high-priority users, they are allocated to users with lower priority according to the queuing algorithm (maximum CQI algorithm, proportional fairness algorithm and round-robin algorithm). RS is the Resource Scheduler. Abbreviation, indicating the resource scheduler; the specific process is:

步骤二一、判断排队队列中是否有用户等级为最高的优先级的VIP1用户需要被服务,Step 21, judging whether there is a VIP1 user whose user level is the highest priority in the queuing queue to be served,

如果排队队列中有用户等级为最高的优先级的VIP1用户需要被服务,则判断该用户的通信业务类型以及通信时间,计算该用户的不同资源块上的信噪比SNRm,并计算每个通信信道的信道质量CQI的值,通过下式选择信道质量最好的载波m:If there is a VIP1 user with the highest user level in the queuing queue that needs to be served, then judge the user's communication service type and communication time, calculate the signal-to-noise ratio SNRm on different resource blocks of the user, and calculate each communication The value of the channel quality CQI of the channel, the carrier m with the best channel quality is selected by the following formula:

式中,M为总载波数,1≤m≤M,CQIm表示VIP1用户在载波m上的信道质量;根据信道质量CQIm公式的计算结果选择信道质量最好的载波m,用载波m传输VIP1用户的通信数据,并断开正在用载波m传输数据用户的连接请求,从而满足VIP1用户的最高优先级和打断用户通信的权限;In the formula, M is the total number of carriers, 1≤m≤M, and CQIm represents the channel quality of VIP1 users on carrier m; according to the calculation result of the channel quality CQIm formula, select carrier m with the best channel quality, and use carrier m to transmit VIP1 users communication data, and disconnect the connection request of the user who is using the carrier m to transmit data, so as to meet the highest priority of the VIP1 user and the authority to interrupt the user's communication;

如果没有,则进行下一步;If not, proceed to the next step;

步骤二二、判断排队队列中是否有用户等级为次高级的优先级的VIP2用户需要被服务,Step 22, judging whether there is a VIP2 user whose user level is the second-highest priority in the queuing queue to be served,

如果有排队队列中有用户等级是次高级的VIP2的用户需要被服务,则无论调度算法的准则是什么,都把VIP2用户放置在排队队列的最前面的位置,进行排队等待;If there is a VIP2 user whose user level is the second highest in the queuing queue and needs to be served, then no matter what the scheduling algorithm criterion is, the VIP2 user is placed at the forefront of the queuing queue and waits in line;

如果没有,则进行下一步;If not, proceed to the next step;

步骤二三、判断排队队列中是否有用户等级是VIP3用户需要被服务,Step two and three, judging whether there is a user level in the queuing queue that is a VIP3 user that needs to be served,

如果排队队列中有用户等级是第三高的优先级的VIP3用户需要被服务,则将其排队等待时长Tw与设定的等待门限时长tw进行比较,若Tw<tw,则该用户继续在资源调度器RS内与普通用户一起进行排序等待;若Tw>tw,则该用户此时具有与VIP2用户相同的权限,像VIP2用户一样,不计其信道质量如何,都可以排到队列等待接入序列的最前面的位置,等待优先接入通信;If there is a VIP3 user whose user level is the third highest priority in the queuing queue and needs to be served, then compare its queuing waiting time Tw with the set waiting threshold time tw, if Tw<tw, the user continues to be in the resource The scheduler RS performs sorting and waiting with ordinary users; if Tw>tw, the user has the same authority as the VIP2 user at this time, and like the VIP2 user, regardless of the channel quality, it can be queued to wait for the access sequence The frontmost position of , waiting for priority access communication;

如果没有,则进行步骤三的发送时间间隔TTI资源块调度步骤。If not, proceed to the third step of scheduling TTI resource blocks.

具体实施方式五:Specific implementation mode five:

与具体实施方式一、二或四不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤三所述的判断每个成员载波在每个发送时间间隔TTI中是否有资源块可以调度;若是,则选择用户队列中排在最前面的用户进行服务,然后进行步骤六的过程为,判断每个成员载波是否有可被调度的资源块,如果当前发送时间间隔TTI中有可被调度的资源块,则选择队列中最前面的用户进行服务,按照最大CQI算法准则,将所有未达到等待门限时长tw的VIP3用户和普通用户按照信道质量CQI的值从大到小的顺序进行排队,等待通信,然后进行步骤六。Different from specific embodiments 1, 2 or 4, in the adaptive resource scheduling method based on user Qos requirements and queuing policies in this embodiment, in step 3, it is judged whether each component carrier in each transmission time interval TTI There are resource blocks that can be scheduled; if so, select the top user in the user queue to serve, and then proceed to the process of step 6 to determine whether each component carrier has a resource block that can be scheduled. If the current transmission time interval TTI If there are resource blocks that can be scheduled in the queue, select the frontmost user in the queue to serve, and according to the maximum CQI algorithm criterion, all VIP3 users and ordinary users who have not reached the waiting threshold time tw are ranked from large to small according to the channel quality CQI value Queue up in the sequence, wait for communication, and then go to step six.

具体实施方式六:Specific implementation method six:

与具体实施方式五不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤五所述的判断连接时间大于最小连接时间te的用户,且该用户占资源块RB上的平均信道质量CQI的值小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值的过程为:用户占资源块RB上的平均信道质量CQI的值与替补用户占资源块RB上的平均信道质量CQI的值的比较通过下式进行计算,从而确定用户占资源块RB上的平均信道质量CQI的值是否小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值,The difference from Embodiment 5 is that in the adaptive resource scheduling method based on user Qos requirements and queuing strategies in this embodiment, the user whose connection time is determined to be greater than the minimum connection time t e in step 5, and the user occupies a resource block The process that the value of the average channel quality CQI on the RB is smaller than the value of the average channel quality CQI on the resource block RB occupied by the substitute user on the resource block RB is: the value of the average channel quality CQI on the resource block RB occupied by the user and the resource occupied by the substitute user The comparison of the average channel quality CQI value on the block RB is calculated by the following formula, so as to determine whether the average channel quality CQI value of the user occupying the resource block RB is smaller than the average channel quality of the substitute user occupying the resource block RB on the resource block RB The value of the CQI,

式中,Uon表示在线可能被替换的用户总数,Ureplace表示排队队列中可能替换的用户总数,Mneed表示替换业务需要的资源块RB的数量,CQIm(uon)表示第m个资源块用户uon的CQI值,CQIm(ureplace)表示表示第m个资源块用户ureplace的CQI值;Δreplace为设置的门限值,通过如下公式得到:In the formula, U on represents the total number of users that may be replaced online, U replace represents the total number of users that may be replaced in the queuing queue, M need represents the number of resource blocks RB required for replacement services, and CQI m (u on ) represents the mth resource The CQI value of the block user u on , CQI m (u replace ) represents the CQI value of the mth resource block user u replace ; Δ replace is the set threshold value, obtained by the following formula:

式中,b表示替换业务调节参数,nno-link表示替换业务后服务的用户数,nlink表示替换业务前服务的用户数。In the formula, b represents the adjustment parameter of the replacement service, n no-link represents the number of users served after the replacement service, and n link represents the number of users served before the replacement service.

具体实施方式七:Specific implementation mode seven:

与具体实施方式一、二、四或六不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤六所述的判断每个排队等待的用户的等待时间是否大于设定的用户等待时间门限twm,若是,则提高该用户的信道质量CQI的值后重新排队;若否,则进行步骤七的过程中,Different from specific embodiments 1, 2, 4 or 6, in the adaptive resource scheduling method based on user Qos requirements and queuing strategies in this embodiment, in step 6, it is judged whether the waiting time of each user waiting in line is greater than Set the user waiting time threshold t wm , if yes, then increase the value of the channel quality CQI of the user and re-queue; if not, then proceed to the process of step seven,

所述的提高该用户的信道质量CQI的值后重新排队的步骤,提高后的用户的信道质量CQI的值的计算公式为:In the step of re-queuing after the value of improving the channel quality CQI of the user, the calculation formula of the value of the channel quality CQI of the user after the improvement is:

CQInew=CQIold+[Δimprove]CQI new = CQI old + [Δ improve ]

式中,[]表示取整数,CQIold表示该用户原来的CQI值,CQInew表示提高后的CQI的值,且 In the formula, [] represents an integer, CQI old represents the original CQI value of the user, CQI new represents the value of the improved CQI, and

式中,a表示业务服务调节参数,Nneed表示当前业务所需要的资源块RB数,kno-link表示排队队列中该业务所占的用户百分比,klink表示正在被服务的队列中该业务所占的用户百分比。In the formula, a represents the business service adjustment parameter, N need represents the number of resource blocks RB required by the current business, k no-link represents the user percentage of the business in the queuing queue, and k link represents the business in the queue being served % of users.

具体实施方式八:Specific implementation mode eight:

与具体实施方式七不同的是,本实施方式的基于用户Qos需求和排队策略的自适应资源调度方法,步骤七所述的判断发送时间间隔TTI的时长是否超时的过程为,判断发送时间间隔TTI的时长是否大于用户信道质量CQI的值的更新时间。The difference from Embodiment 7 is that in the adaptive resource scheduling method based on user Qos requirements and queuing policies in this embodiment, the process of judging whether the duration of the transmission time interval TTI in step 7 is overtime is to judge the transmission time interval TTI Whether the duration of is greater than the update time of the user channel quality CQI value.

本发明还可有其它多种实施例,在不背离本发明精神及其实质的情况下,本领域技术人员当可根据本发明作出各种相应的改变和变形,但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。The present invention can also have other various embodiments, without departing from the spirit and essence of the present invention, those skilled in the art can make various corresponding changes and deformations according to the present invention, but these corresponding changes and deformations are all Should belong to the scope of protection of the appended claims of the present invention.

Claims (8)

1.一种基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:所述方法通过以下步骤实现:1. an adaptive resource scheduling method based on user Qos requirements and queuing strategies, characterized in that: the method is realized by the following steps: 步骤一、计算通信请求的用户在不同成员载波上的信道质量CQI的值,并按最大CQI算法的排队准进行排队,获得用户队列;Step 1, calculate the value of the channel quality CQI of the user of the communication request on different component carriers, and queue up according to the queuing criterion of the maximum CQI algorithm, obtain the user queue; 步骤二、判断步骤一的用户对列中是否存在具有VIP等级的用户,Step 2, judging whether there is a user with a VIP level in the user pair column of step 1, 若是,则根据用户的VIP等级对用户进行相应的VIP等级的服务;If so, provide corresponding VIP level services to the user according to the user's VIP level; 若否,则进行步骤三;If not, go to step three; 步骤三、判断每个成员载波在每个发送时间间隔TTI中是否有资源块可以调度;Step 3, judging whether each component carrier has resource blocks that can be scheduled in each transmission time interval TTI; 若是,则选择用户队列中排在最前面的用户进行服务,然后进行步骤六;If so, then select the user who ranks first in the user queue to serve, and then proceed to step six; 若否,则进行步骤四;If not, go to step 4; 步骤四、判断用户队列中是否存在连接时间大于最大连接时间tc的用户,Step 4, determine whether there is a user whose connection time is greater than the maximum connection time tc in the user queue, 若是,则给该用户服务断线,重新计算该用户信道质量的CQI的值,并重新排队,然后进行步骤六;If so, then disconnect the service to the user, recalculate the value of the CQI of the channel quality of the user, and requeue, and then proceed to step 6; 若否,则进行步骤五;If not, go to step five; 步骤五、判断是否存在连接时间大于最小连接时间te的用户,且该用户占资源块RB上的平均信道质量CQI的值小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值;其中,替补用户表示当该用户断线后再连接上的用户,Step 5. Determine whether there is a user whose connection time is greater than the minimum connection time t e , and the value of the average channel quality CQI of the user on the resource block RB is less than the value of the average channel quality CQI of the resource block RB occupied by the substitute user on the resource block RB Value; among them, the substitute user means the user who connects after the user disconnects, 若是,则令替补用户替换当前用户,然后替补用户重新进行排队进行步骤六;If so, make the substitute user replace the current user, and then the substitute user re-queues and proceeds to step 6; 若否,则进行步骤六;If not, proceed to step six; 步骤六、判断每个排队等待的用户的等待时间是否大于设定的用户等待时间门限twmStep 6, judging whether the waiting time of each user waiting in line is greater than the set user waiting time threshold t wm , 若是,则提高该用户的信道质量CQI的值后重新排队,进行步骤七;If so, then increase the value of the user's channel quality CQI and re-queue, and proceed to step 7; 若否,则进行步骤七;If not, proceed to step seven; 步骤七、判断发送时间间隔TTI的时长是否超时,Step 7, determine whether the duration of the sending time interval TTI is overtime, 若否,则进入下一个发送时间间隔TTI的调度时间,并返回步骤二;If not, then enter the scheduling time of the next transmission time interval TTI, and return to step 2; 如果发送时间间隔TTI超时,则算法结束;If the sending time interval TTI is overtime, the algorithm ends; 其中,所述的Qos是quality of service的缩写,表示服务质量。Wherein, the Qos is an abbreviation of quality of service, which means the quality of service. 2.根据权利要求1所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤一所述的计算宽带中请求用户在不同成员载波上的信道质量CQI的值,并按最大CQI算法的排队准进行排队,获得用户队列的过程为,通过下式获取所述的信道质量CQI的值最大的用户,表示为 2. the adaptive resource scheduling method based on user Qos requirements and queuing strategy according to claim 1, characterized in that: the value of the channel quality CQI of requesting the user on different component carriers in the calculation broadband described in step 1, and Queue according to the queuing standard of the maximum CQI algorithm, and the process of obtaining the user queue is to obtain the user with the largest value of the channel quality CQI by the following formula, expressed as 式中,M为总载波数,m表示第m个载波,m∈M,为载波m的CQI值最大的用户,U为排队队列中的用户总数;然后按最大CQI算法,将用户对应的信道质量CQI的值由大到小进行排队,获得用户队列。In the formula, M is the total number of carriers, m represents the mth carrier, m∈M, is the user with the largest CQI value of the carrier m, and U is the total number of users in the queuing queue; then according to the maximum CQI algorithm, the user Corresponding channel quality CQI values are queued from large to small to obtain a user queue. 3.根据权利要求1或2所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤二所述的具有VIP等级的用户,按照VIP等级分为VIP1用户、VIP2用户、VIP3用户和普通用户四种,不同VIP等级的用户具有不同的优先级,VIP1用户具有最高的优先级,VIP2用户具有次高的优先级,VIP3用户具有第三高的优先级,普通用户即为没有优先级的用户;所述的用户的通信业务类型包括四种:文本业务、语音业务、图像业务和视频业务,且用户业务所需的资源块RB的数量顺序为,文本业务小于语音业务,语音业务小于图像业务,图像业务小于视频业务;3. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 1 or 2, characterized in that: the users with VIP levels described in step 2 are divided into VIP1 users and VIP2 users according to VIP levels , VIP3 users and ordinary users. Users with different VIP levels have different priorities. VIP1 users have the highest priority, VIP2 users have the second highest priority, VIP3 users have the third highest priority, and ordinary users are It is a user without priority; the user’s communication service types include four types: text service, voice service, image service and video service, and the order of the number of resource blocks RB required by the 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; 其中,不同VIP等级的用户,优先级服务形式的定义如下:Among them, the definition of priority service form for users of different VIP levels is as follows: 1)VIP1用户的优先级服务形式为:1) The priority service form of VIP1 users is: VIP1用户为最高的优先级,具有切断当前用户的通信的权限,当VIP1用户需要接入通话时,立即搜索、判断周围信道质量最好的基站及载波,并立刻中断当前正在通话的用户,以令VIP1用户进行数据的传输;The VIP1 user has the highest priority and has the right to cut off the communication of the current user. When the VIP1 user needs to connect to the call, it immediately searches and judges the base station and carrier with the best channel quality around it, and immediately interrupts the current user who is talking. Let the VIP1 user perform data transmission; 2)VIP2用户的优先级服务形式为:2) The priority service form of VIP2 users is: VIP2用户为次高的优先级,具有插队、优先接入通信的权限,当在该发送时间间隔TTI时刻出现VIP2用户时,且VIP2用户按照排队规则排在队列后面的位置,则将等待接入的VIP2用户插队在队列中最先接入通信的位置,待有用户完成通信后,VIP2用户无需等待直接接入通信;VIP2 users have the second highest priority and have the right to jump in the queue and access communication first. When a VIP2 user appears at the time of the transmission time interval TTI, and the VIP2 user is ranked at the back of the queue according to the queuing rules, it will wait for access The VIP2 users jump in the queue and are the first to access the communication position in the queue. After a user completes the communication, the VIP2 user does not need to wait to directly access the communication; 3)VIP3用户的优先级服务形式为:3) The priority service form of VIP3 users is: VIP3用户为第三高的优先级,具有排队等待和优先接入通信的权限,设排队等待时延门限为tw,当该发送时间间隔TTI时刻出现VIP3用户,判断VIP3用户的等待时间是否小于等于tw,若是,则该用户继续排队等待,若否,且该用户仍未接入通信,则令VIP3用户具有与VIP2用户相同的插队权限,插队在队列中最优先接入通信的位置,在当前发送时间间隔TTI完成通信,VIP3用户优先接入通信;VIP3 users are the third highest priority and have the right to wait in line and access communication first. Set the waiting time in line as t w . Equal to t w , if yes, the user continues to wait in line, if not, and the user has not yet connected to the communication, then the VIP3 user has the same queue jumping authority as the VIP2 user, and the queue jumping is the most priority access communication position in the queue, The communication is completed at the current sending time interval TTI, and VIP3 users have priority to access the communication; 4)普通用户的优先级服务形式为:4) The priority service form of ordinary users is: 普通用户没有优先级,采用最大CQI算法进行资源分配,若出现VIP用户,则普通用户为优先级最低的用户。Ordinary users have no priority, and the maximum CQI algorithm is used for resource allocation. If VIP users appear, ordinary users are the users with the lowest priority. 4.根据权利要求3所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤二所述的判断步骤一的用户对列中是否存在具有VIP等级的用户,4. the adaptive resource scheduling method based on user Qos requirements and queuing strategy according to claim 3, characterized in that: whether there is a user with a VIP level in the user pair column of step 1 described in step 2, 若是,则根据用户的VIP等级对用户进行相应的VIP等级的服务;If so, provide corresponding VIP level services to the user according to the user's VIP level; 若否,则进行步骤三的具体过程为:If not, the specific process of step 3 is as follows: 步骤二一、判断排队队列中是否有VIP1用户需要被服务,Step 21, judging whether there is a VIP1 user in the queuing queue that needs to be served, 如果排队队列中有VIP1用户需要被服务,则判断该用户的通信业务类型以及通信时间,计算该用户的不同资源块上的信噪比SNRm,并计算每个通信信道的信道质量CQI的值,通过下式选择信道质量最好的载波m:If there is a VIP1 user in the queuing queue that needs to be served, judge the communication service type and communication time of the user, calculate the signal-to-noise ratio SNR m on different resource blocks of the user, and calculate the channel quality CQI value of each communication channel , select the carrier m with the best channel quality by the following formula: 式中,M为总载波数,1≤m≤M,CQIm表示VIP1用户在载波m上的信道质量;根据信道质量CQIm公式的计算结果选择信道质量最好的载波m,用载波m传输VIP1用户的通信数据,并断开正在用载波m传输数据用户的连接请求;In the formula, M is the total number of carriers, 1≤m≤M, and CQI m represents the channel quality of the VIP1 user on the carrier m; according to the calculation result of the channel quality CQI m formula, select the carrier m with the best channel quality, and use the carrier m to transmit VIP1 user's communication data, and disconnect the connection request of the user who is using the carrier m to transmit data; 如果没有,则进行下一步;If not, proceed to the next step; 步骤二二、判断排队队列中是否有VIP2用户需要被服务,Step 22, determine whether there is a VIP2 user in the queuing queue that needs to be served, 如果有排队队列中有VIP2的用户需要被服务,则把VIP2用户放置在排队队列的最前面的位置,进行排队等待;If there is a VIP2 user in the queuing queue that needs to be served, the VIP2 user is placed at the front of the queuing queue and waits in line; 如果没有,则进行下一步;If not, proceed to the next step; 步骤二三、判断排队队列中是否有VIP3用户需要被服务,Step two and three, judging whether there is a VIP3 user in the queuing queue that needs to be served, 如果排队队列中有VIP3用户需要被服务,则将其排队等待时长Tw与设定的等待门限时长tw进行比较,若Tw<tw,则该用户继续在资源调度器RS内与普通用户一起进行排序等待;若Tw>tw,则该用户此时具有与VIP2用户相同的权限,排到队列等待接入序列的最前面的位置,等待优先接入通信;If there is a VIP3 user in the queuing queue that needs to be served, compare its queuing waiting time length T w with the set waiting threshold time t w , if T w < t w , then the user continues to be in the resource scheduler RS with the normal The users are sorted and waited together; if T w >t w , the user has the same authority as the VIP2 user at this time, and is placed in the front of the queue waiting for the access sequence, waiting for priority access communication; 如果没有,则进行步骤三的发送时间间隔TTI资源块调度的步骤。If not, perform the step 3 of scheduling the TTI resource block for the transmission time interval. 5.根据权利要求1、2或4的所述基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤三所述的判断每个成员载波在每个发送时间间隔TTI中是否有资源块可以调度;若是,则选择用户队列中排在最前面的用户进行服务,然后进行步骤六的过程为,判断每个成员载波是否有可被调度的资源块,如果当前发送时间间隔TTI中有可被调度的资源块,则选择队列中最前面的用户进行服务,按照最大CQI算法准则,将所有未达到等待门限时长tw的VIP3用户和普通用户按照信道质量CQI的值从大到小的顺序进行排队,等待通信,然后进行步骤六。5. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 1, 2 or 4, characterized in that: in step 3, it is judged whether each component carrier is in each transmission time interval TTI There are resource blocks that can be scheduled; if so, select the top user in the user queue to serve, and then proceed to the process of step 6 to determine whether each component carrier has a resource block that can be scheduled. If the current transmission time interval TTI If there are resource blocks that can be scheduled in the queue, select the front user in the queue to serve, and according to the maximum CQI algorithm criterion, all VIP3 users and ordinary users who have not reached the waiting threshold time t w are ranked from large to large according to the value of channel quality CQI The small sequence is queued, waiting for communication, and then proceeds to step six. 6.根据权利要求5所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤五所述的判断连接时间大于最小连接时间te的用户,且该用户占资源块RB上的平均信道质量CQI的值小于资源块RB上替补用户占资源块RB上的平均信道质量CQI值的过程为:用户占资源块RB上的平均信道质量CQI的值与替补用户占资源块RB上的平均信道质量CQI值的比较通过下式进行计算,从而确定用户占资源块RB上的平均信道质量CQI的值是否小于资源块RB上替补用户占资源块RB上的平均信道质量CQI的值,6. the adaptive resource scheduling method based on user Qos requirement and queuing policy according to claim 5, is characterized in that: the user whose connection time described in step 5 is greater than minimum connection time t e is judged, and this user occupies resource block The process that the average channel quality CQI value on the RB is smaller than the average channel quality CQI value on the resource block RB occupied by the substitute user on the resource block RB is: the average channel quality CQI value on the resource block RB occupied by the user and the resource block occupied by the substitute user The comparison of the average channel quality CQI value on the RB is calculated by the following formula, so as to determine whether the average channel quality CQI value of the user occupying the resource block RB is smaller than the average channel quality CQI value of the substitute user occupying the resource block RB on the resource block RB value, 式中,Uon表示在线可能被替换的用户总数,Ureplace表示排队队列中可能替换的用户总数,Mneed表示替换业务需要的资源块RB的数量,CQIm(uon)表示第m个资源块用户uon的CQI值,CQIm(ureplace)表示表示第m个资源块用户ureplace的CQI值;Δreplace为设置的门限值,通过如下公式得到:In the formula, U on represents the total number of users that may be replaced online, U replace represents the total number of users that may be replaced in the queuing queue, M need represents the number of resource blocks RB required for replacement services, and CQI m (u on ) represents the mth resource The CQI value of the block user u on , CQI m (u replace ) represents the CQI value of the mth resource block user u replace ; Δ replace is the set threshold value, obtained by the following formula: 式中,b表示替换业务的调节参数,nno-link表示替换业务后服务的用户数,nlink表示替换业务前服务的用户数。In the formula, b represents the adjustment parameter of the replacement service, n no-link represents the number of users served after the replacement service, and n link represents the number of users served before the replacement service. 7.根据权利要求1、2、4或6所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤六所述的判断每个排队等待的用户的等待时间是否大于设定的用户等待时间门限twm,若是,则提高该用户的信道质量CQI的值后重新排队;若否,则进行步骤七的过程中,7. according to claim 1,2,4 or 6 described based on user's Qos demand and the self-adaptive resource scheduling method of queuing policy, it is characterized in that: step 6 described whether the waiting time of judging each queued waiting user is greater than Set the user waiting time threshold t wm , if yes, then increase the value of the channel quality CQI of the user and re-queue; if not, then proceed to the process of step seven, 所述的提高该用户的信道质量CQI的值后重新排队的步骤,提高后的用户的信道质量CQI的值的计算公式为:In the step of re-queuing after the value of improving the channel quality CQI of the user, the calculation formula of the value of the channel quality CQI of the user after the improvement is: CQInew=CQIold+[Δimprove]CQI new = CQI old + [Δ improve ] 式中,[]表示取整数,CQIold表示该用户原来的CQI值,CQInew表示提高后的CQI的值,且 In the formula, [] represents an integer, CQI old represents the original CQI value of the user, CQI new represents the value of the improved CQI, and 式中,a表示业务服务的调节参数,Nneed表示当前业务所需要的资源块RB数,kno-link表示排队队列中该业务所占的用户百分比,klink表示正在被服务的队列中该业务所占的用户百分比。In the formula, a represents the adjustment parameter of the business service, N need represents the number of resource blocks RB required by the current business, k no-link represents the user percentage of the business in the queuing queue, and k link represents the RB in the queue being served The percentage of users accounted for by the business. 8.根据权利要求7所述的基于用户Qos需求和排队策略的自适应资源调度方法,其特征在于:步骤七所述的判断发送时间间隔TTI的时长是否超时的过程为,判断发送时间间隔TTI的时长是否大于用户信道质量CQI的值的更新时间。8. The adaptive resource scheduling method based on user Qos requirements and queuing strategies according to claim 7, characterized in that: the process of judging whether the duration of the sending time interval TTI in step 7 is overtime is to judge the sending time interval TTI Whether the duration of is greater than the update time of the user channel quality CQI value.
CN201810953970.1A 2018-08-21 2018-08-21 Adaptive resource scheduling method based on user QoS requirements 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 Adaptive resource scheduling method based on user QoS requirements and queuing strategy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810953970.1A CN109041247B (en) 2018-08-21 2018-08-21 Adaptive resource scheduling method based on user QoS requirements 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 Adaptive resource scheduling method based on user QoS requirements and queuing strategy

Country Status (1)

Country Link
CN (1) CN109041247B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
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
CN120031343A (en) * 2025-04-21 2025-05-23 北京悦途出行网络科技有限公司 High-speed rail business channel ticket checking service method based on data transmission

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 南京邮电大学 Cross-layer Scheduling and Mapping Method of Wireless Virtual Network Resources 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 南京邮电大学 Cross-layer Scheduling and Mapping Method of Wireless Virtual Network Resources Based on Queuing Theory

Non-Patent Citations (2)

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

* Cited by examiner, † Cited by third party
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
CN120031343A (en) * 2025-04-21 2025-05-23 北京悦途出行网络科技有限公司 High-speed rail business channel ticket checking service method based on data transmission

Also Published As

Publication number Publication date
CN109041247B (en) 2021-09-07

Similar Documents

Publication Publication Date Title
US9001763B2 (en) Wireless service access method and apparatus
US7796551B1 (en) Parallel adaptive quantile wireless scheduler
KR101728840B1 (en) LTE scheduling
JP2008011539A (en) Apparatus and method for scheduling data packets in a communication system
Bojovic et al. A new channel and QoS aware scheduler to enhance the capacity of voice over LTE systems
CN101286949A (en) MAC Layer Resource Scheduling Strategy of Wireless Mesh Network Based on IEEE802.16d Standard
US20100061321A1 (en) Method of scheduling packets
CN104619034B (en) Towards the grouping scheduling method of real time business in a kind of LTE communication system
CN106211234B (en) Scheduling method of LTE system private network and LTE system dynamic resource scheduler
CN111757468A (en) A resource allocation method, device, storage medium, and electronic device
CN109041247A (en) Adaptive resource dispatching method based on user Qos demand and queuing policy
WO2014117347A1 (en) Data scheduling method and apparatus
CN113746677A (en) 5G new air interface oriented network slice internal resource allocation method
CN104980935A (en) Method, device and system for sharing network
CN107872892A (en) A method and device for allocating wireless resources
CN101808324B (en) MAC layer architecture design of wireless Mesh network
CN100550704C (en) Channel priority queuing strategy in the multi-carrier communications systems
CN102469602A (en) User multi-service scheduling method
WO2013097712A1 (en) Scheduling method and device, and base station
CN108882383B (en) Modulation and coding scheme-based uplink residual resource allocation method and base station
CN107769977B (en) Power communication network resource allocation method based on soft switch
CN1633097A (en) Quality of Service Scheduler and Method for Voice Service in Broadband Wireless Metropolitan Area Network
CN112543490B (en) Method and device for admitting user equipment and method and device for switching user equipment
CN107155220B (en) Resource scheduling method and device
CN104185288B (en) Multi-user dispatching method and base station

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