A quality of service scheduling method, apparatus, device, medium and product

Abstract

A quality of service scheduling method, device, equipment, medium and product are disclosed. The method comprises: according to the service type of the logical channel to which the user terminal service flow belongs, mapping the logical channel to the corresponding node in the corresponding quality of service priority matrix, and determining the time-sensitive priority update strategy of the logical channel; according to the time-sensitive priority update strategy of the logical channel and the service parameters of the service flow corresponding to the logical channel, determining the time-sensitive priority corresponding to the logical channel; according to the traffic change of the logical channel and the time-sensitive priority, updating the nodes of the corresponding quality of service priority matrix; polling each node in each quality of service priority matrix to determine and execute the corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs. The QoS scheduling of the wireless access network in the TSN and non-TSN mixed service multi-terminal scene can be realized.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a quality of service scheduling method, device, equipment, medium and product. Background Art

[0002] The integration of Time Sensitive Networking (TSN) and 5th Generation Mobile Communication Technology (5G) can meet the low latency and high reliability requirements of the Internet of Things and Industrial Internet. It helps to achieve deterministic transmission of services in industrial systems and ensure the quality of business services. It is an important technical direction for building high-quality, secure, reliable and intelligent industrial Internet networks in the future.

[0003] While the 3GPP (3rd Generation Partnership Project) has proposed a 5G and TSN converged architecture, it hasn't yet detailed how to implement resource scheduling on the radio access network side to ensure end-to-end deterministic transmission. Therefore, implementing QoS (Quality of Service) scheduling for both TSN and non-TSN services within the radio access network is a pressing technical challenge. Summary of the Invention

[0004] The present invention provides a method, apparatus, device, medium and product for quality of service scheduling, which can realize differentiated QoS scheduling of wireless access networks in complex scenarios with mixed TSN and non-TSN services and multiple device terminals, so as to ensure the end-to-end deterministic transmission of TSN service flows in the wireless access network and the end-to-end QoS requirements of non-TSN service flows.

[0005] According to one aspect of the present invention, a quality of service scheduling method is provided, the method comprising:

[0006] According to the service type of the logical channel to which the user terminal service flow belongs, the logical channel is mapped to the corresponding node in the corresponding quality of service priority matrix, and the time-sensitive priority update strategy of the logical channel is determined; wherein different service types correspond to different matrix types of quality of service priority matrices, and the service flow includes at least one of a TSN service flow and a non-TSN service flow;

[0007] Determine the time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update policy of the logical channel and the service parameters of the service flow corresponding to the logical channel;

[0008] Update the nodes of the corresponding service quality priority matrix according to the traffic changes and time-sensitive priorities of the logical channels;

[0009] Polling is performed on each node in each quality of service priority matrix to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

[0010] According to another aspect of the present invention, a quality of service scheduling device is provided, the device comprising:

[0011] A channel mapping and priority update strategy determination module is configured to map the logical channel to a corresponding node in the corresponding quality of service priority matrix based on the service type of the logical channel to which the user terminal service flow belongs, and determine a time-sensitive priority update strategy for the logical channel; wherein different service types correspond to different matrix types of quality of service priority matrices, and the service flow includes at least one of a TSN service flow and a non-TSN service flow;

[0012] A priority determination module, configured to determine a time-sensitive priority corresponding to a logical channel according to a time-sensitive priority update strategy of the logical channel and service parameters of a service flow corresponding to the logical channel;

[0013] A matrix update module is used to update nodes in the corresponding quality of service priority matrix according to the traffic changes and time-sensitive priorities of the logical channels;

[0014] The resource scheduling module is used to poll each node in each quality of service priority matrix to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

[0015] According to another aspect of the present invention, an electronic device is provided, comprising:

[0016] at least one processor; and

[0017] a memory communicatively connected to the at least one processor; wherein,

[0018] The memory stores a computer program that can be executed by the at least one processor. The computer program is executed by the at least one processor to enable the at least one processor to perform the quality of service scheduling method described in any embodiment of the present invention.

[0019] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the quality of service scheduling method described in any embodiment of the present invention when executed.

[0020] According to another aspect of the present application, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the quality of service scheduling method according to any of the embodiments of the present application.

[0021] The quality of service scheduling method provided by the embodiments of the present application determines the quality of service priority matrix and time-sensitive priority update strategy corresponding to each logical channel according to the service type of each logical channel to which the service flow belongs, thereby determining the sensitive priority of the corresponding logical channel according to the time-sensitive priority update strategy and the service parameter, updating the nodes in the corresponding quality of service priority matrix according to the service amount change of the logical channel and the time-sensitive priority, and finally polling the nodes in each quality of service priority matrix, determining the corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs to complete the corresponding resource scheduling, which can realize the differentiated QoS scheduling of the wireless access network in the complex scene of TSN and non-TSN mixed service multi-device terminals, and realize the low delay, low jitter and end-to-end deterministic transmission guarantee of TSN service in the wireless access network, and the end-to-end QoS requirement guarantee of non-TSN service.

[0022] The quality of service scheduling device, electronic equipment, computer readable storage medium and computer program product provided by the embodiments of the present application also have the above technical effects.

[0023] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present application, nor is it used to limit the scope of the present application. Other features of the present application will become apparent from the following description. BRIEF DESCRIPTION OF DRAWINGS

[0024] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can also be obtained by those skilled in the art without creative labor.

[0025] Figure 1 is an architecture diagram of a deterministic wireless access network end-to-end system according to the first embodiment of the present application;

[0026] Figure 2 is a flowchart of a quality of service scheduling method according to the first embodiment of the present application;

[0027] Figure 3 is a schematic diagram of a TSN QoS mapping strategy for a deterministic wireless access network according to the second embodiment of the present application;

[0028] Figure 4 This is a flowchart of a QoS scheduling method for a deterministic wireless access network provided in accordance with a second embodiment of the present invention;

[0029] Figure 5 is a schematic diagram of a discrete traffic bucket mechanism provided according to the second embodiment of the present invention;

[0030] Figure 6 is a schematic diagram of primary-secondary scheduling provided according to embodiment 2 of the present invention;

[0031] Figure 7 1 is a schematic structural diagram of a QoS scheduling system for deterministic wireless access networks provided according to a third embodiment of the present invention;

[0032] Figure 8 This is a structural diagram of a quality of service scheduling device provided according to a fourth embodiment of the present invention;

[0033] Figure 9 It is a structural diagram of an electronic device for implementing the quality of service scheduling method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0034] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of the present invention.

[0035] It should be noted that the terms "first", "second", etc. in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0036] Example 1

[0037] Figure 1 This is an architecture diagram of a deterministic wireless access network end-to-end system provided in the first embodiment of the present invention. Figure 1As shown, in order for the 5G system to support end-to-end deterministic transmission, the 3GPP R16 standard adds a TSN application function entity (TSN AF) in the 5GC (5G core network) control plane to realize policy, session configuration and modification between the PCF (Policy Control Function) and the SMF (Session Management Function). Two TSN translators (device-side TSN translator DS-TT and network-side TSN translator NW-TT) are added on the user terminal (User Equipment, UE) side and the network side to connect the 5G network to the TSN network and serve as a bridge in the entire TSN network, and to perform preset gating policies according to the arrival time, cycle time and service delay jitter requirements of the service flow to control the exit data queue and reduce the jitter caused by the advance arrival of time-sensitive data due to the influence of the air interface, thereby providing deterministic guarantee for service transmission.

[0038] However, although 3GPP has proposed a 5G and TSN integration architecture, it has not specified how the wireless access network side implements resource scheduling to guarantee end-to-end deterministic transmission. Currently, the wireless access network QoS has the following problems when carrying TSN services:

[0039] 1) The existing QoS service classification of the wireless access network cannot effectively adapt to the characteristics of the wired TSN service, resulting in the inability to design a reasonable QoS strategy to achieve the end-to-end deterministic requirement of the TSN service in the wireless access network;

[0040] 2) The existing QoS scheduling strategy of the wireless access network cannot meet the deterministic transmission of the wired TSN service in the wireless air interface, especially in the mixed complex scenario of non-TSN services and TSN services on multiple device terminals, it cannot simultaneously meet the end-to-end QoS requirements of TSN service deterministic transmission and non-TSN services.

[0041] To solve the above problems, Figure 2 A flowchart of a service quality scheduling method provided by Embodiment One of the present application, this embodiment can be applicable to the case of QoS scheduling of TSN services and non-TSN services in the wireless access network under the integration architecture of 5G and TSN, and the method can be executed by a service quality scheduling device, which can be realized in the form of hardware and / or software, and can be configured in an electronic device. As Figure 2 As shown, the service quality scheduling method provided by Embodiment One specifically includes the following steps:

[0042] S110. Map the logical channel to the corresponding node in the corresponding quality of service priority matrix according to the service type of the logical channel to which the user terminal service flow belongs, and determine the time-sensitive priority update strategy of the logical channel; wherein different service types correspond to service quality priority matrices of different matrix types, and the service flow includes at least one of a TSN service flow and a non-TSN service flow.

