Time delay sensitive service scheduling method and device and readable storage medium

Abstract

The invention provides a time delay sensitive service scheduling method and device and a readable storage medium, and the method comprises the steps: obtaining a network parameter of a user, and a time delay requirement parameter corresponding to the user; determining a baseline enhancement proportional fair (EPF) priority based on the network parameters; determining a priority adjustment factor based on the time delay requirement parameter; determining an EPF priority based on a time delay requirement according to the baseline EPF priority and the priority adjustment factor; and performing user resource allocation according to the determined EPF priority. According to the method and the device, the multi-dimensional optimization target and the priority function are introduced, so that the time delay requirements of different services are accurately met, and the flexibility and the fairness of network scheduling are improved. Besides, by providing configuration options of the time delay factors, flexible adjustment of the algorithm among the rate, the resource fairness and the time delay dimension is realized, and the applicability and the flexibility of the algorithm are further improved.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device, and readable storage medium for scheduling delay-sensitive services. Background Art

[0002] In wireless communication systems, resource scheduling is a core issue. Traditional scheduling algorithms, such as Max C / I (Maximum Carrier-to-Interference Ratio,

[0003] The Max C / I (interference ratio) and RR (Round Robin) scheduling have their own limitations. Although the Max C / I scheduling algorithm can maximize the system throughput, it may cause unfairness among users; while the RR scheduling algorithm ensures fairness among users, it cannot maximize the system throughput. The Proportional Fair (PF) scheduling algorithm strikes a balance between the two, but there is still room for improvement. The EPF (Enhanced Proportional Fair) algorithm is based on the PF algorithm and further considers the QoS (Quality of Service) requirements and

[0004] The user experience is aimed at achieving more efficient resource allocation and a better user experience. However, the traditional EPF scheduler focuses mainly on the rate dimension and is not optimal in other dimensions (such as latency and power).

[0005] With the development of 5G communication technology, the latency requirements of different services are becoming increasingly diverse, and the traditional EPF scheduler can no longer meet these needs.

[0006] Therefore, how to better implement resource scheduling for services with different latency requirements becomes a problem that needs to be solved. Summary of the Invention

[0007] The technical problem to be solved by this application is to provide a delay-sensitive service scheduling method, device and readable storage medium to solve the problems existing in the prior art in view of the above-mentioned deficiencies in the prior art.

[0008] In a first aspect, the present application provides a method for scheduling delay-sensitive services, the method comprising:

[0009] S1. Obtain the user's network parameters and the user's corresponding delay requirement parameters;

[0010] S2. Determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters;

[0011] S3. Determine a priority adjustment factor based on the delay requirement parameter;

[0012] S4. Determine the EPF priority based on the latency requirement according to the baseline EPF priority and the priority adjustment factor;

[0013] S5. Allocate user resources according to the determined EPF priority.

[0014] In some embodiments, the user's network parameters include an instantaneous rate and a historical transmission rate;

[0015] The baseline EPF priority is determined based on the instantaneous rate and the historical transmission rate.

[0016] In some embodiments, based on the network parameters, the baseline enhanced proportional fairness (EPF) priority is determined by the following formula:

[0017]

[0018] Among them, Priority EPF represents the baseline EPF priority, α represents the rate weight, r i (t) represents the instantaneous rate, R i (t) represents the historical transmission rate, β represents the service priority weight, and QoS i Indicates the 5G service quality identifier 5QI level mapping value, 5QI_rank indicates the 5QI level, and K indicates the amplification factor.

[0019] In some embodiments, the delay requirement parameters corresponding to the user include delay demand and packet residence time;

[0020] The priority adjustment factor is determined based on the delay requirement and the packet residence time.

[0021] In some embodiments, based on the latency requirement parameter, the priority adjustment factor is determined by the following formula:

[0022]

[0023] Where γ(D) represents the priority adjustment factor, D represents the delay requirement, T represents the packet residence time, and γ1 and γ2 represent the adjustment coefficients.

[0024] In some embodiments, based on the baseline EPF priority and the priority adjustment factor, the EPF priority based on the latency requirement is determined by the following formula:

[0025] P new (D)=γ(D)*Priority EPF

[0026] Among them, P new (D) represents the EPF priority based on the delay requirement. EPF represents the baseline EPF priority, and γ(D) represents the priority adjustment factor.

[0027] In some embodiments, after S4, the method further includes:

[0028] Jitter suppression is performed according to the EPF priority based on the delay requirement to obtain the EPF priority after jitter suppression.

[0029] In some embodiments, jitter suppression is performed according to the EPF priority based on the latency requirement using the following formula to obtain the EPF priority after jitter suppression:

[0030]

[0031] Among them, P final (D) represents the EPF priority after jitter suppression, P new (D) represents the EPF priority based on the delay requirement, λ represents the jitter suppression coefficient, Indicates the delay change rate.

[0032] In a second aspect, the present application provides a delay-sensitive service scheduling device, the device comprising:

[0033] A parameter acquisition module configured to acquire the user's network parameters and the user's corresponding delay requirement parameters;

[0034] A first determining module configured to determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters;

[0035] a second determining module configured to determine a priority adjustment factor based on the delay requirement parameter;

[0036] a third determining module configured to determine an EPF priority based on a latency requirement according to a baseline EPF priority and a priority adjustment factor;

[0037] The resource allocation module is configured to allocate user resources according to the determined EPF priority.

[0038] In a third aspect, the present application provides a delay-sensitive service scheduling device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to implement the delay-sensitive service scheduling method described in the first aspect above.

[0039] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the delay-sensitive service scheduling method described in the first aspect is implemented.

[0040] The present application provides a method, device and readable storage medium for scheduling delay-sensitive services, and the method includes: obtaining the user's network parameters and the delay requirement parameters corresponding to the user; determining the baseline enhanced proportional fairness EPF priority based on the network parameters; determining the priority adjustment factor based on the delay requirement parameters; determining the EPF priority based on the delay requirement according to the baseline EPF priority and the priority adjustment factor; and allocating user resources according to the determined EPF priority. The present application provides a method for scheduling delay-sensitive services, which achieves accurate satisfaction of different service delay requirements by introducing multi-dimensional optimization objectives and priority functions, thereby improving the flexibility and fairness of network scheduling. In addition, by providing configuration options for the delay factor, flexible adjustment of the algorithm between the rate, resource fairness and delay dimensions is achieved, further improving the applicability and flexibility of the algorithm. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0042] Figure 1 Schematic diagram of the traditional baseline EPF scheduler processing different business scenarios

[0043] Figure 2 Schematic diagram of a delay-sensitive service scheduling system provided in an embodiment of the present application

[0044] Figure 3 A flowchart of a method for scheduling delay-sensitive services provided in an embodiment of the present application;

[0045] Figure 4 A flowchart of another method for scheduling delay-sensitive services provided in an embodiment of the present application;

[0046] Figure 5 A schematic diagram of the structure of a delay-sensitive service scheduling device provided in an embodiment of the present application;

[0047] Figure 6 A schematic diagram of the structure of another delay-sensitive service scheduling device provided in an embodiment of the present application.

[0048] The above drawings illustrate specific embodiments of the present application, which will be described in more detail below. These drawings and the textual description are not intended to limit the scope of the present application in any way, but rather to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments. DETAILED DESCRIPTION

[0049] In order to enable those skilled in the art to better understand the technical solution of the present application, the implementation methods of the present application will be further described in detail below with reference to the accompanying drawings.

[0050] It should be understood that the specific embodiments and drawings described herein are only used to explain the present application, rather than to limit the present application.

[0051] It can be understood that, in the absence of conflict, the various embodiments and features in the embodiments of the present application can be combined with each other.

[0052] It will be understood that, for the sake of ease of description, the drawings of this application only show the parts related to this application, while the parts not related to this application are not shown in the drawings.

[0053] It can be understood that each unit and module involved in the embodiments of the present application may correspond to only one physical structure, or may be composed of multiple physical structures, or multiple units and modules may be integrated into one physical structure.

[0054] It can be understood that the terms "first", "second", etc. in the embodiments of the present application are used to distinguish different objects, or to distinguish different processing of the same object, rather than to describe a specific order of objects.

[0055] It is understandable that, in the absence of conflict, the functions and steps marked in the flowcharts and block diagrams of the present application may occur in an order different from that marked in the drawings.

[0056] It is understood that the flowcharts and block diagrams of the present application illustrate the possible architectures, functions, and operations of the systems, devices, equipment, and methods according to the various embodiments of the present application. Each box in the flowchart or block diagram may represent a unit, module, program segment, or code, which contains executable instructions for implementing the specified functions. Moreover, each box or combination of boxes in the block diagram and flowchart may be implemented by a hardware-based system that implements the specified functions, or by a combination of hardware and computer instructions.

[0057] It can be understood that the units and modules involved in the embodiments of the present application can be implemented by software or hardware, for example, the units and modules can be located in a processor.

[0058] The traditional baseline EPF (Enhanced Proportional Fair) scheduling algorithm focuses primarily on rate and is suboptimal in other key dimensions, such as latency and power. When handling scenarios where different services have varying latency requirements, the baseline EPF scheduler's fairness principle can result in latency-sensitive services not achieving optimal performance. This phenomenon is exacerbated by network congestion.

[0059] For example, Figure 1 Schematic diagram of the scenario where the traditional baseline EPF scheduler handles different services, such as Figure 1 As shown, UE1, UE2, and UE3 each have different packet delay requirements (5ms for UE1, 2ms for UE2, and 3ms for UE3). However, under baseline EPF scheduling, UE2's delay requirement cannot be met, and UE1's delay exceeds expectations. For services with the same delay requirement, the delay margin at the near end is large, while the delay margin at the far end is small. The fairness principle can lead to failure to meet the far end delay requirement.

[0060] With the rapid development of communications technology, especially the evolution of 5G and future 6G technologies, the latency requirements of different services are becoming increasingly diverse. Traditional scheduling algorithms are no longer able to meet these diverse needs. Therefore, a new network scheduling method is needed that comprehensively considers multiple dimensions such as latency, jitter, and power to achieve more precise service experience optimization and resource allocation.

[0061] Based on this, the present application provides a delay-sensitive service scheduling method and system based on multi-dimensional service experience to solve the shortcomings of the traditional baseline EPF scheduler in dimensions such as delay and jitter, and improve the satisfaction of network scheduling with the delay requirements of different services.

[0062] The following specific embodiments describe in detail the technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0063] The present application provides a method for scheduling delay-sensitive services. For ease of explanation, the embodiments of the present application are described with the method execution subject being a base station.

