Route selection method with enhanced reliability in deterministic network

Abstract

The invention belongs to the technical field of deterministic networks, and discloses a reliability-enhanced route selection method in a deterministic network, which comprises the following steps of: acquiring network topology information and deterministic flow attributes, modeling network topology into a directed graph, and defining key parameters of deterministic flow. Thirdly, considering the transient error probability of the link, and constructing a minimum and shortest path set capable of meeting the flow reliability requirement; and based on the minimum path set, finding all data packet redundancy transmission combinations meeting the flow reliability, and determining an optimal combination scheme of path redundancy, transmission quantity redundancy and injection time slot in combination with a circular queue forwarding mechanism of a deterministic network. Then, calculating an optimal scheduling score of each stream, and preferentially scheduling the stream with the highest score; in addition, the invention also provides a corresponding objective function and a constraint condition, and ensures that the requirements of deterministic time delay and time slot capacity are met in the flow scheduling process. According to the invention, the reliability of traffic transmission in the network and the network scheduling performance can be effectively improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of deterministic networks, and in particular relates to a routing selection method with enhanced reliability in a deterministic network. Background Art

[0002] With the rapid development of industrial Internet, intelligent manufacturing and industry, the performance requirements of industrial networks are increasing. In order to support real-time control and efficient collaboration, low latency, low jitter and high reliability have become key requirements. However, the "best effort" mode of traditional Ethernet cannot provide the necessary transmission certainty and it is difficult to meet strict latency and reliability standards. This uncertainty may cause production line stagnation, equipment failure, and even security risks in industrial environments. Therefore, in order to meet network needs, deterministic networking (Deterministic Networking, DetNet) came into being to provide predictable network behavior and ensure the reliable transmission of critical data.

[0003] Deterministic networks achieve end-to-end low latency and high reliability transmission by combining advanced network technologies. In order to solve transient failures that may occur in the network and enhance the reliability of data transmission, deterministic networks introduce the Frame Replication and Elimination for Reliability (FRER) mechanism. FRER performs redundant replication and transmission on multiple paths of the data stream, ensuring that even if an error occurs on a path, other paths can still successfully transmit the same data packet, thereby improving the overall reliability of the network. This mechanism can effectively deal with transient error problems such as link failures and bit errors, ensuring that data can be delivered to the destination on time and safely. With the introduction of FRER, deterministic networks can meet the high reliability requirements of industrial applications and avoid production failures and safety hazards caused by network transmission uncertainty.

[0004] However, although FRER can improve network reliability through multi-path transmission, it also has some obvious shortcomings. First, the FRER solution relies on redundant path transmission, which may lead to waste of network bandwidth, especially when network resources are limited. This approach may aggravate network congestion. Secondly, FRER increases network complexity and latency during packet duplication and elimination. Especially in large-scale networks, these operations may cause additional processing overhead. In addition, FRER cannot perform refined resource allocation according to different traffic requirements, lacks targeted optimization strategies, and is difficult to maintain high network efficiency in high-traffic scenarios. Summary of the invention

[0005] The purpose of the present invention is to provide a routing selection method with enhanced reliability in a deterministic network to solve the problems existing in the above-mentioned prior art.

[0006] To achieve the above object, the present invention provides a method for routing selection with enhanced reliability in a deterministic network, comprising:

[0007] Acquire network topology data and a deterministic flow set, wherein the deterministic flow set is composed of a plurality of deterministic flows; construct a directed graph based on the network topology data, wherein the directed graph is composed of a forwarding device set in the network topology and a link set connecting the forwarding devices;

[0008] Calculate and determine the transient failure probability of a single data packet of the flow on the link, and determine the minimum shortest path set that meets the flow reliability requirements based on the calculated transient failure probability;

[0009] Based on the minimum shortest path set and the maximum number of transmission paths for the determined flow, path redundancy is obtained, and based on the CQF scheduling mechanism, injection time slot offsets of the determined flow data packets on each path are obtained,

