A communication packet scheduling method, device and electronic equipment

Abstract

This application discloses a method, apparatus, and electronic device for scheduling communication packets. The method includes: receiving communication packets from different channels; obtaining the quality of service (QoS) priority and channel quality for each channel; determining a comprehensive scheduling ranking score for each channel based on the QoS priority and channel quality; and determining a scheduling strategy for the communication packets from different channels based on the comprehensive scheduling ranking score for each channel. This enables intelligent scheduling of communication packets, improving cell throughput and resource utilization.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a method, apparatus and electronic device for scheduling communication packets. Background Technology

[0002] Currently, existing systems schedule communication packets based on three factors: the earliest and latest packet scheduling times, the Quality of Service (QoS) priority for each packet, and the channel quality factor. Packets are then ranked according to these three factors. For example, they are first ranked by factor one; if the rankings of factor one are the same, they are ranked by factor two; and if the rankings of factor two are also the same, they are ranked by factor three.

[0003] Thus, during the scheduling of communication packets, there may be a problem where communication packets have low quality of service priority, and even if the channel quality is very high, they are difficult to be scheduled. Summary of the Invention

[0004] The applicant has creatively provided a method, apparatus, and electronic device for scheduling communication packets, which at least solves the aforementioned technical problems existing in the prior art.

[0005] According to a first aspect of the embodiments of this application, a method for scheduling communication packets includes: receiving communication packets from different channels; obtaining the quality of service priority and channel quality of each channel; determining a scheduling ranking comprehensive score for each channel based on the quality of service priority and channel quality; and determining a scheduling strategy for the communication packets from different channels based on the scheduling ranking comprehensive score for each channel.

[0006] According to one embodiment of this application, determining the comprehensive scheduling ranking score for each channel based on the service quality priority and channel quality includes: obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision; and determining the comprehensive scheduling ranking score for each channel based on the weights and the service quality priority and channel quality.

[0007] According to one embodiment of this application, obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision includes: obtaining preset weights of the service quality priority and channel quality in the communication packet scheduling decision.

[0008] According to one embodiment of this application, obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision includes: dynamically determining the weights of the service quality priority and channel quality in the communication packet scheduling decision based on the waiting time of the communication packet.

[0009] According to one embodiment of this application, the weighting of channel quality is a first parameter, and the weighting of service quality priority is a second parameter. Accordingly, determining the comprehensive scheduling ranking score for each channel based on the weighting, service quality priority, and channel quality includes: determining a first score corresponding to the channel quality based on the first parameter, the channel quality, and a first function; determining a second score corresponding to the service quality priority based on the second parameter, the service quality priority, and a second function; and performing a summation or product operation on the first score and the second score to obtain the comprehensive scheduling ranking score for each channel.

[0010] According to one embodiment of this application, the channel quality includes at least two channel quality factors, and correspondingly, the weighting of the channel quality includes at least two sub-parameters corresponding to the at least two channel quality factors; correspondingly, determining the first score corresponding to the channel quality based on the first parameter, the channel quality, and the first function includes: determining the sub-score corresponding to each factor based on the sub-parameters corresponding to each of the at least two channel quality factors, each factor, and the sub-function corresponding to each factor; and performing summation or product operations on the sub-scores corresponding to each of the at least two channel quality factors to obtain the first score corresponding to the channel quality.

[0011] According to one embodiment of this application, the channel quality factors include at least one of the following: packet error rate; waiting time; and the ratio of waiting time to a waiting time threshold.

[0012] According to one embodiment of this application, determining the scheduling ranking comprehensive score for each channel based on the service quality priority and channel quality includes: determining a scheduling ranking comprehensive score model based on historical data of service quality priority, channel quality, scheduling scheme, and user evaluation; and inputting the service quality priority and channel quality into the scheduling ranking comprehensive score model to obtain the scheduling ranking comprehensive score for each channel.

[0013] According to a second aspect of the present application, a communication packet scheduling apparatus includes: a communication packet receiving module for receiving communication packets from different channels; a scheduling information acquisition module for acquiring the service quality priority and channel quality of each channel; a scheduling score determination module for determining a comprehensive scheduling ranking score for each channel based on the service quality priority and channel quality; and a scheduling ranking module for determining a scheduling strategy for the communication packets from different channels based on the comprehensive scheduling ranking score of each channel.

