Resource scheduling method, device, electronic device, storage medium and base station

By obtaining the service quality configuration information of the users to be dispatched, the first packet delay and data cache amount, the priority queue is divided, and the resources are scheduled according to the historical average rate, the problem of inflexible processing of sudden large traffic services in the existing technology is solved. It realizes effective scheduling of QoS streams and meets differentiated business needs.

CN115460713BActive Publication Date: 2024-11-08CHINA TELECOM CORP LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211073641.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-02
Publication Date
2024-11-08
Estimated Expiration
2042-09-02

AI Technical Summary

Technical Problem

Existing resource scheduling algorithms are difficult to flexibly handle burst traffic services, and cannot effectively ensure the indicators and resource scheduling priorities of QoS flows.

Method used

By obtaining the QoS configuration information of the quality of service of the user to be dispatched, the first packet delay and data cache amount are divided into scheduling queues with different priorities, and the average rate priority is determined based on the historical average rate and QoS configuration information to flexibly schedule resources. Handle burst traffic services.

Benefits of technology

It realizes flexible processing of burst large traffic services, reasonably controls QoS service delay, effectively controls user rate during network congestion, meets differentiated business needs, and improves throughput and user satisfaction.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115460713B_ABST
    Figure CN115460713B_ABST
Patent Text Reader

Abstract

The present disclosure provides a resource scheduling method, device, electronic device, storage medium and base station, which relate to the field of communication technology. By obtaining the quality of service QoS configuration information of the user to be scheduled, at each scheduling moment, the first packet delay and data cache amount corresponding to the user to be scheduled are obtained, and according to the QoS configuration information, the first packet delay and the data cache amount, the user to be scheduled is divided into scheduling queues of different priorities, and resources are scheduled for the user to be scheduled according to the scheduling queues of different priorities. If the priorities of the scheduling queues where the users to be scheduled are located are the same, the average rate priority corresponding to the user to be scheduled is determined according to the historical average rate of the user to be scheduled and the QoS configuration information, and resources are scheduled for the user to be scheduled according to the average rate priority of the user to be scheduled. The present disclosure can reasonably schedule resources for the users to be scheduled, effectively solve the business needs of sudden large-traffic business, and better meet differentiated business needs.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] With the continuous development of mobile Internet, new services and vertical industry applications continue to emerge, and higher requirements are also put forward for mobile communication technology. To this end, 5G defines three major application scenarios for diversified service types, namely: enhanced mobile broadband (eMBB, Enhanced Mobile Broadband), ultra-reliable & low-latency communication (uRLLC, ultra-reliable & low-latency communication), and massive machine type communication (mMTC, massive Machine Type of Communication). In order to better improve the user experience, 5G can provide network services based on the granularity of quality of service (QoS, Quality of Service). For the service type of each QoS flow, the performance indicators of the resource type are defined, where the resource type can be divided into guaranteed bit rate (GBR, Guaranteed Bit Rate) and non-guaranteed bit rate (Non-GBR, Non-Guaranteed Bit Rate). Compared with traditional network services, 5G can provide more refined differentiated services to better meet the diverse needs of customers. How to effectively guarantee the indicators of these QoS flows, the processing of resource scheduling priorities is crucial.

[0003] Existing resource scheduling algorithms include: Proportional Fairness (PF) algorithm, improved M-LWDF (M-largest weighted delay first algorithm) algorithm, exponential proportional fairness (EXP / PF) algorithm, etc. The above methods cannot flexibly handle sudden large traffic services.

[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0005] The present disclosure provides a resource scheduling method, device, electronic device, storage medium and base station, which at least to a certain extent overcome the technical problem in the related art that large-traffic services cannot be flexibly processed.

[0006] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.

[0007] In a first aspect, an embodiment of the present disclosure provides a resource scheduling method, the method comprising:

[0008] Obtain the QoS configuration information of the user to be scheduled;

[0009] At each scheduling moment, obtaining the first packet delay and data cache amount corresponding to the user to be scheduled;

[0010] According to the QoS configuration information, the first packet delay and the data cache amount, the to-be-scheduled users are divided into scheduling queues of different priorities;

[0011] Scheduling resources for the user to be scheduled according to scheduling queues of different priorities; if the priorities of the scheduling queues in which the user to be scheduled are located are the same, determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information;

[0012] According to the average rate priority of the user to be scheduled, resources are scheduled for the user to be scheduled to process the QoS flow service corresponding to the user to be scheduled

[0013] In one embodiment of the present disclosure, the QoS configuration information includes a QoS minimum rate, a QoS maximum rate, and a delay budget;

[0014] The dividing the to-be-scheduled users into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount includes:

[0015] If the first packet delay is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue; or, if the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue;

[0016] If the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is less than the delay budget, and the ratio of the data cache amount to the QoS minimum rate is greater than the delay budget, the user to be scheduled is divided into a scheduling queue of the second priority;

[0017] If the first packet delay is less than the delay budget, and the ratio of the data buffer amount to the QoS minimum rate is less than or equal to the delay budget, the user to be scheduled is divided into a scheduling queue of the third priority.

[0018] In one embodiment of the present disclosure, the priority of the first priority scheduling queue is higher than that of the second priority scheduling queue; and the priority of the second priority scheduling queue is higher than that of the third priority scheduling queue.

[0019] In one embodiment of the present disclosure, the QoS configuration information includes a QoS minimum rate and a QoS maximum rate;

[0020] The determining, according to the historical average rate of the user to be scheduled and the QoS configuration information, the average rate priority corresponding to the user to be scheduled includes:

[0021] If the historical average rate is less than the QoS minimum rate, determining the average rate scheduling value of the user to be scheduled according to the minimum rate difference coefficient, the QoS minimum rate and the historical average rate; or,

