Communication resource scheduling method and device, equipment and storage medium

Abstract

The invention relates to the technical field of wireless communication, and discloses a communication resource scheduling method, device and equipment and a storage medium, the method comprises the following steps: respectively obtaining a first priority and a second priority of a packet, the first priority corresponding to a user type, and the second priority corresponding to a service type; communication resource scheduling is performed on the packet based at least on the first priority and the second priority. By setting a first priority corresponding to a user type and a second priority corresponding to a service type, communication resource scheduling is performed on a packet at least based on the first priority and the second priority, so that hierarchical scheduling is performed in combination with the first priority and the second priority. The requirements of different user types and service types on communication resources are considered, and the service quality of different services of different users or the same user is ensured.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and more specifically to communication resource scheduling methods, apparatus, devices, and storage media. Background Technology

[0002] In communication systems, voice, data, video and other types of services are often transmitted in a mixed manner, and different types of services have very different requirements for latency, traffic and packet loss rate. Traditional resource scheduling mechanisms generally only consider improving rate and throughput, so they cannot meet the network communication resource requirements of different users or different services of the same user, resulting in the inability to guarantee the quality of service for different users or different services of the same user. Summary of the Invention

[0003] In view of this, the present invention provides a communication resource scheduling method, apparatus, device and storage medium to solve the problem that the current resource scheduling mechanism cannot guarantee the quality of service for different users or different services of the same user.

[0004] In a first aspect, the present invention provides a communication resource scheduling method, the method comprising: Obtain the first priority and second priority of the group respectively. The first priority corresponds to the user type, and the second priority corresponds to the business type. Communication resource scheduling is performed on packets based at least on the first and second priorities.

[0005] In one alternative implementation, the first priority includes at least a first level and a second level, and / or the second priority includes at least a third level and a fourth level; The first level is higher than the second level, and the third level is higher than the fourth level.

[0006] In one alternative implementation, communication resource scheduling is performed on packets based at least on a first priority and a second priority, including: Communication resource scheduling is performed on the first group because the first priority level of the first group is higher than the first priority level of the second group.

[0007] In one alternative implementation, based on the fact that the first priority level of the first group is equal to the first priority level of the second group, the method further includes: Get the waiting time for scheduling of the first and second groups.

[0008] In one optional implementation, after obtaining the waiting scheduling duration of the first group and the second group, the method further includes: Based on the fact that the waiting time for the first group is not less than the first threshold and the waiting time for the second group is less than the second threshold, communication resource scheduling is performed on the first group, wherein the first threshold and the second threshold correspond to the level of the second priority.

[0009] In an optional implementation, based on the fact that the waiting time for scheduling of the first group is less than a first threshold and the waiting time for scheduling of the second group is less than a second threshold, the method further includes: Obtain the third priority of the first group and the second group, where the third priority corresponds to user satisfaction; Based on the third priority of the first and second packets, communication resource scheduling is performed on the first and / or second packets.

[0010] In one alternative implementation, the third priority includes at least a fifth level and a sixth level, wherein the fifth level is higher than the sixth level.

[0011] In one optional implementation, communication resource scheduling is performed on the first packet and / or the second packet based on a third priority of the first packet and the second packet, including: Communication resource scheduling is performed on the first group because the third priority level of the first group is higher than the third priority level of the second group.

[0012] In one alternative implementation, the method further includes: Obtain the third threshold for grouping, where the third threshold corresponds to user satisfaction; The third priority of a group is calculated based on the group's waiting time for scheduling and the third threshold.

[0013] In one optional implementation, the third priority of a group is calculated based on the group's waiting scheduling duration and a third threshold, including: The third priority of a group is calculated based on the difference between the third threshold of the group and the waiting time for scheduling.

[0014] In one optional implementation, the third priority of a group is calculated based on the difference between the group's third threshold and the waiting scheduling duration, including: Based on the fact that the difference between the third threshold of the group and the waiting time is less than a preset difference, the first preset algorithm is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting time to obtain the third priority of the group. Based on the fact that the difference between the third threshold of a group and the waiting time for scheduling is not less than a preset difference, a second preset algorithm is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting time for scheduling to obtain the scheduling priority of the group.