[0043] Among them, the logical channel refers to a virtual channel composed of network abstract resources in the communication system, which is used to distinguish and manage different types of service flows. It can include two categories: control channel (used to transmit control plane information) and service channel (used to transmit user plane information).

[0044] The service types of logical channels can include: TSN services, non-TSN services and signaling services. Furthermore, according to different TSN service QoS classification rules, TSN services can be further subdivided into TSN preemptive services, TSN queuing services, TSN periodic services and TSN flow services.

[0045] A Quality of Service Priority Matrix (QPM) can be understood as a matrix pre-configured according to different service types to guide the subsequent QoS scheduling of each logical channel. Different service types correspond to different matrix types of QPMs. A QPM can contain several queues, each queue containing several nodes, each node representing the logical channel to which a service flow of a certain UE belongs. Each node in a QPM of the same matrix type corresponds to the same service type, i.e., there is a one-to-one correspondence between the service type and the matrix type. It is understood that because service flows of the same service type may have different QoS requirements (e.g., latency, jitter, data volume, etc.) in different service scenarios, a QPM of the same matrix type can be configured with queues corresponding to different service scenarios or QoS requirements. For example, queue 1 corresponds to service scenario 1 (corresponding to QoS parameter 1), queue 2 corresponds to service scenario 2 (corresponding to QoS parameter 2), and so on. The specific configuration can be made according to actual service needs, and this embodiment does not specifically limit this.

[0046] The time-sensitive priority (TSP) update policy can be understood as a policy for determining the QoS scheduling priority of each logical channel. The corresponding TSP update policy can be set according to the different service types of the logical channel. Exemplarily, the TSP update policy may include but is not limited to: First In First Out (FIFO) policy, Enhanced Proportional Fair (ePF) policy, Time Sensitive Enhanced Proportional Fair (TS-ePF) policy, etc.

[0047] In an embodiment of the present invention, mapping rules between service types and QPMs of corresponding matrix types, as well as mapping rules between service types and corresponding TSP update policies can be configured in advance according to different service types of logical channels. In this way, when the scheduler performs QoS scheduling on the service flows of each UE, it can map the logical channels to the corresponding nodes in the QPMs of the corresponding matrix types according to the service types of the logical channels to which each service flow belongs. For example, the logical channels of non-TSN services can be mapped to the corresponding nodes in the corresponding non-TSN QPMs, the logical channels of TSN preemptive services can be mapped to the corresponding nodes in the corresponding TSN preemptive QPMs, and so on. At the same time, the TSP update policy corresponding to the logical channel can also be determined, so as to subsequently determine the corresponding TSP for guiding the QoS scheduling of the corresponding logical channel. In one embodiment, the method of mapping the logical channel to which the service flow belongs to the corresponding node in the corresponding QPM can be: first, according to the service type of the logical channel to which the service flow belongs, find the QPM of the corresponding matrix type, and then according to the QoS parameters of the service flow, such as delay, jitter, data volume, etc., find the queue that matches the QoS parameters in the above QPM, and map the logical channel to the tail node of the queue, which can refer to the node where the last element added to the queue (i.e., the logical channel) is located.

[0048] S120 : Determine the time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update policy of the logical channel and the service parameters of the service flow corresponding to the logical channel.

[0049] Among them, the service parameters of the service flow may refer to the relevant parameters used to determine the logical channel TSP, for example, including but not limited to: QoS parameters (priority, packet loss rate, data burst volume, latency, etc.), TSN service flow waiting time in the protocol stack, TSN service flow data backlog, historical scheduling volume, user level, TSN service flow cycle, etc. and channel conditions, etc.

[0050] In an embodiment of the present invention, various service parameters of a service flow can be obtained and then combined with the TSP update policy of the logical channel corresponding to the service flow to determine the TSP corresponding to the logical channel. In a specific embodiment, taking the ePF policy as an example, the service parameters of the service flow (non-TSN service) can be used to call a pre-configured ePF priority calculation formula to determine the TSP of the logical channel to which the service flow belongs.

[0051] S130 : updating nodes of the corresponding quality of service priority matrix according to the traffic change of the logical channel and the time-sensitive priority.

[0052] The traffic change can be used to indicate whether the traffic of the logical channel has arrived or ended. For example, if the current call service of the UE is terminated (the call is hung up), it indicates that the traffic of the corresponding logical channel has ended.

[0053] In an embodiment of the present invention, after receiving a notification of a change in the business volume of a logical channel sent by the top layer, it can be determined whether a specified change (for example, a 01 change) has occurred in the business volume of the logical channel. If so, the corresponding nodes in the QPM to which the logical channel belongs are added or removed according to the arrival or end of the business volume; if not, the corresponding nodes in the corresponding QPM are reordered according to the TSP of the logical channel to update the node position.

[0054] S140 . Poll each node in each quality of service priority matrix to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

[0055] Among them, the resource scheduling strategy can be configured accordingly according to different service types. For example, the resource scheduling strategy may include but is not limited to: signaling service selection polling (RR) strategy, non-TSN service selection ePF strategy, TSN preemptive service selection resource preemption strategy, TSN periodic service selection resource reservation strategy, TSN queuing service selection TS-ePF strategy, TSN traffic service selection TS-ePF strategy after traffic shaping, etc.

[0056] In an embodiment of the present invention, after a QPM is updated, the scheduler can poll the nodes (logical channels) in each QPM, select a corresponding resource scheduling policy based on the matrix type (i.e., service type) of the QPM to which the node belongs, and allocate and schedule resources for the corresponding node according to the resource scheduling policy. In a specific embodiment, the scheduler can select a specific resource scheduling policy for a specific type of TSN service flow according to pre-configured TSN service QoS classification rules, thereby meeting the end-to-end deterministic transmission of TSN service flows in the wireless access network and the end-to-end QoS requirements of non-TSN service flows.

[0057] An embodiment of the present invention provides a quality of service scheduling method, which determines the quality of service priority matrix and time-sensitive priority update strategy mapped to each logical channel according to the service type of the logical channel to which each service flow belongs, thereby determining the sensitive priority of the corresponding logical channel according to the time-sensitive priority update strategy and service parameters, and then updates the nodes in the corresponding quality of service priority matrix according to the service volume change and time-sensitive priority of the logical channel. Finally, by polling the nodes in each quality of service priority matrix, the corresponding resource scheduling strategy is determined according to the matrix type of the quality of service priority matrix to which the node belongs to complete the corresponding resource scheduling. This can realize differentiated QoS scheduling of wireless access networks in complex scenarios of TSN and non-TSN mixed services and multiple device terminals, and realize low latency, low jitter, end-to-end deterministic transmission guarantee of TSN services in wireless access networks, as well as end-to-end QoS requirement guarantee of non-TSN services.

[0058] Furthermore, based on the above-mentioned embodiment of the invention, in S110, according to the service type of the logical channel to which the user terminal service flow belongs, the logical channel is mapped to the corresponding node in the corresponding quality of service priority matrix, and the time-sensitive priority update strategy of the logical channel is determined, which specifically includes:

[0059] S1101. Obtain the service type and quality of service parameters of the logical channel to which each user service flow belongs;

[0060] S1102: When the service type is signaling service, map the logical channel to the corresponding tail node of the queue associated with the quality of service parameter in the first quality of service priority matrix, and determine the time-sensitive priority update policy as a first-in-first-out policy;

[0061] S1103. When the service type is a non-TSN service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in the second quality of service priority matrix, and determine the time-sensitive priority update strategy to be an enhanced proportional fairness strategy;

[0062] S1104. When the service type is a TSN preemptive service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in the third quality of service priority matrix, and determine the time-sensitive priority update policy as a first-in-first-out policy;

[0063] S1105. When the service type is a TSN queuing service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in the fourth quality of service priority matrix, and determine the time-sensitive priority update strategy to be a time-sensitive enhanced proportional fairness strategy;

[0064] S1106, when the service type is TSN periodic service, mapping the logical channel to the corresponding tail node of the queue associated with the quality of service parameter in the fifth quality of service priority matrix, and determining the time sensitive priority update strategy as the first-in-first-out strategy or the time sensitive enhanced proportional fair strategy;

[0065] S1107, when the service type is TSN flow service, mapping the logical channel to the corresponding tail node of the queue associated with the quality of service parameter in the fourth quality of service priority matrix, and determining the time sensitive priority update strategy as the time sensitive enhanced proportional fair strategy.

[0066] The first quality of service priority matrix can be a signaling QPM corresponding to the mapping of signaling service. The second quality of service priority matrix can be a non-TSN QPM corresponding to the mapping of non-TSN service. The third quality of service priority matrix can be a TSN preemption QPM corresponding to the mapping of TSN preemption service. The fourth quality of service priority matrix can be a TSN queuing QPM corresponding to the mapping of TSN queuing service or TSN flow service. The fifth quality of service priority matrix can be a TSN periodic QPM corresponding to the mapping of TSN periodic service.