[0022] If the historical average rate is greater than the QoS maximum rate, determining the average rate scheduling value according to the maximum rate difference coefficient, the QoS maximum rate and the historical average rate; or,

[0023] If the historical average rate is greater than or equal to the QoS minimum rate, and the historical average rate is less than or equal to the QoS maximum rate, the average rate scheduling value is a preset value;

[0024] The average rate priority is determined according to the average rate scheduling value corresponding to the user to be scheduled; wherein, the larger the average rate scheduling value is, the higher the average rate priority is.

[0025] In one embodiment of the present disclosure, determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information includes:

[0026]

[0027] Among them, p r represents the average rate scheduling value; r represents the historical average rate; R max Indicates the maximum rate of QoS; R min represents the minimum QoS rate; K represents a preset value; α1 represents the minimum rate difference coefficient; α2 represents the maximum rate difference coefficient; the larger the average rate scheduling value is, the higher the average rate priority is.

[0028] In one embodiment of the present disclosure, the historical average rate is determined as follows:

[0029] The historical average rate is obtained according to the product of the maximum rate corresponding to the scheduling moment and the weight value corresponding to the maximum rate, and the sum of the product of the average rate value corresponding to the moment before the scheduling moment and the weight value corresponding to the average rate value corresponding to the moment before the scheduling moment.

[0030] In one embodiment of the present disclosure, the QoS configuration information includes a 5G service quality identifier 5QI; wherein the 5QI is used to point to a QoS characteristic parameter;

[0031] After determining the average rate priority corresponding to the to-be-scheduled user, the method further includes:

[0032] If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled; wherein, the smaller the value of the 5QI priority, the higher the 5QI priority;

[0033] Resources are scheduled for the user to be scheduled according to the 5QI priority of the user to be scheduled.

[0034] In one embodiment of the present disclosure, after determining the average rate priority corresponding to the to-be-scheduled user, the method further includes:

[0035] If the average rate priorities corresponding to the users to be scheduled are the same, a channel quality indication CQI value is obtained by mapping the modulation and coding mode, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled; wherein, the larger the CQI value, the higher the CQI priority;

[0036] Resources are scheduled for the user to be scheduled according to the CQI priority of the user to be scheduled.

[0037] In a second aspect, an embodiment of the present disclosure provides a resource scheduling device, including:

[0038] A first acquisition unit, used to acquire quality of service QoS configuration information of the user to be scheduled;

[0039] A second acquisition unit is used to acquire the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment;

[0040] A division unit, configured to divide the to-be-scheduled user into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount;

[0041] A determination unit, configured to schedule resources for the user to be scheduled according to scheduling queues of different priorities, and if the priorities of the scheduling queues in which the users to be scheduled are located are the same, determine the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information;

[0042] The scheduling unit is used to schedule resources for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

[0043] In one embodiment of the present disclosure, the dividing unit is further used to:

[0044] If the first packet delay is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue; or, if the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue;

[0045] If the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is less than the delay budget, and the ratio of the data cache amount to the QoS minimum rate is greater than the delay budget, the user to be scheduled is divided into a scheduling queue of the second priority;

[0046] If the first packet delay is less than the delay budget, and the ratio of the data buffer capacity to the QoS minimum rate is less than or equal to the delay budget, the user to be scheduled is divided into the scheduling queue of the third priority.

[0047] In one embodiment of the present disclosure, the determining unit is further configured to:

[0048] If the historical average rate is less than the QoS minimum rate, determining the average rate scheduling value of the user to be scheduled according to the minimum rate difference coefficient, the QoS minimum rate and the historical average rate; or,

[0049] If the historical average rate is greater than the QoS maximum rate, determining the average rate scheduling value according to the maximum rate difference coefficient, the QoS maximum rate and the historical average rate; or,

[0050] If the historical average rate is greater than or equal to the QoS minimum rate, and the historical average rate is less than or equal to the QoS maximum rate, the average rate scheduling value is a preset value;

[0051] The average rate priority is determined according to the average rate scheduling value corresponding to the user to be scheduled; wherein, the larger the average rate scheduling value is, the higher the average rate priority is.

[0052] In one embodiment of the present disclosure, the determining unit is further configured to:

[0053] The historical average rate is obtained according to the product of the maximum rate corresponding to the scheduling moment and the weight value corresponding to the maximum rate, and the sum of the product of the average rate value corresponding to the moment before the scheduling moment and the weight value corresponding to the average rate value corresponding to the moment before the scheduling moment.

[0054] In one embodiment of the present disclosure, the scheduling unit is further configured to:

[0055] If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled; wherein, the smaller the value of the 5QI priority, the higher the 5QI priority;

[0056] Scheduling resources for the user to be scheduled according to the 5QI priority of the user to be scheduled

[0057] In one embodiment of the present disclosure, the scheduling unit is further configured to:

[0058] If the average rate priorities corresponding to the users to be scheduled are the same, a channel quality indication CQI value is obtained by mapping the modulation and coding mode, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled; wherein, the larger the CQI value, the higher the CQI priority;

[0059] Resources are scheduled for the user to be scheduled according to the CQI priority of the user to be scheduled.

[0060] In a third aspect, an embodiment of the present disclosure provides an electronic device, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the method described in the first aspect above by executing the executable instructions.

[0061] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the method described in the first aspect when executed by a processor.

[0062] In a fifth aspect, according to another aspect of the present disclosure, a computer program product or a computer program is also provided, the computer program product or the computer program includes a computer instruction, and the computer instruction is stored in a computer-readable storage medium. The processor of the computer device reads the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the computer device executes any of the above-mentioned methods.

[0063] In a sixth aspect, an embodiment of the present disclosure provides a base station, including: a memory, a transceiver, and a processor;

[0064] The memory is used to store computer programs;

[0065] a transceiver, for transmitting and receiving data under the control of the processor;

[0066] The processor is configured to read the computer program in the memory and perform the following operations:

[0067] Obtain the QoS configuration information of the user to be scheduled;

[0068] At each scheduling moment, obtaining the first packet delay and data cache amount corresponding to the user to be scheduled;

[0069] According to the QoS configuration information, the first packet delay and the data cache amount, the to-be-scheduled users are divided into scheduling queues of different priorities;

[0070] Scheduling resources for the user to be scheduled according to scheduling queues of different priorities; if the priorities of the scheduling queues in which the user to be scheduled are located are the same, determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information;

[0071] Resources are scheduled for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

[0072] A resource scheduling method provided by an embodiment of the present disclosure obtains the service quality QoS configuration information of a user to be scheduled, obtains the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment, divides the user to be scheduled into scheduling queues with different priorities according to the QoS configuration information, the first packet delay and the data cache amount, schedules resources for the user to be scheduled according to the scheduling queues with different priorities, and if the priorities of the scheduling queues where the users to be scheduled are located are the same, determines the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information, and schedules resources for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

[0073] By comprehensively considering the QoS configuration information, the first packet delay and data cache volume corresponding to the scheduled users at each scheduling moment, the scheduled users are divided into scheduling queues of different priorities, and resources are scheduled according to the scheduling queues. For the same priority scheduling queues, resources are scheduled according to the average rate priority. It can realize flexible processing of sudden large-volume services and reasonably control the QoS service delay. In the same priority scheduling queues, the average rate priority sorting processing is introduced, and the user rate can be effectively controlled within a reasonable QoS rate limit range when the network is congested. Effectively solve the business needs of large-volume services and better meet differentiated business needs.

[0074] Furthermore, for the scheduled users with the same average rate priority, 5QI priority and CQI priority are considered to schedule resources for the scheduled users, which can effectively guarantee throughput and user satisfaction and further meet differentiated business needs.

[0075] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0076] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0077] Figure 1 A schematic diagram showing the structure of a communication network in an embodiment of the present disclosure is shown;

[0078] Figure 2 One of the flowcharts of a resource scheduling method in an embodiment of the present disclosure is shown;

[0079] Figure 3 A second flow chart of a resource scheduling method in an embodiment of the present disclosure is shown;

[0080] Figure 4 A third flowchart of a resource scheduling method in an embodiment of the present disclosure is shown;

[0081] Figure 5 A fourth flowchart of a resource scheduling method in an embodiment of the present disclosure is shown;

[0082] Figure 6 A fifth flow chart of a resource scheduling method in an embodiment of the present disclosure is shown;

[0083] Figure 7A schematic diagram showing the structure of a resource scheduling device in an embodiment of the present disclosure is shown;

[0084] Figure 8 A schematic diagram showing the structure of an electronic device in an embodiment of the present disclosure is shown;

[0085] Fig. 9 A schematic structural diagram of a base station in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0086] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0087] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0088] Since the prior art cannot flexibly handle sudden high-traffic services, based on this, the present disclosure provides a resource scheduling method, which obtains the service quality QoS configuration information of the user to be scheduled, obtains the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment, and divides the user to be scheduled into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount, and schedules resources for the user to be scheduled according to the scheduling queues of different priorities. If the priorities of the scheduling queues where the users to be scheduled are located are the same, the average rate priority corresponding to the user to be scheduled is determined according to the historical average rate of the user to be scheduled and the QoS configuration information, and resources are scheduled for the user to be scheduled according to the average rate priority of the user to be scheduled to process the QoS flow service corresponding to the user to be scheduled. By comprehensively considering the service quality QoS configuration information, the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment, the users to be scheduled are divided into scheduling queues of different priorities, and resources are scheduled according to the scheduling queues. For scheduling queues with the same priority, resources are scheduled according to the average rate priority. It can realize flexible processing of sudden high-traffic services, reasonably control Qos service delay, introduce average rate priority sorting processing in the same priority scheduling queue, and effectively control user rates within a reasonable Qos rate limit range when network congestion occurs. It effectively solves the business needs of high-traffic services and better meets differentiated business needs.

[0089] The network architecture and business scenarios described in the embodiments of the present disclosure are intended to more clearly illustrate the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. A person of ordinary skill in the art can appreciate that with the evolution of the network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.

[0090] Figure 1 The structure diagram of a communication network applicable to the embodiment of the present application is shown in FIG. The communication system includes a terminal device 101, a terminal device 102, and a network side device 103. The terminal devices 101 and 102 may also be referred to as terminal devices or user terminals (UE), and the terminal devices 101 and 102 may be terminal side devices such as mobile phones, tablet computers (Tablet Personal Computer), laptop computers (Laptop Computer), personal digital assistants (Personal Digital Assistant, PDA), mobile Internet devices (Mobile Internet Device, MID), wearable devices (Wearable Device) or vehicle-mounted devices.

[0091] The network side device 103 may be a base station or a core network. The base station may be a base station of 5G and later versions (e.g., gNB, 5G NR NB, etc.), or a base station in other communication systems (e.g., eNB, WLAN access point, or other access point, etc.). The base station may be referred to as a node B, an evolved node B, an access point, a base transceiver station (BTS), a radio base station, a radio transceiver, a basic service set (BSS), an extended service set (ESS), a B node, an evolved B node (eNB), a home B node, a home evolved B node, a WLAN access point, a WiFi node, or some other suitable term in the field. As long as the same technical effect is achieved, the base station is not limited to a specific technical vocabulary. It should be noted that in the embodiment of the present invention, only a base station in the NR system is used as an example, but the specific type of the base station is not limited. The base station can communicate with the terminal device 101 and the terminal device 102 under the control of the base station controller, and the base station controller may be part of the core network or some base stations.

[0092] The terminal device 101 and the terminal device 102 can perform data transmission with the network side device 103 via the Uu interface.