[0014] According to a third aspect of this application, an electronic device is provided, comprising:

[0015] At least one processor; and

[0016] A memory communicatively connected to the at least one processor; wherein,

[0017] The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method described in this application.

[0018] The method in this application embodiment receives communication packets from different channels; obtains the quality of service priority and channel quality for each channel; determines a scheduling ranking comprehensive score for each channel based on the quality of service priority and channel quality; and determines a scheduling strategy for the communication packets from different channels based on the scheduling ranking comprehensive score for each channel. This enables intelligent scheduling of communication packets, improving cell throughput and resource utilization.

[0019] It should be understood that the implementation of this application does not need to achieve all the beneficial effects described above. Rather, a specific technical solution can achieve a specific technical effect, and other embodiments of this application can also achieve beneficial effects not mentioned above. Attached Figure Description

[0020] The above and other objects, features, and advantages of exemplary embodiments of this application will become readily apparent from the following detailed description taken in conjunction with the accompanying drawings. Several embodiments of this application are illustrated in the drawings by way of example and not limitation, in which:

[0021] In the accompanying drawings, the same or corresponding reference numerals indicate the same or corresponding parts.

[0022] Figure 1 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 1 ;

[0023] Figure 2 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 2 ;

[0024] Figure 3 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 3 ;

[0025] Figure 4 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 4 ;

[0026] Figure 5 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 5 ;

[0027] Figure 6 This illustration shows a flowchart of the communication packet scheduling method provided in an embodiment of this application. Figure 6 ;

[0028] Figure 7 This illustration shows an application scenario of the communication packet scheduling method provided in an embodiment of this application;

[0029] Figure 8 This illustration shows an optional schematic diagram of a communication packet scheduling device provided in an embodiment of this application;

[0030] Figure 9 A schematic diagram of the composition structure of the electronic device provided in the embodiments of this application is shown. Detailed Implementation

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

[0032] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of this application. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of those different embodiments or examples.

[0033] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "a plurality of" means two or more, unless otherwise explicitly specified.

[0034] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.

[0035] In related technologies, currently known solutions for scheduling communication packets are based on three factors: the earliest and latest scheduling times, the quality of service (QoS) priority for each packet, and the channel quality factor. These factors are then used for hierarchical sorting. For example, sorting is first done based on factor one; if factors one is the same, sorting is done based on factor two; and if factors two are also the same, sorting is done based on factor three. However, these technologies often encounter the problem that packets with low QoS priorities may struggle to be scheduled even with high channel quality.

[0036] To address the problem in related technologies where communication packets often have low Quality of Service (QoS) priority during scheduling, making them difficult to schedule even with high channel quality, thus leading to low cell throughput and low resource utilization, the method in this application involves receiving communication packets from different channels; obtaining the QoS priority and channel quality of each channel; determining a comprehensive scheduling ranking score for each channel based on the QoS priority and channel quality; and determining a scheduling strategy for communication packets from different channels based on the comprehensive scheduling ranking score for each channel. This allows for a comprehensive scoring of QoS priority and channel quality within a single dimension, and the determination of a scheduling strategy for communication packets based on the comprehensive scheduling ranking score, thereby improving cell throughput and resource utilization. Therefore, compared to related technologies where communication packets often have low QoS priority during scheduling, making them difficult to schedule even with high channel quality, resulting in low cell throughput and low resource utilization, the communication packet scheduling method in this application can improve cell throughput and resource utilization.

[0037] The processing flow of the communication packet scheduling method provided in the embodiments of this application will be described. See [link to relevant documentation]. Figure 1 , Figure 1 This is a schematic diagram of the processing flow of the communication packet scheduling method provided in the embodiments of this application. Figure 1 , will combine Figure 1 Steps S101-S104 are explained below.

[0038] Step S101: Receive communication packets from different channels.

[0039] In some embodiments, the channel may include a wired channel and a wireless channel. The channel may also include other channels, which are not limited in this application embodiment. The communication packet may include a communication data packet for which a scheduling strategy needs to be determined. The scheduling strategy may include the scheduling order of the communication packets and the scheduling scheme of the communication packets.