[0067] The first-in-first-out (FIFO) strategy refers to a strategy that does not consider the priority of the service flow and schedules according to the order of arrival of the service flow. The enhanced proportional fair (ePF) strategy is a scheduling strategy that dynamically adjusts the scheduling priority according to the real-time rate and average rate of the user.

[0068] The time sensitive enhanced proportional fair (TS-ePF) strategy is a strategy proposed by an embodiment of the present application to allocate resources according to the end-to-end delay requirement of TSN service, and comprehensively consider elements such as TSN service backlog, historical scheduling amount, channel condition and other QoS configuration index parameters.

[0069] In an embodiment of the present invention, mapping rules between service type-QPM matrix type and service type-TSP update strategy can be pre-configured respectively, so that the scheduler can obtain the service type and QoS parameters of the logical channel to which each service flow of all UEs belongs, and then traverse each logical channel to map each logical channel to the tail node of the corresponding queue associated with the QoS parameters in the QPM of the corresponding matrix type according to the corresponding service type, and determine the TSP update strategy corresponding to each logical channel. Specifically, if the service type is signaling service, the corresponding logical channel will be mapped to the signaling QPM, and the TSP update policy will select the FIFO policy; if the service type is non-TSN service, the corresponding logical channel will be mapped to the non-TSN QPM, and the TSP update policy will select the ePF policy; if the service type is TSN preemptive service, the corresponding logical channel will be mapped to the TSN preemptive QPM, and the TSP update policy will select the FIFO policy; if the service type is TSN queuing service, the corresponding logical channel will be mapped to the TSN queuing QPM, and the TSP update policy will select the TS-ePF policy; if the service type is TSN periodic service, the corresponding logical channel will be mapped to the TSN periodic QPM, and the TSP update policy will select the FIFO policy or TS-ePF policy; if the service type is TSN traffic service, the corresponding logical channel will be mapped to the TSN queuing QPM, and the TSP update policy will select the TS-ePF policy.

[0070] Furthermore, based on the above-mentioned embodiment of the invention, determining the time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update policy of the logical channel and the service parameters of the service flow corresponding to the logical channel in S120 specifically includes:

[0071] S1201. Obtain corresponding service parameters according to the service type and service transmission type of the service flow;

[0072] S1202: Based on the time-sensitive priority update strategy of the logical channel to which the service flow belongs, determine the corresponding time-sensitive priority using service parameters.

[0073] Among them, the service transmission types may include: new transmission, retransmission and signaling. New transmission means that the data packet is transmitted from the sender to the receiver for the first time; retransmission means that during the data transmission process, when the data cannot be successfully transmitted to the receiver due to some reasons (such as data packet loss, confirmation response loss or network congestion, etc.), the sender sends the same data packet again; signaling means the control information of the transmission, such as the signal used to control the circuit switching or data exchange process in the communication network.

[0074] In the embodiment of the present application, the TSP updating includes the following process: the scheduler can obtain corresponding service parameters such as QoS parameters (priority, packet loss rate, data burst volume, delay, etc.), TSN service flow waiting time in protocol stack, data backlog of TSN service flow, historical scheduling volume, user level, cycle of TSN service flow, and channel conditions, etc., based on the service type and service transmission type of each service flow; and then determine the corresponding TSP by using the service parameters according to the TSP updating strategy determined for each logical channel.

[0075] Further, on the basis of the above-mentioned embodiment of the present application, the service quality priority matrix corresponding to the logical channel is updated according to the service volume change condition and the time-sensitive priority in S130, and specifically includes:

[0076] S1301, obtaining the service volume change condition of the logical channel, and determining whether the service volume change condition meets the preset service volume change rule;

[0077] S1302, if yes, supplementing or deleting the corresponding node in the service quality priority matrix to which the logical channel belongs according to the service change condition;

[0078] S1303, if no, updating the position of the corresponding node in the service quality priority matrix to which the logical channel belongs according to the time-sensitive priority of the logical channel.

[0079] The preset service volume change rule can be understood as a rule for judging whether the service volume of the logical channel changes as specified, and exemplary, the preset service volume change rule can include but is not limited to: service volume state change, etc.

[0080] In the embodiment of the present application, the QPM updating includes the following process: the scheduler can receive the notification containing the service volume change condition of the logical channel sent by the top layer, and then determine whether the service volume change condition meets the preset service volume change rule (for example, whether the service volume changes as 01 state), if yes, supplementing or deleting the corresponding node in the QPM to which the corresponding logical channel belongs according to the service volume change condition; if no, reordering the corresponding node in the QPM to which the corresponding logical channel belongs according to the TSP determined in the foregoing to update the node position.

[0081] Further, on the basis of the above-mentioned embodiment of the present application, each node in each service quality priority matrix is polled in S140 to determine and execute the corresponding resource scheduling strategy according to the matrix type of the service quality priority matrix to which the node belongs, and specifically includes:

[0082] S1401, polling each queue in each service quality priority matrix, and each node in each queue;

[0083] S1402: When the matrix type is the first matrix type, the resource scheduling strategy of each node is determined to be a round-robin scheduling strategy, and each node is traversed and resource allocated and scheduled in a retransmission-first-new-transmission manner;

[0084] S1403: When the matrix type is the second matrix type, the resource scheduling policy of each node is determined to be the enhanced proportional fairness policy, and each node is traversed according to the retransmission-first-new-transmission method and the time-sensitive priority, so as to output each node to the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue in sequence;

[0085] S1404: When the matrix type is the third matrix type, the resource scheduling strategy of each node is determined to be the resource preemption strategy, and resources are allocated and scheduled for each node according to the retransmission-first-new-transmission method and the round-robin scheduling strategy or the time-sensitive enhanced proportional fairness strategy;

[0086] S1405: When the matrix type is the fourth matrix type, the resource scheduling policy of each node is determined to be the time-sensitive enhanced proportional fairness policy, and each node is traversed according to the retransmission-first-new-transmission method and the time-sensitive priority, so as to output each node to the TSN main scheduling queue in sequence;

[0087] S1406: When the matrix type is the fifth matrix type, the resource scheduling strategy of each node is determined to be the resource reservation strategy, and resources are allocated and scheduled for each node according to the retransmission-first-new-transmission method and the round-robin strategy or the time-sensitive enhanced proportional fairness strategy. After the reserved resources are allocated, the nodes without resource allocation are output to the TSN main scheduling queue.

[0088] S1407 , traverse each node in the TSN main scheduling queue, the non-TSN main scheduling queue, and the non-TSN auxiliary scheduling queue in sequence, and allocate and schedule resources according to the time-sensitive priority of the nodes until the resources are exhausted or the traversal is completed.

[0089] Among them, the first matrix type to the fifth matrix type may respectively refer to the matrix types corresponding to signaling QPM, non-TSN QPM QPM, TSN preemptive QPM, TSN queuing QPM and TSN periodic QPM.

[0090] The retransmission-first-new-transmission method means that the retransmission service flow is scheduled first, and the new transmission service flow is scheduled secondly.

[0091] The round-robin scheduling strategy may refer to the RR round-robin strategy, the core idea of ​​which is to allocate resources to each node in turn according to a fixed order.

[0092] The TSN main scheduling queue is used to store priority nodes to be scheduled for TSN service flows, the non-TSN main scheduling queue is used to store priority nodes to be scheduled for non-TSN service flows, and the non-TSN auxiliary scheduling queue is used to store backup nodes to be scheduled for non-TSN service flows. Among them, the auxiliary scheduling queue is mainly used to solve the problem of surplus resources caused by node scheduling failure in the main scheduling queue, or to serve as a backup for scheduling in scenarios such as MU (Multi-User Pairing) pairing in the main scheduling queue.

[0093] The resource preemption strategy is to give priority to public resources when allocating resources, and then preempt reserved resources, dedicated resources, and non-emergency signaling resources in turn when resources are insufficient.

[0094] Resource reservation strategy refers to reserving scheduling air interface time in the time domain and the number of frequency domain resources in advance.

[0095] In an embodiment of the present invention, the scheduler can poll each QPM and each queue in the QPM, and poll all nodes in the queue to determine and execute the corresponding resource scheduling policy according to the matrix type of the QPM to which the node belongs. Specifically, the resource scheduling process is as follows:

[0096] If the current state is signaling QPM, the resource scheduling strategy selects the RR polling strategy, and traverses each queue in the signaling QPM in turn according to the retransmission-first-new-transmission method, and allocates and schedules resources for the nodes in each queue in a round-robin manner;

