Gated deployment method, device, storage medium, and apparatus

Abstract

This invention discloses a gating deployment method, device, storage medium, and apparatus. The invention selects the target data transmission link corresponding to the target service flow from a preset time-sensitive network structure, and obtains the node information and GCL capability information corresponding to the target data transmission link. Based on the node information, GCL capability information, and preset time slot scheduling and gating constraints, it determines the time slot scheduling and gating deployment scheme corresponding to the target service flow. The invention then performs gating deployment on the target data transmission link according to the time slot scheduling and gating deployment scheme. This invention rationally deploys the time slot scheduling and gating scheme based on network node capabilities and the latency jitter requirements of time-sensitive service flows. Compared to existing gating schemes that introduce additional jitter at every node where gating is disabled, leading to the inability to meet the latency or jitter requirements of certain service flows, this invention achieves gating deployment in a wider range of scenarios, reduces resource waste, and improves communication efficiency.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a gating deployment method, device, storage medium and apparatus. Background Technology

[0002] With the continuous development of industrial intelligence, the Industrial Internet has become a key comprehensive information infrastructure for the development of industrial intelligence. As the infrastructure for the development of the Industrial Internet, the basic network needs to have stronger interconnection, high-quality transmission and intelligent operation and maintenance capabilities in the future. Under the general trend of IT and OT convergence in intelligent manufacturing and the Industrial Internet, a unified network technology solution is needed to connect the underlying basic network. The end-to-end extremely low latency and reliable data transmission of TSN network have become the best choice for basic network in industrial scenarios.

[0003] TSN is an emerging network transmission technology that extends traditional Ethernet technology, allowing Time-Sensitive (TS) and Best-Effort (BE) traffic to be transmitted in the same network. Through vendor-independent standardization processes, it has become a widely focused key technology.

[0004] However, in practical deployments, existing gating schemes face two main problems: First, the number of real-time flows is limited. Since each timeslot requires two GCL entries (one on and one off), and a typical TSN switch has a maximum GCL entry length of 256 per port, the number of flows passing through that port is effectively limited to 128. Second, the bloat of the GCL list caused by the varying TS flow cycles further exacerbates this problem. Due to different service cycles, the number of GCL entries required for fine-grained control of service flows exceeds the capacity limit of a typical switch.

[0005] In order to solve the deployment problem caused by the GCL entry restriction, the existing gating scheme will introduce additional jitter in each node where gating is not enabled. Therefore, it may not be able to meet the latency or jitter requirements of some business flows, thus making the gating scheme unable to be deployed reasonably to meet various scenarios.

[0006] The above content is only used to help understand the technical solution of the present invention and does not represent an admission that the above content is prior art. Summary of the Invention

[0007] The main objective of this invention is to provide a gating deployment method, device, storage medium, and apparatus, which aims to solve the technical problem in the prior art of how to reasonably deploy network latency scheduling and gating schemes based on the network node capabilities and the latency jitter requirements of time-sensitive service flows.

[0008] To achieve the above objectives, the present invention provides a gating deployment method, the gating deployment method comprising the following steps:

[0009] Upon receiving a target service flow, a corresponding target data transmission link is selected from a preset time-sensitive network structure, which includes several end-to-end data transmission links.

[0010] Obtain the node information and GCL capability information corresponding to the target data transmission link;

[0011] Based on the node information, the GCL capability information, and the preset time slot scheduling and gating constraints, determine the time slot scheduling and gating deployment scheme corresponding to the target service flow;

[0012] The target data transmission link is gated and deployed according to the time slot scheduling and gating deployment scheme.

[0013] Optionally, the step of determining the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints includes:

[0014] The node information, the GCL capability information, and the preset time slot scheduling and gating constraints are input into the preset SMT solver to obtain the output results. The output results include gating switch information and gating deployment location information in the data transmission link.

[0015] Based on the gate switch information and the deployment location information, a time slot scheduling and gate deployment scheme corresponding to the target service flow is generated.

[0016] Optionally, before selecting the corresponding target data transmission link from a preset time-sensitive network structure upon receiving the target service flow, the method further includes:

[0017] Obtain latency jitter requirements for different types of service flows and GCL capability information for network topology nodes;

[0018] Preset time slot scheduling and gating constraints are generated based on the latency jitter requirement information and the GCL capability information of the network topology nodes.

[0019] The preset time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint.

[0020] Optionally, the starting time slot constraint is a pre-set constraint on the time when each data frame in the target service flow enters the transmission queue in the data transmission link at the source node of the target service flow;

[0021] The initial time slot constraint is:

[0022]

[0023]

[0024]

[0025] For the target business flow s i ∈S, where the application period of the target service flow is denoted as s. i The path of the target service flow from the source node to the target node is represented as [[v1,v2],…,[v...]. n-1 ,v n ]], where v1 and v n These are the source node and the target node of the target service flow, respectively; the target service flow contains one or more data frames. The set of data frames is denoted as

[0026] For each data frame The time node for entering the corresponding queue is recorded as . The time point at which forwarding begins from the port is denoted as . The minimum and maximum times for completing the transmission are denoted as follows:

