Quality of service scheduling method, device, equipment, medium and product

Abstract

The invention discloses a service quality scheduling method, device and equipment, a medium and a product. The method comprises the following steps: mapping a logic channel to a corresponding node in a corresponding service quality priority matrix according to a service type of the logic channel to which a service flow of a user terminal belongs, and determining a time-sensitive priority updating strategy of the logic channel; determining a time-sensitive priority corresponding to the logic channel according to a time-sensitive priority updating strategy of the logic channel and a service parameter of a service flow corresponding to the logic channel; performing node updating on the corresponding service quality priority matrix according to the service volume change condition of the logic channel and the time-sensitive priority; and polling each node in each service quality priority matrix so as to determine and execute a corresponding resource scheduling strategy according to the matrix type of the service quality priority matrix to which the node belongs. The QoS scheduling of the wireless access network under 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 service quality scheduling method, device, equipment, medium and product. Background Art

[0002] The integration of Time Sensitive Networking (TSN) and the fifth generation mobile communication technology (5G) can meet the requirements of the Internet of Things and the Industrial Internet for low latency and high reliability, help 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] However, although 3GPP (3rd Generation Partnership Project) has proposed an architecture for the integration of 5G and TSN, it has not made detailed provisions on how to implement resource scheduling on the wireless access network side to ensure end-to-end deterministic transmission. Therefore, how to implement QoS (Quality of Service) scheduling for TSN services and non-TSN services in the wireless access network is a technical problem that needs to be solved urgently. Summary of the invention

[0004] The present invention provides a service quality scheduling method, device, equipment, medium and product, which can realize differentiated QoS scheduling of wireless access networks in complex scenarios of TSN and non-TSN mixed 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 service quality priority matrix, and the time-sensitive priority update strategy of the logical channel is determined; 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;

[0007] Determine the time-sensitive priority corresponding to 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;

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

[0009] Each node in each quality of service priority matrix is ​​polled 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 service quality scheduling device is provided, the device comprising:

[0011] A channel mapping and priority update strategy determination module is used to map the logical channel to the corresponding node in the corresponding service quality 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;

[0012] A priority determination module, used to determine the time-sensitive priority corresponding to 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;

[0013] A matrix update module, used to update nodes of the corresponding service quality priority matrix according to the traffic change of the logical channel and the time-sensitive priority;

[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, the electronic device 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 executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute 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 invention, a computer program product is provided. The computer program product includes a computer program. When the computer program is executed by a processor, the quality of service scheduling method described in any embodiment of the present invention is implemented.

[0021] A service quality scheduling method provided by an embodiment of the present invention determines the service quality 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 service quality priority matrix according to the service volume change and time-sensitive priority of the logical channel. Finally, by polling the nodes in each service quality priority matrix, the corresponding resource scheduling strategy is determined according to the matrix type of the service quality priority matrix to which the node belongs to complete the corresponding resource scheduling. Differentiated QoS scheduling of wireless access networks in complex scenarios of TSN and non-TSN mixed services and multiple device terminals can be realized, and 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 can be realized.

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

[0023] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0025] Figure 1 is an architecture diagram of a deterministic wireless access network end-to-end system provided according to Embodiment 1 of the present invention;

[0026] Figure 2 is a flow chart of a service quality scheduling method provided according to Embodiment 1 of the present invention;

[0027] Figure 3 is a schematic diagram of a TSN QoS mapping strategy for a deterministic wireless access network provided according to Embodiment 2 of the present invention;

[0028] Figure 4 is a flow chart of a QoS scheduling method for a deterministic wireless access network provided according to Embodiment 2 of the present invention;

[0029] Figure 5 is a schematic diagram of a discrete flow bucket mechanism provided according to Embodiment 2 of the present invention;

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

[0031] Figure 7 It is a structural diagram of a QoS scheduling system for a deterministic wireless access network provided according to Embodiment 3 of the present invention;

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

[0033] Fig. 9 It is a structural diagram of an electronic device for implementing the service quality 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 scheme of the present invention, the technical scheme 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 described embodiments 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 creative work should fall within the scope of protection of the present invention.