[0015] In one alternative implementation, the data transmission information is the instantaneous throughput of packets.

[0016] In one alternative implementation, the third threshold of the first group is proportional to the first threshold, and the third threshold of the second group is proportional to the second threshold.

[0017] In one alternative implementation, the first proportional relationship is the same as the second proportional relationship.

[0018] In a second aspect, the present invention provides a communication resource scheduling device, the device comprising: The priority acquisition module is used to acquire the first priority and the second priority of the group respectively. The first priority corresponds to the user type, and the second priority corresponds to the business type. The resource scheduling module is used to perform communication resource scheduling on packets based at least on the first priority and the second priority.

[0019] Thirdly, the present invention provides a computer device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform the communication resource scheduling method of the first aspect or any corresponding embodiment described above.

[0020] Fourthly, the present invention provides a computer-readable storage medium storing computer instructions for causing a computer to execute the communication resource scheduling method of the first aspect or any corresponding embodiment thereof.

[0021] Fifthly, the present invention provides a computer program product, including computer instructions for causing a computer to execute the communication resource scheduling method of the first aspect or any corresponding embodiment thereof.

[0022] The communication resource scheduling method provided in this embodiment of the invention sets a first priority corresponding to the user type and a second priority corresponding to the service type, and performs communication resource scheduling on groups based at least on the first priority and the second priority, thereby combining the first priority and the second priority for hierarchical scheduling, taking into account the communication resource needs of different user types and service types, and ensuring the quality of service for different users or different services of the same user. Attached Figure Description

[0023] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0024] Figure 1 This is a flowchart illustrating a communication resource scheduling method according to an embodiment of the present invention; Figure 2 This is a flowchart illustrating the process of determining the third priority in the communication resource scheduling method according to an embodiment of the present invention; Figure 3 This is a resource scheduling diagram of a communication resource scheduling method according to an embodiment of the present invention; Figure 4 This is a comparison chart of the data packet scheduling rates between the communication resource scheduling method of this invention and the PF proportional fairness algorithm; Figure 5 This is a structural block diagram of a communication resource scheduling device according to an embodiment of the present invention; Figure 6 This is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. Detailed Implementation

[0025] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0026] Beam-hopping technology utilizes time-slicing techniques, employing beamforming and beam skipping to illuminate only a portion of the beams within a single time segment. This enables precise coverage of specific areas and simultaneous service for multiple users, making it more suitable for application scenarios with unevenly distributed service demands compared to conventional communication technologies.

[0027] In common application scenarios of beam hopping technology, namely in communication systems where user services are unevenly distributed in time and space and have diverse service requirements, voice, data, video and other types of services are often transmitted in a mixed manner. Different types of services have drastically different requirements for latency, traffic and packet loss rate. Traditional resource scheduling mechanisms generally only consider improving rate and throughput, and therefore cannot meet the network communication resource requirements of different users or different services of the same user, resulting in the inability to guarantee the quality of service for different users or different services of the same user.

[0028] To address the aforementioned technical problems, embodiments of the present invention provide a communication resource scheduling method. This method obtains a first priority and a second priority for packets, where the first priority corresponds to a user type and the second priority corresponds to a service type. Communication resource scheduling is then performed on packets based at least on the first and second priorities. The present invention sets a first priority corresponding to the user type and a second priority corresponding to the service type, and performs communication resource scheduling on packets based at least on both priorities. This allows for hierarchical scheduling by combining the first and second priorities, taking into account the communication resource needs of different user types and service types, and ensuring service quality for different users or different services of the same user.