[0027] Optionally, the data frame isolation constraint is a pre-set constraint that the reserved delays of any two data frames cannot overlap on each data transmission link; the corresponding data transmission link to which each port connects to the target service flow is denoted as:

[0028] The data frame isolation constraints include:

[0029]

[0030]

[0031]

[0032]

[0033]

[0034]

[0035] The gating model constraints are pre-set constraints on the delay processing of data frames under two conditions: gating is enabled and gating is disabled.

[0036] The gating model constraints include:

[0037]

[0038] if s i .gc==1,then

[0039]

[0040]

[0041]

[0042]

[0043] else

[0044]

[0045]

[0046] The link rate is represented as [v a ,v b ].s; note For gating variables, it represents the gating variable for business flow s. i ∈S, at port Whether gating is enabled; if gating is enabled, then record... and These are the closing time and opening time, respectively.

[0047] Optionally, the streaming link transmission constraint is a constraint that for each data frame, the transmission time in each data transmission link follows the order of its path.

[0048] The streaming link transmission constraints include:

[0049]

[0050]

[0051]

[0052]

[0053]

[0054] δ represents the maximum time synchronization error between adjacent nodes in the data transmission link.

[0055] The frame transmission delay constraint is a constraint that the time from the start of transmission to the completion of transmission for each data frame on each data transmission link should be equal to the ratio of the data size of the data frame to the link rate of the data transmission link.

[0056] The frame transmission delay constraint includes:

[0057]

[0058]

[0059]

[0060] The data frame size is denoted as . Link rate is represented as [v a ,v b ].s.

[0061] Optionally, the end-to-end latency constraint is a pre-set constraint condition that the end-to-end latency of each data frame does not exceed the end-to-end requirements of the service flow corresponding to the data frame; the end-to-end latency requirement is expressed as s. i .e2e;

[0062] The end-to-end delay constraint includes:

[0063]

[0064]

[0065] [v a ,v b ].d represents the propagation delay;

[0066] The jitter constraint is a pre-set constraint condition that the actual jitter corresponding to each data frame does not exceed the jitter requirement of the service flow corresponding to the data frame; the jitter requirement is expressed as: s i .jitter;

[0067] The jitter constraint includes:

[0068]

[0069]

[0070] The device GCL cycle constraint is a pre-set constraint that the GCL cycle for each port must be a multiple of the cycle of the service flow that enables GCL on that port.

[0071] The device GCL cycle constraint includes:

[0072]

[0073]

[0074]

[0075] Where [v] a ,v b ].T represents the GCL period size; This is an introduced integer variable that represents the ratio of the port GCL period to the service flow period.

[0076] The device GCL capability constraint is a pre-set constraint that the number of GCL entries required for gating data frames cannot exceed the GCL hardware capability of the device node.

[0077]

[0078]

[0079] Among them, [v a v b ].C represents the maximum GCL length.

[0080] Furthermore, to achieve the above objectives, the present invention also proposes a gating deployment device, the gating deployment device including a memory, a processor, and a gating deployment program stored in the memory and executable on the processor, the gating deployment program being configured to implement the gating deployment steps as described above.

[0081] In addition, to achieve the above objectives, the present invention also proposes a storage medium storing a gating deployment program, which, when executed by a processor, implements the steps of the gating deployment method as described above.

[0082] Furthermore, to achieve the above objectives, the present invention also proposes a gating deployment device, the gating deployment device comprising:

[0083] The path determination module is used to select the corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure contains several end-to-end data transmission links.

[0084] The information acquisition module is used to acquire node information and GCL capability information corresponding to the data transmission link;

[0085] The scheduling and deployment module is used to determine the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints.

[0086] This invention selects a corresponding target data transmission link from a preset time-sensitive network structure (TSN) upon receiving a target service flow. The preset TSN includes several end-to-end data transmission links. It acquires node information and GCL capability information corresponding to the target data transmission link. Based on the node information, the GCL capability information, and preset time-slot scheduling and gating constraints, it determines a time-slot scheduling and gating deployment scheme for the target service flow. The invention then performs gating deployment on the target data transmission link according to the time-slot scheduling and gating deployment scheme. This invention rationally deploys network latency scheduling and gating schemes based on network node capabilities and the latency jitter requirements of time-sensitive service flows. Compared to existing gating schemes that introduce additional jitter at every node where gating is disabled, potentially failing to meet the latency or jitter requirements of certain service flows, this invention achieves gating deployment in a wider range of scenarios, reduces resource waste, and improves communication efficiency. Attached Figure Description

[0087] Figure 1 This is a schematic diagram of the structure of the gated deployment device of the hardware operating environment involved in the embodiments of the present invention;

[0088] Figure 2 This is a flowchart illustrating the first embodiment of the gating deployment method of the present invention;

[0089] Figure 3 This is a schematic diagram of the TSN network architecture of the first embodiment of the gating deployment method of the present invention;

[0090] Figure 4 This is a flowchart illustrating the second embodiment of the gating deployment method of the present invention;

[0091] Figure 5 This is a structural block diagram of the first embodiment of the gated deployment device of the present invention.

[0092] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0093] It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0094] Reference Figure 1 , Figure 1 This is a schematic diagram of the gated deployment device structure of the hardware operating environment involved in the embodiments of the present invention.