[0040] Step S102: Obtain the service quality priority and channel quality for each channel.

[0041] In some embodiments, the Quality of Service (QoS) priority may include a 5qi priority parameter. The 5qi priority parameter is an unsigned integer value ranging from 0 to 255. The 5qi priority parameter can be used in 5G (5th Generation Mobile Communication Technology) systems to reference a set of standard 5G QoS characteristic parameters based on the 5qi priority parameter. The 5G QoS characteristic parameters may include: packet scheduling weights, admission control, queue management thresholds, and link layer protocol configurations. Channel quality may include: channel quality factors. These channel quality factors may include at least one of: packet error rate, latency, and the ratio of latency to a latency threshold.

[0042] Step S103: Determine the comprehensive score for scheduling order of each channel based on service quality priority and channel quality.

[0043] In some embodiments, step S103 may include: obtaining the weights of service quality priority and channel quality in the communication packet scheduling decision; and determining a comprehensive scheduling ranking score for each channel based on the weights, service quality priority, and channel quality. The weights may include the weights of service quality priority and channel quality preset in the configuration file. The comprehensive scheduling ranking score may be the basis for determining the scheduling strategy for communication packets. The higher the comprehensive scheduling ranking score, the earlier the corresponding communication packet is scheduled.

[0044] To determine the weighting of service quality priority and channel quality in packet scheduling decisions, specific implementation may include: obtaining preset weightings for service quality priority and channel quality in packet scheduling decisions. These preset weightings may include: the weightings of service quality priority and channel quality pre-defined in a configuration file.

[0045] As an example, the preset weighting for service quality priority is 0.6; the preset weighting for channel quality is 0.4. Based on the weighting of service quality priority (0.6), service quality priority, and channel quality (0.4), a comprehensive scheduling score for each channel is calculated.

[0046] In terms of the weighting of service quality priority and channel quality in communication packet scheduling decisions, in specific implementation, it may also include: dynamically determining the weighting of service quality priority and channel quality in communication packet scheduling decisions based on the waiting time of communication packets.

[0047] As an example, a preset waiting time threshold is obtained. In response to a packet waiting time exceeding the preset threshold, the weight of service quality priority in the packet scheduling decision is increased.

[0048] To determine the comprehensive scheduling ranking score for each channel based on its weighted average, service quality priority, and channel quality, the specific implementation may include: determining a first score corresponding to channel quality based on a first parameter, channel quality, and a first function; determining a second score corresponding to service quality priority based on a second parameter, service quality priority, and a second function; and summing or multiplying the first and second scores to obtain the comprehensive scheduling ranking score for each channel. The first parameter may include a weighted average for channel quality. The second parameter may include a weighted average for service quality priority. This application does not limit the specific weighted average. The first function may include a function that calculates the first score corresponding to channel quality based on the first parameter and channel quality. This application does not limit the specific first function. The second function may include a function that calculates the second score corresponding to service quality priority based on the second parameter and service quality priority. This application does not limit the specific second function.

[0049] As an example, based on the first parameter, channel quality, and first function, the first score corresponding to the channel quality of communication packet 1 is determined to be 0.5. Based on the second parameter, service quality priority, and second function, the second score corresponding to the service quality priority of communication packet 1 is determined to be 5. Multiplying the first score and the second score yields a comprehensive scheduling ranking score of 2.5 for communication packet 1 on channel 1.

[0050] To determine the first score corresponding to channel quality based on a first parameter, channel quality, and a first function, in specific implementation, this can include: determining a sub-score corresponding to each factor based on the sub-parameters, each factor, and the sub-function corresponding to each of at least two channel quality factors; and performing summation or multiplication on the sub-scores corresponding to each of the at least two channel quality factors to obtain the first score corresponding to the channel quality. Here, channel quality can include at least two channel quality factors. The weighting of channel quality can include at least two sub-parameters corresponding to the at least two channel quality factors. Channel quality factors can include packet error rate, latency, and the ratio of latency to a latency threshold. Sub-parameters can include parameters corresponding to packet error rate, latency, and the ratio of latency to a latency threshold. Sub-functions can include functions that calculate the sub-scores corresponding to the channel quality factors based on the sub-parameters and channel quality factors. This application does not limit the specific sub-functions.