[0029] The communication resource scheduling method provided in this invention can be applied to communication systems, such as various satellite communication systems and wireless communication systems, and is particularly suitable for satellite communication systems employing beam hopping technology. This communication system can be a satellite communication system, such as various low-Earth orbit, medium-Earth orbit, and high-Earth orbit satellites. By employing beam hopping technology, the resource scheduling method provided by this invention can accurately cover different areas, meeting the communication resource needs of different users and services, thereby improving the resource utilization rate and user satisfaction of the satellite communication system. This communication system can also be a terrestrial wireless communication system, especially a densely networked terrestrial communication system, such as the industrial internet and densely populated user areas like urban core areas and transportation hubs. The resource scheduling method provided by this invention can rationally schedule and allocate communication resources, ensuring user service needs and adapting to the differentiated service requirements of complex terrestrial communication environments.

[0030] According to an embodiment of the present invention, a communication resource scheduling method embodiment is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0031] This embodiment provides a communication resource scheduling method, which can be used in communication systems, and is particularly suitable for wireless communication systems employing beam hopping technology. Figure 1 This is a flowchart illustrating a communication resource scheduling method according to an embodiment of the present invention, as shown below. Figure 1 As shown, the process includes the following steps: Step S101: Obtain the first priority and second priority of the group respectively.

[0032] In this embodiment of the invention, the first priority corresponds to the user type, and the second priority corresponds to the service type. The corresponding first and second priorities are obtained based on the user type and service type of the group.

[0033] In this embodiment of the invention, user type is used to distinguish the importance of users served by each group. One user type can correspond to multiple groups. Groups corresponding to the same user type have the same first priority, while groups corresponding to different user types have different first priorities. Similarly, service type is used to distinguish the importance of user services corresponding to each group. One service type can correspond to multiple groups. Groups corresponding to the same service type have the same second priority, while groups corresponding to different service types have different second priorities.

[0034] In this embodiment of the invention, users in the communication system are pre-classified into various user types according to the importance of user services and their service quality requirements, thereby assigning a first priority to the group corresponding to each user. Specifically, user services with higher importance and higher service quality requirements are assigned to the corresponding higher-priority user types, while user services with lower importance and lower service quality requirements are assigned to the corresponding lower-priority user types. Similarly, user services in the communication system are pre-classified into various service types according to the quality requirements of user services for communication resources, thereby assigning a second priority to the group corresponding to each service. Specifically, user services with higher quality requirements for communication resources are assigned to the corresponding higher-priority service types, while user services with lower quality requirements for communication resources are assigned to the corresponding lower-priority service types. The service quality requirements of user services, including their requirements for communication resources, may include requirements for latency, traffic, and packet loss rate.

[0035] In one optional implementation, the first priority includes at least a first level and a second level, and / or the second priority includes at least a third level and a fourth level; wherein the first level is higher than the second level, and the third level is higher than the fourth level. It should be noted that the above is only an example of the first and second priorities including at least two levels. In actual communication resource scheduling, more levels of first and second priorities can be divided and allocated, and no specific limitation is made here.

[0036] In a specific embodiment, user types can be divided into four categories: Gold, Silver, Bronze, and Iron. The first priority level is: Gold > Silver > Bronze > Iron. Service types can be divided into two categories based on their sensitivity and tolerance to latency: Guaranteed Bit Rate (GBR) and Non-Guaranteed Bit Rate (Non-GBR). The second priority level of Guaranteed Bit Rate services is higher than that of Non-Guaranteed Bit Rate services. Guaranteed Bit Rate services, such as real-time voice and video calls, have stricter latency requirements to ensure users receive stable transmission rates. Non-Guaranteed Bit Rate services, such as web browsing and file downloads, have relatively lower latency requirements and can tolerate a certain degree of delay.

[0037] Step S102: Perform communication resource scheduling on the packets based at least on the first priority and the second priority.

[0038] In this embodiment of the invention, hierarchical scheduling is performed by combining the first priority and the second priority, and communication resources are scheduled for groups with higher priority than the first priority and the second priority.

[0039] In one optional implementation, communication resource scheduling is performed on the first group based on the fact that the first priority level of the first group is higher than the first priority level of the second group, thereby prioritizing the scheduling of communication resources for the group with the higher first priority level. For example, if the first priority includes a first level and a second level, and the second priority includes a third level and a fourth level, and the first priority level of the first group is the first level, then communication resource scheduling is performed on the first group.