[0064] Figure 2 A schematic diagram of a delay-sensitive service scheduling system provided in an embodiment of the present application is shown in FIG. Figure 2As shown, this application redesigns the traditional scheduler according to the delay requirements of different services, and introduces multi-dimensional optimization objectives, including delay satisfaction of packet arrival time, packet delay requirements, jitter threshold, etc., to solve the shortcomings of the traditional baseline EPF scheduler in dimensions such as delay, and improve the satisfaction of network scheduling with the delay requirements of different services.

[0065] Figure 3 A schematic diagram of a method for scheduling delay-sensitive services provided in an embodiment of the present application is shown in FIG. Figure 3 As shown, the present application provides a method for scheduling delay-sensitive services, which includes S1-S5, as follows:

[0066] S1. Obtain the user's network parameters and the user's corresponding delay requirement parameters;

[0067] In some embodiments, the user's network parameters include instantaneous rate and historical transmission rate; specifically, the base station queries the instantaneous rate, channel quality, and historical transmission rate that can be allocated to each user at the current moment.

[0068] 1) Instantaneous rate (ri(t)): Estimates the achievable rate of the user in the current TTI through CQI / SINR measurements.

[0069] 2) Channel Quality (CQIi(t)): Spectral efficiency is derived from the CQI or PMI reported by the UE.