[0051] As an example, the overall scheduling score k for each channel can be expressed by the following formula (1):

[0052]

[0053] Where C1 represents the weighting of channel quality, C2 represents the weighting of service quality priority, PER represents the packet error rate, and W... i (t) represents the waiting delay, D i The threshold representing the delay, r i (t) represents the instantaneous speed of device i at time t. This represents the average throughput of device i, and P represents the service quality priority. -lgPER represents the sub-score corresponding to the packet error rate. This represents the sub-rating corresponding to the ratio of waiting time to a waiting time threshold. A ratio approaching 0 will affect the calculation of the sub-rating. Expanding the ratio exponentially ensures that the calculation of the sub-rating is not affected by the ratio approaching 0.

[0054] In some embodiments, step S103 may further include: determining a comprehensive scheduling ranking score model based on historical data of service quality priority, channel quality, scheduling scheme, and user evaluation; inputting service quality priority and channel quality into the comprehensive scheduling ranking score model to obtain a comprehensive scheduling ranking score for each channel. The scheduling scheme may include the scheduling order of current communication packets. Historical user evaluation data may include user satisfaction survey scores. Training the neural network model with scheduling ranking based on historical data of service quality priority, channel quality, scheduling scheme, and user evaluation yields the comprehensive scheduling ranking score model. The comprehensive scheduling ranking score model can be used to determine the comprehensive scheduling ranking score for each channel based on the input service quality priority and channel quality.

[0055] Step S104: Based on the comprehensive score of scheduling and sorting for each channel, determine the scheduling strategy for communication packets from different channels.

[0056] In specific implementation, step S104 may include: sorting communication packets from different channels according to the scheduling ranking comprehensive score of each channel in descending order of the scheduling ranking comprehensive score, so as to obtain the scheduling order of the communication packets.

[0057] In some embodiments, the processing flow of the scheduling method for the communication packets is illustrated. Figure 2 ,like Figure 2 As shown, it includes:

[0058] Step S201a: Obtain the preset service quality priority and channel quality weights in the communication packet scheduling decision.

[0059] Step S201b: Determine the comprehensive score for scheduling ranking of each channel based on the proportion weight, service quality priority, and channel quality.

[0060] The specific descriptions of each step in steps S201a and S201b are the same as those for step S103 above, and will not be repeated here.

[0061] In some embodiments, the processing flow of the scheduling method for the communication packets is illustrated. Figure 3 ,like Figure 3 As shown, it includes:

[0062] Step S202a: Based on the waiting time of the communication packet, dynamically determine the weight of service quality priority and channel quality in the communication packet scheduling decision.

[0063] Step S202b: Determine the comprehensive score for scheduling ranking of each channel based on the proportion weight, service quality priority, and channel quality.

[0064] As an example, steps S202a and S202b may include: setting a preset waiting time threshold of 5 seconds; determining the waiting time for communication packet 2 to be 6 seconds; and increasing the weight of the service quality priority of communication packet 2 in the communication packet scheduling decision, since the waiting time of 6 seconds for communication packet 2 is greater than the preset waiting time threshold of 5 seconds.

[0065] The specific descriptions of each step in steps S202a and S202b are the same as those for step S103 above, and will not be repeated here.

[0066] In some embodiments, the processing flow of the scheduling method for the communication packets is illustrated. Figure 4 ,like Figure 4 As shown, it includes:

[0067] Step S301: Determine the first score corresponding to the channel quality based on the first parameter, channel quality, and first function.

[0068] Step S302: Determine the second score corresponding to the service quality priority based on the second parameter, the service quality priority, and the second function.

[0069] Step S303: Add or multiply the first score and the second score to obtain the comprehensive scheduling ranking score for each channel.

[0070] The specific explanations for each step S301-S303 are the same as those for step S103 above, and will not be repeated here.

[0071] In some embodiments, the processing flow of the scheduling method for the communication packets is illustrated. Figure 5 ,like Figure 5 As shown, it includes:

[0072] Step S401: Determine the sub-score corresponding to each factor based on the sub-parameters, each factor, and the sub-function corresponding to each of the at least two channel quality factors.

[0073] Step S402: Summation or product operation is performed on the sub-scores corresponding to each of the at least two channel quality factors to obtain the first score corresponding to the channel quality.

[0074] As an example, steps S401 and S402 may include: acquiring at least two channel quality factors. The at least two channel quality factors may include: packet error rate and latency. Based on the sub-parameters corresponding to each factor, each factor itself, and the sub-function corresponding to each factor, a sub-score corresponding to each factor is determined. The sub-scores corresponding to the packet error rate and the sub-scores corresponding to the latency are summed or multiplied to obtain a first score corresponding to the channel quality.

[0075] The process of determining the first score based on the two channel quality factors is similar to the above process, and will not be elaborated here. At least two channel quality factors include packet error rate and the ratio of waiting time to waiting time threshold.

[0076] Taking at least two channel quality factors, including packet error rate, latency, and the ratio of latency to latency threshold, as an example, the process for determining the first score based on these three channel quality factors is as follows:

[0077] Obtain at least two channel quality factors. These factors may include: packet error rate, latency, and the ratio of latency to a latency threshold. Based on the sub-parameters corresponding to each factor, each factor itself, and its corresponding sub-function, determine a sub-score for each factor. Summate or multiply the sub-scores corresponding to the packet error rate, latency, and the ratio of latency to the latency threshold to obtain the first channel quality score.

[0078] The specific explanations for each step in steps S401 and S402 are the same as those for step S103 above, and will not be repeated here.

[0079] In some embodiments, the processing flow of the scheduling method for the communication packets is illustrated. Figure 6 ,like Figure 6 As shown, it includes:

[0080] Step S501: Based on historical data of service quality priority, channel quality, scheduling scheme and user evaluation, determine the comprehensive scoring model for scheduling ranking.

[0081] Step S502: Input the service quality priority and channel quality into the scheduling ranking comprehensive scoring model to obtain the scheduling ranking comprehensive score for each channel.

[0082] The specific descriptions of each step in steps S501 and S502 are the same as those in step S103 above, and will not be repeated here.

[0083] Figure 7 This illustration shows an application scenario of the communication packet scheduling method provided in an embodiment of this application;

[0084] refer to Figure 7 This application illustrates an application scenario of the communication packet scheduling method provided in this embodiment, applied to a 5G system for scheduling communication packets. First, communication packets are scheduled based on the TTI (Transmission Time Interval). The channel quality of all current channels is obtained, and the throughput of the corresponding device for each communication packet is updated. QoS service requirements are obtained, including service quality priority. A comprehensive scheduling ranking score for each channel is calculated based on algorithm requirement parameters. These parameters may include service quality priority, channel quality, the weight of channel quality, and the weight of service quality priority. Finally, communication packets from different channels are sorted from high to low according to their comprehensive scheduling ranking scores and scheduled sequentially. In response to resource exhaustion in the 5G system, the scheduling of the current communication packet ends. The scheduling of the next communication packet begins based on the TTI.

[0085] Understandable. Figure 7 The application scenarios of the communication packet scheduling method in this application are only some exemplary implementations in the embodiments of this application. The application scenarios of the communication packet scheduling method in the embodiments of this application include, but are not limited to, those of... Figure 7 The application scenarios of the communication packet scheduling method shown are illustrated.