[0040] In one optional implementation, communication resource scheduling is performed on the first group based on the fact that the first priority level of the first group is equal to the first priority level of the second group, and the second priority level of the first group is higher than the second priority level of the second group. This means that when the first priority levels are equal, communication resources are prioritized for groups with higher second priority levels. For example, if the first priority includes a first level and a second level, and the second priority includes a third level and a fourth level, and the first priority level of the first group is the first level, and the second priority level of the first group is the third level, and the first priority level of the second group is the first group, and the second priority level of the second group is the fourth level, then communication resource scheduling is performed on the first group.

[0041] In one optional implementation, based on the fact that the first priority level of the first group is equal to the first priority level of the second group, the waiting scheduling duration of the first group and the second group is obtained. The priority for scheduling communication resources for the first group and the second group is determined based on whether their waiting scheduling durations exceed their acceptable latency thresholds. Thus, when the first priority levels are equal, the second priority and latency are comprehensively considered to schedule communication resources within the user's acceptable latency range, avoiding situations where the waiting scheduling duration of the groups exceeds the latency requirements of the user and the service, leading to a severe degradation in service quality. The waiting scheduling duration can be calculated using the current average queue length and average group arrival rate of the groups, as shown in the following formula (1): Formula (1) in, Indicates grouping In the time slot The waiting time for scheduling at the start time. This represents the average group arrival rate; Indicates grouping In the time slot The average queue length before the start time. ,in, Indicates grouping In the time slot The length of the queue at the start time.

[0042] In one optional implementation, after obtaining the waiting scheduling durations of the first and second packets, communication resource scheduling is performed on the packets based on the waiting scheduling durations of the first and second packets and a latency threshold. The latency threshold characterizes the maximum acceptable latency for the packets and corresponds to the level of the second priority.

[0043] In one optional implementation, communication resource scheduling is performed on the first group based on the fact that the waiting scheduling time of the first group is not less than a first threshold and the waiting scheduling time of the second group is less than a second threshold. This prioritizes scheduling communication resources for groups whose waiting scheduling time exceeds their acceptable latency threshold, preventing the waiting scheduling time of groups from exceeding the latency requirements of users and services, and ensuring service quality. The first threshold and the second threshold correspond to the level of the second priority; the first threshold characterizes the acceptable latency threshold for the first group, and the second threshold characterizes the acceptable latency threshold for the second group.

[0044] In one optional implementation, based on the fact that the waiting time for the first group is less than a first threshold and the waiting time for the second group is less than a second threshold, a third priority is obtained for the first group and the second group. Based on the third priority of the first group and the second group, communication resource scheduling is performed on the first group and / or the second group. The third priority corresponds to user satisfaction and is used to meet the user's service quality requirements during the communication resource scheduling process. By introducing a third priority that represents the scheduling priority of the groups, communication resources are scheduled according to priority order within the delay threshold of each group to ensure that the user's service quality requirements are met.

[0045] In one alternative implementation, the third priority includes at least a fifth level and a sixth level, wherein the fifth level is higher than the sixth level. It should be noted that the above is merely an example of the third priority including at least two levels. In actual communication resource scheduling, more third priority levels can be divided and allocated, such as assigning one third priority level to each packet; no specific limitation is made here.

[0046] In one alternative implementation, communication resource scheduling is performed on the first group based on the fact that the third priority level of the first group is higher than that of the second group, thereby prioritizing the scheduling of communication resources for groups with higher third priority levels to ensure that the user's service quality requirements are met.

[0047] It should be noted that the above examples only use the first and second groups as examples. In actual communication resource scheduling, more groups may be involved. For instance, when scheduling communication resources for multiple groups, the first group set with the highest priority is determined. Within the first group set, the second group or second group set that has reached the delay threshold is first identified, and communication resources are scheduled for the second group or second group set first. Among the groups in the first group set that have not reached the delay threshold, communication resources are scheduled sequentially according to the third priority level.