[0097] If the current QPM is non-TSN, the resource scheduling strategy selects the ePF strategy, and traverses each queue in the non-TSN QPM in the order of retransmission first and new transmission later. The nodes in each queue are traversed in order from low to high according to the TSP calculated by the ePF strategy, and are output to the non-TSN main scheduling queue and non-TSN auxiliary scheduling queue in turn. Resources will be allocated after TSN service scheduling is completed and there are remaining resources. It should be understood that the lower the TSP value corresponding to the node, the higher the scheduling priority corresponding to the node.

[0098] If the current QPM is a TSN preemptive QPM, the resource scheduling policy selects the resource preemptive policy and traverses each queue in the TSN preemptive QPM in sequence according to the retransmission-first-new-transmission method. For each node in the queue, resources are allocated according to the TSP calculated by polling or TS-ePF policy. Among them, resource allocation prioritizes public resources. If they are insufficient, reserved resources, dedicated resources, and non-emergency signaling resources are occupied in turn.

[0099] If the current queue is a TSN queuing QPM, the resource scheduling strategy selects the TS-ePF strategy, and traverses each queue in the TSN queuing QPM in sequence according to the retransmission-first-new-transmission method. For each node in the queue, the TSP calculated by the TS-ePF strategy is output to the TSN main scheduling queue in descending order.

[0100] If the current schedule is TSN periodic QPM, the resource reservation strategy is selected. Each queue in the TSN periodic QPM is traversed in sequence according to the retransmission-first-new-transmission method. Resources are allocated to the nodes in each queue according to the TSP calculated by polling or TS-ePF strategy. Reserved resources are given priority in resource allocation. When resources are insufficient, unallocated nodes are output to the TSN main scheduling queue in sequence.

[0101] The TSN main scheduling queue, non-TSN main scheduling queue and non-TSN auxiliary scheduling queue that have not been allocated resources are traversed in turn, and resources are allocated and scheduled to the nodes in them in order from low to high according to the corresponding time-sensitive priority until the resources are exhausted or the traversal is completed.

[0102] Furthermore, based on the above-mentioned embodiment of the invention, when the service type is TSN traffic service, it further includes:

[0103] Obtain data characteristics of business flows;

[0104] When the data characteristics meet the preset traffic shaping conditions, traffic shaping is performed on the service flow.

[0105] The data characteristics of a service flow may include, but are not limited to, data volume, sudden traffic fluctuations, etc. Preset traffic shaping conditions may refer to pre-configured conditions for determining whether traffic shaping is required for a service flow, such as whether the data volume of the service flow exceeds a preset threshold, or whether the sudden traffic fluctuation of the service flow exceeds a preset fluctuation threshold.

[0106] In an embodiment of the present invention, when the service type of the logical channel to which a service flow belongs is a TSN traffic service, pre-configured preset traffic shaping conditions can be used to detect whether the service flow has a large flow rate or a service with large sudden fluctuations in flow rate. If so, traffic shaping is performed to reduce the jitter of the TSN traffic service and solve the problem of TSN high-flow services occupying bandwidth resources for a long time, causing congestion of other service data. In one embodiment, a discrete traffic bucket mechanism can be used to implement traffic shaping.

[0107] Furthermore, based on the above-mentioned embodiments of the invention, this embodiment provides a quality of service scheduling method, further comprising:

[0108] Obtaining business monitoring characteristics of business flows;

[0109] When the service monitoring characteristics meet the preset resource pre-scheduling conditions, the corresponding resource scheduling strategy is determined and executed according to the matrix type of the service quality priority matrix to which the logical channel corresponding to the service flow belongs;

[0110] When the service monitoring characteristics meet the preset traffic shaping conditions, traffic shaping is performed on the service flow.

[0111] Among them, the service monitoring characteristics may refer to the relevant monitoring characteristics used to realize dynamic prediction of service flows, such as but not limited to: historical scheduling conditions, channel conditions, TSN service backlog data volume, TSN QoS configuration characteristics (such as configured delay, packet loss, maximum data burst volume and priority, etc.), etc.

[0112] The preset resource pre-scheduling condition may refer to a pre-configured condition for determining whether a service flow is to be pre-scheduled, for example, whether the current QoS configuration characteristics of the service flow can be met, or whether the QoS scheduling resources required by the service flow can be met, etc.

[0113] In an embodiment of the present invention, the scheduler can obtain the service monitoring characteristics of each service flow, and predict whether the service flow meets the preset resource pre-scheduling conditions or the preset traffic shaping conditions by integrating various information. If the preset resource pre-scheduling conditions are met, the corresponding resource scheduling strategy is directly determined and executed according to the matrix type of the QPM to which the logical channel corresponding to the service flow belongs, so that the service flow that meets the specific conditions is quickly scheduled through human intervention without the need for scheduling through QPM node polling, thereby improving scheduling efficiency and avoiding the waste of resources caused by traditional fixed pre-scheduling when there is no service data; if the preset traffic shaping conditions are met, the service flow is traffic shaped to achieve the maximum delay and jitter protection.

[0114] Example 2

[0115] Figure 3 A schematic diagram of a TSN QoS mapping strategy for deterministic wireless access networks provided in the second embodiment of the present invention. Figure 3 ,The configuration process of TSN QoS mapping policy includes the following steps:

[0116] Step 1: The network element TSN AF obtains TSN service characteristics to perform TSN service QoS classification and sends the corresponding TSN QoS mapping policy to the network element PCF.

[0117] Among them, TSN service QoS classification rules include but are not limited to TSN service transmission characteristics (burst, periodic, regular), TSN service data volume characteristics (small data volume, large data volume, regular data volume), TSN service delay characteristics (extremely small, small, large, regular (relative size)), TSN service jitter characteristics (extremely small, small, large), etc. As shown in Table 1, TSN service QoS can be divided into four types: preemptive service, periodic service, flow service and queuing service.

[0118]

[0119] Specifically, when scheduling TSN services, the scheduler can select the best scheduling strategy based on the four categories of TSN service QoS and the actual scheduling situation. For example, TSN service QoS can correspond to the following best scheduling strategy selections: for preemptive services with extremely high requirements for sudden delay and jitter, the resource preemption strategy is given priority; for periodic services with small periodic data volume, the resource reservation strategy is given priority; for large-volume services with large delay and jitter, traffic shaping is required and the TS-ePF strategy is given priority; for queuing services with regular data volume and delay and relatively high and low jitter, the TS-ePF strategy is given priority.

[0120] Step 2: The network element PCF receives the TSN service request and formulates a TSN QoS profile based on the corresponding TSN QoS mapping strategy to identify the corresponding latency, jitter, packet loss rate and other indicator requirements of the current TSN service. At the same time, it configures the TSN PDR (Packet Detection Rule) for mapping the TSN IP flow to the TSN QoS flow.

[0121] In an embodiment of the present invention, the TSN QoS profile may include: extended 5QI (5G QoS Identifier), allocation and retention priority, minimum data rate, average data rate, service priority, latency, jitter, packet error rate, period, maximum burst size, packet length, etc.

[0122] Step 3: The network element SMF receives the TSN session establishment request, sends the TSN QoS profile and TSN QoS rule to the base station and terminal, and configures the TSN PDR to the network element UPF.

[0123] Step 4: The base station RRC (Radio Resource Control) layer configures TSN QoS parameters for other layers of the protocol stack (SDAP (Service Data Adaptation Protocol), PDCP (Packet Data Convergence Protocol), RLC (Radio Link Control), and MAC (Medium Access Control)), and establishes mappings between TSN QoS flows and TSN DRBs (Data Radio Bearers) and between TSN DRBs and TSN LCHs (Logical Channels).

[0124] Step 5: The network element UPF receives the TSN service flow, maps the TSN IP flow to the TSN QoS flow according to the PDR, and delivers it to the base station through the N3 port until it is transmitted to the scheduler for resource scheduling;

[0125] Step 6: The SDAP layer and PDCP layer of the protocol stack configure the TSN mapping relationship according to the RRC, and map the TSN QoS flow to the corresponding TSN LCH for scheduling by the scheduler.

[0126] Specifically, SDAP classifies the received TSN QoS flows according to the TSN service QoS classification rules, and during the mapping process to DRB and LCH, passes the classified TSN service QoS category identifier to the scheduler for selecting the corresponding scheduling strategy.

[0127] Based on the above TSN QoS mapping strategy for deterministic wireless access networks, the second embodiment of the present invention proposes a QoS scheduling method for deterministic wireless access networks. Figure 4 As shown, the QoS scheduling method includes the following steps:

[0128] S1. Obtain the service type and service buffer size of the logical channel to which each service flow of all UEs belongs.

[0129] In the embodiment of the present invention, the time consumed by the TSN service data packet in the protocol stack can also be obtained, and the remaining available scheduling delay can be calculated according to the TSN delay requirement.

[0130] S2. Traverse the logical channels of all UE corresponding service flows and select the corresponding mapped QPM and TSP update strategies according to the service type of the logical channel.

[0131] In this embodiment of the present invention, step S2 includes the following specific process:

[0132] S211. Determine whether the service type is a signaling service. If it is a signaling service, execute S212; otherwise, execute S221.