[0095] like Figure 1 As shown, the gated deployment device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen, and optionally, it may also include a standard wired interface or a wireless interface. In this invention, the wired interface of the user interface 1003 may be a USB interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wireless-Fidelity (Wi-Fi) interface). The memory 1005 may be high-speed random access memory (RAM) or non-volatile memory (NVM), such as a disk storage device. The memory 1005 may also optionally be a storage device independent of the aforementioned processor 1001.

[0096] Those skilled in the art will understand that Figure 1 The structure shown does not constitute a limitation on the gating deployment device and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0097] like Figure 1 As shown, the memory 1005, which is identified as a computer storage medium, may include an operating system, a network communication module, a user interface module, and a gating deployment program.

[0098] exist Figure 1 In the gated deployment device shown, the network interface 1004 is mainly used to connect to the backend server and communicate with the backend server; the user interface 1003 is mainly used to connect to the user equipment; the gated deployment device calls the gated deployment program stored in the memory 1005 through the processor 1001 and executes the gated deployment method provided in the embodiment of the present invention.

[0099] Based on the above hardware structure, an embodiment of the gating deployment method of the present invention is proposed.

[0100] Reference Figure 2 , Figure 2 This is a flowchart illustrating the first embodiment of the gating deployment method of the present invention, which presents the first embodiment of the gating deployment method of the present invention.

[0101] In this embodiment, the gating deployment method includes the following steps:

[0102] Step S10: Upon receiving a target service flow, select the corresponding target data transmission link from a preset time-sensitive network structure, wherein the preset time-sensitive network structure contains several end-to-end data transmission links.

[0103] It should be noted that the executing entity in this embodiment can be a device containing a gating deployment system, such as a computer, or other devices capable of performing the same or similar functions. This embodiment does not impose any limitations on this. The gating deployment system can be used in scenarios such as smart factories to ensure deterministic transmission of real-time services, and can also be applied to data transmission in all broadband communication scenarios. In this embodiment and the following embodiments, the gating deployment system is used as an example to illustrate the gating deployment method of the present invention.

[0104] It should be understood that the target service flow can be any service flow passing through a Time-Sensitive Network (TSN) in various data communication scenarios. This service flow can be data frame traffic passing through a TSN switch architecture, and the data communication scenario can be an industrial digitalization scenario or a communication scenario in the automotive field. The key technologies of TSN include three aspects: time synchronization, gating mechanisms, and time slot scheduling. TSN uses these three mechanisms to ensure deterministic transmission of real-time service flows. Among them, the gating mechanism defined by the IEEE 802.1Qbv standard uses a Gate Control List (GCL) to control the opening and closing of the switch's queues.

[0105] Understandably, the preset time-sensitive network structure can be a pre-configured TSN network topology, which includes multiple data transmission links. The target data transmission link can be one or more of several end-to-end data transmission links. Traditional data transmission processes place packets in corresponding queues based on a priority field. Data packets in a queue can only be forwarded when the gating switch of that queue is opened. By combining this gating mechanism with time synchronization and slot scheduling mechanisms, precise control and deterministic forwarding of TS stream data packets can be achieved. For further explanation of the TSN network topology, refer to... Figure 3The diagram illustrates a TSN network architecture where data packets forwarded from port 0 to port 2 and then to port 3 are processed by the switching engine and placed into corresponding queues based on their priority fields. Data packets in a queue can only be forwarded when the gating switch of that queue is turned on. By combining this gating mechanism with time synchronization and slot scheduling mechanisms, precise control and deterministic forwarding of TS flow data packets can be achieved. However, setting gating switches solely based on the TSN network topology is insufficient to enable gating for all TS flows due to the limited hardware capabilities of the TSN switches. Therefore, this solution first selects the corresponding target data transmission link from a preset time-sensitive network structure based on the parameter information corresponding to the TSN network and the target service flow. This facilitates the subsequent determination of the slot scheduling and gating deployment scheme for the target service flow based on the parameter information corresponding to the target data link.

[0106] In specific implementation, upon receiving a target service flow, a corresponding target data transmission link is selected from a preset time-sensitive network topology. This preset time-sensitive network topology can be labeled as follows: Where V is the set containing nodes. This is a set that includes all links.

[0107] Step S20: Obtain the node information and GCL capability information corresponding to the target data transmission link.

[0108] It should be noted that the node information can be the end-to-end node information of the target data transmission link corresponding to the target service flow. The node information includes the parameter information corresponding to the source node, the transmission node, and the target node, wherein the path from the source node to the target node is represented as [[v1,v2],…,[v...]. n-1 ,v n ]], where v1 and v n These are the source node and the target node of the business flow, respectively. The parameter information includes node location, data load, and connection relationships between nodes.

[0109] It is understood that GCL capability information can refer to parameter information corresponding to the gate control switch state controlled by the gate control list. The parameter information includes: maximum GCL length, number of GCL entries, GCL cycle size, and enable parameters.

[0110] In practice, by determining the node information and GCL capability information corresponding to the target data transmission link, the nodes that the target service flow will pass through during data transmission and the maximum GCL load capacity can be accurately determined, which facilitates the accurate determination of gating enable information in the later stage.