[0093] Optionally, the wireless network or wired network described above uses standard communication technology and / or protocol. The network is usually the Internet, but it can also be any network, including but not limited to a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a dedicated network or any combination of a virtual private network). In some embodiments, technologies and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), etc. are used to represent data exchanged through the network. In addition, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPsec) can also be used to encrypt all or some links. In other embodiments, customized and / or dedicated data communication technologies can also be used to replace or supplement the above data communication technologies.

[0094] Optionally, the client of the application installed in different terminal devices 101 is the same, or the client of the same type of application based on different operating systems. Based on the different terminal platforms, the specific form of the client of the application can also be different, for example, the application client can be a mobile client, a PC client, etc.

[0095] Those skilled in the art will know that Figure 1 The number of terminal devices and network side devices in the example is only for illustration, and any number of terminal devices may be provided according to actual needs, which is not limited in the embodiments of the present disclosure.

[0096] The present exemplary implementation is described in detail below with reference to the accompanying drawings and embodiments.

[0097] First, a resource scheduling method is provided in an embodiment of the present disclosure. The method can be executed by any network-side device with computing and processing capabilities. In the following process, the network-side device is taken as a base station as an example.

[0098] Figure 2 A flow chart of a resource scheduling method in an embodiment of the present disclosure is shown as follows: Figure 2 As shown, the resource scheduling method provided in the embodiment of the present disclosure includes the following steps:

[0099] S202: Acquire the quality of service (QoS) configuration information of the user to be scheduled.

[0100] In a possible embodiment, in order to better improve the user experience, 5G can provide network services based on the granularity of service quality flow. When receiving the QoS flow service of the user to be scheduled, the QoS configuration information of the user to be scheduled can be obtained. The QoS configuration information is the information of the QoS flow service corresponding to the user to be scheduled, including 5QI, QoS minimum rate R min , QoS maximum rate R max and delay budget T max .

[0101] Specifically, 5QI is the 5G service quality identifier, which is used to point to QoS characteristic parameters. After receiving the QoS flow service, the corresponding 5QI can be determined, and the 5QI priority can be obtained by querying the 5QI and QOS characteristic mapping table.

[0102] Delay budget T max Corresponding to the packet delay budget (PDB). Get the QoS minimum rate R according to the QoS configuration file min , QoS maximum rate R maxFor GBR services, the QoS minimum rate corresponds to the guaranteed flow bit rate (GFBR), and the QoS maximum rate corresponds to the maximum flow bit rate (MFBR).

[0103] Furthermore, for Non-GBR services, the QoS minimum rate is not configured. In specific implementation, the minimum bit rate value MinBR can be preset to correspond to the QoS minimum rate, and the QoS maximum rate corresponds to the aggregate maximum bit rate (AMBR, Aggregate Maximum Bit Rate).

[0104] For example, assuming that in the QoS configuration information corresponding to the user to be scheduled, the 5QI value is 1, the 5QI priority is 20, and T max =100, corresponding to GBR service type, R min Can be set to 64kbps, R max Can be set to 256kbps.

[0105] S204: At each scheduling moment, obtain the first packet delay and data cache amount corresponding to the user to be scheduled.

[0106] In a possible embodiment, at each scheduling moment, the first data packet delay of the user to be scheduled is recorded, that is, the first packet delay τ. The data buffer amount of the user to be scheduled is calculated.

[0107] Among them, the data cache amount S of the above-mentioned user to be scheduled buf , is to count the total amount of user data cache to be scheduled.

[0108] S206: Divide the users to be scheduled into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data buffer capacity.

[0109] In a possible embodiment, users to be scheduled are divided into scheduling queues of different priorities according to the QoS minimum rate, QoS maximum rate and delay budget in the QoS configuration information, as well as the first packet delay and data buffer capacity.

[0110] Specifically, if the first packet delay is greater than or equal to the delay budget, the user to be scheduled will be divided into the first priority scheduling queue; or, if the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is greater than or equal to the delay budget, the user to be scheduled will be divided into the first priority scheduling queue.

[0111] The specific formula is as follows: If τ<T max And S buf / R max ≥Tmax Or τ ≥ T max , the user to be scheduled is in the scheduling queue of the first priority.

[0112] If the first packet delay is less than the delay budget, and the ratio of the data cache amount to the maximum QoS rate is less than the delay budget, and the ratio of the data cache amount to the minimum QoS rate is greater than the delay budget, the user to be scheduled will be assigned to the second priority scheduling queue.

[0113] The specific formula is as follows: If τ<T max And S buf / R max <T max buf / R min , the user to be scheduled is in the scheduling queue of the second priority.

[0114] If the first packet delay is less than the delay budget, and the ratio of the data buffer to the QoS minimum rate is less than or equal to the delay budget, the user to be scheduled is assigned to the third priority scheduling queue.

[0115] The specific formula is as follows: If τ<T max And S buf / R min ≤T max , the user to be scheduled is in the scheduling queue of the third priority.

[0116] In the above content, the priority of the first priority scheduling queue is higher than that of the second priority scheduling queue, and the priority of the second priority scheduling queue is higher than that of the third priority scheduling queue.

[0117] S208: Scheduling resources for the users to be scheduled according to scheduling queues of different priorities. If the priorities of the scheduling queues of the users to be scheduled are the same, determining the average rate priority corresponding to the users to be scheduled according to the historical average rates and QoS configuration information of the users to be scheduled.

[0118] In a possible embodiment, after the users to be scheduled are divided into scheduling queues of different priorities, resources can be scheduled for the users to be scheduled according to the scheduling queues of different priorities. If the users to be scheduled are in a scheduling queue with a high priority, resources are scheduled for the users to be scheduled preferentially.

[0119] Exemplarily, for scheduling queues of different priorities, priority is given to scheduling resources to handle services for users to be scheduled in the first priority scheduling queue. If the network still has remaining resources to be allocated, users in the second and third priority scheduling queues are scheduled in turn.