[0010] Determine a combination of data packet transmission schemes based on injection time slot offset, path redundancy, and transmission volume redundancy on a single path;

[0011] Based on the combination of data packet transmission schemes, the best scheduling score of each of the determined flows is calculated, the optimal determined flow is determined based on the best scheduling score corresponding to each of the determined flows, and the optimal determined flow is scheduled.

[0012] Optionally, the deterministic flow is specifically:

[0013] f i =(f i .S,f i .D,f i .p,f i .l,f i .d,f i .R,f i .W,f i .r)

[0014] In the formula, f i .S represents a deterministic flow f i The source node, f i .D represents a deterministic flow f i The destination node, f i .p represents a deterministic flow f i The sending cycle, f i .l represents a deterministic flow f i The length of each data transmission, f i.d represents the maximum end-to-end delay allowed for a deterministic flow f, f i .R represents the deterministic flow f i The preset routing set, f i .R={r1,r2,r3,…,r n} represents that the preset route set consists of multiple alternative routes. n ={e1,e2,…e l}, Indicates that the alternative route consists of several non-loop forwarding links in E, f i .R is initially defined as empty, f i .W represents the deterministic flow f i The maximum number of transmission paths, f i .r represents a deterministic flow f i The minimum reliability index.

[0015] Optionally, the transient failure probability of a single data packet of the flow on the link is calculated and determined, specifically including:

[0016]

[0017] In the formula, For a deterministic flow f i A single packet on path r j transient fault, λ is the constant of hardware failure rate, l is the deterministic flow f i The length of each data sent, e k For path r j Any link on lr k Table is e k Data transfer speed, For a deterministic flow f i The probability of transient failure of a single packet copy being transmitted on multiple paths of a preset routing set.

[0018] Optionally, determining a minimum shortest path set that meets flow reliability requirements based on the calculated transient failure probability specifically includes:

[0019] The current shortest path for which the transient failure probability of a single data packet of the flow in the link is greater than or equal to the minimum reliability index is determined as the minimum shortest path that meets the reliability requirements of the flow.

[0020] Optionally, the path redundancy is specifically:

[0021]

[0022] In the formula, Indicates the selection of the minimum shortest path set R i The path r inj As a certain flow f i The transmission path, If it is not selected, f i .W is a deterministic flow f i The maximum number of transmission paths.

[0023] Optionally, the transmission redundancy is specifically:

[0024]

[0025] In the formula, Represents the path r j The deterministic flow f transmitted on i The number of copies of the packet is hour, when hour,

[0026] Optionally, obtaining and determining the injection time slot offset of the flow data packet on each path based on the CQF scheduling mechanism specifically includes:

[0027] Based on the CQF scheduling mechanism, the injection time slot offset of deterministic flow data packets on each path is defined. With the goal of minimizing flow conflicts, all injection time slot offsets are traversed, and the time slot with the largest network time slot remaining capacity value is selected as the injection time slot offset of the path.

[0028] Optionally, the calculating the best scheduling score of each of the determined flows specifically includes:

[0029]

[0030] In the formula, Score(H i ,M i ,o i ) is the optimal scheduling score, α is the maximum remaining capacity weight considered for scheduling, Res(o i ) is a combined path redundancy H i , transmission redundancy M i and injection slot offset o i The maximum remaining capacity of the network, Cap is the maximum amount of data that can be sent in a single time slot of the network, β is the weight of the resource occupied by itself, Represents the flow f i Press a combination H i 、M i and i The total amount of resources occupied by the scheduler, For path r j The stream f transmitted on i The number of copies of the packet, For path rj The number of hops, f i .l is the flow f i The length of data sent each time, max(F) is the maximum amount of resources occupied by a single flow in F.

[0031] Optionally, the scheduling the optimal determined flow specifically includes:

[0032] The constraint conditions are determined and the maximum number of successful network scheduling flows is taken as the goal, an objective function is constructed, and the optimal determined flow is scheduled based on the objective function.

[0033] Optionally, the objective function is:

[0034] max∑S i

[0035] In the formula, S i Represents the flow f i Whether the scheduling is successful, S i =1 indicates successful scheduling;

[0036] The constraints include deterministic delay constraints, injection time slot constraints and time slot capacity constraints.

[0037] The technical effects of the present invention are:

[0038] The present invention significantly improves the reliability and transmission efficiency in deterministic networks by constructing a reliability-guaranteed routing selection method, solves the problem of data loss caused by transient link failures, and ensures low latency, low jitter and high reliability during traffic transmission. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0040] The drawings constituting a part of the present application are used to provide a further understanding of the present application. The illustrative embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0041] Figure 1 It is a flow chart of a reliability-enhanced routing selection method in a deterministic network according to an embodiment of the present invention;

[0042] Figure 2 This is a preliminary experimental effect diagram of a routing selection method with enhanced reliability in a deterministic network according to an embodiment of the present invention. DETAILED DESCRIPTION

[0043] Various exemplary embodiments of the present invention will now be described in detail. This detailed description should not be considered as limiting the present invention, but should be understood as a more detailed description of certain aspects, features, and embodiments of the present invention.

[0044] It should be understood that the terms described in the present invention are only for describing special embodiments and are not intended to limit the present invention. In addition, for the numerical range in the present invention, it should be understood that each intermediate value between the upper and lower limits of the scope is also specifically disclosed. Each smaller range between the intermediate value in any stated value or stated range and any other stated value or intermediate value in the described range is also included in the present invention. The upper and lower limits of these smaller ranges can be independently included or excluded in the scope.

[0045] Unless otherwise indicated, all technical and scientific terms used herein have the same meanings as those of ordinary skill in the art generally understood by the present invention. Although the present invention describes only preferred methods, any method similar or equivalent to that described herein may also be used in the implementation or testing of the present invention. All documents mentioned in this specification are incorporated by reference to disclose and describe the methods related to the documents. In the event of a conflict with any incorporated document, the content of this specification shall prevail.

[0046] It will be apparent to those skilled in the art that various modifications and variations may be made to the specific embodiments of the present invention description without departing from the scope or spirit of the present invention. Other embodiments derived from the present invention description will be apparent to those skilled in the art. The present application description and examples are exemplary only.

[0047] The words “include,” “including,” “have,” “contain,” etc. used in this article are open-ended terms, meaning including but not limited to.

[0048] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0049] Embodiment 1

[0050] like Figure 1 - Figure 2As shown, in this embodiment, a reliability-enhanced routing method in a deterministic network is provided, including: obtaining network topology data and a deterministic flow set, wherein the deterministic flow set is composed of several deterministic flows; constructing a directed graph based on the network topology data, wherein the directed graph is composed of a forwarding device set and a link set connecting the forwarding devices in the network topology; calculating the transient failure probability of a single data packet of the determined flow in the link, and determining the minimum shortest path set that meets the flow reliability requirements based on the calculated transient failure probability; obtaining path redundancy based on the minimum shortest path set and the maximum number of transmission paths for the determined flow, obtaining the injection time slot offset of the determined flow data packet on each path based on the CQF scheduling mechanism, and determining a combination of data packet transmission schemes based on the injection time slot offset, path redundancy and transmission volume redundancy on a single path; calculating the best scheduling score of each of the determined flows based on the combination of data packet transmission schemes, determining the optimal determined flow based on the best scheduling score corresponding to each of the determined flows, and scheduling the optimal determined flow.

