Time-Sensitive Streaming Scheduling Methods, Devices, Equipment, Storage Media, and Products
By acquiring topology data and flow characteristic information in deterministic networks, flow-level scheduling priorities and target transmission paths are determined, solving the problems of lack of intelligence in flow scheduling order and single path selection strategy, and achieving more efficient flow scheduling and resource utilization.
Patent Information
- Application Number
- CN202611450831.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-09-17
- Publication Date
- 2026-11-17
AI Technical Summary
In existing technologies, time-sensitive flow scheduling methods suffer from a lack of intelligence in flow scheduling order and a single path selection strategy, resulting in a limited number of schedulable flows and low network resource utilization.
By acquiring topology data and flow characteristic information of a deterministic network, a set of available transmission paths is determined. Based on the flow characteristic information and the number of available paths, the flow-level scheduling priority is determined, a flow scheduling sequence is generated, and the target transmission path and time parameters are selected for packet forwarding under preset parameter constraints.
It increases the number of schedulable flows, avoids single-point congestion, makes full use of network resources, and improves network resource utilization.
Smart Images

Figure CN123123283A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of network communication technology, and in particular to a scheduling method, apparatus, device, storage medium, and product for time-sensitive streams. Background Technology
[0002] In time-sensitive applications such as Industrial IoT, smart grids, and remote surgery, networks need to provide bounded end-to-end latency and jitter guarantees for time-sensitive traffic. Traditional Ethernet, originally designed to provide best-effort service, cannot guarantee bounded end-to-end latency, jitter, and zero packet loss for real-time applications. With the surge in time-sensitive applications in wide area networks, large-scale networks based on Internet Protocol (IP) have a strong need for deterministic forwarding capabilities to transmit both time-sensitive and best-effort traffic within the same network.
[0003] The Time-Sensitive Networking (TSN) task force proposed a series of standards to support real-time transmission in Layer 2 local area networks (LANs). The basic principle of TSN is to enable a global scheduling schedule by scheduling queue resources through time-division multiplexing, thereby reducing the uncertainty caused by congestion and queuing delays. Since the maximum network diameter in a LAN is limited to a small area, TSN assumes that all clocks on switches and end systems are precisely synchronized, and that propagation delays on the links are negligible.
[0004] Since these assumptions in TSN are impractical for large-scale networks, the IETF DetNet working group relaxed these assumptions by extending the TSN mechanism to Layer 3 deterministic networks through Cyclic Specified Queuing and Forwarding (CSQF). CSQF divides the transmission time at the egress port into a series of equally spaced time intervals, each called a period. By marking a series of periodic information in the packet header, packets can be transmitted along the path within a precisely reserved time period. Therefore, once the period size and label stack are determined, the end-to-end delay is bounded. More importantly, end-to-end jitter is theoretically independent of the number of hops and is controlled to a range not exceeding 2T.
[0005] In the prior art, there is a method for planning the entire network periodic label for implementing wide-area deterministic networks. This method proposes the concept of periodic time factor T, binds the maximum queue length to the periodic time factor to limit queuing delay, and designs flow offset (FO) and cycle shifting (CS) algorithms to calculate the periodic label of the flow.
[0006] However, this existing technology has the following shortcomings: (1) The flow scheduling order lacks intelligence. In the existing technology, the FO-CS algorithm schedules flows in the default order without considering the differences in scheduling urgency between different flows. In actual large-scale traffic scenarios, the characteristics of flows (such as traffic size, sending cycle, number of available paths, etc.) vary significantly. Simple sequential scheduling can easily lead to the inability to schedule strictly constrained flows because resources are occupied by loosely constrained flows, reducing the number of schedulable flows in the entire network.
[0007] (2) Single path selection strategy. In existing technologies, each flow is scheduled using only a single shortest path. When the queue resources on that path are insufficient, the flow is determined to be unschedulable. In asymmetric topology and long-distance link scenarios, as the number of flows increases, traffic aggregation (multiple flows converge at the bottleneck link) is easily triggered, resulting in single-point congestion, while the resources on other available paths are not utilized, leading to low network resource utilization. Summary of the Invention
[0008] This invention provides a scheduling method, apparatus, device, storage medium, and product for time-sensitive streams, to solve the problems of limited number of schedulable streams and low network resource utilization in existing stream scheduling methods.
[0009] According to one aspect of the present invention, a scheduling method for time-sensitive streams is provided, comprising: Obtain network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; Based on the network topology data and the characteristic information of each flow, determine the set of available transmission paths for each time-sensitive flow to be scheduled; Based on the characteristic information of each flow and the number of available paths in each set of available transmission paths, the flow-level scheduling priority of each time-sensitive flow to be scheduled is determined, and a flow scheduling sequence is generated based on the flow-level scheduling priority. For each time-sensitive flow to be scheduled in the flow scheduling sequence, based on preset parameter constraints, deadline constraints, and preset resource constraints, the target transmission path of the current time-sensitive flow to be scheduled is determined from the set of available transmission paths of the current time-sensitive flow to be scheduled, and the transmission time parameter corresponding to the target transmission path is determined, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
[0010] According to another aspect of the present invention, a scheduling apparatus for time-sensitive streams is provided, comprising: The topology acquisition module is used to acquire network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; The path calculation module is used to determine the set of available transmission paths for each time-sensitive flow to be scheduled based on the network topology data and the characteristic information of each flow. The priority calculation module is used to determine the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow characteristic information and the number of available paths in each available transmission path set, and to generate a flow scheduling sequence based on each flow-level scheduling priority. The scheduling execution module is used to determine the target transmission path of each time-sensitive flow to be scheduled in the flow scheduling sequence based on preset parameter constraints, deadline constraints and preset resource constraints, from the set of available transmission paths of the current time-sensitive flow to be scheduled, and to determine the transmission time parameter corresponding to the target transmission path, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
[0011] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the time-sensitive flow scheduling method according to any embodiment of the present invention.
[0012] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the time-sensitive flow scheduling method according to any embodiment of the present invention.
[0013] According to another aspect of the present invention, a computer program product is provided, the computer program product comprising a computer program that, when executed by a processor, implements the time-sensitive flow scheduling method described in any embodiment of the present invention.
[0014] The technical solution provided by this invention involves acquiring network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; determining a set of available transmission paths for each time-sensitive flow to be scheduled based on the network topology data and the flow characteristic information; determining the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow characteristic information and the number of available paths in each set of available transmission paths, and generating a flow scheduling sequence based on the flow-level scheduling priority; for each time-sensitive flow to be scheduled in the flow scheduling sequence, determining the target transmission path of the current time-sensitive flow to be scheduled based on preset parameter constraints, deadline constraints, and preset resource constraints, and determining the transmission time parameter corresponding to the target transmission path, so that network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter. By acquiring network topology data and flow characteristic information of deterministic networks, flow-level scheduling priorities are determined based on the flow characteristic information and the number of available paths in the set of available transmission paths, and flow scheduling sequences are generated. This prioritizes resource allocation for flows with stricter constraints and greater scheduling difficulty, solving the problem that existing technologies suffer from resource preemption for flows with strict constraints and limited number of schedulable flows due to the lack of intelligence in flow scheduling order. At the same time, target transmission paths are selected from multiple available transmission paths based on preset parameter constraints, deadline constraints, and preset resource constraints, breaking the single shortest path scheduling limitation, avoiding single-point congestion and link resource idleness, and solving the problem of low network resource utilization caused by the single path selection strategy in existing technologies.
[0015] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description
[0016] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0017] Figure 1 A flowchart illustrating a time-sensitive stream scheduling method provided in Embodiment 1 of the present invention; Figure 2 This is a schematic diagram of an available transmission path provided in Embodiment 1 of the present invention; Figure 3 A schematic diagram of a resource status matrix provided in an embodiment of the present invention; Figure 4This is a schematic diagram of the structure of a time-sensitive flow scheduling device provided in Embodiment 2 of the present invention; Figure 5 This is a schematic diagram of the structure of an electronic device provided in Embodiment 3 of the present invention. Detailed Implementation
[0018] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.
[0019] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0020] Example 1 Figure 1 This is a flowchart illustrating a time-sensitive flow scheduling method according to Embodiment 1 of the present invention. This embodiment is applicable to scheduling time-sensitive flows, particularly suitable for scheduling scenarios in three-layer wide-area deterministic networks based on the CSQF mechanism. This method can be executed by a time-sensitive flow scheduling device, which can be implemented in hardware and / or software and can be configured in an electronic device. Figure 1 As shown, the method includes: S110. Obtain network topology data of the deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled.
[0021] In this embodiment, the deterministic network is a Layer 3 wide-area deterministic network employing the CSQF mechanism, which can provide bounded end-to-end delay and jitter guarantees for time-sensitive flows. Network topology data is data used to characterize the topology and link attributes of the deterministic network. For example, network topology data may include a directed weighted graph G=(V,E,W) of the deterministic network, where V represents the set of network nodes, which may include forwarding devices such as switches and routers, or terminal systems; E represents the set of network links, where each link is a directed edge connecting two network nodes; and W represents the set of link weights, where link weights can be parameters such as link propagation delay or link bandwidth, which are not limited in this embodiment. A time-sensitive flow awaiting scheduling refers to a time-sensitive flow whose target transmission path and corresponding transmission time parameters have not yet been determined in the deterministic network and is awaiting scheduling. At least one time-sensitive flow awaiting scheduling can constitute a set of time-sensitive flows awaiting scheduling. ,in, This represents the i-th time-sensitive flow to be scheduled, where n is the number of time-sensitive flows to be scheduled, and n is a positive integer. Flow characteristic information describes the service characteristics and transmission requirements of the time-sensitive flows to be scheduled. In some embodiments, the flow characteristic information includes source node identifier, destination node identifier, transmission period, data packet length, number of data packets, and end-to-end deadline. Taking the i-th time-sensitive flow to be scheduled as an example... For example: Source node identifier The source node (i.e., the data sender) is used to uniquely identify the time-sensitive stream; for example, it can be a node ID, IP address, or MAC address. The destination node identifier... Used to uniquely identify the destination node (i.e., the data receiver) of a time-sensitive stream; transmission period The time interval at which the source node of a time-sensitive stream periodically sends data packets; packet length. The length of a single data packet in a time-sensitive stream, which can be in bytes; the number of data packets. For time-sensitive streams, this refers to the number of data packets sent in each transmission cycle; the end-to-end deadline. This represents the maximum end-to-end delay allowed for a time-sensitive stream from its source node to its destination node.
[0022] Specifically, network topology data can be obtained from the network management system, or network topology data can be obtained by summarizing the link information reported by each network node in the deterministic network based on the link layer discovery protocol; and, flow characteristic information of each time-sensitive flow to be scheduled can be received from the terminal device when it initiates a transmission request, or flow characteristic information pre-configured by the network controller according to the service transmission requirements can be obtained.
[0023] S120. Based on the network topology data and the characteristic information of each flow, determine the set of available transmission paths for each time-sensitive flow to be scheduled.
[0024] In this embodiment, the set of available transmission paths may include at least one available transmission path. The available transmission path is a transmission path in the network topology of a deterministic network that runs from the source node of a time-sensitive flow to the destination node and meets preset filtering conditions. Each available transmission path consists of multiple links sequentially connecting the source node and the destination node, as well as the network nodes it passes through.
[0025] Specifically, for each time-sensitive flow to be scheduled First, the source node identifier is obtained from the flow characteristic information of the time-sensitive flow to be scheduled. and destination node identifier Then, the corresponding source and destination nodes are determined in the directed weighted graph G=(V,E,W) corresponding to the network topology data; then, using the link weight as the path cost, the K shortest paths from the source node to the destination node are calculated to obtain the candidate path set. Where K is the preset maximum number of paths. When calculating the K shortest paths, the K-shortest path algorithm or other multi-path calculation algorithms can be used; this embodiment does not limit this.
[0026] Furthermore, for the candidate path set Each path in the process is filtered out, and paths with more than a preset hop count threshold are removed. The set of remaining paths after filtering is determined as the set of available transmission paths for the time-sensitive flow to be scheduled. And record the number of available paths. .
[0027] Optionally, the preset hop count threshold can be pre-configured based on the size of the deterministic network and the transmission requirements of time-sensitive streams.
[0028] For example, such as Figure 2 As shown, the source node identifier of the i-th time-sensitive flow to be scheduled is Src, and the destination node identifier is Dst. Three available transmission paths are calculated as follows: Path 1 (Src→A→C→E→Dst), with a total path delay of 7.5ms; Path 2 (Src→A→C→Dst), with a total path delay of 9.0ms; Path 3 (Src→B→D→E→Dst), with a total path delay of 9.5ms.
[0029] S130. Based on the characteristic information of each flow and the number of available paths in each set of available transmission paths, determine the flow-level scheduling priority of each time-sensitive flow to be scheduled, and generate a flow scheduling sequence based on the flow-level scheduling priority.
[0030] In this embodiment, the flow-level scheduling priority is used to characterize the priority of a time-sensitive flow to be scheduled in the flow scheduling sequence. The higher the flow-level scheduling priority, the earlier the time-sensitive flow to be scheduled will be scheduled. In some embodiments, the flow-level scheduling priority can be characterized by the scheduling priority weight (SPW). The larger the scheduling priority weight, the higher the flow-level scheduling priority of the corresponding time-sensitive flow to be scheduled.
[0031] Specifically, based on the service characteristics and transmission requirements reflected by the flow characteristic information of each time-sensitive flow to be scheduled, and the path selection space reflected by the number of available paths in each set of available transmission paths, the scheduling urgency of each time-sensitive flow to be scheduled is comprehensively evaluated, and the flow-level scheduling priority of each time-sensitive flow to be scheduled is determined. This gives higher flow-level scheduling priority to time-sensitive flows with stricter scheduling constraints and greater scheduling difficulty, so that they can obtain network resource allocation first. Then, the time-sensitive flows to be scheduled are sorted in descending order of flow-level scheduling priority to generate a flow scheduling sequence.
[0032] For example, the time-sensitive flows to be scheduled are sorted in descending order of their scheduling priority weights (SPW) to form a flow scheduling sequence. ,in, Let represent the i-th time-sensitive flow to be scheduled, and .
[0033] S140. For each time-sensitive flow to be scheduled in the flow scheduling sequence, based on preset parameter constraints, deadline constraints and preset resource constraints, determine the target transmission path of the current time-sensitive flow to be scheduled from the set of available transmission paths of the current time-sensitive flow to be scheduled, and determine the transmission time parameter corresponding to the target transmission path, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
[0034] In this embodiment, preset parameter constraints are used to limit the feasible value range of the transmission time parameter; the deadline constraint ensures that the total transmission delay of the time-sensitive flow to be scheduled from the source node to the destination node along the transmission path does not exceed the end-to-end deadline of the time-sensitive flow to be scheduled; preset resource constraints limit the queue resource capacity occupied by each link in each scheduling cycle to not exceed the maximum queue capacity of the link. The target transmission path is the available transmission path finally selected from the set of available transmission paths for the current time-sensitive flow to be scheduled, used to transmit the current time-sensitive flow to be scheduled. The transmission time parameter corresponding to the target transmission path is the timing configuration information on which each network node on the target transmission path forwards the data packets of the time-sensitive flow to be scheduled when the current time-sensitive flow to be scheduled is transmitted along the target transmission path.
[0035] Specifically, for each time-sensitive flow to be scheduled in the flow scheduling sequence, based on preset parameter constraints, deadline constraints, and preset resource constraints, the available transmission paths in the set of available transmission paths for the current time-sensitive flow to be scheduled are constrained and verified. Available transmission paths that satisfy the above constraints and have transmission time parameters are determined as target transmission paths, and the verified transmission time parameters are determined as the transmission time parameters corresponding to the target transmission path. Then, each network node on the target transmission path forwards the data packets of the time-sensitive flow to be scheduled within the corresponding scheduling period according to the transmission time parameters.
[0036] The technical solution provided in Embodiment 1 of this invention involves acquiring network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; determining the available transmission path set for each time-sensitive flow to be scheduled based on the network topology data and the flow characteristic information; determining the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow characteristic information and the number of available paths in each available transmission path set, and generating a flow scheduling sequence based on the flow-level scheduling priority; for each time-sensitive flow to be scheduled in the flow scheduling sequence, determining the target transmission path of the current time-sensitive flow to be scheduled based on preset parameter constraints, deadline constraints, and preset resource constraints, and determining the transmission time parameter corresponding to the target transmission path, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter. By acquiring network topology data and flow characteristic information of deterministic networks, flow-level scheduling priorities are determined based on the flow characteristic information and the number of available paths in the set of available transmission paths, and flow scheduling sequences are generated. This prioritizes resource allocation for flows with stricter constraints and greater scheduling difficulty, solving the problem that existing technologies suffer from resource preemption for flows with strict constraints and limited number of schedulable flows due to the lack of intelligence in flow scheduling order. At the same time, target transmission paths are selected from multiple available transmission paths based on preset parameter constraints, deadline constraints, and preset resource constraints, breaking the single shortest path scheduling limitation, avoiding single-point congestion and link resource idleness, and solving the problem of low network resource utilization caused by the single path selection strategy in existing technologies.
[0037] In some embodiments, determining the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow feature information and the number of available paths in each set of available transmission paths includes: for each time-sensitive flow to be scheduled, normalizing the total length of data packets, the transmission period, and the number of available paths of the current time-sensitive flow to be scheduled, to obtain normalized total length of data packets, normalized transmission period, and normalized number of available paths; wherein, the total length of data packets is determined based on the product of the length of data packets and the number of data packets of the current time-sensitive flow to be scheduled; and calculating the scheduling priority weight of the current time-sensitive flow to be scheduled based on the normalized total length of data packets, normalized transmission period, and normalized number of available paths, and the corresponding preset weights; wherein, the scheduling priority weight is negatively correlated with the total length of data packets, the transmission period, and the number of available paths of the corresponding flow.
[0038] In this embodiment, the preset weights are weight coefficients pre-set for each normalization parameter. The total data packet length is the product of the data packet length and the number of data packets for the current time-sensitive flow to be scheduled.
[0039] Specifically, to eliminate differences in units and value ranges among different parameters, for each time-sensitive flow to be scheduled, the total length of data packets, sending period, and number of available paths of the current time-sensitive flow to be scheduled are normalized to obtain the normalized total length of data packets. Normalized transmission period and the number of normalized available paths Based on the normalized total data packet length, normalized transmission period, and normalized number of available paths, as well as their respective preset weights, the scheduling priority weight (SPW) of the time-sensitive flow to be scheduled is calculated. i The calculation formula is as follows: ; in, , , These are preset weights corresponding to the total data packet length, transmission period, and number of available paths, respectively, to satisfy... ; The scheduling priority weight is negatively correlated with the total length of the data packets, the sending period, and the number of available paths of the corresponding time-sensitive flow to be scheduled. That is, the smaller the total length of the data packets, the greater the scheduling priority weight, because time-sensitive flows with smaller total length of data packets are easier to schedule and less likely to cause fragmentation of queue resources; the shorter the sending period, the greater the scheduling priority weight, because time-sensitive flows with shorter sending periods are more urgent; and the fewer the number of available paths, the greater the scheduling priority weight, because time-sensitive flows with fewer available paths have more limited path selection space and stricter scheduling constraints, and should be prioritized for scheduling.
[0040] By normalizing the parameters of the three dimensions to the same numerical range and weighting them into a single scheduling priority weight, the calculation is simple and the overhead is low. The scheduling priority weight is negatively correlated with the total length of the data packet, the sending period and the number of available paths, so that the flow with stricter scheduling constraints is given priority for scheduling, avoiding the situation where the flow with loose constraints occupies resources and the flow with strict constraints cannot be scheduled, thereby increasing the number of time-sensitive flows that can be scheduled in deterministic networks.
[0041] In some embodiments, normalizing the total length of data packets, transmission period, and number of available paths for the current time-sensitive flow to be scheduled to obtain normalized total data packet length, normalized transmission period, and normalized number of available paths includes: determining the maximum and minimum values of the total length of data packets, the maximum and minimum values of the transmission period, and the maximum and minimum values of the number of available paths for all time-sensitive flows to be scheduled; normalizing the total length of data packets for the current time-sensitive flow to be scheduled based on the maximum and minimum values of the total length of data packets to obtain normalized total data packet length; normalizing the transmission period for the current time-sensitive flow to be scheduled based on the maximum and minimum values of the transmission period to obtain normalized transmission period; and normalizing the number of available paths for the current time-sensitive flow to be scheduled based on the maximum and minimum values of the number of available paths to obtain normalized number of available paths.
[0042] Specifically, determine the maximum total length of packets for all time-sensitive flows to be scheduled. and minimum value Maximum value of the sending period and minimum value and the maximum number of available paths. and minimum value For the i-th time-sensitive flow to be scheduled, normalization is performed using the following formula: Based on the maximum and minimum total packet length, the total packet length of the time-sensitive flow to be scheduled is determined. Normalization is performed to obtain the normalized total length of the data packet. : ; Based on the maximum and minimum values of the sending period, the sending period of this time-sensitive stream to be scheduled is determined. Normalization is performed to obtain the normalized transmission period. : ; Based on the maximum and minimum number of available paths, the number of available paths for this time-sensitive flow to be scheduled. Perform normalization to obtain the normalized number of available paths. : ; Normalization based on maximum and minimum values can map the parameters of each time-sensitive flow to be scheduled to a unified numerical range, eliminating differences in units and value ranges, making parameters of different dimensions comparable and easy to calculate with weights. The implementation method is simple and easy to deploy in engineering.
[0043] In some embodiments, the preset parameter constraints include flow offset constraints and period shift constraints; the step of determining the target transmission path of the current time-sensitive flow from the set of available transmission paths of the current time-sensitive flow to be scheduled based on the preset parameter constraints, deadline constraints, and preset resource constraints includes: sorting the available transmission paths in the set of available transmission paths according to the total path delay to obtain a path priority sequence; selecting the transmission paths in the path priority sequence in sequence as the current transmission path, and performing the following steps: parameter determination step: determining the initial transmission time parameter of the current time-sensitive flow to be scheduled on the current transmission path, and using it as the current transmission time parameter, wherein the initial The initial transmission time parameters include flow offset and period shift vector; the parameter verification steps are as follows: based on the current transmission time parameters, verification is performed using the flow offset constraint, the period shift constraint, the deadline constraint, and the preset resource constraint; if the verification passes, the current transmission path is determined as the target transmission path; if the verification fails, the current transmission time parameters are adjusted within the range of the flow offset constraint and the period shift constraint, and the parameter verification steps are re-executed; if there are no verified transmission time parameters within the range of the flow offset constraint and the period shift constraint, the next transmission path in the path priority sequence is selected as the current transmission path, and the parameter determination steps are re-executed.
[0044] In this embodiment, the transmission time parameters include flow offset and period shift vector. The flow offset is the offset of the transmission scheduling period of the time-sensitive flow to be scheduled at the source node relative to the start of the scheduling period. Counting the number of scheduling periods, the flow offset of the i-th time-sensitive flow to be scheduled is denoted as... The periodic shift vector is a vector composed of the periodic shift values of the time-sensitive flow to be scheduled on each link in the transmission path, denoted as . , where corresponds to the component of the h-th link. This represents the number of delay periods in which the data packet of the time-sensitive flow to be scheduled is sent at the egress port of the h-th link relative to its arrival at the network node. Flow offset constraints are used to limit the feasible range of flow offset values; for example, a flow offset constraint of... ,in, For the sending period of the i-th time-sensitive stream to be scheduled, The periodic time factor is the duration of the scheduling period; the periodic shift constraint is used to limit the feasible range of values for each component in the periodic shift vector.
[0045] Specifically, the available transmission paths in the set of available transmission paths for the current time-sensitive flow to be scheduled are sorted in ascending order of total path delay to obtain a path priority sequence, where the total path delay is the sum of the propagation delays of each link contained in the available transmission path; the available transmission paths in the path priority sequence are selected as the current transmission paths in sequence, and the following steps are performed: Parameter determination steps: Determine the initial transmission time parameters of the time-sensitive flow to be scheduled on the current transmission path, and use them as the current transmission time parameters. For example, initialize the flow offset. Periodic shift vector ; Parameter verification steps: Based on the current transmission time parameters, verification is performed using flow offset constraints, period shift constraints, deadline constraints, and preset resource constraints; If the verification passes, the current transmission path will be determined as the target transmission path, and the current transmission time parameter will be determined as the transmission time parameter corresponding to the target transmission path. If the verification fails, adjust the current transmission time parameter within the range of the flow bias constraint and period shift constraint, for example, try the next flow bias value or period shift value, and re-execute the parameter verification step; If no verified transmission time parameter exists within the range of flow bias constraint and period shift constraint, the next transmission path in the path priority sequence is selected as the current transmission path, and the parameter determination step is executed again.
[0046] In this embodiment, each available transmission path is tried in ascending order of total path delay. Within the constraints, the transmission time parameter is adjusted, and the next path is switched after failure. This allows time-sensitive flows to be scheduled using other paths even when resources on a single path are insufficient, avoiding single-point congestion and making full use of the idle resources of each path in the network, thereby increasing the number of schedulable time-sensitive flows and the utilization rate of network resources.
[0047] It should be noted that the path-level priority selection described above is performed based on the flow scheduling sequence determined by flow-level scheduling priority (SPW). Flow-level priority ensures that flows with strict constraints and high scheduling difficulty receive resource allocation first by comprehensively considering the service characteristics of the flow and the number of available paths. Path-level priority, on the other hand, on flows with a determined scheduling order, tries and verifies constraints in ascending order of path delay to select the first available transmission path that satisfies all constraints. The two work together: flow-level priority solves the problem of "who to schedule first," preventing flows with loose constraints from preempting resources and causing flows with strict constraints to be unable to be scheduled; path-level priority solves the problem of "which path to take," avoiding single-point congestion and making full use of the idle resources of each path in the network. Through this two-layer priority mechanism, the number of schedulable flows and network resource utilization in deterministic networks are significantly improved.
[0048] In some embodiments, the periodic shift constraint includes the components of the periodic shift vector corresponding to each link in the current transmission path being within a preset value range; wherein the lower limit of the preset value range is a preset value, and the upper limit is determined based on the queue number of the corresponding link; the deadline constraint includes the total transmission delay of the current transmission path not exceeding the end-to-end deadline of the current time-sensitive flow to be scheduled; wherein the total transmission delay is determined based on the propagation delay of each link on the current transmission path and the periodic shift vector; the preset resource constraint includes, for each link in the current transmission path and for each scheduling period on the link, the sum of the queue resource capacity required by the current time-sensitive flow to be scheduled and the queue resource capacity already occupied by the link in the scheduling period is not greater than the maximum queue capacity of the link, wherein the required queue resource capacity is determined based on the product of the data packet length and the number of data packets of the current time-sensitive flow to be scheduled, and the maximum queue capacity is the product of the queue length and the maximum transmission unit of the link.
[0049] In this embodiment, the periodic shift constraint includes ensuring that the components of the periodic shift vector corresponding to each link in the current transmission path are within a preset value range, for example... The lower limit of the preset value range is a preset value (e.g., 0), and the upper limit is determined based on the number of queues for the corresponding link. Let h be the number of queues for the h-th link; optionally, the number of queues for different links in a deterministic network can be different, and the upper limit of each component in the periodic shift vector is determined based on the number of queues for their respective links, thereby adapting to heterogeneous queue networks.
[0050] The deadline constraint includes ensuring that the total transmission delay of the current transmission path does not exceed the end-to-end deadline of the current time-sensitive flow to be scheduled. The total transmission delay is determined based on the propagation delay and periodic shift vector of each link on the current transmission path; the propagation delay of each link is the aforementioned link weight. For example, considering the number of scheduling cycles, the total transmission delay satisfies... ,in, Let the propagation delay of the i-th time-sensitive flow to be scheduled be the h-th link. Let Δ be the periodic shift value of the i-th time-sensitive flow to be scheduled on the h-th link, i.e., the periodic shift vector Δ. i The component in the current transmission path corresponds to the h-th link, where j is the number of links in the current transmission path. Let be the end-to-end deadline for the i-th time-sensitive flow to be scheduled.
[0051] Preset resource constraints include: for each link in the current transmission path and for each scheduling period on that link, the sum of the queue resource capacity required by the time-sensitive flow to be scheduled and the queue resource capacity already occupied on that link during that scheduling period shall not exceed the maximum queue capacity of that link; for example, for each link in the current transmission path And for each scheduling period t, satisfying The required queue resource capacity is based on the packet length of the current time-sensitive flow to be scheduled. With the number of data packets The product of the length of the data packet and the maximum transmission unit (MTU) determines the queue resource capacity. The resource state matrix contains elements of the resource state matrix. Indicates link The queue resource capacity that has been occupied during the t-th scheduling period. For example, such as... Figure 3 As shown, the rows of the resource status matrix correspond to the links. , , The column corresponds to the scheduling period The element in the k-th row and t-th column of the matrix is the link. Queue resource capacity already occupied in the t-th scheduling period For example, links In the The queue resource capacity already occupied within a scheduling cycle is 9000 bytes. If the queue resource capacity required by the current time-sensitive flow to be scheduled is 6000 bytes, then the sum of the two is 15000 bytes. The preset resource constraint is satisfied when the maximum queue resource capacity of the link is 15000 bytes (queue length L=10, maximum transmission unit MTU=1500).
[0052] Optionally, after determining the target transmission path and its corresponding transmission time parameters, the queue resource capacity occupied by the time-sensitive flow to be scheduled is recorded in the corresponding element of the resource state matrix, and the transmission time parameters are configured to each network node on the target transmission path in the form of a periodic label stack, denoted as . , where Ω i The flow bias for the first jump. The sending scheduling period for the k-th hop (i.e., the period label for the k-th hop).
[0053] By limiting the periodic shift range based on the actual number of queues on each link, calculating the total transmission delay based on the link propagation delay and the periodic shift vector, and calculating the queue resource usage based on the actual length of the data packet, the deterministic transmission of time-sensitive streams with bounded end-to-end delay and no queue overflow is ensured. At the same time, it adapts to network scenarios with heterogeneous queue numbers, avoids resource waste caused by uniformly reserving based on the maximum transmission unit, and improves network resource utilization.
[0054] Example 2 Figure 4 This is a schematic diagram of a time-sensitive flow scheduling device provided in Embodiment 2 of the present invention. Figure 4 As shown, the device includes: The topology acquisition module 21 is used to acquire network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; The path calculation module 22 is used to determine the set of available transmission paths for each time-sensitive flow to be scheduled based on the network topology data and the characteristic information of each flow. The priority calculation module 23 is used to determine the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow feature information and the number of available paths in each available transmission path set, and to generate a flow scheduling sequence based on each flow-level scheduling priority. The scheduling execution module 24 is used to determine the target transmission path of each time-sensitive flow to be scheduled in the flow scheduling sequence based on preset parameter constraints, deadline constraints and preset resource constraints, from the set of available transmission paths of the current time-sensitive flow to be scheduled, and to determine the transmission time parameter corresponding to the target transmission path, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
[0055] The technical solution provided in Embodiment 2 of this invention obtains network topology data and flow characteristic information of a deterministic network, determines flow-level scheduling priority based on the flow characteristic information and the number of available paths in the set of available transmission paths, and generates a flow scheduling sequence. This prioritizes the allocation of resources to flows with stricter constraints and greater scheduling difficulty, solving the problem in existing technologies where the lack of intelligence in flow scheduling order leads to resource preemption for flows with strict constraints and a limited number of schedulable flows. At the same time, based on preset parameter constraints, deadline constraints, and preset resource constraints, the target transmission path is selected from multiple available transmission paths, breaking the single shortest path scheduling limitation, avoiding single-point congestion and link resource idleness, and solving the problem of low network resource utilization caused by the single path selection strategy in existing technologies.
[0056] Optionally, the flow feature information includes source node identifier, destination node identifier, transmission period, data packet length, number of data packets, and end-to-end deadline.
[0057] Optionally, the priority calculation module 23 includes: The data normalization unit is used to normalize the total length of data packets, the sending period, and the number of available paths of each time-sensitive flow to be scheduled, so as to obtain the normalized total length of data packets, the normalized sending period, and the normalized number of available paths; wherein, the total length of data packets is determined based on the product of the length of data packets and the number of data packets of the time-sensitive flow to be scheduled. The weight calculation unit is used to calculate the scheduling priority weight of the current time-sensitive flow to be scheduled based on the normalized total length of the data packet, the normalized transmission period, the normalized number of available paths, and the corresponding preset weights; wherein the scheduling priority weight is negatively correlated with the total length of the data packet, the transmission period, and the number of available paths of the corresponding flow.
[0058] Optionally, the data normalization unit includes: The first normalization subunit is used to determine the maximum and minimum total length of data packets, the maximum and minimum sending period, and the maximum and minimum number of available paths for all time-sensitive flows to be scheduled. The second normalization subunit is used to normalize the total length of the data packets of the current time-sensitive flow to be scheduled based on the maximum and minimum values of the total length of the data packets, so as to obtain the normalized total length of the data packets. The third normalization subunit is used to normalize the transmission period of the current time-sensitive stream to be scheduled based on the maximum and minimum values of the transmission period, so as to obtain the normalized transmission period. The fourth normalization subunit is used to normalize the number of available paths for the current time-sensitive flow to be scheduled based on the maximum and minimum values of the number of available paths, so as to obtain the normalized number of available paths.
[0059] Optionally, the preset parameter constraints include flow bias constraints and periodic shift constraints; Optionally, the scheduling execution module 24 includes: The path sorting unit is used to sort the available transmission paths in the set of available transmission paths according to the total path delay to obtain a path priority sequence. The path cyclic scheduling unit is used to select the transmission path in the path priority sequence as the current transmission path in sequence order, and perform the following steps: Parameter determination step: Determine the initial transmission time parameters of the currently scheduled time-sensitive flow on the current transmission path, and use them as the current transmission time parameters, wherein the initial transmission time parameters include the flow offset and the period shift vector; Parameter verification steps: Based on the current transmission time parameter, verification is performed using the flow offset constraint, the period shift constraint, the cutoff time constraint, and the preset resource constraint; If the verification passes, the current transmission path will be determined as the target transmission path; If the verification fails, the current transmission time parameter is adjusted within the range of the flow bias constraint and the period shift constraint, and the parameter verification step is re-executed. If no verified transmission time parameter exists within the range of the flow bias constraint and the periodic shift constraint, then the next transmission path in the path priority sequence is selected as the current transmission path, and the parameter determination step is re-executed.
[0060] Optionally, the periodic shift constraint includes the components of the periodic shift vector corresponding to each link in the current transmission path being located within a preset value range; wherein, the lower limit of the preset value range is a preset value, and the upper limit is determined based on the number of queues for the corresponding link; The deadline constraint includes that the total transmission delay of the current transmission path does not exceed the end-to-end deadline of the current time-sensitive flow to be scheduled; wherein, the total transmission delay is determined based on the propagation delay of each link on the current transmission path and the periodic shift vector; The preset resource constraints include, for each link in the current transmission path and each scheduling period on the link, the sum of the queue resource capacity required by the current time-sensitive flow to be scheduled and the queue resource capacity already occupied by the link in the scheduling period is not greater than the maximum queue capacity of the link. The required queue resource capacity is determined based on the product of the data packet length and the number of data packets of the current time-sensitive flow to be scheduled, and the maximum queue capacity is the product of the queue length and the maximum transmission unit of the link.
[0061] The time-sensitive stream scheduling device provided in this embodiment of the invention can execute the time-sensitive stream scheduling method provided in any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.
[0062] Example 3 Figure 5 This is a schematic diagram of an electronic device provided in Embodiment 3 of the present invention. 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 processors, cellular phones, smartphones, 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 illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.
[0063] like Figure 5 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.
[0064] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.
[0065] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, digital signal processors (DSPs), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as time-sensitive streaming scheduling methods.
[0066] In some embodiments, the time-sensitive stream scheduling method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or mounted on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the time-sensitive stream scheduling method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to execute the time-sensitive stream scheduling method by any other suitable means (e.g., by means of firmware).
[0067] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.
[0068] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.
[0069] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.
[0070] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).
[0071] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.
[0072] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.
[0073] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.
[0074] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.
[0075] This invention also provides a computer program product, including a computer program and / or instructions, which, when executed by a processor, implements the time-sensitive stream scheduling method provided in any embodiment of this application.
[0076] In implementing the computer program product, computer program code for performing the operations of this invention can be written in one or more programming languages or a combination thereof. Programming languages include object-oriented programming languages such as Java, Smalltalk, and C++, as well as conventional procedural programming languages such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0077] Note that the above description is merely a preferred embodiment of the present invention and the technical principles employed. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and various obvious changes, readjustments, and substitutions can be made without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in detail through the above embodiments, the present invention is not limited to the above embodiments, and may include many other equivalent embodiments without departing from the concept of the present invention, the scope of which is determined by the scope of the appended claims.
Claims
1. A scheduling method for time-sensitive streams, characterized in that, include: Obtain network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; Based on the network topology data and the characteristic information of each flow, determine the set of available transmission paths for each time-sensitive flow to be scheduled; Based on the characteristic information of each flow and the number of available paths in each set of available transmission paths, the flow-level scheduling priority of each time-sensitive flow to be scheduled is determined, and a flow scheduling sequence is generated based on the flow-level scheduling priority. For each time-sensitive flow to be scheduled in the flow scheduling sequence, based on preset parameter constraints, deadline constraints, and preset resource constraints, the target transmission path of the current time-sensitive flow to be scheduled is determined from the set of available transmission paths of the current time-sensitive flow to be scheduled, and the transmission time parameter corresponding to the target transmission path is determined, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
2. The method according to claim 1, characterized in that, The flow characteristic information includes source node identifier, destination node identifier, transmission period, data packet length, number of data packets, and end-to-end deadline.
3. The method according to claim 2, characterized in that, The process of determining the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the characteristic information of each flow and the number of available paths in each set of available transmission paths includes: For each time-sensitive flow to be scheduled, the total length of data packets, the sending period, and the number of available paths of the current time-sensitive flow to be scheduled are normalized to obtain the normalized total length of data packets, the normalized sending period, and the normalized number of available paths; wherein, the total length of data packets is determined based on the product of the length of data packets and the number of data packets of the current time-sensitive flow to be scheduled. Based on the normalized total data packet length, normalized transmission period, and normalized number of available paths, as well as the corresponding preset weights, the scheduling priority weight of the current time-sensitive flow to be scheduled is calculated; wherein, the scheduling priority weight is negatively correlated with the total data packet length, transmission period, and number of available paths of the corresponding flow.
4. The method according to claim 3, characterized in that, The normalization process for the total length of data packets, transmission period, and number of available paths of the current time-sensitive flow to be scheduled, to obtain normalized total data packet length, normalized transmission period, and normalized number of available paths, includes: Determine the maximum and minimum total length of data packets, the maximum and minimum sending period, and the maximum and minimum number of available paths for all time-sensitive flows to be scheduled. Based on the maximum and minimum values of the total data packet length, the total data packet length of the current time-sensitive flow to be scheduled is normalized to obtain the normalized total data packet length. Based on the maximum and minimum values of the transmission period, the transmission period of the current time-sensitive stream to be scheduled is normalized to obtain the normalized transmission period. Based on the maximum and minimum values of the number of available paths, the number of available paths for the current time-sensitive flow to be scheduled is normalized to obtain the normalized number of available paths.
5. The method according to claim 1, characterized in that, The preset parameter constraints include flow bias constraints and periodic shift constraints; The step of determining the target transmission path of the time-sensitive flow to be scheduled from the set of available transmission paths based on preset parameter constraints, deadline constraints, and preset resource constraints includes: The available transmission paths in the set of available transmission paths are sorted according to their total path delay to obtain a path priority sequence; The transmission paths in the path priority sequence are selected sequentially as the current transmission paths, and the following steps are performed: Parameter determination step: Determine the initial transmission time parameters of the currently scheduled time-sensitive flow on the current transmission path, and use them as the current transmission time parameters, wherein the initial transmission time parameters include the flow offset and the period shift vector; Parameter verification steps: Based on the current transmission time parameter, verification is performed using the flow offset constraint, the period shift constraint, the cutoff time constraint, and the preset resource constraint; If the verification passes, the current transmission path will be determined as the target transmission path; If the verification fails, the current transmission time parameter is adjusted within the range of the flow bias constraint and the period shift constraint, and the parameter verification step is re-executed. If no verified transmission time parameter exists within the range of the flow bias constraint and the periodic shift constraint, then the next transmission path in the path priority sequence is selected as the current transmission path, and the parameter determination step is re-executed.
6. The method according to claim 5, characterized in that, The periodic shift constraint includes the components of the periodic shift vector corresponding to each link in the current transmission path being located within a preset value range; wherein, the lower limit of the preset value range is a preset value, and the upper limit is determined based on the number of queues for the corresponding link; The deadline constraint includes that the total transmission delay of the current transmission path does not exceed the end-to-end deadline of the current time-sensitive flow to be scheduled; wherein, the total transmission delay is determined based on the propagation delay of each link on the current transmission path and the periodic shift vector; The preset resource constraints include, for each link in the current transmission path and each scheduling period on the link, the sum of the queue resource capacity required by the current time-sensitive flow to be scheduled and the queue resource capacity already occupied by the link in the scheduling period is not greater than the maximum queue capacity of the link. The required queue resource capacity is determined based on the product of the data packet length and the number of data packets of the current time-sensitive flow to be scheduled, and the maximum queue capacity is the product of the queue length and the maximum transmission unit of the link.
7. A scheduling device for time-sensitive streams, characterized in that, include: The topology acquisition module is used to acquire network topology data of a deterministic network and flow characteristic information of at least one time-sensitive flow to be scheduled; The path calculation module is used to determine the set of available transmission paths for each time-sensitive flow to be scheduled based on the network topology data and the characteristic information of each flow. The priority calculation module is used to determine the flow-level scheduling priority of each time-sensitive flow to be scheduled based on the flow characteristic information and the number of available paths in each available transmission path set, and to generate a flow scheduling sequence based on each flow-level scheduling priority. The scheduling execution module is used to determine the target transmission path of each time-sensitive flow to be scheduled in the flow scheduling sequence based on preset parameter constraints, deadline constraints and preset resource constraints, from the set of available transmission paths of the current time-sensitive flow to be scheduled, and to determine the transmission time parameter corresponding to the target transmission path, so that the network nodes on the target transmission path forward the data packets of the current time-sensitive flow to be scheduled based on the transmission time parameter.
8. An electronic device, characterized in that, The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the time-sensitive stream scheduling method according to any one of claims 1-6.
9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that cause a processor to execute the time-sensitive flow scheduling method of any one of claims 1-6.
10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the time-sensitive stream scheduling method according to any one of claims 1-6.