[0048] In one alternative implementation, such as Figure 2 As shown, the third priority of each group is determined in the following way: Step S201: Obtain the third threshold for grouping.

[0049] Among them, the third threshold corresponds to user satisfaction. The third threshold is used to characterize the user's satisfaction with the service quality. The third threshold reflects the user's requirements for service quality. The third threshold of the group is less than the delay threshold.

[0050] In one optional implementation, the third threshold of the group is proportional to the delay threshold, i.e., the third threshold is equal to the delay threshold multiplied by a coefficient less than 1. Taking the first group and the second group mentioned above as examples, the third threshold of the first group is proportional to the first threshold, and the third threshold of the second group is proportional to the second threshold. Optionally, the first proportional relationship and the second proportional relationship are the same, i.e., the corresponding delay thresholds are multiplied by the same proportional coefficient.

[0051] Step S202: Calculate the third priority of the group based on the waiting scheduling time of the group and the third threshold.

[0052] Specifically, the third threshold of a group is subtracted from the waiting time for scheduling to determine the time leeway before the group reaches the third threshold. The third priority of the group is then measured based on the time leeway. The smaller the time leeway, the higher the third priority level. This allows groups that are about to reach the user satisfaction threshold to be assigned a higher third priority, so that communication resources can be scheduled for them first to ensure service quality.

[0053] In one optional implementation, the third priority of a group is calculated based on the difference between the group's third threshold and the waiting time for scheduling. Specifically, different algorithms are used to calculate the third priority of a group according to the magnitude of the difference between the group's third threshold and the waiting time for scheduling, as follows: Based on the condition that the difference between the third threshold and the waiting scheduling duration of a group is less than a preset difference, a first preset algorithm is used to calculate the third priority of the group by combining the data transmission information of the group with the absolute value of the difference between the third threshold and the waiting scheduling duration. The first preset algorithm multiplies the data transmission information of the group by the absolute value of the difference between the third threshold and the waiting scheduling duration. According to the first preset algorithm, the larger the absolute value of the difference between the third threshold and the waiting scheduling duration, the higher the third priority of the group. Therefore, groups whose waiting scheduling duration exceeds the third threshold more are assigned a higher third priority. Priority is given to scheduling communication resources for groups that are about to reach the latency threshold, preventing the waiting scheduling duration of groups from exceeding the latency threshold, and ensuring that communication resources are scheduled for each group within the latency threshold as much as possible to avoid service quality degradation.

[0054] Based on the premise that the difference between the third threshold and the waiting time for a group is not less than a preset difference, a second preset algorithm is used to calculate the group's scheduling priority by combining the group's data transmission information with the difference between the third threshold and the waiting time. Specifically, the second preset algorithm divides the group's data transmission information by the difference between the third threshold and the waiting time. According to this algorithm, the smaller the difference between the third threshold and the waiting time, the higher the group's third priority. This allows groups whose waiting time is closer to the third threshold to be assigned a higher third priority, prioritizing the scheduling of communication resources for groups that are about to reach the third threshold. This prevents groups from exceeding the third threshold and ensures that communication resources are scheduled for each group within the third threshold as much as possible, thus guaranteeing service quality.

[0055] In one optional implementation, if the difference between the third threshold of a group and the waiting time for scheduling is not less than a preset difference, a control factor can be superimposed to adjust the sensitivity of the third priority to latency and increase the calculation weight of groups that have not reached the third threshold, so as to prioritize scheduling communication resources to groups that are still within the satisfaction threshold and avoid the waiting time of groups exceeding the satisfaction threshold as much as possible, thus preventing service quality degradation.

[0056] In one optional implementation, the preset difference is 0, and the calculation method for the third priority can be as shown in the following formula (2): Formula (2) in, Indicates grouping The difference between the third threshold and the waiting time for scheduling. Indicates grouping The third priority, Indicates grouping Data transmission information; It is the first control factor, used to adjust the sensitivity of the third priority to latency; It serves as the second control factor, used to adjust the initial base for the third priority.