[0035] It should be noted that the terms "first", "second", etc. in the specification 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 data 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 that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0036] Embodiment 1

[0037] Figure 1 This is an architecture diagram of a deterministic wireless access network end-to-end system provided in Embodiment 1 of the present invention. Figure 1As shown in the figure, 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 implement policy, session configuration and modification between PCF (Policy Control Function) and SMF (Session Management Function). Two TSN converters (TSN converter DS-TT on the equipment side and NW-TT on the network side) are added on the 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. The gating strategy is preset according to the arrival time, cycle time and service delay jitter requirements of the service flow, and the export data queue is controlled to reduce the jitter caused by the early arrival of time-sensitive data due to the influence of the air interface, providing deterministic guarantee for service transmission.

[0038] However, although 3GPP has proposed an architecture for the integration of 5G and TSN, it has not made detailed provisions on how to implement resource scheduling on the wireless access network side to ensure end-to-end deterministic transmission. At present, the QoS of the wireless access network has the following problems when carrying TSN services:

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

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

[0041] In order to solve the above problems, Figure 2 This is a flow chart of a service quality scheduling method provided in the first embodiment of the present invention. This embodiment can be applied to the situation where QoS scheduling is performed on TSN services and non-TSN services in a wireless access network under the fusion architecture of 5G and TSN. The method can be executed by a service quality scheduling device, which can be implemented in the form of hardware and / or software, and the service quality scheduling device can be configured in an electronic device. Figure 2 As shown, a service quality scheduling method provided in this embodiment 1 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 quality of service 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, which can include control channels (used to transmit control plane information) and service channels (used to transmit user plane information).

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

[0045] The quality of service priority matrix (QoS Priority Matrix, QPM) can be understood as a matrix configured in advance according to different service types for guiding the QoS scheduling of subsequent logical channels. Different service types correspond to QPMs of different matrix types. QPM can contain several queues, each queue contains several nodes, each node represents the logical channel to which a service flow of a certain UE belongs, and each node in the QPM of the same matrix type corresponds to the same service type, that is, the service type corresponds to the matrix type one by one. It can be understood that since the service flow of the same service type may have differentiated QoS requirements (such as delay, jitter, data volume, etc.) in different service scenarios, for the QPM of the same matrix type, queues corresponding to different service scenarios or QoS requirements can be configured respectively. 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), etc., which can be configured accordingly according to actual service needs, and this embodiment does not specifically limit this.

[0046] The time-sensitive priority (TSP) update strategy can be understood as a strategy for determining the QoS scheduling priority of each logical channel. The corresponding TSP update strategy can be set according to the different service types of the logical channel. Exemplarily, the TSP update strategy may include but is not limited to: First In First Out (FIFO) strategy, Enhanced Proportional Fair (ePF) strategy, Time Sensitive Enhanced Proportional Fair (TS-ePF) strategy, 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 strategies 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 QPM of the corresponding matrix type according to the service types of the logical channels to which the service flows belong, for example, mapping the logical channels of non-TSN services to the corresponding nodes in the non-TSN QPMs, mapping the logical channels of TSN preempted services to the corresponding nodes in the TSN preempted QPMs, and so on. At the same time, the TSP update strategy 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 latency, 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 strategy 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, 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 strategy of the logical channel corresponding to the service flow, the TSP corresponding to the logical channel can be determined. In a specific embodiment, taking the ePF strategy as an example, the TSP of the logical channel to which the service flow belongs can be determined by calling a pre-configured ePF priority calculation formula based on the service parameters of the service flow (non-TSN service).

[0051] S130: Update nodes of the corresponding service quality 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 traffic 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 traffic volume of the logical channel. If so, the corresponding nodes in the QPM to which the logical channel belongs are supplemented or removed according to the arrival or end of the traffic volume; if not, the corresponding nodes in the corresponding QPM are reordered according to the TSP of the logical channel to update the node positions.