[0111] Step S30: Determine the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information, and the preset time slot scheduling and gating constraints.

[0112] It should be noted that the preset time slot scheduling and gating constraints include one or more of the following: starting time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint.

[0113] Understandably, scheduling of the time slot length and start time of the transmission node, as well as the deployment of gating enable between nodes on the target data transmission link to control the gating switch, are used to ensure that no interference occurs between data frames during data frame transmission.

[0114] Furthermore, the starting time slot constraint is a pre-set constraint condition for the time when each data frame in the target service flow enters the transmission queue in the data transmission link at the source node of the target service flow;

[0115] The initial time slot constraint is:

[0116]

[0117]

[0118]

[0119] For the target business flow s i ∈S, where the application period of the target service flow is denoted as s. i The path of the target service flow from the source node to the target node is represented as [[v1,v2],…,[v...]. n-1 ,v n ]], where v1 and v n These are the source node and the target node of the target service flow, respectively; the target service flow contains one or more data frames. The set of data frames is denoted as

[0120] For each data frame The time node for entering the corresponding queue is recorded as . The time point at which forwarding begins from the port is denoted as . The minimum and maximum times for completing the transmission are denoted as follows:

[0121] Furthermore, the data frame isolation constraint is a pre-set constraint condition that the reserved delays of any two data frames cannot overlap in each data transmission link; the corresponding data transmission link to which each port connects to the target service flow is denoted as:

[0122] The data frame isolation constraints include:

[0123]

[0124]

[0125]

[0126]

[0127]

[0128]

[0129] Furthermore, the gating model constraint is a pre-set constraint condition for the delay processing of data frames under two conditions: gating is enabled and gating is disabled.

[0130] The gating model constraints include:

[0131]

[0132] if s i .gc==1,then

[0133]

[0134]

[0135]

[0136]

[0137] else

[0138]

[0139]

[0140] The link rate is represented as [v a ,v b ].s; note For gating variables, it represents the gating variable for business flow s. i ∈S, at port Whether gating is enabled; if gating is enabled, then record... and These are the closing time and opening time, respectively.

[0141] It should be noted that if gating is enabled, the queue switch must be closed at the earliest possible time when a data frame may enter the queue, and the gating switch must be opened to enable transmission only after the data frame has entered the queue. If gating is not enabled, in the best case, the data frame may be forwarded immediately after entering the queue after the minimum processing delay, while in the worst case, it will have to wait for the maximum processing delay plus the forwarding delay of one MTU (Maximum Unit Length) data frame.

[0142] Furthermore, the streaming link transmission constraint is a constraint condition that for each data frame, the transmission time in each data transmission link follows the order of its path.

[0143] The streaming link transmission constraints include:

[0144]

[0145]

[0146]

[0147]

[0148]

[0149] δ represents the maximum time synchronization error between adjacent nodes in the data transmission link.

[0150] Furthermore, the frame transmission delay constraint is a constraint that the time from the start of transmission to the completion of transmission for each data frame on each data transmission link should be equal to the ratio of the data size of the data frame to the link rate of the data transmission link.

[0151] The frame transmission delay constraint includes:

[0152]

[0153]

[0154]

[0155] The data frame size is denoted as . Link rate is represented as [v a ,v b ].s.

[0156] Furthermore, the end-to-end latency constraint is a pre-set constraint condition that the end-to-end latency of each data frame does not exceed the end-to-end requirements of the corresponding service flow; the end-to-end latency requirement is expressed as s. i .e2e;

[0157] The end-to-end delay constraint includes:

[0158]

[0159]

[0160] [v a ,v b ].d represents the propagation delay;

[0161] Furthermore, the jitter constraint is a pre-set constraint condition that the actual jitter corresponding to each data frame does not exceed the jitter requirement of the service flow corresponding to the data frame; the jitter requirement is expressed as: s i .jitter;

[0162] The jitter constraint includes:

[0163]

[0164]

[0165] Furthermore, the device GCL cycle constraint is a pre-set constraint that the GCL cycle for each port must be a multiple of the cycle of the service flow that enables GCL on that port.

[0166] The device GCL cycle constraint includes:

[0167]

[0168]

[0169]

[0170] Where [v] a ,v b ].T represents the GCL period size; This is an introduced integer variable that represents the ratio of the port GCL period to the service flow period.

[0171] Furthermore, the device GCL capability constraint is a pre-set constraint that the number of GCL entries required for gating data frames cannot exceed the GCL hardware capability of the device node.

[0172]

[0173]

[0174] Among them, [v a ,v b ].C represents the maximum GCL length.

[0175] Understandably, by pre-setting data frame isolation constraints and gating model constraints, mutual interference caused during data frame transmission can be effectively avoided. Furthermore, based on the application cycle, end-to-end latency requirements, and jitter requirements corresponding to the target service flow, the end-to-end latency constraints, jitter constraints, and device GCL cycle constraints can be determined. Specifically, the GCL cycle is relaxed from the least common multiple of the cycles of each TS flow to a multiple of each TS flow, thus transforming the problem into linear constraints for solving the gate control deployment scheme.