[0057] In one optional implementation, the data transmission information is the instantaneous throughput of the packets, which can be calculated based on the user signal-to-noise ratio, as shown in the following formula (3): Formula (3) in, Indicates grouping In the time slot Inner Instantaneous throughput on each subcarrier Indicates the bandwidth of the subcarrier. This represents the mapping corresponding to the bit error rate. Indicates grouping In the time slot Inner The signal-to-noise ratio (SNR) over each resource block (RB). This varies depending on the modulation technique used. Bit error rate There are different mapping relationships between them.

[0058] In one specific embodiment Figure 3 This is a resource scheduling diagram of a communication resource scheduling method according to an embodiment of the present invention, as shown below. Figure 3 As shown, under the same first priority level, data services, as non-guaranteed bit rate (Non-GBR) services, have a lower second priority level. Therefore, the average user latency for data services is relatively higher than that for video and voice services. Both voice and video services are guaranteed bit rate (GBR) services and have the same second priority level. The latency threshold for video services is higher than that for voice services. Conversely, the third priority level for video services is lower than that for voice services. Therefore, the average user latency for voice services is relatively higher than that for video services.

[0059] In one specific embodiment Figure 4 This is a comparison chart of the packet scheduling rates of the communication resource scheduling method of this invention and the PF proportional fairness algorithm, as shown in the figure. Figure 4 As shown, with the increase in the number of users, the packet scheduling rate of the proportional fairness algorithm commonly used in related technologies drops sharply, while the communication resource scheduling method of the present invention can still maintain a high packet scheduling rate. It can be seen that the communication resource scheduling method of the present invention can fully guarantee the quality of service for users in multi-user service scenarios.

[0060] The communication resource scheduling method provided in this embodiment of the invention sets a first priority corresponding to the user type and a second priority corresponding to the service type, and performs communication resource scheduling on groups based at least on the first priority and the second priority, thereby combining the first priority and the second priority for hierarchical scheduling, taking into account the communication resource needs of different user types and service types, and ensuring the quality of service for different users or different services of the same user.

[0061] This embodiment also provides a communication resource scheduling device for implementing the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0062] This embodiment provides a communication resource scheduling device, such as... Figure 5 As shown, it includes: The priority acquisition module 501 is used to acquire the first priority and the second priority of the group respectively. The first priority corresponds to the user type and the second priority corresponds to the business type. Resource scheduling module 502 is used to perform communication resource scheduling on packets based at least on a first priority and a second priority.

[0063] In one alternative implementation, the first priority includes at least a first level and a second level, and / or the second priority includes at least a third level and a fourth level; The first level is higher than the second level, and the third level is higher than the fourth level.

[0064] In one optional implementation, the resource scheduling module 502 includes: The first scheduling unit is used to perform communication resource scheduling on the first group based on the fact that the first priority level of the first group is higher than the first priority level of the second group.

[0065] In one alternative implementation, based on the fact that the first priority level of the first group is equal to the first priority level of the second group, the device further includes: The waiting time acquisition module is used to obtain the waiting scheduling time of the first group and the second group.

[0066] In one alternative embodiment, the device further includes: The second scheduling module is used to perform communication resource scheduling on the first group based on the fact that the waiting scheduling time of the first group is not less than a first threshold and the waiting scheduling time of the second group is less than a second threshold, wherein the first threshold and the second threshold correspond to the level of the second priority.

[0067] In an optional implementation, based on the fact that the waiting time for scheduling of the first group is less than a first threshold and the waiting time for scheduling of the second group is less than a second threshold, the device further includes: The third priority acquisition module is used to acquire the third priority of the first group and the second group, where the third priority corresponds to user satisfaction. The third scheduling module is used to perform communication resource scheduling on the first group and / or the second group based on the third priority of the first group and the second group.

[0068] In one alternative implementation, the third priority includes at least a fifth level and a sixth level, wherein the fifth level is higher than the sixth level.

[0069] In one optional implementation, the third scheduling module includes: The third scheduling unit is used to perform communication resource scheduling on the first group based on the fact that the third priority level of the first group is higher than the third priority level of the second group.