[0120] ​Furthermore, if the priorities of the scheduling queues of the users to be scheduled are the same, the average rate priority corresponding to the users to be scheduled is determined according to the historical average rate of the users to be scheduled and the QoS minimum rate and QoS maximum rate in the QoS configuration information.

[0121] The historical average rate r is also calculated at each scheduling moment. The specific method is as follows: the historical average rate is obtained by multiplying the maximum rate corresponding to the scheduling moment by the weight value corresponding to the maximum rate, and the product of the average rate value corresponding to the moment before the scheduling moment and the weight value corresponding to the average rate value corresponding to the moment before the scheduling moment.

[0122] The specific formula for calculating the historical average rate is as follows:

[0123] r(t)=(1-θ)r(t-1)+θr c (1)

[0124] Where t represents the current scheduling time; r(t) represents the historical average rate at the current scheduling time; r(t-1) represents the historical average rate at the previous scheduling time; r c represents the maximum rate at the current scheduling time; θ represents r c The corresponding weight value, where θ∈[0,1].

[0125] The above c This rate can be understood as the instantaneous maximum rate that can be allocated to the user to be scheduled at the current moment.

[0126] Specifically, the specific method of determining the average rate priority corresponding to the user to be scheduled is as follows:

[0127] If the historical average rate is less than the QoS minimum rate, the average rate scheduling value of the user to be scheduled is determined based on the minimum rate difference coefficient, the QoS minimum rate and the historical average rate. If the historical average rate is greater than the QoS maximum rate, the average rate scheduling value is determined based on the maximum rate difference coefficient, the QoS maximum rate and the historical average rate. If the historical average rate is greater than or equal to the QoS minimum rate, and the historical average rate is less than or equal to the QoS maximum rate, the average rate scheduling value is the preset value. Determine the average rate priority based on the average rate scheduling value corresponding to the user to be scheduled; wherein, the larger the average rate scheduling value, the higher the average rate priority.

[0128] Exemplarily, the specific formula for determining the average rate priority is as follows:

[0129]

[0130] Among them, p rrepresents the average rate scheduling value; r represents the historical average rate; R max Indicates the maximum rate of QoS; R min represents the minimum QoS rate; K represents a preset value; α1 represents the minimum rate difference coefficient; α2 represents the maximum rate difference coefficient; the larger the average rate scheduling value is, the higher the average rate priority is.

[0131] When the historical average rate r is lower than R min When the historical average rate is higher than R max , lower the scheduling priority.

[0132] Among them, α1 and α2 are the minimum rate difference coefficient and the maximum rate difference coefficient, and α1 and α2 are positive real numbers. It is used to adjust the scheduling priority of the scenario that does not meet the QoS rate. r The larger the value, the higher the average rate priority. α1 can be set to 0.5, and α2 can be set to 4.

[0133] S210: Scheduling resources for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

[0134] In a possible embodiment, after the average rate priority of the user to be scheduled is determined in the above manner, resources are scheduled for the user to be scheduled according to the average rate priority.

[0135] Specifically, resources are scheduled preferentially for users with higher average rate priority. r The larger the value, the higher the average rate priority.

[0136] In a possible implementation manner, after determining the average rate priority corresponding to the user to be scheduled, the following situation may exist. If the average rate priorities corresponding to the users to be scheduled are the same, it is necessary to schedule resources for the users to be scheduled in the following manner, and the specific manner is as follows:

[0137] Figure 3 A schematic diagram of another resource scheduling method is shown, comprising the following steps:

[0138] S302: If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled.

[0139] Among them, the smaller the value of the 5QI priority is, the higher the 5QI priority is.

[0140] S304: Scheduling resources for the user to be scheduled according to the 5QI priority of the user to be scheduled.

[0141] In a possible embodiment, when obtaining QoS configuration information, 5QI can be obtained, and the 5QI priority can be obtained by querying the mapping table of 5QI and QOS characteristic parameters, and resources are scheduled preferentially for users with higher 5QI priorities.

[0142] Through the above methods, throughput and user satisfaction can be effectively guaranteed, and differentiated business needs can be better met.

[0143] Figure 4 A schematic diagram of another resource scheduling method is shown, comprising the following steps:

[0144] S402: If the average rate priorities corresponding to the users to be scheduled are the same, a channel quality indication CQI value is obtained by mapping the modulation and coding scheme, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled.

[0145] Among them, the larger the CQI value, the higher the CQI priority.

[0146] S404: Scheduling resources for the user to be scheduled according to the CQI priority of the user to be scheduled.

[0147] In a possible embodiment, at each scheduling moment, a channel quality indicator CQI value may be calculated, and the priorities of the users to be scheduled may be sorted by the CQI value to obtain the CQI priority of the users to be scheduled, and resources may be scheduled preferentially for users to be scheduled with higher CQI priorities.

[0148] The CQI value may be obtained by mapping according to a modulation and coding scheme (MCS).

[0149] Through the above methods, throughput and user satisfaction can be effectively guaranteed, and differentiated business needs can be better met.

[0150] Further, Figure 5 A schematic diagram of a specific resource scheduling method is shown, which includes the following steps:

[0151] S502: Acquire the quality of service (QoS) configuration information of the user to be scheduled.

[0152] Among them, QoS configuration information includes QoS minimum rate, QoS maximum rate, delay budget and 5QI.

[0153] S504: At each scheduling moment, the first packet delay and data buffer size corresponding to the user to be scheduled are obtained.

[0154] The average historical rate and the channel quality indicator CQI value may also be obtained.

[0155] S506: Divide the users to be scheduled into scheduling queues of different priorities according to the QoS minimum rate, QoS maximum rate, delay budget, first packet delay and data buffer capacity.