[0133] S212: Map the logical channel to the signaling QPM, and select the TSP update policy as the first-in-first-out policy.

[0134] S221. Determine whether the service type is a TSN service. If it is a non-TSN service, execute S222; otherwise, execute S231.

[0135] S222: Map the logical channel to a non-TSN QPM and select the TSP update strategy as the ePF strategy. The ePF strategy can use the following formula:

[0136] P ePF =w PF Log2(P PF )+w GBR Log2(P GBR )+w NGBR Log2(P NGBR )+w AMBR Log2(P AMBR )+w 5QI Log2(P 5QI )

[0137] Among them, w PF 、w GBR 、w NGBR 、w AMBR and w 5QI These are the weights corresponding to each priority factor, and each priority factor is introduced as follows:

[0138] 1) PF (Proportional Fair) priority factor

[0139] Where TBSize is the TB block size supported by the channel conditions of the UE in the previous transmission interval (TTI); HisThrout is the UE's historical traffic smoothing value; θ is the scaling factor of the previous TTI; and last represents the historical traffic.

[0140] 2) GBR (Guaranteed Bit Rate) priority factor, Where, P GBR For GBR services, for NGBR (Non-Guaranteed BitRate) services, P PF=1; GBR is the guaranteed bit rate configured by the system; HisTh GBR is the historical throughput rate of the GBR priority factor.

[0141] 3) The NGBR priority factor and AMBR (Aggregate Maximum Bit Rate) priority factor can be designed with reference to the GBR priority factor.

[0142] 4) The 5QI priority factor is the priority calculated based on the value of the Default Priority Level in the configured QoS Profile. The 5QI priority factor can be set to absolute priority based on the actual service type, and a separate QPM queue can be designed for the logical channel to which the service flow belongs in the non-TSN QPM.

[0143] It is understandable that the specific algorithms of the first-in-first-out strategy and the ePF strategy can refer to the existing technology and will not be described in detail in this embodiment.

[0144] S231. Determine whether the service type is a TSN preemptive service. If it is a TSN preemptive service, execute S232; otherwise, execute S241.

[0145] S232: Map the logical channel to the TSN preemptive QPM, and select the TSP update policy as the first-in-first-out policy.

[0146] S241. Determine whether the service type is a TSN queuing service. If it is a TSN queuing service, execute S242; otherwise, execute S251.

[0147] S242: Map the logical channel to the TSN queue QPM and select the TSP update strategy as the TS-ePF strategy. The TS-ePF strategy can be implemented using the following formula:

[0148] P TS-ePF =w ePF Log2(P ePF )+w TS Log2(P TS )

[0149] Among them, P TS-ePF The time-sensitive priority calculated using the time-sensitive enhanced proportional fairness strategy; w ePF is the non-sensitive delay weight of TSN service; P ePF is the non-sensitive delay priority factor of TSN services; w TS is the TSN service sensitive delay weight; P TS is the TSN service-sensitive latency priority factor, expressed as follows:

[0150]

[0151] TSN service data backlog priority factor P cache It can be determined based on the TSN service cache value and cache conversion value;

[0152] TSN service average sensitive delay priority factor:

[0153]

[0154] TSN service emergency sensitive delay priority factor:

[0155]

[0156] Where w cache The backlog weight of TSN business data; The average sensitive latency weight of TSN services; is the TSN service emergency sensitive delay weight; τ pdb is the converted value of PDB (Packet Delay Budget) configured in TSN QoS Profile; τ thrd The reserved delay threshold preset for the scheduler; is the remaining delay of packet i in the scheduler; n is the number of packets cached in the TSN service channel. If it is a TSN service after traffic shaping, the value is the total number of packets in all traffic buckets distributed in the current TTI of the TSN service; m is the total number of packets in the TSN service channel cache packet n whose scheduling remaining delay is less than the reserved delay threshold.

[0157] S251. Determine whether the logical channel is a TSN traffic service. If it is a TSN traffic service, execute S3 (S31); otherwise, execute S252.

[0158] S252 : The logical channel is mapped to the TSN period QPM, and the TSP update policy is selected as the first-in-first-out policy or the TS-ePF policy.

[0159] S3. Determine whether the preset traffic shaping conditions are met. If the conditions are met, calculate the traffic shaping parameters and perform traffic shaping on the service flow.

[0160] In this embodiment of the present invention, step S3 includes the following specific process:

[0161] S31. Determine whether the data characteristics of the service flow meet the preset traffic shaping conditions.

[0162] In one embodiment, the preset traffic shaping conditions may include: whether the service flow is a TSN high-traffic service, and whether the sudden fluctuation of the TSN service flow exceeds a certain threshold.

[0163] S32, according to the TSN service delay requirement, the scheduler limit reserved delay, intercept a certain number of TSN service cache packets, calculate the required parameters of the traffic shaping module: traffic bucket type, traffic bucket size, traffic bucket position and bucket update period, etc.

[0164] S33, the traffic shaping module performs traffic shaping according to the above parameters, and executes S242 after traffic shaping.

[0165] In an embodiment, the traffic shaping module can be called to perform necessary shaping of the data packet scheduling frequency and scheduling data volume of the TSN service that meets the conditions.

[0166] Specifically, the traffic shaping module can determine whether the current service flow is a large flow TSN service according to the TSN service QoS classification rule, or whether the current service flow is a service with large flow or large flow burst fluctuation according to the dynamic prediction module. If the above preset traffic shaping conditions are met, the necessary data volume and data packet mode optimization of the TSN service flow is performed, the TSN flow service jitter is reduced, and the problem of other service data congestion caused by long-term occupation of bandwidth resources by large flow TSN service is solved.

[0167] In an embodiment, the traffic shaping can be implemented by using a discrete traffic bucket mechanism. Specifically, as shown in Figure 5 The discrete traffic bucket mechanism is to distribute all (types) of traffic buckets in S32 on the time axis according to the residual delay of each data packet and the remaining data of the existing traffic bucket covered, and to allocate the intercepted TSN service cache packets in the time axis traffic bucket in order of delay urgency, to ensure that the shaping service can meet the shaping requirements in terms of packet frequency and packet flow in time. Finally, the traffic bucket time position and traffic bucket index are mapped to the contained data packets for subsequent scheduling and packet assembly.

[0168] The discrete traffic bucket mechanism has the characteristics of multiple and configurable bucket types, discrete and flexible bucket positions, real-time bucket updates, and combination use of different types of traffic buckets, and can be effectively applied to various differentiated multi-TSN service scenarios.

[0169] S4, according to the TSP update strategy of each logical channel and the service parameters of the logical channel corresponding service flow, calculate and update the TSP corresponding to the logical channel.

[0170] In an embodiment of the present invention, a TSP update module can be called to determine the TSP corresponding to a logical channel. Specifically, the TSP update module can select corresponding TSP calculation factors (i.e., service parameters) and TSP update strategies based on service type (TSN service, non-TSN service) and service transmission type (new transmission, retransmission, signaling); wherein the TSP calculation factors may include, but are not limited to: QoS parameters (priority, packet loss rate, data burst volume, latency, etc.), TSN service flow waiting time in the protocol stack, TSN service flow data backlog, historical scheduling volume, user level, TSN service flow cycle, etc., and channel conditions, etc.

[0171] Furthermore, the TSP module may calculate and update the TSP according to the above calculation factors, and provide the updated TSP to the QPM update module for QPM update.

[0172] S5. Determine whether the logical channel traffic has changed to 01 state, and notify the QPM update module to take corresponding actions.

[0173] S6. If the QPM update module receives a notification of a traffic status change of 01, it adds or deletes the corresponding nodes in the QPM to which the corresponding logical channel belongs; otherwise, it reorders the corresponding nodes in the QPM to which the corresponding logical channel belongs according to the calculated TSP to update the node positions.

[0174] S7. If a pre-scheduling notification is received from the dynamic prediction module, the corresponding resource scheduling strategy is determined and executed based on the matrix type of the QPM to which the notified logical channel belongs. Otherwise, each QPM and each queue in the QPM are polled, and all nodes in the queue are polled to determine and execute the corresponding resource scheduling strategy based on the matrix type of the QPM to which the node belongs.

[0175] S8. Determine and execute the corresponding resource scheduling strategy according to the matrix type of the QPM to which the node belongs.

[0176] In one embodiment, the resource scheduling strategy selects and distinguishes TSN services, non-TSN services, and signaling transmission. TSN services are divided into preemptive services, periodic services, flow services, and queued services, and each service is divided into new transmission and retransmission.

[0177] In this embodiment of the present invention, step S8 includes the following specific process:

[0178] S811. Determine whether the current matrix type is signaling QPM. If it is signaling QPM, execute S812; otherwise, execute S821.

[0179] S812: Select the RR polling strategy as the resource scheduling strategy, and traverse each queue in the signaling QPM in sequence according to the retransmission first and then new transmission method, and perform resource allocation and scheduling on the nodes in each queue in a polling method.