[0070] In one alternative embodiment, the device further includes: The third threshold acquisition module is used to acquire the third threshold of the group, which corresponds to user satisfaction. The third priority calculation module is used to calculate the third priority of a group based on the group's waiting scheduling duration and the third threshold.

[0071] In one optional implementation, the third priority calculation module is used for: The third priority of a group is calculated based on the difference between the third threshold of the group and the waiting time for scheduling.

[0072] In one optional implementation, the third priority of a group is calculated based on the difference between the group's third threshold and the waiting scheduling duration, including: The first calculation unit is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting scheduling time based on the fact that the difference between the third threshold and the waiting scheduling time is less than a preset difference, using the first preset algorithm to obtain the third priority of the group. The second calculation unit is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting scheduling time based on the fact that the difference between the third threshold and the waiting scheduling time is not less than a preset value, using a second preset algorithm to obtain the scheduling priority of the group.

[0073] In one alternative implementation, the data transmission information is the instantaneous throughput of packets.

[0074] In one alternative implementation, the third threshold of the first group is proportional to the first threshold, and the third threshold of the second group is proportional to the second threshold.

[0075] In one alternative implementation, the first proportional relationship is the same as the second proportional relationship.

[0076] Further functional descriptions of the above modules and units are the same as those in the corresponding embodiments described above, and will not be repeated here.

[0077] In this embodiment, the communication resource scheduling device is presented in the form of a functional unit. Here, a unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that execute one or more software or fixed programs, and / or other devices that can provide the above functions.

[0078] This invention also provides a computer device having the above-described features. Figure 5 The communication resource scheduling device shown.

[0079] Please see Figure 6 , Figure 6 This is a schematic diagram of the structure of a computer device provided in an optional embodiment of the present invention, such as... Figure 6 As shown, the computer device includes one or more processors 10, memory 20, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The components communicate with each other via different buses and can be mounted on a common motherboard or otherwise installed as needed. The processors can process instructions executed within the computer device, including instructions stored in or on memory to display graphical information of a GUI on external input / output devices (such as display devices coupled to the interfaces). In some alternative implementations, multiple processors and / or multiple buses can be used with multiple memories and multiple memory modules, if desired. Similarly, multiple computer devices can be connected, each providing some of the necessary operations (e.g., as a server array, a group of blade servers, or a multiprocessor system). Figure 6 Take a processor 10 as an example.

[0080] Processor 10 may be a central processing unit, a network processor, or a combination thereof. Processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The programmable logic device may be a complex programmable logic device (CAMP), a field-programmable gate array (FPGA), a general-purpose array logic (GPA), or any combination thereof.

[0081] The memory 20 stores instructions executable by at least one processor 10 to cause the at least one processor 10 to perform the method shown in the above embodiments.

[0082] The memory 20 may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the computer device. Furthermore, the memory 20 may include high-speed random access memory and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some alternative embodiments, the memory 20 may optionally include memory remotely located relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0083] The memory 20 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as flash memory, hard disk or solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0084] The computer device also includes a communication interface 30 for communicating with other devices or communication networks.

[0085] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as computer code that can be recorded on a storage medium, or implemented as computer code downloaded via a network and originally stored on a remote storage medium or a non-transitory machine-readable storage medium and then stored on a local storage medium. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code, which, when accessed and executed by the computer, processor, or hardware, implements the methods shown in the above embodiments.

[0086] A portion of this invention can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide the methods and / or technical solutions according to the invention through the operation of the computer. Those skilled in the art will understand that the forms in which computer program instructions exist in a computer-readable medium include, but are not limited to, source files, executable files, installation package files, etc. Correspondingly, the ways in which computer program instructions are executed by a computer include, but are not limited to: the computer directly executing the instructions, or the computer compiling the instructions and then executing the corresponding compiled program, or the computer reading and executing the instructions, or the computer reading and installing the instructions and then executing the corresponding installed program. Here, the computer-readable medium can be any available computer-readable storage medium or communication medium accessible to a computer.