[0051] The present embodiment discloses a reliability-enhanced routing method in a deterministic network, which aims to solve the reliability problem caused by transient link failures. The method includes the following steps: First, obtain network topology information and characteristic attributes of deterministic flows, model the network topology as a directed graph, and define key parameters related to deterministic flows. Next, consider the transient error probability of the link and construct a minimum shortest path set that can meet the flow reliability requirements. Based on the minimum path set, find all redundant transmission combinations that can achieve flow reliability, and combine the circular queue forwarding mechanism of the deterministic network to determine the best combination of path redundancy, transmission volume redundancy and injection time slot. Then, by calculating the best scheduling score for each flow, the flow with the highest score is scheduled first. In addition, the present embodiment also proposes corresponding objective functions and constraints to ensure that the deterministic delay and time slot capacity requirements are met during the flow scheduling process.

[0052] In view of this, the main purpose of this embodiment is to propose an effective routing selection method to improve the reliability in deterministic networks. This method aims to solve the network instability problem caused by transient link failures and ensure the reliable transmission and real-time performance of data streams. By optimizing the network topology model and redundant transmission strategy, low latency and high reliability network performance can be achieved, thereby providing technical support for high-demand applications such as the industrial Internet. Specifically, the following steps are included:

[0053] The first step is to obtain network topology information and related properties of deterministic flows, and establish a corresponding mathematical model to describe network topology and deterministic flow characteristics, including:

[0054] The network topology is modeled as a directed graph G = (V, E), where V is the set of forwarding devices and E = (e1, e2, ..., eN ) is a set of links connecting forwarding devices, representing the links in the topology. There are five types of delays in the forwarding system: processing delay d proc , transmission delay d tran , propagation delay d prop , queuing delay d queue and clock synchronization delay d sync .

[0055] The set of all deterministic flows in the network is defined as F. For each deterministic flow f i , is defined as a tuple f i =(f i .S,f i .D,f i .p,f i .l,f i .d,f i .R,f i .W,f i .r). Among them, f i .S represents stream f i The source node, f i .D represents flow f i The destination node, f i .p represents stream f i The sending cycle, f i .l represents the flow f i The length of each data transmission, f i .d represents the maximum end-to-end delay allowed for flow f, f i .R represents flow f i The preset routing set, f i .R={r1,r2,r3,…,r n} represents that the preset route set consists of multiple alternative routes. n ={e1,e2,…e l}, Indicates that the alternative route consists of several non-loop forwarding links in E, f i .R is initially defined as empty, f i .W represents flow f i The maximum number of transmission paths, f i .r represents the flow f i The minimum reliability index.

[0056] According to the sending period of all flows in the flow set F, define the super period T C =LCM(f i .p),f i ∈F indicates that the super period is the least common multiple of all flow periods, and flow scheduling is performed in a super period cycle. The time slot length T is defineds =GCD(f i .p),f i ∈F indicates that the time slot length is the greatest common divisor of all flow periods, and the time slot is the minimum time metric for flow scheduling.

[0057] The second step is to consider the transient failure probability of the link and determine the minimum shortest path set that meets the flow reliability requirements, including:

[0058] Transient faults are common faults in network communications that cause components to fail for a short time and then recover, including bit errors, temporary link failures, and temporary synchronization errors. Represents the flow f i A single packet on path r j where λ is a constant representing the hardware failure rate, and len is the number of transient failures in the flow f. i The length of each data sent, e k is the path r j Any link on lr k Indicates e k data transfer speed. Represents the flow f i The probability of a single packet copy being transmitted on multiple paths of a preset routing set is a transient failure. Find the minimum shortest routing space, that is, In this embodiment, the flow f i The current shortest path is added to R i In the calculation Until it is less than f i .r, then R i is caused by the flow i A route set composed of multiple short paths, using R i All paths in the transport flow f i A single copy of the data packet can ensure that the transient failure probability satisfies the flow f i reliability requirements.

[0059] The third step is to analyze and find all combinations of data packet redundant transmission schemes that meet the flow reliability requirements based on the minimum path set, including:

[0060] According to the minimum routing space R i and flow i The maximum number of transmission paths f i .W, this embodiment defines path redundancy in, Indicates selection R i The path r in j As a flow i The transmission path, means not to select, and Represents the flow f i The number of transmission paths is not greater than the maximum path. A single path can also transmit multiple data packet copies. This embodiment defines multiple data packet copies on a single path as transmission redundancy. in, Represents the path r j The stream f transmitted on i The number of copies of the packet, and when hour, when hour, To satisfy the flow f i The reliability needs to meet Need to find H i and M i Possible combinations for H i , find several The combination of H i W in is 1, and the rest are 0. i , When j is smaller, the corresponding path r j The shorter the transient failure probability formula The shorter the path, the higher the probability of transient failure. Indicates the use of a single path r j transmission copies are required to satisfy f i The reliability of H i The maximum number of copies M to be transferred max and the minimum number of copies M to be transmitted min and H i and M i The combination solution is converted into a combination packing problem with upper and lower limits. This embodiment uses a depth-first search algorithm to solve it.

[0061] The fourth step is to combine the circular queue forwarding mechanism of the deterministic network and find the optimal combination of all path redundancy, transmission volume redundancy and time slot offset from the perspective of minimizing flow conflicts. Specifically, it includes:

[0062] According to the transmission combination, path redundancy H i and transmission redundancy M i , combined with the circular queue forwarding CQF scheduling mechanism, this embodiment defines Represents the flow f i The injection slot offset of the data packet on each path, where express packets on path r j The injection slot offset is Represents the path r jNot selected, no slot offset is injected. Based on the idea of ​​minimizing flow capacity conflicts, the flow f i An H i and M i Combination, traversal The path r j All possible injection time slot offsets are selected, and the time slot with the largest network time slot remaining capacity value is selected as path r j The injection time slot of the flow f i All path redundancy, transmission capacity redundancy and offset time slot combinations.

[0063] Step 5: Calculate the best scheduling scores for all flows based on the path, transmission volume, and time slot offset combination, and prioritize the flow with the highest current score. Specifically, the following steps are performed:

[0064] For a path redundancy, transmission capacity redundancy and offset time slot combination H i 、M i and i , the scheduling score is calculated by comprehensively considering the maximum remaining capacity of the network after scheduling and the amount of resources it occupies. The calculation formula is as follows:

[0065]

[0066] Among them, α is the weight of the maximum remaining capacity considered for scheduling, Res(o i ) is a combination of H i 、M i and i The maximum remaining capacity of the network, Cap is the maximum amount of data that can be sent in a single time slot of the network, α>0 means that the flow f i The larger the maximum remaining capacity after scheduling, the more conducive it is to scheduling other flows; β is the weight of the resources occupied by itself. Represents the flow f i Press a combination H i 、M i and i The total amount of resources occupied by the schedule, including: is the path r j The stream f transmitted on i The number of copies of the packet, is the path r j The number of hops, f i .l is the stream f i The length of each data transmission, max(F) is the maximum amount of resources occupied by a single flow in F, β<0 means that flow f i The less total resources are occupied, the more other flow scheduling can be utilized.

[0067] Flow rate i The best scheduling score Si =max(Score(H i ,M i ,o i )) is the maximum score of all scheduling combinations. Each scheduling calculates the best scheduling score for all flows and schedules the flow with the best score.

[0068] A reliability-enhanced routing selection method in a deterministic network in this embodiment is based on the following optimization objectives and constraints and is solved using a heuristic method.

[0069] The objective function is modeled as the maximum network schedulable performance. It is believed that when the number of successful network scheduling flows is the largest, the network achieves the best scheduling performance. The objective function is expressed as:

[0070] maxΣS i

[0071] Among them, S i Represents the flow f i Whether the scheduling is successful, S i =1 indicates that the scheduling is successful, otherwise

[0072] The deterministic delay constraint is:

[0073]

[0074] Among them, S i Whether to schedule flow f i success, Indicates selection R i The path r in j As a flow i The transmission path, If Indicates that the data packet is on path r j The injection slot offset is Represents the flow f i The minimum routing set R i Middle Path j The maximum transmission delay of Represents the path r j The number of hops, T s is the time slot length, f i .d is the maximum end-to-end delay allowed for flow f. This constraint means that flow f i The delay of a packet transmitted along any path cannot exceed the delay of flow f i Maximum latency requirement

[0075] Injection slot constraints:

[0076]

[0077] Among them, S i Whether to schedule flow f i success, Indicates selection R i The path r in j As a flow i The transmission path, If Indicates that the data packet is on path r j The injection slot offset is Represents the flow f i The minimum routing set R i Middle Path j The maximum transmission delay of T s is the time slot length, T c represents the super period length, f i .p is the stream f i The cycle, represents a superperiodic internal flow f i The constraint states that any flow f i The sum of the injection slot offset and the transmission delay cannot exceed one cycle, otherwise two super-cycle data may collide.

[0078] Time slot capacity constraints:

[0079]

[0080] in, Represents the flow f i The data packet will be sent through path r in time slot t j In link e k Otherwise Said no, S i Whether to schedule flow f i success, Indicates selection R i The path r in j As a flow i The transmission path, If Represents the path r j The stream f transmitted on i The number of packet copies, f i .l represents the flow f i The length of each data sent. It is link e k The maximum capacity that can be transmitted in time slot t.

[0081] This embodiment obtains network topology information and deterministic flow attributes, and models the network topology as a directed graph to define the key parameters of the deterministic flow. Next, considering the transient error probability of the link, a minimum shortest path set that can meet the flow reliability requirements is constructed. Based on the minimum path set, all redundant transmission combinations of data packets that meet the flow reliability are found, and combined with the circular queue forwarding mechanism of the deterministic network, the optimal combination of path redundancy, transmission volume redundancy and injection time slot is determined. Then, the optimal scheduling score of each flow is calculated, and the flow with the highest score is scheduled first. In addition, this embodiment also proposes corresponding objective functions and constraints to ensure that the deterministic delay and time slot capacity requirements are met during the traffic scheduling process. This embodiment can effectively improve the reliability of traffic transmission in the network and the network scheduling performance.

[0082] The above is only a preferred specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A method for routing with enhanced reliability in a deterministic network, characterized in that: include: Acquire network topology data and a deterministic flow set, wherein the deterministic flow set is composed of a plurality of deterministic flows; construct a directed graph based on the network topology data, wherein the directed graph is composed of a forwarding device set in the network topology and a link set connecting the forwarding devices; Calculate and determine the transient failure probability of a single data packet of the flow on the link, and determine the minimum shortest path set that meets the flow reliability requirements based on the calculated transient failure probability; Based on the minimum shortest path set and the maximum number of transmission paths for the determined flow, path redundancy is obtained, and based on the CQF scheduling mechanism, injection time slot offsets of the determined flow data packets on each path are obtained, Determine a combination of data packet transmission schemes based on injection time slot offset, path redundancy, and transmission volume redundancy on a single path; Based on the combination of data packet transmission schemes, the best scheduling score of each of the determined flows is calculated, the optimal determined flow is determined based on the best scheduling score corresponding to each of the determined flows, and the optimal determined flow is scheduled.