[0070] 3) Historical transmission rate (Ri(t)): updated through exponential smoothing filtering.

[0071] The historical transmission rate is calculated as follows:

[0072] R i (t+1)=(1+ρ)·R i (t)+ρ·r i (t)

[0073] Here, ρ is the forgetting factor, which is usually between 0.001 and 0.01.

[0074] In some embodiments, the delay requirement parameters corresponding to the user include delay requirement and packet residence time; specifically, the base station queries the delay requirement of the SDU packet of each user at the current moment to obtain the delay requirement and packet residence time parameters.

[0075] S2. Determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters;

[0076] In this step, the base station calculates the baseline EPF priority of each user at the current moment, and the baseline EPF priority is determined based on the instantaneous rate and the historical transmission rate.

[0077] In some embodiments, based on the network parameters, the baseline enhanced proportional fairness (EPF) priority is determined by the following formula:

[0078]

[0079] Among them, Priority EPF represents the baseline EPF priority, α represents the rate weight (default 1.0), r i (t) represents the instantaneous rate, R i (t) represents the historical transmission rate, β represents the service priority weight (such as 2.0 for delay-sensitive services and 1.0 for ordinary services), QoS i It represents the 5G service quality identifier 5QI level mapping value, 5QI_rank represents the 5QI level, and K represents the amplification factor (usually 10).