[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 preemptive 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 the QPM is updated, the scheduler can poll the nodes (logical channels) in each QPM, select the corresponding resource scheduling strategy according to 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 strategy. In a specific embodiment, the scheduler can select a specific resource scheduling strategy for a specific type of TSN service flow according to the pre-configured TSN service QoS classification rules, which can meet 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] A service quality scheduling method provided by an embodiment of the present invention determines the service quality 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 service quality priority matrix according to the service volume change and time-sensitive priority of the logical channel. Finally, by polling the nodes in each service quality priority matrix, the corresponding resource scheduling strategy is determined according to the matrix type of the service quality priority matrix to which the node belongs to complete the corresponding resource scheduling. Differentiated QoS scheduling of wireless access networks in complex scenarios of TSN and non-TSN mixed services and multiple device terminals can be realized, and 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 can be realized.

[0058] Further, 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 service quality priority matrix, and the time-sensitive priority update strategy of the logical channel is determined, which specifically includes:

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

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

[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 a quality of service parameter in a second quality of service priority matrix, and determine the time-sensitive priority update strategy as an enhanced proportional fairness strategy;

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

[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 a quality of service parameter in a fourth quality of service priority matrix, and determine the time-sensitive priority update strategy as a time-sensitive enhanced proportional fairness strategy;

[0064] S1106. When the service type is a TSN periodic service, map 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 determine the time-sensitive priority update strategy as a first-in-first-out strategy or a time-sensitive enhanced proportional fairness strategy;

[0065] S1107. When the service type is TSN traffic service, 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, and determine the time-sensitive priority update strategy as the time-sensitive enhanced proportional fairness strategy.

[0066] Among them, the first service quality priority matrix may refer to the signaling QPM mapped corresponding to the signaling service. The second service quality priority matrix may refer to the non-TSN QPM QPM mapped corresponding to the non-TSN service. The third service quality priority matrix may refer to the TSN preemption QPM mapped corresponding to the TSN preemption service. The fourth service quality priority matrix may refer to the TSN queuing QPM mapped corresponding to the TSN queuing service or TSN traffic service. The fifth service quality priority matrix may refer to the TSN periodic QPM mapped corresponding to the TSN periodic service.

[0067] The first-in-first-out (FIFO) policy is a policy that schedules services in the order they arrive, regardless of their priorities. The enhanced proportional fairness (ePF) policy is a scheduling policy that dynamically adjusts scheduling priorities based on the user's real-time rate and average rate.

[0068] The time-sensitive enhanced proportional fairness (TS-ePF) strategy is a strategy proposed in an embodiment of the present invention for allocating resources based on the end-to-end delay requirements of TSN services, taking into account factors such as TSN service backlog, historical scheduling volume, channel conditions, and other QoS configuration indicator 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, after obtaining the service type and QoS parameters of the logical channel to which each service flow of all UEs belongs, 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 the 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] Further, based on the above-mentioned embodiment of the invention, S120 determines the time-sensitive priority corresponding to 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, specifically including:

[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 reason (such as data packet loss, confirmation response loss or network congestion, etc.), the sender sends the same data packet again; signaling means transmission control information, such as signals used to control circuit switching or data exchange processes in communication networks.

[0074] In an embodiment of the present invention, TSP update includes the following process: the scheduler can obtain corresponding service parameters based on the service type and service transmission type of each service flow, such as QoS parameters (priority, packet loss rate, data burst, 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, channel conditions, etc.; and then determine the corresponding TSP based on the TSP update strategy determined for each logical channel as mentioned above and using its service parameters.

[0075] Further, based on the above-mentioned embodiment of the invention, in S130, the corresponding service quality priority matrix is ​​updated according to the traffic change of the logical channel and the time-sensitive priority, which specifically includes:

[0076] S1301, obtaining the traffic change of the logical channel, and determining whether the traffic change satisfies the preset traffic change rule;

[0077] S1302: If yes, add or delete the corresponding node in the service quality priority matrix to which the logical channel belongs according to the service change situation;

[0078] S1303: 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.

[0079] The preset traffic volume change rule may be understood as a pre-configured rule for determining whether the traffic volume of a logical channel undergoes a specified change. Exemplarily, the preset traffic volume change rule may include but is not limited to: traffic volume changes to 01 state, etc.

[0080] In an embodiment of the present invention, QPM update includes the following process: the scheduler can receive a notification of the traffic volume change status of the logical channel sent by the top layer, and then determine whether the traffic volume change status meets the preset traffic volume change rules (for example, whether the traffic volume is a 01 state change). If so, the corresponding nodes in the QPM to which the corresponding logical channel belongs are supplemented or deleted according to the traffic volume change status; if not, the corresponding nodes in the QPM to which the corresponding logical channel belongs are reordered according to the TSP determined above to update the node position.

[0081] Further, based on the above-mentioned embodiment of the invention, each node in each quality of service priority matrix is ​​polled in S140 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, specifically including:

[0082] S1401, polling each queue in each quality of service 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 polling 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 strategy of each node is determined to be an enhanced proportional fairness strategy, and each node is traversed according to the retransmission first and then new transmission mode 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 a resource preemption strategy, and resources are allocated and scheduled for each node according to a retransmission-first-new-transmission mode and a round-robin scheduling strategy or a time-sensitive enhanced proportional fairness strategy;

[0086] S1405. 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 and new transmission later mode 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 as the resource reservation strategy, and resources are allocated and scheduled for each node according to the retransmission before new transmission mode and the polling strategy or the time-sensitive enhanced proportional fairness strategy, and 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 the signaling QPM, the non-TSN QPM QPM, the TSN preemption QPM, the TSN queuing QPM and the 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 polling scheduling strategy may refer to the RR polling (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 the priority nodes to be scheduled for TSN business flows, the non-TSN main scheduling queue is used to store the priority nodes to be scheduled for non-TSN business flows, and the non-TSN auxiliary scheduling queue is used to store the backup nodes to be scheduled for non-TSN business 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 be used as a backup to be scheduled in scenarios such as MU (Multi-User Pairing) pairing in the main scheduling queue.

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

[0094] The resource reservation strategy refers to reserving the 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 may poll each QPM and each queue in the QPM, and poll all nodes in the queue, to determine and execute the corresponding resource scheduling strategy 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 one is signaling QPM, the resource scheduling strategy selects the RR polling strategy, and traverses each queue in the signaling QPM in turn in the way of retransmission first and then new transmission, and performs resource allocation and scheduling for the nodes in each queue in a polling 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 retransmission-first-new-transmission mode. 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 turn. Resources will be allocated after the 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 TSN preempted, the resource scheduling strategy selects the resource preemption strategy, and traverses each queue in the TSN preempted QPM in turn according to the retransmission first and then the 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;

[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 turn according to the retransmission first and then the new transmission method. For the nodes in each queue, the TSP calculated by the TS-ePF strategy is output to the TSN main scheduling queue in order from low to high;

[0100] If the current time is TSN periodic QPM, the resource scheduling strategy selects the resource reservation strategy, and traverses each queue in the TSN periodic QPM in turn according to the retransmission first and then the 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 reserved resources, and when resources are insufficient, the unallocated nodes are output to the TSN main scheduling queue in turn;

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

[0102] Further, based on the above-mentioned embodiment of the invention, when the service type is TSN traffic service, it also 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 the service flow may include but are not limited to: data volume, traffic burst fluctuation, etc. The preset traffic shaping condition may refer to a pre-configured condition for determining whether the service flow needs to be traffic shaped, such as whether the data volume of the service flow is greater than a preset threshold, whether the traffic burst fluctuation size of the service flow is greater than a preset fluctuation threshold, etc.

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

[0107] Further, based on the above-mentioned embodiment of the invention, a quality of service scheduling method provided in this embodiment further includes:

[0108] Obtaining business monitoring characteristics of business flows;

[0109] When the service monitoring characteristics meet the preset resource pre-scheduling conditions, determine and execute 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;

[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 the 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 guarantee.

[0114] Embodiment 2

[0115] Figure 3 A schematic diagram of a TSN QoS mapping strategy for a deterministic wireless access network provided in the second embodiment of the present invention. Figure 3 ,The configuration process of TSN QoS mapping strategy 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, traffic 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 optimal 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 according to 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, the TSN PDR (Packet Detection Rule) is configured 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 reservation priority, minimum data rate, average rate, service priority, latency, jitter, packet error rate, cycle, 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), MAC (Medium Access Control)), and establishes the mapping relationship between TSN QoS flow and TSN DRB (Data Radio Bearer) and between TSN DRB and TSN LCH (Logical Channel).

[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 flow according to the TSN service QoS classification rules, and in the process of mapping 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 the 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 may adopt 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 They 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 (Transport Block) size that can be supported by the channel condition of the UE in the previous time transmission interval TTI; HisThrout is the UE historical traffic smoothing value; θ is the proportional coefficient of the previous TTI; last represents the historical traffic.

[0140] 2) GBR (Guaranteed Bit Rate) priority factor, Where P GBR For GBR services, for NGBR (Non-Guaranteed Bit Rate) services, PPF =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 the 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 can be understood that the specific algorithms of the first-in-first-out strategy and the ePF strategy can refer to the existing technology, and this embodiment will not be repeated here.

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

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

[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 adopt 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 by using the time-sensitive enhanced proportional fairness strategy; w ePF is the non-sensitive delay weight of TSN service; ePF is the non-sensitive delay priority factor of TSN services; w TS P is the TSN service sensitive delay weight; TS is the TSN service sensitive delay 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 mean sensitive delay priority factor:

[0153]

[0154] TSN service emergency sensitive delay priority factor:

[0155]

[0156] In the formula, w cache Backlog weight for TSN business data; is the TSN service mean sensitive delay weight; is the emergency sensitive delay weight of TSN service; τ pdb is the PDB (Packet Delay Budget) converted value configured in the TSN QoS Profile; τ thrd The reserved delay threshold preset for the scheduler; is the remaining delay of data packet i in the scheduler; n is the number of data packets cached in the TSN service channel. If it is a TSN service after traffic shaping, the value is the total number of data packets in all traffic buckets distributed in the current TTI of the TSN service; m is the total number of data packets in the TSN service channel cache data 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 strategy is selected as the first-in-first-out strategy or the TS-ePF strategy.

[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 the 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 requirements and the scheduler's maximum reserved delay, a certain number of TSN service cache packets are intercepted to calculate the parameters required by the traffic shaping module: traffic bucket type, traffic bucket size, traffic bucket location, and bucket update cycle, etc.

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

[0165] In one embodiment, the traffic shaping module may be called to perform necessary shaping of the packet scheduling frequency and the scheduling data volume for the TSN services that meet the conditions.

[0166] Specifically, the traffic shaping module can determine whether the current service flow is a high-traffic TSN service according to the TSN service QoS classification rules, or monitor whether the current service flow is a service with large traffic or large sudden traffic fluctuations according to the dynamic prediction module. If the above preset traffic shaping conditions are met, the necessary data volume and data packetization mode of the TSN service flow will be optimized to reduce the jitter of TSN traffic services, and solve the problem of TSN high-traffic services occupying bandwidth resources for a long time, causing other business data to be blocked.

[0167] In one embodiment, traffic shaping can be implemented using a discrete traffic bucket mechanism. Specifically, Figure 5 As shown in the figure, the discrete traffic bucket mechanism is to discretely distribute all (types of) traffic buckets in S32 on the time axis according to the remaining delay of all data packets and the legacy data of the existing traffic buckets covered, and to distribute the intercepted TSN service cache packets to the time axis traffic buckets in sequence according to the delay urgency, so as to ensure that the rectified service can meet the shaping requirements in terms of both packet sending frequency and packet sending 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 grouping.

[0168] The discrete traffic bucket mechanism has the characteristics of diverse and configurable bucket types, discrete and flexible bucket locations, real-time bucket updates, and different types of traffic buckets that can be used in combination. It can be effectively applied to various differentiated multi-TSN business scenarios.

[0169] S4. Calculate and update the TSP corresponding to the logical channel according to the TSP update strategy of each logical channel and the service parameters of the service flow 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 according to service types (TSN services, non-TSN services) and service transmission types (new transmission, retransmission, signaling); wherein the TSP calculation factors may include, but are not limited to: QoS parameters (priority, packet loss rate, data burst, 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 according to 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 according to 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. Among them, TSN services are distinguished into preemptive services, periodic services, flow services, and queuing services, and each service is distinguished into new transmission and retransmission.

[0177] In the 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: The resource scheduling strategy selects the RR polling strategy, and traverses each queue in the signaling QPM in turn in a retransmission-first-newtransmission manner, and performs resource allocation and scheduling in a polling manner for the nodes in each queue.

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

[0181] S822. Select the ePF strategy as the resource scheduling strategy, and traverse each queue in the non-TSN QPM in turn according to the retransmission-first-new-transmission method. Traverse the nodes in each queue in order from low to high values ​​according to the TSP calculated by the ePF strategy, and output them to the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue in turn. 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 which, 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 the resource reservation strategy, and traverses each queue in the TSN periodic QPM in turn in the manner of retransmission first and new transmission later, and allocates resources to the nodes in each queue in accordance with the TSP calculated by polling or TS-ePF strategy; wherein, the resource allocation gives priority to the reserved resources, and when the resources are insufficient, the unallocated nodes are output to the TSN main scheduling queue in turn;

[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 and then the 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. 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 sequence, and resources are allocated and scheduled for the nodes therein in order from low to high according to the time-sensitive priority of the nodes until the resources are exhausted or the traversal is completed, and the resources are output 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, the TSN main scheduling queue is used to store the priority nodes to be scheduled for TSN service flows, the non-TSN main scheduling queue is used to store the priority nodes to be scheduled for non-TSN service flows, and the non-TSN auxiliary scheduling queue is used to store the 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 be used as a backup to be scheduled in scenarios such as MU pairing in the main scheduling queue.

[0190] S10. Analyze various service monitoring characteristics 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 delay, 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 scheduling of the service by the scheduler to dynamically predict the possible arrival slots, data volume, data peaks, channel conditions and corresponding optimal scheduling strategies of subsequent TSN service flows.

[0192] In one embodiment, based on the above dynamic prediction information, if the predicted TSN service flow meets the preset resource pre-scheduling conditions, the resource scheduling module is instructed to update the scheduling strategy and pre-scheduling the resources, wherein the upper limit of the pre-scheduling size depends on the historical actual peak value and the configured peak value (MDBV). The pre-scheduling of dynamic prediction notification can, on the one hand, reduce the delay loss from CU data to RLC until it is notified to the scheduler, and on the other hand, avoid the waste of resources 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, remaining delay, etc.) are notified and optimized in order to achieve the maximum delay and jitter guarantee.

[0194] In one embodiment, based on the above dynamic prediction information, the TSP update module may also 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 judgment 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 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, and 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.

[0197] Embodiment 3

[0198] Figure 7 The following is a schematic diagram of a QoS scheduling system for a deterministic wireless access network provided in Embodiment 3 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 structure of the QoS scheduling system of this embodiment is specifically described below.

[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 node) 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 one embodiment, the scheduling feedback module may provide the recorded historical scheduling amount, resource utilization, historical channel conditions, and TSN data backlog information to the TSP update module periodically or in real time, and the TSP update module performs TSP update.

[0207] In one embodiment, the scheduling feedback module may provide the recorded historical adjustment amount, scheduling frequency, historical channel conditions, and TSN backlog data volume to the dynamic prediction module periodically or in real time, so that the dynamic prediction module can update the associated prediction items; wherein the prediction items may include the arrival time, traffic size, and duration of the service flow.

[0208] In one embodiment, the scheduling feedback module can provide the TSN backlog data volume and possible remaining time consumption to the CU regularly or in real time, so that the CU can adjust the data forwarding strategy and update it to be in an efficient and balanced state with the scheduler. This can avoid the problem that the CU forwards data too quickly, resulting in data backlog on the scheduler side, causing system performance degradation, or that the scheduler has no data to schedule due to too slow data forwarding, resulting in increased latency, or that the scheduling of other business data is affected due to long-term emphasis on forwarding certain business data.

[0209] The configuration module includes a QoS configuration unit and a traffic shaping configuration unit. The QoS configuration unit is responsible for receiving, configuring and updating TSNQoS and non-TSN QoS related parameters; the traffic shaping configuration unit is used to update the configuration of the traffic shaping module based on input information from the user status module, dynamic prediction module, and scheduling feedback module. Related parameters required for traffic shaping.

[0210] The embodiment of the present invention provides a QoS scheduling system for deterministic wireless access networks. Through the mutual cooperation among a user state 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 system 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, and 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.

[0211] Embodiment 4

[0212] Figure 8 This is a schematic diagram of the structure of a service quality scheduling device provided by Embodiment 4 of the present invention. Figure 8 As shown, the device comprises:

[0213] The channel mapping and priority update strategy determination module 21 is used to map the logical channel to the corresponding node in the corresponding service quality 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;

[0214] A priority determination module 22, configured to determine the time-sensitive priority corresponding to 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;

[0215] A matrix updating module 23, used for updating nodes of a corresponding quality of service priority matrix according to a change in the traffic volume of a logical channel and a time-sensitive priority;

[0216] The resource scheduling module 24 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.

[0217] Further, 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, used 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, configured to map the logical channel to a corresponding tail node of a queue associated with a quality of service parameter in a 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 used to map 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 when the service type is a non-TSN service, and determine the time-sensitive priority update strategy as an enhanced proportional fairness strategy;

[0221] A third channel mapping unit is used to 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 when the service type is a TSN preemption service, and determine the time-sensitive priority update strategy as a first-in-first-out strategy;

[0222] a fourth channel mapping unit, configured to 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 when the service type is a TSN queuing service, and determine the time-sensitive priority update strategy as a time-sensitive enhanced proportional fairness strategy;

[0223] a fifth channel mapping unit, configured to 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 when the service type is a TSN periodic service, and determine the time-sensitive priority update strategy as a first-in-first-out strategy or a time-sensitive enhanced proportional fairness strategy;

[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] Further, based on the above-mentioned embodiment of the invention, the priority determination module 22 includes:

[0226] A service type and service parameter acquisition unit, used 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] Further, based on the above-mentioned embodiment of the invention, the matrix updating module 23 includes:

[0229] A traffic change judgment unit, used to obtain traffic change conditions of a logical channel and judge whether the traffic change conditions meet preset traffic change rules;

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

[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] Further, based on the above-mentioned embodiment of the invention, the resource scheduling module 24 includes:

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

[0234] A first resource scheduling unit, configured to determine the resource scheduling strategy of each node as a round-robin scheduling strategy when the matrix type is the first matrix type, and to traverse, allocate and schedule resources for each node in a retransmission-first-newtransmission manner;

[0235] A second resource scheduling unit is used to determine the resource scheduling strategy of each node as an enhanced proportional fairness strategy when the matrix type is the second matrix type, and traverse each node according to the retransmission first and then new transmission mode 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;

[0236] A third resource scheduling unit is used to determine the resource scheduling strategy of each node as a resource preemption strategy when the matrix type is a third matrix type, and allocate and schedule resources for each node according to a retransmission-first-new-transmission mode and a polling 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 strategy of each node as a time-sensitive enhanced proportional fairness strategy, and traverse each node according to a retransmission-first-new-transmission mode and a 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 determine the resource scheduling strategy of each node as a resource reservation strategy when the matrix type is the fifth matrix type, and to allocate and schedule resources for each node according to a retransmission-first-new-transmission mode and a polling strategy or a time-sensitive enhanced proportional fairness strategy, and after the reserved resources are allocated, output the nodes to which resources are not 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, 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.

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

[0241] A data feature acquisition module, used to acquire 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] Further, based on the above-mentioned embodiment of the invention, the service quality scheduling device also includes:

[0244] A service monitoring feature acquisition module is used to acquire service monitoring features of service flows;

[0245] A resource pre-scheduling module is used to determine and execute a 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 characteristics meet the preset resource pre-scheduling conditions;

[0246] The second traffic shaping module is used to perform traffic shaping on the service flow when the service monitoring characteristics meet the preset traffic shaping conditions.

[0247] The service quality scheduling device provided in the embodiment of the present invention can execute the service quality scheduling method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0248] Embodiment 5

[0249] Fig. 9 A schematic diagram of the structure of an electronic device 30 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0250] like Fig. 9 As shown, the electronic device 30 includes at least one processor 31, and a memory connected to the at least one processor 31, such as a read-only memory (ROM) 32, a random access memory (RAM) 33, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 31 can perform 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 to 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 number 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 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 may be a variety of general and / or special 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 dedicated artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The processor 31 executes the various methods and processes described above, such as a quality of service scheduling method.

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

[0254] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0255] In some embodiments, the quality of service scheduling method may 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 implements its solution mainly 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 when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program can be executed entirely on the machine, partially on the machine, partially on the machine as an independent software package and partially on a remote machine, or entirely on a remote machine or server.

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

[0257] To provide interaction with a user, the systems and techniques described herein may 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 a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0258] The systems and techniques described herein may be implemented in a computing system that includes backend 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 frontend components (e.g., a user computer with a graphical user interface or a 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 backend components, middleware components, or frontend components. The components of the system may 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 a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0260] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0261] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A service quality scheduling method, characterized in that: The method comprises: 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 service quality priority matrix, and the time-sensitive priority update strategy of the logical channel is determined; wherein different service types correspond to the 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; Determine the time-sensitive priority corresponding to the logical channel according to the time-sensitive priority update strategy of the logical channel and the service parameter of the service flow corresponding to the logical channel; Performing node update 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 method of mapping the logical channel to a corresponding node in a corresponding quality of service priority matrix according to the 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: Acquire the service type and service quality parameter 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 as 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 as 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 as a first-in-first-out strategy; When the service type is a TSN queuing 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 as 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 strategy as a first-in-first-out strategy or a time-sensitive enhanced proportional fairness strategy; 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 as 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 strategy 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 comprises: 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 strategy 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, characterized in that: 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 yes, then add or delete the corresponding node in the service quality priority matrix to which the logical channel belongs according to the service change situation; If not, the position of the corresponding node in the service quality 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, characterized in that The polling of each of the nodes in each of the quality of service priority matrices to determine and execute a corresponding resource scheduling strategy according to a 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 polling 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 strategy of each of the nodes is determined to be an enhanced proportional fairness strategy, and each of the nodes is traversed according to the retransmission first and then new transmission mode and the time-sensitive priority, so as to output each of the nodes to the non-TSN main scheduling queue and the non-TSN auxiliary scheduling queue in sequence; When the matrix type is the third matrix type, the resource scheduling strategy of each of the nodes is determined as a resource preemption strategy, and resources are allocated and scheduled for each of the nodes according to a retransmission-first-then-new-transmission method and a polling 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 of the nodes is determined to be a time-sensitive enhanced proportional fairness strategy, and each of the nodes is traversed according to the retransmission-first-new-transmission mode and the time-sensitive priority, so as to output each of the nodes to the TSN main scheduling queue in sequence; When the matrix type is the fifth matrix type, the resource scheduling strategy of each of the nodes is determined as a resource reservation strategy, and resources are allocated and scheduled for each of the nodes according to a retransmission-first-new-transmission mode and a polling strategy or a time-sensitive enhanced proportional fairness strategy, and after the reserved resources are allocated, the nodes to which resources are not 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 a TSN traffic service, it also includes: Acquiring data characteristics of the service 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: Acquiring 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 by 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 device for quality of service scheduling, characterized in that: The device comprises: A channel mapping and priority update strategy determination module, used to map the logical channel to the corresponding node in the corresponding service quality 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 the 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; A priority determination module, configured to determine the time-sensitive priority corresponding to 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; A matrix updating module, used for updating 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, and the computer program is executed by the at least one processor so that the at least one processor can 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