[0180] S821: Determine whether the current matrix type is TSN QPM. If it is TSN QPM, execute S831; otherwise, execute S822.

[0181] S822. The resource scheduling strategy selects the ePF strategy, and traverses each queue in the non-TSN QPM in sequence according to the retransmission-first-new-transmission method. The nodes in each queue are traversed in order from low to high values ​​according to the TSP calculated by the ePF strategy, and are output to the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue in sequence. Resources will be allocated after the TSN service scheduling is completed and there are remaining resources.

[0182] S831. Determine whether the current matrix type is TSN preempting QPM. If it is TSN preempting QPM, execute S832; otherwise, execute S841.

[0183] S832. The resource scheduling strategy selects a resource preemption strategy, and traverses each queue in the TSN preemption QPM in turn according to the retransmission-first-new-transmission method, and allocates resources to the nodes in each queue according to the TSP calculated by polling or TS-ePF strategy; among them, resource allocation gives priority to public resources, and if they are not enough, reserved resources, dedicated resources and non-emergency signaling resources are occupied in turn.

[0184] S841. Determine whether the current matrix type is TSN periodic QPM. If it is TSN periodic QPM, execute S842; otherwise, execute S851.

[0185] S842: The resource scheduling strategy selects a resource reservation strategy, and traverses each queue in the TSN period QPM in sequence according to the retransmission-first-new-transmission method. For each node in each queue, resources are allocated according to the TSP calculated by the polling or TS-ePF strategy. Reserved resources are prioritized for resource allocation. When resources are insufficient, unallocated nodes are output to the TSN main scheduling queue in sequence.

[0186] S851. Determine whether the current matrix type is TSN queuing QPM. If it is TSN queuing QPM, execute S852; otherwise, execute S812.

[0187] S852. The resource scheduling strategy selects the TS-ePF strategy, and traverses each queue in the TSN queuing QPM in turn according to the retransmission-first-new-transmission method. The nodes in each queue are output to the TSN main scheduling queue in order from low to high according to the TSP calculated by the TS-ePF strategy.

[0188] S9. Traverse the TSN main scheduling queue, non-TSN main scheduling queue, and non-TSN auxiliary scheduling queue for unallocated resources in sequence, and allocate and schedule resources for the nodes therein in order of their time-sensitive priority from low to high until the resources are exhausted or the traversal is completed, and output them to the physical layer and scheduling feedback module.

[0189] In one embodiment, the specific process of primary and secondary scheduling is as follows: Figure 6 As shown in the figure, the TSN main scheduling queue is used to store priority nodes to be scheduled for TSN service flows, the non-TSN main scheduling queue is used to store priority nodes to be scheduled for non-TSN service flows, and the non-TSN auxiliary scheduling queue is used to store backup nodes to be scheduled for non-TSN service flows. Among them, the auxiliary scheduling queue is mainly used to solve the problem of surplus resources when node scheduling fails in the main scheduling queue, or to serve as a backup to be scheduled in scenarios such as MU pairing in the main scheduling queue.

[0190] S10. Analyze various service monitoring features of the current service flow and comprehensively predict relevant parameters of preset resource pre-scheduling conditions and preset traffic shaping conditions.

[0191] Specifically, the dynamic prediction module can combine the TSN QoS configuration characteristics (including the configured latency, packet loss, MDBV (Maximum Data Burst Volume) and priority, etc.), the actual monitoring characteristics of the TSN service, the real-time status of the channel, and the scheduler's scheduling of the service to dynamically predict the possible arrival slots, data volume, data spikes, channel conditions and corresponding optimal scheduling strategies of subsequent TSN service flows.

[0192] In one embodiment, based on the dynamic prediction information described above, if the predicted TSN service flow meets the preset resource pre-scheduling conditions, the resource scheduling module is instructed to update the scheduling policy and pre-scheduling resources, where the upper limit of the pre-scheduling size depends on the historical actual peak value and the configured peak value (MDBV). Pre-scheduling based on dynamic prediction notification can, on the one hand, reduce the latency loss from CU data to RLC and then to the scheduler notification, and on the other hand, avoid the resource waste caused by traditional fixed pre-scheduling when there is no service data.

[0193] In one embodiment, based on the above-mentioned dynamic prediction information, if the predicted TSN service flow meets the preset traffic shaping conditions, the relevant parameters of the traffic shaping module (including but not limited to TSN data cycle, data volume, residual delay, etc.) are notified and optimized in order to achieve the maximum delay and jitter protection.

[0194] In one embodiment, based on the above dynamic prediction information, the TSP update module may be instructed to update the TSP of the corresponding service flow.

[0195] S11. Determine whether the preset resource pre-scheduling conditions are met. If so, execute S7. Otherwise, execute S31 to perform traffic shaping condition determination and subsequent related steps until the scheduling is completed.

[0196] The embodiment of the present invention provides a QoS scheduling method for deterministic wireless access networks, which can implement differentiated QoS scheduling of wireless access networks in complex scenarios with mixed TSN and non-TSN services and multiple device terminals, and achieve low latency, low jitter, and end-to-end deterministic transmission guarantees for TSN services in wireless access networks, as well as end-to-end QoS requirements for non-TSN services.

[0197] Example 3

[0198] Figure 7 This is a structural diagram of a QoS scheduling system for deterministic wireless access networks provided by the third embodiment of the present invention. Figure 7 As shown, the QoS scheduling system includes: a user status module, a traffic shaping module, a TSP update module, a QPM update module, a dynamic prediction module, a resource scheduling module, a scheduling feedback module and a configuration module. The following is a detailed description of the structure of the QoS scheduling system of this embodiment.

[0199] The user status module is used to update user configuration information, CU forwarded data information and scheduled status information, and provide the updated information to the TSP update module.

[0200] The traffic shaping module is used to determine whether the business flow meets the preset traffic shaping conditions. If it meets the conditions, traffic shaping is performed and the shaping results are output to the TSP update module.

[0201] The TSP update module is responsible for calculating and updating the TSP of the logical channel to which each service flow belongs, and outputting the updated TSP to the QPM update module.

[0202] The QPM update module is responsible for QPM update maintenance (update nodes) and outputs the updated QPM to the resource scheduling module.

[0203] The dynamic prediction module is used to integrate various information to predict business characteristics in real time, and output the prediction results to the TSP update module, traffic shaping module and resource scheduling module.

[0204] The resource scheduling module is used to select the best scheduling strategy for resource allocation based on business characteristics, channel conditions, etc.

[0205] The scheduling feedback module is responsible for recording historical scheduling information and outputting the statistical and processed information to the TSP update module, dynamic prediction module, and CU.

[0206] In an embodiment, the scheduling feedback module can provide the recorded historical scheduling quantity, resource utilization, historical channel condition and TSN data backlog information to the TSP updating module periodically or in real time, and the TSP updating module updates the TSP.

[0207] In an embodiment, the scheduling feedback module can provide the recorded historical scheduling quantity, scheduling frequency, historical channel condition and TSN backlog data to the dynamic prediction module periodically or in real time, so that the dynamic prediction module updates the associated prediction items; wherein the prediction items can include the arrival time, traffic size and duration of the service flow.

[0208] In an embodiment, the scheduling feedback module can provide the TSN backlog data and possible remaining time to the CU periodically or in real time, so that the CU adjusts the data forwarding strategy and updates to the scheduler to be in an efficient and balanced state. Avoiding the problems such as system performance degradation caused by data backlog on the scheduler side due to too fast data forwarding by the CU, time delay increase caused by no data scheduling on the scheduler due to too slow data forwarding by the CU, and affecting the scheduling of other service data due to long-term bias of forwarding certain service data.

[0209] The configuration module includes a QoS configuration unit and a traffic shaping configuration unit, wherein the QoS configuration unit is responsible for receiving and updating the TSN QoS and non-TSN QoS related parameters; and the traffic shaping configuration unit updates the related parameters required for traffic shaping for the traffic shaping module according to the input information of the user state module, the dynamic prediction module and the scheduling feedback module.

[0210] The embodiment of the application provides a QoS scheduling system for a deterministic wireless access network, which can realize differentiated QoS scheduling of the wireless access network in a complex scene of mixed TSN and non-TSN service multi-device terminals through mutual cooperation between the user state module, the traffic shaping module, the TSP updating module, the QPM updating module, the dynamic prediction module, the resource scheduling module, the scheduling feedback module and the configuration module, and realizes low delay, low jitter and end-to-end deterministic transmission guarantee of TSN service in the wireless access network, and end-to-end QoS requirement guarantee of non-TSN service.

[0211] Embodiment four

[0212] Figure 8 A structural schematic diagram of a service quality scheduling device provided by the fourth embodiment of the application is shown in FIG. 4. Figure 8 As shown in the figure, the device comprises:

[0213] A channel mapping and priority update strategy determination module 21 is configured to map the logical channel to a corresponding node in the corresponding quality of service priority matrix based on the service type of the logical channel to which the user terminal service flow belongs, and determine a time-sensitive priority update strategy for the logical channel; wherein different service types correspond to different matrix types of quality of service priority matrices, and the service flow includes at least one of a TSN service flow and a non-TSN service flow;

[0214] A priority determination module 22 is configured to determine a time-sensitive priority corresponding to a logical channel according to a time-sensitive priority update strategy of the logical channel and service parameters of a service flow corresponding to the logical channel;

[0215] The matrix update module 23 is used to update the nodes of the corresponding quality of service priority matrix according to the traffic change of the logical channel and the time-sensitive priority;

[0216] The resource scheduling module 24 is configured to poll each node in each quality of service priority matrix to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

[0217] Furthermore, based on the above-mentioned embodiment of the invention, the channel mapping and priority update strategy determination module 21 includes:

[0218] A service type and service quality parameter acquisition unit, configured to acquire the service type and service quality parameters of the logical channel to which each user service flow belongs;

[0219] A first channel mapping unit is configured to map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in the first quality of service priority matrix when the service type is a signaling service, and determine a time-sensitive priority update strategy as a first-in-first-out strategy;

[0220] A second channel mapping unit is configured to, when the service type is a non-TSN service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in the second quality of service priority matrix, and determine the time-sensitive priority update strategy to be an enhanced proportional fairness strategy;

[0221] a third channel mapping unit, configured to, when the service type is a TSN preemptive service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a third quality of service priority matrix, and determine a time-sensitive priority update strategy as a first-in-first-out strategy;

[0222] a fourth channel mapping unit, configured to, when the service type is a TSN queuing service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a fourth quality of service priority matrix, and determine the time-sensitive priority update strategy to be a time-sensitive enhanced proportional fairness strategy;

[0223] a fifth channel mapping unit, configured to, when the service type is a TSN periodic service, map the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a fifth quality of service priority matrix, and determine a time-sensitive priority update policy as a first-in-first-out policy or a time-sensitive enhanced proportional fairness policy;

[0224] The sixth channel mapping unit is used to map the logical channel to the corresponding tail node of the queue associated with the service quality parameter in the fourth service quality priority matrix when the service type is TSN traffic service, and determine the time-sensitive priority update strategy as the time-sensitive enhanced proportional fairness strategy.

[0225] Furthermore, based on the above-mentioned embodiment of the invention, the priority determination module 22 includes:

[0226] A service type and service parameter acquisition unit, configured to acquire corresponding service parameters according to the service type and service transmission type of the service flow;

[0227] The priority determination unit is used to determine the corresponding time-sensitive priority based on the time-sensitive priority update strategy of the logical channel to which the service flow belongs and using the service parameters.

[0228] Furthermore, based on the above embodiment of the invention, the matrix updating module 23 includes:

[0229] A traffic change judgment unit, configured to obtain traffic change information of a logical channel and judge whether the traffic change information satisfies a preset traffic change rule;

[0230] A first node updating unit is configured to add or delete corresponding nodes in the quality of service priority matrix to which the logical channel belongs according to the service change;

[0231] The second node updating unit is configured to, if not, update the position of the corresponding node in the service quality priority matrix to which the logical channel belongs according to the time-sensitive priority of the logical channel.

[0232] Furthermore, based on the above embodiments of the invention, the resource scheduling module 24 includes:

[0233] A polling unit, configured to poll each queue in each quality of service priority matrix and each node in each queue;

[0234] A first resource scheduling unit is configured to, when the matrix type is the first matrix type, determine the resource scheduling strategy of each node as a round-robin scheduling strategy, and perform traversal, resource allocation, and scheduling on each node in a retransmission-first-new-transmission manner;

[0235] A second resource scheduling unit is configured to, when the matrix type is the second matrix type, determine the resource scheduling policy of each node as the enhanced proportional fairness policy, and traverse each node according to the retransmission-first-new-transmission method and the time-sensitive priority method, so as to output each node to the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue in sequence;

[0236] A third resource scheduling unit is configured to, when the matrix type is the third matrix type, determine the resource scheduling strategy of each node as a resource preemption strategy, and allocate and schedule resources for each node according to a retransmission-first-new-transmission method and a round-robin scheduling strategy or a time-sensitive enhanced proportional fairness strategy;

[0237] a fourth resource scheduling unit, configured to, when the matrix type is the fourth matrix type, determine the resource scheduling policy for each node as the time-sensitive enhanced proportional fairness policy, and traverse each node according to the retransmission-first-new-transmission mode and the time-sensitive priority mode, so as to output each node to the TSN main scheduling queue in sequence;

[0238] a fifth resource scheduling unit, configured to, when the matrix type is the fifth matrix type, determine the resource scheduling policy of each node as the resource reservation policy, and allocate and schedule resources for each node according to the retransmission-first-new-transmission method and the round-robin policy or the time-sensitive enhanced proportional fairness policy, and after the reserved resources are allocated, output the nodes to which no resources are allocated to the TSN main scheduling queue;

[0239] The main and auxiliary scheduling units are used to traverse each node in the TSN main scheduling queue, non-TSN main scheduling queue and non-TSN auxiliary scheduling queue in sequence, and allocate and schedule resources according to the time-sensitive priority of the nodes until the resources are exhausted or the traversal is completed.

[0240] Furthermore, based on the above-mentioned embodiment of the invention, the quality of service scheduling device further includes:

[0241] A data feature acquisition module is used to obtain data features of a service flow when the service type is a TSN traffic service;

[0242] The first traffic shaping module is used to perform traffic shaping on the service flow when the data characteristics meet the preset traffic shaping conditions.

[0243] Furthermore, based on the above-mentioned embodiment of the invention, the quality of service scheduling device further includes:

[0244] The service monitoring feature acquisition module is configured to acquire a service monitoring feature of the service flow.

[0245] The resource pre-scheduling module is configured to determine and execute a corresponding resource scheduling strategy according to a matrix type of a quality of service priority matrix to which a logical channel corresponding to the service flow belongs when the service monitoring feature meets a preset resource pre-scheduling condition.

[0246] The second traffic shaping module is configured to perform traffic shaping on the service flow when the service monitoring feature meets a preset traffic shaping condition.

[0247] The quality of service scheduling device provided by the embodiments of the present application can execute the quality of service scheduling method provided by any of the embodiments of the present application, and has the corresponding function modules and beneficial effects of the execution method.

[0248] Embodiment five

[0249] Figure 9 A structural schematic diagram of an electronic device 30 that can be used to implement embodiments of the present application is shown. The electronic device is intended to represent various forms of digital computers, such as laptops, desktops, tablets, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular telephones, smart phones, wearable devices (e.g., headsets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not intended to limit the implementations of the present application described and / or claimed in this document.

[0250] As shown in Figure 9 The electronic device 30 includes at least one processor 31, and a memory, such as a read-only memory (ROM) 32, a random access memory (RAM) 33, etc., which is communicatively connected to the at least one processor 31, wherein the memory stores a computer program that can be executed by the at least one processor. The processor 31 can execute various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 32 or the computer program loaded from the storage unit 38 into the random access memory (RAM) 33. In the RAM 33, various programs and data required for the operation of the electronic device 30 can also be stored. The processor 31, the ROM 32, and the RAM 33 are connected to each other through a bus 34. An input / output (I / O) interface 35 is also connected to the bus 34.

[0251] A plurality of components in the electronic device 30 are connected to the I / O interface 35, including: an input unit 36, such as a keyboard, a mouse, etc.; an output unit 37, such as various types of displays, speakers, etc.; a storage unit 38, such as a magnetic disk, an optical disk, etc.; and a communication unit 39, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 39 allows the electronic device 30 to exchange information / data with other devices through a computer network, such as the Internet, and / or various telecommunication networks.

[0252] The processor 31 can be various general and / or special purpose processing components with processing and computing capabilities. Some examples of the processor 31 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 31 performs various methods and processes described above, such as the quality of service scheduling method.

[0253] In some embodiments, the quality of service scheduling method can be implemented as a computer program tangibly embodied in a computer readable storage medium, such as the storage unit 38. In some embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 30 via the ROM 32 and / or the communication unit 39. When the computer program is loaded onto the RAM 33 and executed by the processor 31, one or more steps of the quality of service scheduling method described above can be performed. Alternatively, in other embodiments, the processor 31 can be configured to perform the quality of service scheduling method by any other appropriate means, such as by means of firmware.

[0254] The various implementations of the systems and techniques described above can be realized in digital electronic circuitry, integrated circuitry, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on a chip (SOC), a programmable logic device (PLD), a computer hardware, firmware, software, and / or combinations thereof. These various implementations can include implementation in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

[0255] In some embodiments, the quality of service scheduling method can be implemented as a computer program, which is invisibly included in a computer program product. The computer program implements the quality of service scheduling method of the present invention when executed by a processor. The computer program product can be understood as a software product that mainly implements its solution through a computer program. The computer program for implementing the method of the present invention can be written in any combination of one or more programming languages. These computer programs can be provided to a processor of a general-purpose computer, a special-purpose computer or other programmable data processing device so that the functions / operations specified in the flowchart and / or block diagram are implemented when the computer program is executed by the processor. The computer program can be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0256] In the context of the present invention, computer-readable storage media can be tangible media that can contain or store a computer program for use with an instruction execution system, device or equipment or used in combination with an instruction execution system, device or equipment. Computer-readable storage media can include but are not limited to electronic, magnetic, optical, electromagnetic, infrared or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, computer-readable storage media can be machine-readable signal media. More specific examples of machine-readable storage media can include electrical connections based on one or more lines, portable computer disks, hard disks, random access memories (RAM), read-only memories (ROM), erasable programmable read-only memories (EPROM or flash memory), optical fibers, portable compact disk read-only memories (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0257] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, the 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 acoustic input, voice input, or tactile input).