[0086] The method in this application embodiment obtains the weights of service quality priority and channel quality in communication packet scheduling decisions; based on these weights, service quality priority, and channel quality, a comprehensive scheduling ranking score for each channel is determined. This allows for a comprehensive scoring of service quality priority and channel quality within a single dimension, ensuring scheduling opportunities for communication packets with poor channel quality, thereby improving cell throughput and 5G system resource utilization. The method in this application embodiment also dynamically determines the weights of service quality priority and channel quality in communication packet scheduling decisions based on the communication packet waiting time. This shortens the communication packet waiting time, ensuring scheduling opportunities for communication packets with long waiting times, thereby improving cell throughput and 5G system resource utilization. The method in this application embodiment further determines a first score corresponding to channel quality based on a first parameter, channel quality, and a first function; determines a second score corresponding to service quality priority based on a second parameter, service quality priority, and a second function; and performs summation or multiplication of the first and second scores to obtain a comprehensive scheduling ranking score for each channel. In this way, service quality priority and channel quality can be comprehensively scored under one dimension based on pre-configured weights, ensuring scheduling opportunities for communication packets with poor channel quality, thereby improving cell throughput and 5G system resource utilization. The method of this application embodiment determines a sub-score for each factor based on the sub-parameters, each factor, and the sub-function corresponding to each of at least two channel quality factors; the sub-scores corresponding to each of the at least two channel quality factors are summed or multiplied to obtain a first score for channel quality. Thus, a first score for channel quality can be determined based on multiple channel quality factors, comprehensively scoring service quality priority and channel quality under one dimension, ensuring scheduling opportunities for communication packets with poor channel quality, thereby improving cell throughput and 5G system resource utilization. The method of this application embodiment determines a scheduling ranking comprehensive scoring model based on historical data of service quality priority, channel quality, scheduling scheme, and user evaluation; service quality priority and channel quality are input into the scheduling ranking comprehensive scoring model to obtain a scheduling ranking comprehensive score for each channel. In this way, the neural network model can automatically determine the comprehensive score of service quality priority and channel quality in one dimension, ensuring the scheduling opportunity for communication packets with poor channel quality, broadening the use of the scheduler, reducing the scheduling time of communication packets, and improving cell throughput and resource utilization of the 5G system.

[0087] Therefore, compared with the problems in related technologies where communication packets have low quality of service priority during the scheduling process, making it difficult to schedule even if the channel quality is high, resulting in low cell throughput and low resource utilization, the communication packet scheduling method of this application can improve cell throughput and resource utilization.

[0088] The following description continues to illustrate the exemplary structure of the communication packet scheduling device 90 provided in the embodiments of this application as a software module. In some embodiments, such as Figure 8 As shown, the software modules in the communication packet scheduling device 90 may include: a communication packet receiving module 901, used to receive communication packets from different channels; a scheduling information acquisition module 902, used to acquire the service quality priority and channel quality of each channel; a scheduling score determination module 903, used to determine the comprehensive scheduling ranking score of each channel based on the service quality priority and channel quality; and a scheduling ranking module 904, used to determine the scheduling strategy for communication packets from different channels based on the magnitude of the comprehensive scheduling ranking score of each channel.

[0089] It should be noted that the description of the apparatus in this application embodiment is similar to the description of the method embodiment above, and has similar beneficial effects as the method embodiment, therefore it will not be repeated. For technical details not covered in the communication packet scheduling apparatus provided in this application embodiment, please refer to... Figures 1 to 7 The meaning is understood in accordance with the description of any of the accompanying drawings.

[0090] According to embodiments of this application, this application also provides an electronic device.

[0091] Figure 9 A schematic block diagram of an example electronic device 800 that can be used to implement embodiments of this application is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the application described and / or claimed herein.

[0092] like Figure 9 As shown, the electronic device 800 includes a computing unit 801, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 802 or a computer program loaded from a storage unit 808 into a random access memory (RAM) 803. The RAM 803 may also store various programs and data required for the operation of the electronic device 800. The computing unit 801, ROM 802, and RAM 803 are interconnected via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0093] Multiple components in electronic device 800 are connected to I / O interface 805, including: input unit 806, such as keyboard, mouse, etc.; output unit 807, such as various types of displays, speakers, etc.; storage unit 808, such as disk, optical disk, etc.; and communication unit 809, such as network card, modem, wireless transceiver, etc. Communication unit 809 allows electronic device 800 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0094] The computing unit 801 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 801 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 801 performs the various methods and processes described above, such as the communication packet scheduling method. For example, in some embodiments, the communication packet scheduling method can be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 808. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 800 via ROM 802 and / or communication unit 809. When the computer program is loaded into RAM 803 and executed by the computing unit 801, one or more steps of the communication packet scheduling method described above can be performed. Alternatively, in other embodiments, the computing unit 801 can be configured to perform the communication packet scheduling method by any other suitable means (e.g., by means of firmware).