[0176] It should be understood that this solution, by pre-setting multiple constraints, can ensure that the gating deployment scheme achieves deterministic network transmission of time-sensitive service flows without violating the existing hardware capabilities of network nodes. By using the number of GCL entries of the device as one of the constraints, it can be ensured that the calculation results are within the capabilities of the device.

[0177] In practical implementation, existing technologies can address the deployment issues caused by GCL entry limitations through full-delay gating models, ungated models, or partial-gating models. The partial-gating model combines the advantages of both full-delay and ungated models. Specifically, gating is enabled only at some nodes along the service flow path, while gating is disabled at others. Compared to full-gating and ungated models, partial-gating combines the advantages of both. On one hand, it can eliminate data frame jitter and achieve completely deterministic network transmission by gating at some nodes; on the other hand, it can effectively reduce the required number of GCL entries by not gating certain service flows at some nodes. However, existing partial-gating schemes introduce additional jitter at each node where gating is disabled, which may prevent meeting the latency or jitter requirements of certain service flows. Compared to existing gating deployment models, this solution can achieve a more flexible gating scheme. Therefore, by using node information, GCL capability information, and constraints such as starting time slot constraints, data frame isolation constraints, stream link transmission constraints, frame transmission delay constraints, gating model constraints, end-to-end delay constraints, jitter constraints, device GCL period constraints, and device GCL capability constraints, the time slot scheduling and gating deployment scheme corresponding to the target service flow can be determined. This allows for the reasonable arrangement of network delay scheduling and gating schemes based on network node capabilities and the delay jitter requirements of time-sensitive service flows.

[0178] Step S40: Perform gated deployment on the target data transmission link according to the time slot scheduling and gating deployment scheme.

[0179] In practice, gating is deployed at the locations where gating needs to be enabled for each node in the target data transmission link, based on the time slot scheduling and gating deployment scheme.

[0180] This embodiment selects a corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure includes several end-to-end data transmission links. It acquires node information and GCL capability information corresponding to the target data transmission link. Based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints, it determines a time slot scheduling and gating deployment scheme for the target service flow. The target data transmission link is then gating-deployed according to the time slot scheduling and gating deployment scheme. This embodiment rationally deploys the network latency scheduling and gating scheme based on network node capabilities and the latency jitter requirements of time-sensitive service flows. Compared to existing gating schemes that introduce additional jitter at every node where gating is disabled, potentially failing to meet the latency or jitter requirements of certain service flows, this embodiment achieves gating deployment across a wider range of scenarios, reducing resource waste and improving communication efficiency.

[0181] Reference Figure 4 , Figure 4 This is a flowchart illustrating the second embodiment of the gating deployment method of the present invention, based on the above. Figure 2 The first embodiment shown presents a second embodiment of the gating deployment method of the present invention.

[0182] In this embodiment, before step S10, the method further includes: before selecting the corresponding target data transmission link from the preset time-sensitive network structure when the target service flow is received, the method further includes: obtaining latency jitter requirement information of different types of service flows and GCL capability information of network topology nodes; generating preset time slot scheduling and gating constraints based on the latency jitter requirement information and the GCL capability information of the network topology nodes; wherein the preset time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission latency constraint, gating model constraint, end-to-end latency constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint.

[0183] It should be noted that since the gating deployment method in this solution covers gating deployment in various communication scenarios, before actual deployment, the preset time slot scheduling and gating constraints that meet the gating deployment requirements of different types of service flows and the GCL capability information of network topology nodes are determined by obtaining the latency jitter requirements of different types of service flows and the GCL capability information of network topology nodes.

[0184] It should be understood that pre-setting time slot scheduling and gating constraints can facilitate gating deployment in various scenarios later. The pre-set time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint.

[0185] Understandably, by pre-setting multiple constraints, the gating deployment scheme can ensure deterministic network transmission of time-sensitive service flows without violating the existing hardware capabilities of network nodes. Furthermore, by pre-setting constraints corresponding to various communication scenarios, it can meet the needs of various types of service flows to flexibly arrange network latency scheduling and gating schemes reasonably according to the network node capabilities and the latency jitter requirements of time-sensitive service flows during data transmission. This effectively solves the problems of TSN time slot scheduling and gating scheme arrangement in some existing gating scheme research.

[0186] In this embodiment, step S30 includes:

[0187] Step S301: Input the node information, the GCL capability information, and the preset time slot scheduling and gating constraints into the preset SMT solver to obtain the output results. The output results include gating switch information and gating deployment location information in the data transmission link.

[0188] It should be noted that the SMT (Satisfiability Modulo Theories) solver can be used to describe the problem constraints corresponding to the target business flow, solve the network model, find feasible solutions to the problem, and output them.

[0189] Understandably, the node information of the target service flow, GCL capability information, and preset time slot scheduling and gating constraints are input into the preset SMT solver to obtain the output results. The output results include gating switch information, gating deployment location information in the data transmission link, time slot length between each transmission node, and time slot start time.

[0190] In the specific implementation, the following constraints are established: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint. Then, the SMT solver is used to solve these constraints to obtain gating switch information, gating deployment location information in the data transmission link, time slot length between each transmission node, and time slot start time.

[0191] Step S302: Generate a time slot scheduling and gating deployment scheme corresponding to the target service flow based on the gating switch information and the deployment location information.