[0156] S508: Schedule resources for the users to be scheduled according to the scheduling queues of different priorities. If the priorities of the scheduling queues of the users to be scheduled are the same, determine the average rate priority corresponding to the users to be scheduled according to the historical average rate, QoS minimum rate and QoS maximum rate of the users to be scheduled, and schedule resources for the users to be scheduled according to the average rate priority of the users to be scheduled.

[0157] S510: If the average rate priorities corresponding to the users to be scheduled are the same, a channel quality indication CQI value is obtained through modulation and coding mapping, and the priorities of the users to be scheduled are sorted according to the CQI values ​​to obtain the CQI priorities of the users to be scheduled, and resources are scheduled for the users to be scheduled according to the CQI priorities of the users to be scheduled.

[0158] S512: If the CQI priorities of the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled, and resources are scheduled for the users to be scheduled according to the 5QI priorities of the users to be scheduled.

[0159] Further, Figure 6 A schematic diagram of a specific resource scheduling method is shown, which includes the following steps:

[0160] S602: Acquire the quality of service (QoS) configuration information of the user to be scheduled.

[0161] Among them, QoS configuration information includes QoS minimum rate, QoS maximum rate, delay budget and 5QI.

[0162] S604: At each scheduling moment, the first packet delay and data buffer size corresponding to the user to be scheduled are obtained.

[0163] The average historical rate and the channel quality indicator CQI value may also be obtained.

[0164] S606: Divide the users to be scheduled into scheduling queues of different priorities according to the QoS minimum rate, QoS maximum rate, delay budget, first packet delay and data buffer capacity.

[0165] S608: Schedule resources for the users to be scheduled according to the scheduling queues of different priorities. If the priorities of the scheduling queues of the users to be scheduled are the same, determine the average rate priority corresponding to the users to be scheduled according to the historical average rate, QoS minimum rate and QoS maximum rate of the users to be scheduled, and schedule resources for the users to be scheduled according to the average rate priority of the users to be scheduled.

[0166] S610: If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled, and resources are scheduled for the users to be scheduled according to the 5QI priorities of the users to be scheduled.

[0167] S612: If the 5QI priorities of the users to be scheduled are the same, the channel quality indication CQI value is obtained by mapping through the modulation and coding method, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled, and resources are scheduled for the users to be scheduled according to the CQI priority of the users to be scheduled.

[0168] Through the above resource scheduling method, by introducing the scheduling queue preprocessing mechanism and comprehensively considering the delay requirements and cache capacity, compared with the traditional scheduling algorithm, it is possible to flexibly handle bursty large-flow services and reasonably control the QoS flow service delay. In the scheduling queues with the same priority, a calculation method based on average rate priority is proposed. When network congestion occurs, the user rate can be effectively controlled within a reasonable QoS rate limit range. For users to be scheduled with the same average rate priority, 5QI priority and CQI priority are considered in turn, which can effectively guarantee throughput and user satisfaction and better meet differentiated business needs.

[0169] Based on the same inventive concept, the embodiment of the present disclosure also provides a resource scheduling device, such as the following embodiment. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0170] Figure 7 A schematic diagram of a structure of an embodiment of the present disclosure is shown as follows: Figure 7 As shown, the resource scheduling device 70 includes:

[0171] The first acquisition unit 701 is used to acquire the quality of service QoS configuration information of the user to be scheduled;

[0172] The second acquisition unit 702 is used to acquire the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling time;

[0173] A division unit 703 is used to divide the users to be scheduled into scheduling queues of different priorities according to QoS configuration information, first packet delay and data buffer amount;

[0174] The determination unit 704 is used to schedule resources for the user to be scheduled according to the scheduling queues of different priorities. If the priorities of the scheduling queues of the users to be scheduled are the same, the average rate priority corresponding to the user to be scheduled is determined according to the historical average rate and QoS configuration information of the user to be scheduled;

[0175] The scheduling unit 705 is used to schedule resources for the users to be scheduled according to the average rate priority of the users to be scheduled, so as to process the QoS flow service corresponding to the users to be scheduled.

[0176] In one embodiment of the present disclosure, the dividing unit 703 is further configured to:

[0177] If the first packet delay is greater than or equal to the delay budget, the user to be scheduled is assigned to the first priority scheduling queue; or, if the first packet delay is less than the delay budget, and the ratio of the data buffer capacity to the QoS maximum rate is greater than or equal to the delay budget, the user to be scheduled is assigned to the first priority scheduling queue;

[0178] If the first packet delay is less than the delay budget, and the ratio of the data buffer to the QoS maximum rate is less than the delay budget, and the ratio of the data buffer to the QoS minimum rate is greater than the delay budget, the user to be scheduled is assigned to the second priority scheduling queue;

[0179] If the first packet delay is less than the delay budget, and the ratio of the data buffer to the QoS minimum rate is less than or equal to the delay budget, the user to be scheduled is assigned to the third priority scheduling queue.

[0180] In one embodiment of the present disclosure, the determining unit 704 is further configured to:

[0181] If the historical average rate is less than the QoS minimum rate, the average rate scheduling value of the user to be scheduled is determined according to the minimum rate difference coefficient, the QoS minimum rate and the historical average rate; or,

[0182] If the historical average rate is greater than the QoS maximum rate, the average rate scheduling value is determined according to the maximum rate difference coefficient, the QoS maximum rate and the historical average rate; or,

[0183] If the historical average rate is greater than or equal to the QoS minimum rate, and the historical average rate is less than or equal to the QoS maximum rate, the average rate scheduling value is the preset value;

[0184] The average rate priority is determined according to the average rate scheduling value corresponding to the user to be scheduled; wherein, the larger the average rate scheduling value is, the higher the average rate priority is.

[0185] In one embodiment of the present disclosure, the determining unit 704 is further configured to:

[0186] The historical average rate is obtained by summing the product of the maximum rate corresponding to the scheduling moment and the weight value corresponding to the maximum rate, and the product of the average rate value corresponding to the moment before the scheduling moment and the weight value corresponding to the average rate value corresponding to the moment before the scheduling moment.

[0187] In one embodiment of the present disclosure, the scheduling unit 705 is further configured to:

[0188] If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled; wherein, the smaller the value of the 5QI priority, the higher the 5QI priority;

[0189] Schedule resources for users to be scheduled based on their 5QI priority

[0190] In one embodiment of the present disclosure, the scheduling unit 705 is further configured to:

[0191] If the average rate priorities of the users to be scheduled are the same, the channel quality indicator CQI value is obtained by mapping the modulation and coding mode, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled; wherein, the larger the CQI value, the higher the CQI priority;

[0192] Resources are scheduled for the users to be scheduled according to their CQI priorities.

[0193] Those skilled in the art will appreciate that various aspects of the present disclosure may be implemented as systems, methods or program products. Therefore, various aspects of the present disclosure may be specifically implemented in the following forms, namely: complete hardware implementation, complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as "circuits", "modules" or "systems".

[0194] Refer to the following Figure 8 The electronic device 800 according to this embodiment of the present disclosure is described. Figure 8 The electronic device 800 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0195] like Figure 8As shown, the electronic device 800 is in the form of a general computing device. The components of the electronic device 800 may include but are not limited to: at least one processing unit 810, at least one storage unit 820, and a bus 830 connecting different system components (including the storage unit 820 and the processing unit 810).

[0196] Among them, the storage unit stores a program code, and the program code can be executed by the processing unit 810, so that the processing unit 810 executes the steps described in the above "Exemplary Method" section of this specification according to various exemplary embodiments of the present disclosure. For example, the processing unit 810 can execute the following steps in the above method embodiment, for example: obtaining the quality of service QoS configuration information of the user to be scheduled; obtaining the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment; dividing the user to be scheduled into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount; scheduling resources for the user to be scheduled according to the scheduling queues of different priorities, if the priorities of the scheduling queues where the user to be scheduled is located are the same, then determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information; scheduling resources for the user to be scheduled according to the average rate priority of the user to be scheduled to process the QoS flow service corresponding to the user to be scheduled.

[0197] The storage unit 820 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 8201 and / or a cache memory unit 8202 , and may further include a read-only memory unit (ROM) 8203 .

[0198] The storage unit 820 may also include a program / utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0199] Bus 830 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0200] The electronic device 800 may also communicate with one or more external devices 840 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 800, and / or communicate with any device that enables the electronic device 800 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 850. Furthermore, the electronic device 800 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 860. As shown, the network adapter 860 communicates with other modules of the electronic device 800 via a bus 830. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0201] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0202] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer program product or a computer program, which includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes any of the resource scheduling methods described above.

[0203] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. A program product capable of implementing the above method of the present disclosure is stored thereon. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to cause the terminal device to execute the steps according to various exemplary implementations of the present disclosure described in the above “Exemplary Method” section of this specification.

[0204] More specific examples of computer-readable storage media in the present disclosure may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0205] Fig. 9 FIG. 1 shows a schematic diagram of the structure of a base station provided by an embodiment of the present disclosure, that is, a schematic diagram of the structure of a base station. Fig. 9 As shown, the base station includes a processor 900, a memory 901 and a transceiver 902;

[0206] The processor 900 is responsible for managing the bus architecture and general processing, and the memory 901 can store data used by the processor 900 when performing operations. The transceiver 902 is used to receive and send data under the control of the processor 900. The transceiver 902 can be a backscatter transmitter and a backscatter receiver.

[0207] The bus architecture may include any number of interconnected buses and bridges, specifically linking together various circuits of one or more processors represented by processor 900 and memory represented by memory 901. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The processor 900 is responsible for managing the bus architecture and general processing, and the memory 901 may store data used by the processor 900 when performing operations.

[0208] The process disclosed in the embodiment of the present invention can be applied to the processor 900, or implemented by the processor 900. In the implementation process, each step of the signal processing process can be completed by the hardware integrated logic circuit or software instructions in the processor 900. The processor 900 can be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and can implement or execute the methods, steps and logic block diagrams disclosed in the embodiment of the present invention. The general-purpose processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiment of the present invention can be directly embodied as a hardware processor to be executed, or a combination of hardware and software modules in the processor can be executed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 901, and the processor 900 reads the information in the memory 901 and completes the steps of the signal processing process in combination with its hardware.

[0209] Specifically, the processor 900 is used to read the program in the memory 901 and execute:

[0210] Obtain the service quality QoS configuration information of the user to be scheduled; at each scheduling moment, obtain the first packet delay and data cache amount corresponding to the user to be scheduled; divide the user to be scheduled into scheduling queues with different priorities according to the QoS configuration information, the first packet delay and the data cache amount; schedule resources for the user to be scheduled according to the scheduling queues with different priorities. If the priorities of the scheduling queues where the users to be scheduled are located are the same, determine the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information; schedule resources for the user to be scheduled according to the average rate priority of the user to be scheduled to process the QoS flow service corresponding to the user to be scheduled.

[0211] In the present disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0212] Alternatively, the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0213] In a specific implementation, the program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet).

[0214] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0215] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0216] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0217] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A resource scheduling method, It is characterized in that The method comprises: Obtain the QoS configuration information of the user to be scheduled; At each scheduling moment, obtaining the first packet delay and data cache amount corresponding to the user to be scheduled; According to the QoS configuration information, the first packet delay and the data cache amount, the to-be-scheduled users are divided into scheduling queues of different priorities; Scheduling resources for the user to be scheduled according to scheduling queues of different priorities, and if the priorities of the scheduling queues in which the user to be scheduled are located are the same, determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information; Resources are scheduled for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

