Redundant Path Reconfiguration for Fail-Safe Industrial Data Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for fail-safe data transmission in industrial networks, particularly during network topology changes, experience communication failures due to simultaneous changes in redundant paths, which can be worse than single connection failures.
Innovation Solution
The method involves using new identifiers for new redundant paths during network reconfiguration, maintaining existing reservations on old paths, and reserving resources on new paths with different identifiers to ensure uninterrupted communication, allowing for seamless redundancy and path changes without disrupting real-time data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If seamless redundancy mechanisms (HSR/PRP) are used to prevent communication failure during errors, then reliability is improved, but device complexity increases due to sequence numbers and duplicate filtering
Solution Approach 1:
The patent creates a copy of the data stream through parallel redundant paths without adding complex sequence numbers or filtering mechanisms. The simple duplication approach maintains reliability while avoiding the protocol complexity of HSR/PRP by using identical copies rather than numbered sequences that require synchronization and filtering.
Solution Approach 2:
The patent segments the data transmission into parallel independent paths without requiring complex coordination between them. Each path operates independently with simple duplication, avoiding the need for sequence number management and duplicate filtering that characterizes HSR/PRP implementations.
2Adaptability or versatility
If GADAG-based path calculation is used to determine redundant paths, then adaptability is improved, but reliability deteriorates during GADAG changes because both paths can be simultaneously affected
Solution Approach 1:
The patent pre-establishes multiple diverse redundant paths before any failure or change occurs. By having multiple pre-calculated paths that are diverse in their routing, the system can immediately switch to an alternative path if one becomes affected, preventing the simultaneous failure scenario that occurs with GADAG-based single path calculation.
Solution Approach 2:
The patent prepares multiple backup paths in advance as a cushion against potential failures. This beforehand preparation ensures that if one path is affected by GADAG changes or other issues, alternative paths are already available and can be activated immediately, maintaining communication continuity.
3Adaptability or versatility
If network topology changes (expansions/repairs) are implemented, then adaptability is improved, but communication failures occur due to simultaneous changes in all redundant paths
Solution Approach 1:
The patent implements dynamic path selection where multiple redundant paths are monitored and the system can adaptively switch between them based on current network conditions. This dynamic approach allows the network to handle topology changes gracefully by activating alternative paths when needed, maintaining communication stability during adaptations.
Solution Approach 2:
The patent prepares multiple alternative paths in advance as cushions against topology changes. When network expansions or repairs occur, these pre-established alternative paths provide a safety buffer that prevents communication failures, allowing the network to adapt while maintaining reliability.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to a method for fail-safe data transmission in a network (B1-B9), in which - data packets are transmitted from a sender (E4) to a receiver (E8) via redundant paths (P1, P2), on which resources for the transmission are reserved at participating network nodes (B1-B9) using an identifier (VID1, VID2) associated with the path (P1, P2) in question, wherein, if a new path (P3, P4) is to be found for at least one of the paths (P1, P2) involved, - the previous reservations on all redundant paths (P1, P2) are maintained, - a new redundant path (P3, P4) is determined for the at least one path (P1, P2) involved and it is attempted to reserve resources for the transmission on this new redundant path at the participating network nodes (B1-B9), wherein a new identifier (VID3, VID4) associated with the new path (P3, P4) is used, and - if the new reservations on the at least one new path (P3, P4) are successful, the previous reservations on the at least one previous path (P1, P2) involved are removed. The invention also relates to a network node, a computer program and a computer-readable medium.