[0080] 5G QoS Identifier (5QI) is an indicator used in 5G networks to define the required service level for a specific data flow. It is used to prioritize traffic and allocate network resources based on the type of traffic and its specific requirements. 5QI values ​​range from 1 to 255, with each value corresponding to a set of QoS parameters, including latency, throughput, packet loss rate, and jitter.

[0081] Among them, QoS i Define 5QI level mapping values ​​based on 3GPP definitions, directly mapping to the service's delay sensitivity, reliability requirements, and resource allocation priorities. These can be directly associated with the 5QI priority value (inverse relationship) or customized.

[0082] For example, when the 5QI value is 1 (highest priority), QoSi = (1 / 1) × 10 = 10.0; when the 5QI value is 6, QoSi = (1 / 6) × 10 ≈ 1.67.

[0083] The following is a specific example of determining baseline EPF priorities for this application:

[0084] A user uses 5QI3 for real-time gaming services. The current rate is 100 Mbps, the historical transmission rate is 50 Mbps, α is 1.0, and β is 2.0. Then:

[0085] QoSi=(1 / 3)×10≈3.3

[0086]

[0087] Therefore, based on the technical solution of the present application, the baseline EPF priority value of the user is 8.6.

[0088] S3. Determine a priority adjustment factor based on the delay requirement parameter;

[0089] In the present application, the priority adjustment factor is determined based on the delay requirement and the packet residence time.

[0090] In some embodiments, based on the latency requirement parameter, the priority adjustment factor is determined by the following formula:

[0091]

[0092] Where γ(D) represents the priority adjustment factor, D represents the delay requirement, T represents the packet residence time, and γ1 and γ2 represent the adjustment coefficients.

[0093] The adjustment coefficients can be set to γ1 = 0.1 and γ2 = 0.9. The thresholds are selected based on the following criteria:

[0094] 1) 0.1T: Suppress priority when there is sufficient latency margin (to avoid excessive resource preemption);

[0095] 2) 0.9T: Priority is significantly increased near the deadline (hard latency guarantee);

[0096] 3) Middle range: Linear growth simulates increasing urgency.

[0097] S4. Determine the EPF priority based on the latency requirement according to the baseline EPF priority and the priority adjustment factor;

[0098] In some embodiments, based on the baseline EPF priority and the priority adjustment factor, the EPF priority based on the latency requirement is determined by the following formula:

[0099] P new (D)=γ(D)*Priority EPF

[0100] Among them, P new (D) represents the EPF priority based on the delay requirement. EPF represents the baseline EPF priority, and γ(D) represents the priority adjustment factor.

[0101] Specifically, define the priority function P new (D), where D represents the delay demand and T represents the packet residence time. The base station calculates the priority adjustment factor γ(D) based on the delay demand and the packet residence time. EPF The EPF priority of each user based on the delay requirement is calculated. The priority function can be adjusted based on the relationship between the delay requirement D and the preset delay threshold γT to achieve fair scheduling among different services.

[0102] The following is a specific example of determining EPF priority based on latency requirements in this application:

[0103] Service requirement: End-to-end delay ≤ 20ms (T = 20ms), current packet dwell time D = 15ms. The new priority calculation process is as follows:

[0104] (1) Judgment interval: 0.1T = 2ms < 15ms < 18ms = 0.9T, so the middle segment formula is used to calculate γ(D):