[0095] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0096] The program code used to implement the methods of this application may be written in any combination of one or more programming languages. This program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing device, such that when executed by the processor or controller, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The program code may be executed entirely on a machine, partially on a machine, as a standalone software package partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0097] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0098] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as a data server), or computing systems that include middleware components (e.g., an application server), or computing systems that include frontend components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with embodiments of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., a communication network). Examples of communication networks include local area networks (LANs), wide area networks (WANs), and the Internet.

[0099] Computer systems can include clients and servers. Clients and servers are generally located far apart and typically interact via communication networks. Client-server relationships are created by computer programs running on the respective computers and having a client-server relationship with each other. Servers can be cloud servers, servers in distributed systems, or servers incorporating blockchain technology.

[0100] It should be understood that the various forms of processes shown above can be used to rearrange, add, or delete steps. For example, the steps described in this application can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution disclosed in this application can be achieved, and this is not limited herein.

[0101] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for scheduling communication packets, comprising: Receive communication packets from different channels; Obtain the service quality priority and channel quality for each channel; the channel quality includes at least one of the following: packet error rate, waiting time, and the ratio of waiting time to a waiting time threshold; Obtain the weights of the service quality priority and channel quality in the communication packet scheduling decision; The step of obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision includes: dynamically determining the weights of the service quality priority and channel quality in the communication packet scheduling decision based on the waiting time of the communication packet. Based on the weighted proportions, service quality priority, and channel quality, a comprehensive score for scheduling and ranking each channel is determined. Based on the comprehensive score of the scheduling order of each channel, a scheduling strategy is determined for the communication packets from different channels.

2. The method according to claim 1, wherein obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision includes: Obtain the preset service quality priority and channel quality weights in the communication packet scheduling decision.

3. The method according to claim 1, wherein the weighting of channel quality is a first parameter, and the weighting of service quality priority is a second parameter. Accordingly, determining the comprehensive score for scheduling ranking of each channel based on the weighted proportions, service quality priority, and channel quality includes: Based on the first parameter, the channel quality, and the first function, a first score corresponding to the channel quality is determined; Based on the second parameter, the service quality priority, and the second function, a second score corresponding to the service quality priority is determined; The first score and the second score are summed or multiplied to obtain the overall scheduling ranking score for each channel.

4. The method according to claim 3, wherein the channel quality includes at least two channel quality factors. Accordingly, the weighting of the channel quality includes at least two sub-parameters corresponding to at least two channel quality factors; Accordingly, based on the first parameter, the channel quality, and the first function, a first score corresponding to the channel quality is determined, including: Based on the sub-parameters, each factor, and the sub-functions corresponding to each of the at least two channel quality factors, determine the sub-score corresponding to each factor. The sub-scores corresponding to each of the at least two channel quality factors are summed or multiplied to obtain the first score corresponding to the channel quality.

5. The method according to claim 1, further comprising: Based on historical data of service quality priority, channel quality, scheduling scheme and user evaluation, a comprehensive scoring model for scheduling ranking is determined. The service quality priority and channel quality are input into the scheduling ranking comprehensive scoring model to obtain the scheduling ranking comprehensive score for each channel.

6. A communication packet scheduling device, comprising: A communication packet receiving module is used to receive communication packets from different channels; The scheduling information acquisition module is used to acquire the service quality priority and channel quality of each channel; the channel quality includes at least one of the following: packet error rate, waiting time, and the ratio of waiting time to a waiting time threshold; The scheduling scoring determination module is used to obtain the weights of the service quality priority and channel quality in the communication packet scheduling decision. The step of obtaining the weights of the service quality priority and channel quality in the communication packet scheduling decision includes: dynamically determining the weights of the service quality priority and channel quality in the communication packet scheduling decision based on the waiting time of the communication packet. Based on the weighted proportions, service quality priority, and channel quality, a comprehensive score for scheduling and ranking each channel is determined. Based on the comprehensive score of the scheduling order of each channel, a scheduling strategy is determined for the communication packets from different channels.

7. An electronic device, comprising: include: At least one processor; as well as A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-5.

Images