2. The resource scheduling method according to claim 1, It is characterized in that The QoS configuration information includes a QoS minimum rate, a QoS maximum rate, and a delay budget; The dividing the to-be-scheduled users into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount includes: If the first packet delay is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue; or, if the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is greater than or equal to the delay budget, the user to be scheduled is divided into a first priority scheduling queue; If the first packet delay is less than the delay budget, and the ratio of the data cache amount to the QoS maximum rate is less than the delay budget, and the ratio of the data cache amount to the QoS minimum rate is greater than the delay budget, the user to be scheduled is divided into a scheduling queue of the second priority; If the first packet delay is less than the delay budget, and the ratio of the data buffer amount to the QoS minimum rate is less than or equal to the delay budget, the user to be scheduled is divided into a scheduling queue of the third priority.

3. The resource scheduling method according to claim 1, It is characterized in that The priority of the first priority scheduling queue is higher than that of the second priority scheduling queue; the priority of the second priority scheduling queue is higher than that of the third priority scheduling queue.

4. The resource scheduling method according to claim 1, It is characterized in that The QoS configuration information includes a QoS minimum rate and a QoS maximum rate; The determining, according to the historical average rate of the user to be scheduled and the QoS configuration information, the average rate priority corresponding to the user to be scheduled includes: If the historical average rate is less than the QoS minimum rate, determining the average rate scheduling value of the user to be scheduled according to the minimum rate difference coefficient, the QoS minimum rate and the historical average rate; or, If the historical average rate is greater than the QoS maximum rate, determining the average rate scheduling value according to the maximum rate difference coefficient, the QoS maximum rate and the historical average rate; or, If the historical average rate is greater than or equal to the QoS minimum rate, and the historical average rate is less than or equal to the QoS maximum rate, the average rate scheduling value is a preset value; The average rate priority is determined according to the average rate scheduling value corresponding to the to-be-scheduled user; wherein, the larger the average rate scheduling value is, the higher the average rate priority is.

5. The resource scheduling method according to claim 1, It is characterized in that The QoS configuration information includes a QoS minimum rate and a QoS maximum rate; The determining, according to the historical average rate of the user to be scheduled and the QoS configuration information, the average rate priority corresponding to the user to be scheduled includes: Among them, p r represents the average rate scheduling value; r represents the historical average rate; R max Indicates the maximum rate of QoS; R min Indicates the minimum QoS rate; K indicates the preset value; α 1 Represents the minimum rate difference coefficient; α 2 Represents the maximum rate difference coefficient; the larger the average rate scheduling value is, the higher the average rate priority is.

6. The resource scheduling method according to any one of claims 1 or 4, It is characterized in that The historical average rate is determined as follows: The historical average rate is obtained according to the product of the maximum rate corresponding to the scheduling moment and the weight value corresponding to the maximum rate, and the sum of the product of the average rate value corresponding to the moment before the scheduling moment and the weight value corresponding to the average rate value corresponding to the moment before the scheduling moment.

7. The resource scheduling method according to claim 1, It is characterized in that The QoS configuration information includes a 5G service quality identifier 5QI; wherein the 5QI is used to point to a QoS characteristic parameter; After determining the average rate priority corresponding to the to-be-scheduled user, the method further includes: If the average rate priorities corresponding to the users to be scheduled are the same, the priorities of the users to be scheduled are sorted according to the QoS characteristic parameters corresponding to the 5QI to obtain the 5QI priorities of the users to be scheduled; wherein, the smaller the value of the 5QI priority, the higher the 5QI priority; Resources are scheduled for the user to be scheduled according to the 5QI priority of the user to be scheduled.

8. The resource scheduling method according to claim 1, It is characterized in that After determining the average rate priority corresponding to the to-be-scheduled user, the method further includes: If the average rate priorities corresponding to the users to be scheduled are the same, a channel quality indication CQI value is obtained by mapping the modulation and coding mode, and the priorities of the users to be scheduled are sorted according to the CQI value to obtain the CQI priority of the users to be scheduled; wherein, the larger the CQI value, the higher the CQI priority; Resources are scheduled for the user to be scheduled according to the CQI priority of the user to be scheduled.

9. A resource scheduling device, It is characterized in that The device comprises: A first acquisition unit, used to acquire quality of service QoS configuration information of the user to be scheduled; A second acquisition unit is used to acquire the first packet delay and data cache amount corresponding to the user to be scheduled at each scheduling moment; A division unit, configured to divide the to-be-scheduled user into scheduling queues of different priorities according to the QoS configuration information, the first packet delay and the data cache amount; A determination unit, configured to schedule resources for the user to be scheduled according to scheduling queues of different priorities, and if the priorities of the scheduling queues in which the users to be scheduled are located are the same, determine the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information; The scheduling unit is used to schedule resources for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.

10. An electronic device, It is characterized in that include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to perform the method of any one of claims 1 to 7 by executing the executable instructions.

11. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

12. A base station, It is characterized in that include: Memory, transceiver, and processor; The memory is used to store computer programs; a transceiver, for transmitting and receiving data under the control of the processor; The processor is configured to read the computer program in the memory and perform the following operations: Obtain the QoS configuration information of the user to be scheduled; At each scheduling moment, obtaining the first packet delay and data cache amount corresponding to the user to be scheduled; According to the QoS configuration information, the first packet delay and the data cache amount, the to-be-scheduled users are divided into scheduling queues of different priorities; Scheduling resources for the user to be scheduled according to scheduling queues of different priorities; if the priorities of the scheduling queues in which the user to be scheduled are located are the same, determining the average rate priority corresponding to the user to be scheduled according to the historical average rate of the user to be scheduled and the QoS configuration information; Resources are scheduled for the user to be scheduled according to the average rate priority of the user to be scheduled, so as to process the QoS flow service corresponding to the user to be scheduled.