[0105] γ(D)=15 / (20-15)=3.0

[0106] (2) If the baseline EPF is 2.0, the EPF priority based on latency requirements is:

[0107] P new (D) = 3.0 × 2.0 = 6.0

[0108] Therefore, compared with the traditional EPF (priority = 2.0), the scheduling opportunities for delay-sensitive services are increased by 3 times.

[0109] S5. Allocate user resources according to the determined EPF priority.

[0110] Specifically, after obtaining the EPF priorities of all users based on delay requirements, the users are sorted according to the EPF priorities based on delay requirements. During each scheduling, the user with the highest priority is selected for resource allocation based on the value of the latest priority function to ensure that delay-sensitive services can obtain sufficient resources.

[0111] Figure 4 Another schematic diagram of the delay-sensitive service scheduling method provided in an embodiment of the present application is as follows Figure 4 As shown, the present application provides a method for scheduling delay-sensitive services. When there is a jitter control requirement, after S4, the method further includes:

[0112] Jitter suppression is performed according to the EPF priority based on the delay requirement to obtain the EPF priority after jitter suppression.

[0113] Specifically, this step is used to achieve multi-dimensional optimization goals. On the basis of delay optimization, by extending the priority function and introducing the jitter derivative term, delay fluctuation (jitter) is further limited to avoid sudden changes in service experience.

[0114] In some embodiments, jitter suppression is performed according to the EPF priority based on the latency requirement using the following formula to obtain the EPF priority after jitter suppression:

[0115]

[0116] Among them, P final (D) represents the EPF priority after jitter suppression, P new (D) represents the EPF priority based on the delay requirement, λ represents the jitter suppression coefficient, Indicates the delay change rate (the first-order difference of the delay in the past 100ms window).

[0117] The value of λ (ranging from 0.5 to 1.5) changes dynamically. When the jitter exceeds a threshold (e.g., ±20ms), the λ value increases linearly, forcing smooth scheduling.

[0118] Correspondingly, after obtaining the EPF priority after jitter suppression by performing jitter suppression, step S5 of the present application performs user resource allocation according to the EPF priority after jitter suppression.

[0119] This application provides a method for scheduling delay-sensitive services. By introducing multidimensional optimization objectives and priority functions, it accurately meets the delay requirements of different services and improves the flexibility and fairness of network scheduling. In addition, by providing a configuration option for the delay factor, the algorithm can flexibly adjust between the speed, resource fairness, and delay dimensions, further improving the algorithm's applicability and flexibility.

[0120] It should be understood that, although the various steps in the flowcharts of the above embodiments are shown in sequence as indicated by the arrows, these steps are not necessarily performed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and they may be performed in other orders. Moreover, at least a portion of the steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily performed at the same time, but may be performed at different times, and their execution order is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of sub-steps or stages of other steps.

[0121] Figure 5 A schematic diagram of a delay-sensitive service scheduling device provided in an embodiment of the present application is shown in FIG. Figure 5 As shown, the present application provides a delay-sensitive service scheduling device, the device comprising:

[0122] A parameter acquisition module 11 is configured to acquire the user's network parameters and the user's corresponding delay requirement parameters;

[0123] A first determining module 12 is configured to determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters;

[0124] A second determining module 13, configured to determine a priority adjustment factor based on the delay requirement parameter;

[0125] a third determining module 14, configured to determine an EPF priority based on a latency requirement according to the baseline EPF priority and the priority adjustment factor;

[0126] The resource allocation module 15 is configured to allocate user resources according to the determined EPF priority.

[0127] In some embodiments, the apparatus further includes: a jitter suppression module configured to perform jitter suppression according to the EPF priority based on the delay requirement to obtain the EPF priority after jitter suppression.

[0128] Regarding the limitation of the delay-sensitive service scheduling device, reference may be made to the limitation of the delay-sensitive service scheduling method in the above embodiments of the present application, which will not be repeated in this embodiment.

[0129] Figure 6 Another schematic diagram of the delay-sensitive service scheduling device provided in an embodiment of the present application is as follows Figure 6 As shown, the device includes a memory 22 and a processor 21, the memory stores a computer program, and the processor is configured to run the computer program to execute the methods in the above embodiments of the present application.