2. A method for routing selection with enhanced reliability in a deterministic network according to claim 1, characterized in that: The deterministic flow is specifically: f i =(f i .S,f i .D,f i .p,f i .l,f i .d,f i .R,f i .W,f i .r) In the formula, f i .S represents a deterministic flow f i The source node, f i .D represents a deterministic flow f i The destination node, f i .p represents a deterministic flow f i The sending cycle, f i .l represents a deterministic flow f i The length of each data transmission, f i .d represents the maximum end-to-end delay allowed for a deterministic flow f, f i .R represents the deterministic flow f i The preset routing set, f i .R=r1,r2,r3,…,r n } represents that the preset route set consists of multiple alternative routes. n ={e1,e2,…e l }, Indicates that the alternative route consists of several non-loop forwarding links in E, f i .R is initially defined as empty, f i .W represents the deterministic flow f i The maximum number of transmission paths, f i .r represents a deterministic flow f i The minimum reliability index.

3. The method for routing selection with enhanced reliability in a deterministic network according to claim 1, characterized in that: Calculate and determine the transient failure probability of a single data packet in a flow on a link, including: In the formula, For a deterministic flow f i A single packet on path r j transient fault, λ is the constant of hardware failure rate, l is the deterministic flow f i The length of each data transmission, e k For path r j Any link on lr k Table is e k Data transfer speed, For a deterministic flow f i The probability of transient failure of a single packet copy being transmitted on multiple paths of a preset routing set.

4. The method for selecting a route with enhanced reliability in a deterministic network according to claim 1, characterized in that: The step of determining the minimum shortest path set that meets the flow reliability requirement based on the calculated transient failure probability specifically includes: The current shortest path for which the transient failure probability of a single data packet of the flow in the link is greater than or equal to the minimum reliability index is determined as the minimum shortest path that meets the reliability requirements of the flow.

5. The method for selecting a route with enhanced reliability in a deterministic network according to claim 1, characterized in that: The path redundancy is specifically: In the formula, Indicates the selection of the minimum shortest path set R i The path r in j As a certain flow f i The transmission path, If it is not selected, f i .W is a deterministic flow f i The maximum number of transmission paths.

6. The method for selecting a route with enhanced reliability in a deterministic network according to claim 1, characterized in that: The transmission redundancy is specifically: In the formula, Represents the path r j The deterministic flow f transmitted on i The number of copies of the packet is hour, when hour, 7. A method for routing selection with enhanced reliability in a deterministic network according to claim 1, characterized in that: The method of obtaining and determining the injection time slot offset of the flow data packet on each path based on the CQF scheduling mechanism specifically includes: Based on the CQF scheduling mechanism, the injection time slot offset of deterministic flow data packets on each path is defined. With the goal of minimizing flow conflicts, all injection time slot offsets are traversed, and the time slot with the largest network time slot remaining capacity value is selected as the injection time slot offset of the path.

8. The method for selecting a route with enhanced reliability in a deterministic network according to claim 1, characterized in that: The calculating the best scheduling score of each of the determined flows specifically includes: In the formula, Score(H i ,M i ,o i ) is the optimal scheduling score, α is the weight of the maximum remaining capacity considered for scheduling, Res(o i ) is a combined path redundancy H i , transmission redundancy M i and injection slot offset o i The maximum remaining capacity of the network, Cap is the maximum amount of data that can be sent in a single time slot of the network, β is the weight of the resource occupied by itself, Represents the flow f i Press a combination H i 、M i and i The total amount of resources occupied by the scheduler, For path r j The stream f transmitted on i The number of copies of the packet, For path r j The number of hops, f i .l is the flow f i The length of data sent each time, max(F) is the maximum amount of resources occupied by a single flow in F.

9. The method for selecting a route with enhanced reliability in a deterministic network according to claim 1, characterized in that: The scheduling of the optimal determined flow specifically includes: The constraint conditions are determined and the maximum number of successful network scheduling flows is taken as the goal, an objective function is constructed, and the optimal determined flow is scheduled based on the objective function.

10. A method for routing selection with enhanced reliability in a deterministic network according to claim 9, characterized in that: The objective function is: max∑S i In the formula, S i Represents the flow f i Whether the scheduling is successful, S i =1 indicates successful scheduling; The constraints include deterministic delay constraints, injection time slot constraints and time slot capacity constraints.

Images