[0192] In the specific implementation, scheduling is performed based on the time slot length and time slot start time between each transmission node, as well as the gating switch information between nodes on the target data transmission link and the deployment location information of the gating in the data transmission link, to generate the time slot scheduling and gating deployment scheme corresponding to the target service flow.

[0193] This embodiment selects a corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure includes several end-to-end data transmission links. It acquires node information and GCL capability information corresponding to the target data transmission link. The node information, GCL capability information, and preset time slot scheduling and gating constraints are input into a preset SMT solver to obtain an output result. The output result includes gating switch information and the deployment location information of the gating in the data transmission link. A time slot scheduling and gating deployment scheme corresponding to the target service flow is generated based on the gating switch information and the deployment location information. The target data transmission link is then gating-deployed according to the time slot scheduling and gating deployment scheme. This embodiment rationally deploys the network latency scheduling and gating scheme based on network node capabilities and the latency jitter requirements of time-sensitive service flows. Compared to existing gating schemes that introduce additional jitter at every node where gating is disabled, potentially failing to meet the latency or jitter requirements of certain service flows, this embodiment achieves gating deployment in a wider range of scenarios, reducing resource waste and improving communication efficiency.

[0194] In addition, to achieve the above objectives, the present invention also proposes a storage medium storing a gating deployment program, which, when executed by a processor, implements the steps of the gating deployment method as described above.

[0195] Reference Figure 5 , Figure 5 This is a structural block diagram of the first embodiment of the gated deployment device of the present invention.

[0196] like Figure 5As shown, the gating deployment device proposed in this embodiment of the invention includes:

[0197] The path determination module 10 is used to select the corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure includes several end-to-end data transmission links.

[0198] Information acquisition module 20 is used to acquire node information and GCL capability information corresponding to the data transmission link;

[0199] The scheduling and deployment module 30 is used to determine the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information and the preset time slot scheduling and gating constraints.

[0200] The deployment control module 40 is used to perform gated deployment of the target data transmission link according to the time slot scheduling and gating deployment scheme.

[0201] This embodiment selects a corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure includes several end-to-end data transmission links. It acquires node information and GCL capability information corresponding to the target data transmission link. Based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints, it determines a time slot scheduling and gating deployment scheme for the target service flow. The target data transmission link is then gating-deployed according to the time slot scheduling and gating deployment scheme. This embodiment rationally deploys the network latency scheduling and gating scheme based on network node capabilities and the latency jitter requirements of time-sensitive service flows. Compared to existing gating schemes that introduce additional jitter at every node where gating is disabled, potentially failing to meet the latency or jitter requirements of certain service flows, this embodiment achieves gating deployment across a wider range of scenarios, reducing resource waste and improving communication efficiency.

[0202] Furthermore, the scheduling and deployment module 30 is also used to input the node information, the GCL capability information, and the preset time slot scheduling and gating constraints into the preset SMT solver to obtain the output result. The output result includes gating switch information and gating deployment location information in the data transmission link. Based on the gating switch information and the deployment location information, a time slot scheduling and gating deployment scheme corresponding to the target service flow is generated.

[0203] Furthermore, the gating deployment device also includes a constraint determination module, which is used to acquire latency jitter requirement information for different types of service flows and GCL capability information of network topology nodes; and generate preset time slot scheduling and gating constraints based on the latency jitter requirement information and the GCL capability information of the network topology nodes; wherein the preset time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission latency constraint, gating model constraint, end-to-end latency constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint.

[0204] Furthermore, the constraint determination module is also used to set the starting time slot constraint as a pre-set constraint condition for the time when each data frame in the target service flow enters the transmission queue in the data transmission link at the source node of the target service flow;

[0205] The initial time slot constraint is:

[0206]

[0207]

[0208]

[0209] For the target business flow s i ∈S, where the application period of the target service flow is denoted as s. i The path of the target service flow from the source node to the target node is represented as [[v1,v2],…,[v...]. n-1 ,v n ]], where v1 and v n These are the source node and the target node of the target service flow, respectively; the target service flow contains one or more data frames. The set of data frames is denoted as

[0210] For each data frame The time node for entering the corresponding queue is recorded as . The time point at which forwarding begins from the port is denoted as . The minimum and maximum times for completing the transmission are denoted as follows:

[0211] Furthermore, the constraint determination module is also used to set a pre-defined constraint that the reserved delays of any two data frames cannot overlap on each data transmission link; the corresponding data transmission link to which each port corresponds to the target service flow is denoted as:

[0212] The data frame isolation constraints include:

[0213]

[0214]

[0215]

[0216]

[0217]

[0218]

[0219] The constraint determination module is also used to define the gate model constraint as a pre-set constraint condition for the delay processing of the data frame in both enabled and disabled gate conditions.

[0220] The gating model constraints include:

[0221]

[0222] if s i .gc==1,then

[0223]

[0224]

[0225]

[0226]

[0227] else

[0228]

[0229]

[0230] The link rate is represented as [v a ,v b ].s; note For gating variables, it represents the gating variable for business flow s. i ∈S, at port Whether gating is enabled; if gating is enabled, then record... and These are the closing time and opening time, respectively.