[0130] The memory is connected to the processor, the memory may be a flash memory, a read-only memory or other memory, and the processor may be a central processing unit or a single-chip microcomputer.

[0131] In some embodiments, the present application provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the methods in the above embodiments of the present application are implemented.

[0132] The computer-readable storage medium includes volatile or non-volatile, removable or non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, computer program modules or other data). Computer-readable storage media include, but are not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable read only memory), flash memory or other memory technology, CD-ROM (Compact Disc Read-Only Memory), digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer.

[0133] It is understood that the above embodiments are merely exemplary embodiments for illustrating the principles of the present application, and the present application is not limited thereto. Those skilled in the art may make various modifications and improvements without departing from the spirit and substance of the present application, and such modifications and improvements are also considered to be within the scope of protection of the present application.

Claims

1. A method for scheduling delay-sensitive services, characterized in that: The method comprises: S1. Obtain the user's network parameters and the user's corresponding delay requirement parameters; S2. Determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters; S3. Determine a priority adjustment factor based on the delay requirement parameter; S4. Determine the EPF priority based on the latency requirement according to the baseline EPF priority and the priority adjustment factor; S5. Allocate user resources according to the determined EPF priority.

2. The method for scheduling delay-sensitive services according to claim 1, wherein: The user's network parameters include instantaneous rate and historical transmission rate; The baseline EPF priority is determined based on the instantaneous rate and the historical transmission rate.

3. The method for scheduling delay-sensitive services according to claim 2, wherein: Based on the network parameters, the baseline enhanced proportional fairness (EPF) priority is determined by the following formula: Among them, Priority EPF represents the baseline EPF priority, α represents the rate weight, r i (t) represents the instantaneous rate, R i (t) represents the historical transmission rate, β represents the service priority weight, and QoS i Indicates the 5G service quality identifier 5QI level mapping value, 5QI_rank indicates the 5QI level, and K indicates the amplification factor.

4. The method for scheduling delay-sensitive services according to claim 1, wherein: The delay requirement parameters corresponding to the user include delay demand and packet residence time; The priority adjustment factor is determined based on the delay requirement and the packet residence time.

5. The method for scheduling delay-sensitive services according to claim 4, wherein: Based on the delay requirement parameter, the priority adjustment factor is determined by the following formula: Where γ(D) represents the priority adjustment factor, D represents the delay requirement, T represents the packet residence time, and γ1 and γ2 represent the adjustment coefficients.

6. The method for scheduling delay-sensitive services according to claim 1, wherein: Based on the baseline EPF priority and the priority adjustment factor, the latency-based EPF priority is determined using the following formula: P new (D)=γ(D)*Priority EPF Among them, P new (D) represents the EPF priority based on the delay requirement. EPF represents the baseline EPF priority, and γ(D) represents the priority adjustment factor.

7. The method for scheduling delay-sensitive services according to any one of claims 1 to 6, wherein: After S4, it also includes: Jitter suppression is performed according to the EPF priority based on the delay requirement to obtain the EPF priority after jitter suppression.

8. The method for scheduling delay-sensitive services according to claim 7, wherein: Based on the EPF priority based on the latency requirement, jitter suppression is performed using the following formula to obtain the EPF priority after jitter suppression: Among them, P final (D) represents the EPF priority after jitter suppression, P new (D) represents the EPF priority based on the delay requirement, λ represents the jitter suppression coefficient, Indicates the delay change rate.

9. A delay-sensitive service scheduling device, characterized in that: The device comprises: A parameter acquisition module configured to acquire the user's network parameters and the user's corresponding delay requirement parameters; A first determining module configured to determine a baseline enhanced proportional fairness (EPF) priority based on the network parameters; a second determining module configured to determine a priority adjustment factor based on the delay requirement parameter; a third determining module configured to determine an EPF priority based on a latency requirement according to a baseline EPF priority and a priority adjustment factor; The resource allocation module is configured to allocate user resources according to the determined EPF priority.

10. A delay-sensitive service scheduling device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to implement the delay-sensitive service scheduling method according to any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the delay-sensitive service scheduling method according to any one of claims 1 to 8 is implemented.

Images