[0087] Although embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations all fall within the scope defined by the present invention.

Claims

1. A communication resource scheduling method, characterized in that, The method includes: Obtain the first priority and the second priority of the group respectively. The first priority corresponds to the user type, and the second priority corresponds to the business type. Communication resource scheduling is performed on the group based at least on the first priority and the second priority.

2. The method according to claim 1, characterized in that, The first priority includes at least a first level and a second level, and / or the second priority includes at least a third level and a fourth level; The first level is higher than the second level, and the third level is higher than the fourth level.

3. The method according to claim 1, characterized in that, The step of performing communication resource scheduling on the packets based at least on the first priority and the second priority includes: Communication resource scheduling is performed on the first group based on the fact that the first priority level of the first group is higher than the first priority level of the second group.

4. The method according to claim 3, characterized in that, Based on the fact that the first priority level of the first group is equal to the first priority level of the second group, the method further includes: Obtain the waiting scheduling duration for the first group and the second group.

5. The method according to claim 4, characterized in that, After obtaining the waiting scheduling duration of the first group and the second group, the method further includes: Based on the fact that the waiting time for the first group is not less than a first threshold and the waiting time for the second group is less than a second threshold, communication resource scheduling is performed on the first group, wherein the first threshold and the second threshold correspond to the level of the second priority.

6. The method according to claim 4, characterized in that, Based on the fact that the waiting time for scheduling of the first group is less than a first threshold and the waiting time for scheduling of the second group is less than a second threshold, the method further includes: Obtain the third priority of the first group and the second group, wherein the third priority corresponds to user satisfaction; Based on the third priority of the first packet and the second packet, communication resource scheduling is performed on the first packet and / or the second packet.

7. The method according to claim 6, characterized in that, The third priority includes at least a fifth level and a sixth level, wherein the fifth level is higher than the sixth level.

8. The method according to claim 6, characterized in that, The step of performing communication resource scheduling on the first packet and / or the second packet based on the third priority of the first packet and the second packet includes: Communication resource scheduling is performed on the first group because the third priority level of the first group is higher than the third priority level of the second group.

9. The method according to claim 6, characterized in that, The method further includes: Obtain a third threshold for the group, wherein the third threshold corresponds to user satisfaction; The third priority of the group is calculated based on the waiting time for scheduling and the third threshold.

10. The method according to claim 9, characterized in that, The calculation of the third priority of the group based on the waiting scheduling duration of the group and the third threshold includes: The third priority of the group is calculated based on the difference between the third threshold of the group and the waiting scheduling time.

11. The method according to claim 10, characterized in that, The calculation of the third priority of the group based on the difference between the third threshold of the group and the waiting scheduling time includes: Based on the fact that the difference between the third threshold of the group and the waiting scheduling time is less than a preset difference, the first preset algorithm is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting scheduling time to obtain the third priority of the group. Based on the fact that the difference between the third threshold of the group and the waiting scheduling time is not less than the preset difference, the second preset algorithm is used to calculate the data transmission information of the group and the difference between the third threshold and the waiting scheduling time to obtain the scheduling priority of the group.

12. The method according to claim 11, characterized in that, The data transmission information is the instantaneous throughput of the packets.

13. The method according to any one of claims 6-12, characterized in that, The third threshold of the first group is proportional to the first threshold, and the third threshold of the second group is proportional to the second threshold.

14. The method according to claim 13, characterized in that, The first proportional relationship is the same as the second proportional relationship.

15. A communication resource scheduling device, characterized in that, The device includes: The priority acquisition module is used to acquire the first priority and the second priority of the group respectively. The first priority corresponds to the user type and the second priority corresponds to the business type. A resource scheduling module is used to perform communication resource scheduling on the group based at least on the first priority and the second priority.

16. A computer device, characterized in that, include: A memory and a processor are communicatively connected, the memory stores computer instructions, and the processor executes the communication resource scheduling method according to any one of claims 1 to 14 by executing the computer instructions.

17. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing the computer to execute the communication resource scheduling method according to any one of claims 1 to 14.

Images