[0231] Furthermore, the constraint determination module is also used to constrain the stream link transmission to a constraint condition that, for each data frame, the transmission time in each data transmission link follows the order of its path.

[0232] The streaming link transmission constraints include:

[0233]

[0234]

[0235]

[0236]

[0237]

[0238] δ represents the maximum time synchronization error between adjacent nodes in the data transmission link.

[0239] The constraint determination module is also used to constrain the frame transmission delay to be equal to the ratio of the data size of the data frame to the link rate of the data transmission link for each data frame in each data transmission link.

[0240] The frame transmission delay constraint includes:

[0241]

[0242]

[0243]

[0244] The data frame size is denoted as . Link rate is represented as [v a ,v b ].s.

[0245] Furthermore, the constraint determination module is also used to set the end-to-end latency constraint as a pre-set constraint condition that the end-to-end latency of each data frame does not exceed the end-to-end requirements of the corresponding service flow of the data frame; the end-to-end latency requirement is expressed as s. i .e2e;

[0246] The end-to-end delay constraint includes:

[0247]

[0248]

[0249] [v a ,vb ].d represents the propagation delay;

[0250] The constraint determination module is further configured to set the jitter constraint as a pre-defined constraint condition that the actual jitter corresponding to each data frame does not exceed the jitter requirement of the service flow corresponding to the data frame; the jitter requirement is expressed as: s i .jitter;

[0251] The jitter constraint includes:

[0252]

[0253]

[0254] The constraint determination module is also used to constrain the device GCL cycle to a pre-set constraint condition that the GCL cycle for each port must be a multiple of the cycle of the service flow that enables GCL on that port.

[0255] The device GCL cycle constraint includes:

[0256]

[0257]

[0258]

[0259] Where [v] a ,v b ].T represents the GCL period size; This is an introduced integer variable that represents the ratio of the port GCL period to the service flow period.

[0260] The constraint determination module is also used to constrain the device's GCL capability by setting a pre-defined constraint that the number of GCL entries required for gating data frames cannot exceed the device node's GCL hardware capability.

[0261]

[0262]

[0263] Among them, [v a ,v b ].C represents the maximum GCL length.

[0264] It should be understood that the above are merely illustrative examples and do not constitute any limitation on the technical solutions of the present invention. In specific applications, those skilled in the art can make settings as needed, and the present invention does not impose any restrictions on this.

[0265] It should be noted that the workflow described above is merely illustrative and does not limit the scope of protection of this invention. In practical applications, those skilled in the art can select some or all of the workflow to achieve the purpose of this embodiment according to actual needs, and no restrictions are imposed here.

[0266] In addition, for technical details not described in detail in this embodiment, please refer to the gating deployment method provided in any embodiment of the present invention, which will not be repeated here.

[0267] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or system. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or system that includes that element.

[0268] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments. In the unit claims listing several devices, several of these devices may be embodied by the same hardware item. The use of the terms first, second, and third, etc., does not indicate any order and can be interpreted as names.

[0269] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as a read-only memory image (ROM) / random access memory (RAM), magnetic disk, optical disk), and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0270] The above are merely preferred embodiments of the present invention and do not limit the scope of the patent. Any equivalent structural or procedural transformations made based on the description and drawings of the present invention, or direct or indirect applications in other related technical fields, are similarly included within the scope of patent protection of the present invention.

Claims

1. A method of gated deployment, the method comprising: The gating deployment method includes the following steps: Upon receiving a target service flow, a corresponding target data transmission link is selected from a preset time-sensitive network structure, which includes several end-to-end data transmission links. Obtain the node information and GCL capability information corresponding to the target data transmission link; Based on the node information, the GCL capability information, and the preset time slot scheduling and gating constraints, determine the time slot scheduling and gating deployment scheme corresponding to the target service flow; The target data transmission link is gated and deployed according to the time slot scheduling and gating deployment scheme. Before selecting the corresponding target data transmission link from the preset time-sensitive network structure upon receiving the target service flow, the process further includes: Obtain latency jitter requirements for different types of service flows and GCL capability information for network topology nodes; Preset time slot scheduling and gating constraints are generated based on the latency jitter requirement information and the GCL capability information of the network topology nodes. The preset time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint. The gating model constraints are pre-set constraints on the delay processing of data frames under two conditions: gating is enabled and gating is disabled. The gating model constraints include: ； in, : A collection of data frames, T: The period of the business flow. Expressed as link rate As a gating variable, it represents the threshold for the business flow. In the link Whether gating is enabled; if gating is enabled, then This indicates the closing time. This indicates the opening time. This indicates that the target service flow contains one or more data frames. Represented as a set of data frames, for each data frame The time node for entering the corresponding queue is recorded as . The time point at which forwarding begins from the port is denoted as . ; Represented as: the maximum time point at which a data frame enters the queue; Represented as: the minimum time point at which a data frame enters the queue; Represented as: the minimum time point at which data frames begin forwarding; This is represented as: the maximum time point at which the data frame begins to be forwarded.