[0258] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0259] A computing system may include clients and servers. The clients and servers are typically remote from each other and typically interact via a communication network. This client-server relationship arises through computer programs running on the respective computers, creating a client-server relationship. The server may be a cloud server, also known as a cloud computing server or cloud host. This server is a hosting product within the cloud computing service ecosystem that addresses the management difficulties and limited scalability of traditional physical hosting and VPS services.

[0260] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in the present invention can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of the present invention can be achieved. This is not limited herein.

[0261] The above specific embodiments do not limit the scope of protection of the present invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention are intended to be included within the scope of protection of the present invention.

Claims

1. A quality of service scheduling method, characterized in that: The method comprises: Mapping the logical channel to a corresponding node in a corresponding quality of service priority matrix according to a service type of the logical channel to which the user terminal service flow belongs, and determining a time-sensitive priority update strategy for the logical channel; wherein different service types correspond to different matrix types of quality of service priority matrices, and the service flow includes at least one of a TSN service flow and a non-TSN service flow; Determining a time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update policy of the logical channel and a service parameter of the service flow corresponding to the logical channel; Performing node updates on the corresponding quality of service priority matrix according to the traffic change of the logical channel and the time-sensitive priority; Polling is performed on each of the nodes in each of the quality of service priority matrices to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

2. The method according to claim 1, characterized in that The step of mapping the logical channel to a corresponding node in a corresponding quality of service priority matrix according to a service type of the logical channel to which the user terminal service flow belongs, and determining a time-sensitive priority update strategy for the logical channel includes: Obtaining the service type and quality of service parameters of the logical channel to which each user service flow belongs; When the service type is a signaling service, mapping the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a first quality of service priority matrix, and determining the time-sensitive priority update strategy to be a first-in-first-out strategy; When the service type is a non-TSN service, mapping the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a second quality of service priority matrix, and determining the time-sensitive priority update strategy to be an enhanced proportional fairness strategy; When the service type is a TSN preemptive service, mapping the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a third quality of service priority matrix, and determining the time-sensitive priority update strategy to be a first-in-first-out strategy; When the service type is a TSN queued service, mapping the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a fourth quality of service priority matrix, and determining the time-sensitive priority update strategy to be a time-sensitive enhanced proportional fairness strategy; When the service type is a TSN periodic service, mapping the logical channel to a corresponding tail node of a queue associated with the quality of service parameter in a fifth quality of service priority matrix, and determining the time-sensitive priority update policy to be a first-in-first-out policy or a time-sensitive enhanced proportional fairness policy; When the service type is TSN traffic service, the logical channel is mapped to the corresponding tail node of the queue associated with the service quality parameter in the fourth service quality priority matrix, and the time-sensitive priority update strategy is determined to be a time-sensitive enhanced proportional fairness strategy.

3. The method according to claim 1, characterized in that The determining, according to the time-sensitive priority update policy of the logical channel and the service parameter of the service flow corresponding to the logical channel, the time-sensitive priority corresponding to the logical channel includes: Acquire the corresponding service parameters according to the service type and service transmission type of the service flow; Based on the time-sensitive priority update policy of the logical channel to which the service flow belongs, the corresponding time-sensitive priority is determined using the service parameters.

4. The method according to claim 1, wherein The updating of nodes of the corresponding quality of service priority matrix according to the traffic change of the logical channel and the time-sensitive priority includes: Obtaining a traffic volume change condition of the logical channel, and determining whether the traffic volume change condition satisfies a preset traffic volume change rule; If so, adding or deleting the corresponding node in the quality of service priority matrix to which the logical channel belongs according to the service change; If not, the position of the corresponding node in the quality of service priority matrix to which the logical channel belongs is updated according to the time-sensitive priority of the logical channel.

5. The method according to claim 1, wherein Polling each of the nodes in each of the quality of service priority matrices to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs includes: Polling each queue in each of the quality of service priority matrices and each of the nodes in each of the queues; When the matrix type is the first matrix type, the resource scheduling strategy of each node is determined to be a round-robin scheduling strategy, and each node is traversed and resource allocated and scheduled in a retransmission-first-new-transmission manner; When the matrix type is the second matrix type, the resource scheduling policy of each node is determined to be an enhanced proportional fairness policy, and each node is traversed according to the retransmission-first-new-transmission method and the time-sensitive priority, so as to output each node to a non-TSN main scheduling queue and a non-TSN auxiliary scheduling queue in sequence; When the matrix type is the third matrix type, the resource scheduling strategy of each node is determined to be a resource preemption strategy, and resources are allocated and scheduled for each node according to a retransmission-first-new-transmission method and a round-robin scheduling strategy or a time-sensitive enhanced proportional fairness strategy; When the matrix type is the fourth matrix type, the resource scheduling strategy of each node is determined to be a time-sensitive enhanced proportional fairness strategy, and each node is traversed according to the retransmission-first-new-transmission mode and the time-sensitive priority, so as to output each node to the TSN main scheduling queue in sequence; When the matrix type is the fifth matrix type, the resource scheduling strategy of each node is determined to be a resource reservation strategy, and resources are allocated and scheduled for each node according to a retransmission-first-new-transmission method and a round-robin strategy or a time-sensitive enhanced proportional fairness strategy, and after the reserved resources are allocated, the nodes to which no resources are allocated are output to the TSN main scheduling queue; Each node in the TSN main scheduling queue, the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue is traversed in sequence, and resources are allocated and scheduled according to the time-sensitive priority of the node until resources are exhausted or the traversal is completed.

6. The method according to claim 1, characterized in that When the service type is TSN traffic service, it also includes: Acquiring data characteristics of the business flow; When the data characteristics meet the preset traffic shaping conditions, traffic shaping is performed on the service flow.

7. The method according to claim 1, characterized in that Also includes: Obtaining a service monitoring feature of the service flow; When the service monitoring feature meets the preset resource pre-scheduling condition, determining and executing the corresponding resource scheduling strategy according to the matrix type of the service quality priority matrix to which the logical channel corresponding to the service flow belongs; When the service monitoring feature meets a preset traffic shaping condition, traffic shaping is performed on the service flow.

8. The method according to claim 2 or 5, characterized in that The time-sensitive enhanced proportional fairness strategy adopts the following formula: P TS-ePF =w ePF ·Log2(P ePF )+w TS ·Log2(P TS ); Among them, P TS-ePF The time-sensitive priority calculated using the time-sensitive enhanced proportional fairness strategy; w ePF is the non-sensitive delay weight of TSN service; P ePF is the non-sensitive delay priority factor of TSN services; w TS P is the TSN service sensitive delay weight; TS It is the TSN service sensitive delay priority factor.

9. A method and apparatus for quality of service scheduling, characterized in that: The device comprises: A channel mapping and priority update strategy determination module is configured to map the logical channel to a corresponding node in the corresponding quality of service priority matrix based on the service type of the logical channel to which the user terminal service flow belongs, and determine a time-sensitive priority update strategy for the logical channel; wherein different service types correspond to different matrix types of the quality of service priority matrix, and the service flow includes at least one of a TSN service flow and a non-TSN service flow; a priority determination module, configured to determine the time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update policy of the logical channel and the service parameters of the service flow corresponding to the logical channel; A matrix updating module, configured to update nodes of the corresponding quality of service priority matrix according to the traffic change of the logical channel and the time-sensitive priority; The resource scheduling module is used to poll each of the nodes in each of the quality of service priority matrices to determine and execute a corresponding resource scheduling strategy according to the matrix type of the quality of service priority matrix to which the node belongs.

10. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor. The computer program is executed by the at least one processor to enable the at least one processor to perform the quality of 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 computer instructions, and the computer instructions are used to enable a processor to implement the quality of service scheduling method according to any one of claims 1 to 8 when executed.

12. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the computer program implements the quality of service scheduling method according to any one of claims 1 to 8.

Images