2. The gating deployment method as described in claim 1, characterized in that, The step of determining the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints includes: The node information, the GCL capability information, and the preset time slot scheduling and gating constraints are input into the preset SMT solver to obtain the output results. The output results include gating switch information and gating deployment location information in the data transmission link. Based on the gate switch information and the deployment location information, a time slot scheduling and gate deployment scheme corresponding to the target service flow is generated.

3. The gating deployment method as described in claim 1, characterized in that, The starting time slot constraint is a pre-set constraint condition for the time when each data frame in the target service flow enters the transmission queue in the data transmission link at the source node of the target service flow. The initial time slot constraint is: ： ； For the target business flow The target service flow application cycle is denoted as The path of the target service flow from the source node to the target node is represented as follows: ,in The source node of the target service flow. The target node of the target service flow.

4. The gating deployment method as described in claim 1, characterized in that, The data frame isolation constraint is a pre-set constraint condition that the reserved delays of any two data frames cannot overlap on each data transmission link; the corresponding data transmission link to which each port connects to the target service flow is denoted as: ; The data frame isolation constraints include: ， ， ： 。 5. The gating deployment method as described in claim 1, characterized in that, The streaming link transmission constraint is a constraint condition that, for each data frame, its transmission time in each data transmission link follows its order on the path. The streaming link transmission constraints include: ， ： ， ； The This represents the maximum time synchronization error between adjacent nodes in a data transmission link. This is represented as: the propagation delay of the transmission link; The frame transmission delay constraint is a constraint that the time from the start of transmission to the completion of transmission for each data frame on each data transmission link should be equal to the ratio of the data size of the data frame to the link rate of the data transmission link. The frame transmission delay constraint includes: ： ； The data frame size is denoted as . The link rate is expressed as , This represents the time point at which the data frame transmission is completed. This represents the minimum time point at which a data frame completes transmission. This represents the maximum time point at which a data frame is completed.

6. The gating deployment method as described in claim 1, characterized in that, The end-to-end latency constraint is a pre-set constraint condition that the end-to-end latency of each data frame does not exceed the end-to-end requirements of the corresponding service flow; the end-to-end latency requirement is expressed as... ; The end-to-end delay constraint includes: ： The jitter constraint is a pre-set constraint condition that the actual jitter corresponding to each data frame does not exceed the jitter requirement of the service flow corresponding to the data frame; the jitter requirement is expressed as: ; The jitter constraint includes: ： ； The device GCL cycle constraint is a pre-set constraint that the GCL cycle for each port must be a multiple of the cycle of the service flow that enables GCL on that port. The device GCL cycle constraint includes: ： ； in Represented as the GCL period size; This is an introduced integer variable that represents the ratio of the port GCL period to the service flow period. The device GCL capability constraint is a pre-set constraint that the number of GCL entries required for gating data frames cannot exceed the GCL hardware capability of the device node. ： ； Represented as the maximum GCL length; Indicates whether it is a data frame on the link Enable gating.

7. A gating deployment device, characterized in that, The gated deployment device includes: a memory, a processor, and a gated deployment program stored in the memory and executable on the processor, wherein the gated deployment program, when executed by the processor, implements the gated deployment method as described in any one of claims 1 to 6.

8. A storage medium, characterized in that, The storage medium stores a gating deployment program, which, when executed by a processor, implements the gating deployment method as described in any one of claims 1 to 6.

9. A gating deployment device, characterized in that, The gating deployment device includes: The path determination module is used to select the corresponding target data transmission link from a preset time-sensitive network structure when a target service flow is received. The preset time-sensitive network structure contains several end-to-end data transmission links. The information acquisition module is used to acquire node information and GCL capability information corresponding to the data transmission link; The scheduling and deployment module is used to determine the time slot scheduling and gating deployment scheme corresponding to the target service flow based on the node information, the GCL capability information, and preset time slot scheduling and gating constraints. A deployment control module is used to perform gated deployment of the target data transmission link according to the time slot scheduling and gating deployment scheme. Before selecting the corresponding target data transmission link from the preset time-sensitive network structure upon receiving the target service flow, the process further includes: Obtain latency jitter requirements for different types of service flows and GCL capability information for network topology nodes; Preset time slot scheduling and gating constraints are generated based on the latency jitter requirement information and the GCL capability information of the network topology nodes. The preset time slot scheduling and gating constraints include one or more of the following: start time slot constraint, data frame isolation constraint, stream link transmission constraint, frame transmission delay constraint, gating model constraint, end-to-end delay constraint, jitter constraint, device GCL period constraint, and device GCL capability constraint. The gating model constraints are pre-set constraints on the delay processing of data frames under two conditions: gating is enabled and gating is disabled. The gating model constraints include: ； in, : A collection of data frames, T: The period of the business flow. Expressed as link rate As a gating variable, it represents the threshold for the business flow. In the link Whether gating is enabled; if gating is enabled, then This indicates the closing time. This indicates the opening time. This indicates that the target service flow contains one or more data frames. Represented as a set of data frames, for each data frame The time node for entering the corresponding queue is recorded as . The time point at which forwarding begins from the port is denoted as . ; Represented as: the maximum time point at which a data frame enters the queue; Represented as: the minimum time point at which a data frame enters the queue; Represented as: the minimum time point at which data frames begin forwarding; This is represented as: the maximum time point at which the data frame begins to be forwarded.

Images