# US 2022/0045939 A1 · Network Node, Computer Program, Computer-Readable Medium and Method for Fail-Safe Data Transmission

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0045939 A1
- Document ID: US20220045939A1
- Status: Published application
- Kind: A1
- Application number: 17/417,193
- Filed: 2019-01-23
- Published: 2022-02-10
- Earliest claimed: 2019-01-23
- Assignees: Siemens Aktiengesellschaft
- Applicants: Siemens Aktiengesellschaft
- Inventors: Feng CHEN; Franz-Josef GÖTZ; Marcel KIEßLING; An Ninh NGUYEN; Jürgen SCHMITT
- Web page: https://patentgrep.com/patent/US20220045939A1

## CPC

- G05B 19/0428: {Safety, monitoring (G05B19/0423 takes precedence)}
- G05B 19/0423: {Input/output}
- G05B 19/058: {Safety, monitoring}
- G05B 19/41845: {characterised by system universality, reconfigurability, modularity}
- G05B 19/4185: {characterised by the network communication}
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- H04L 45/22: {Alternate routing}
- H04L 45/28: using route fault recovery
- H04L 45/42: Centralised routing
- H04L 45/52: Multiprotocol routers
- Y02P 90/80: Management or planning
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02P: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS

## Abstract

A network node, computer program, computer-readable medium and method for fail-safe data transmission in a network, in which data packets are transmitted from a sender to a receiver via redundant paths, upon which resources for the transmission are reserved at participating network nodes utilizing an identifier associated with the relevant path, wherein, if a new path is to be found for at least one of the paths involved, then the previous reservations on all redundant paths are maintained, a new redundant path is determined for the at least one path involved and an attempt is made to reserve resources for the transmission on this new redundant path at the participating network nodes, wherein a new identifier associated with the new path is utilized, and if the new reservations on the at least one new path are successful, then previous reservations on the at least one previous path involved are removed.

## Claims

### Claim at position 1

-14. (canceled)

### Claim 15

A method for fail-safe data transmission in a network having a plurality of network nodes (B1-B9), the method comprising:
transmitting data packets from a transmitter to a receiver via at least two redundant paths, upon which resources for the transmission are reserved at involved network nodes utilizing an identifier comprising a VID assigned to the respective path;
retaining previous reservations on all redundant paths, determining a new redundant path for at least one affected path comprising at least one of (i) a change caused by a conversion and (ii) an expansion of the network and attempting to reserve resources for the transmission on this path at the involved network nodes if a new path is to be found for the at least one affected path comprising at least one of (i) the change caused by the conversion and (ii) the expansion of the network, a new identifier assigned to the new path and differing from the previous identifiers being utilized; and
removing the previous reservations on the at least one affected previous path and terminating the transmission of data packets via the at least one affected previous path if the new reservations on the at least one new path are successful.

### Claim 16 (depends on 15)

The method as claimed in claim 15, wherein a plurality of previous paths are affected by the change and a new redundant path is respectively calculated for the plurality of affected paths; and wherein the new identifiers of all new paths differ from one another and from the previous identifiers.

### Claim 17 (depends on 16)

The method as claimed in claim 16, wherein all previous paths are affected by the change and a new redundant path is respectively calculated for the plurality of affected paths.

### Claim 18 (depends on 15)

The method as claimed in claim 15, wherein a new generalized almost directed acyclic graph is calculated for the network or at least one part of the network; and wherein the at least one new path is calculated for the at least one affected previous path utilizing the new GADAG.

### Claim 19 (depends on 16)

The method as claimed in claim 16, wherein a new generalized almost directed acyclic graph is calculated for the network or at least one part of the network; and wherein the at least one new path is calculated for the at least one affected previous path utilizing the new GADAG.

### Claim 20 (depends on 18)

The method as claimed in claim 18, wherein one of (i) a plurality of paths are affected by the change and, of the new paths determined for said paths, at least one path points in the direction of the new GADAG and at least one path points in an opposite direction and (ii) only one of the previous paths is affected by the change and, of the one new path and the unaffected previous path(s), at least one path points in the direction of the new GADAG and at least one path points in the opposite direction.

### Claim 21 (depends on 20)

The method as claimed in claim 20, wherein all paths are affected by the change.

### Claim 22 (depends on 18)

The method as claimed in claim 18, wherein the new GADAG is communicated to the involved network nodes as part of messages which are distributed in the network by processing a routing protocol.

### Claim 23 (depends on 22)

The method as claimed in claim 22, wherein the routing protocol comprises one of (i) the ISIS protocol and the ISIS-SPB/PCR protocol.

### Claim 24 (depends on 20)

The method as claimed in claim 20, wherein the new GADAG is communicated to the involved network nodes as part of messages which are distributed in the network by processing a routing protocol.

### Claim 25 (depends on 24)

The method as claimed in claim 24, wherein the routing protocol comprises one of (i) the ISIS protocol and the ISIS-SPB/PCR protocol.

### Claim 26 (depends on 15)

The method as claimed in claim 15, wherein the at least two previous paths were calculated utilizing a previous generalized almost directed acyclic graph, a previous generalized almost directed acyclic graph; and wherein at least one of the previous paths pointed or points in the direction of the previous GADAG and at least one other path pointed or points in the opposite direction.

### Claim 27 (depends on 15)

The method as claimed in claim 15, wherein after removing the previous reservations on the at least one affected previous path, further reservations of resources are made at the involved network nodes on the at least one new path utilizing the previous identifier, of the at least one previous path, and the reservations for the new identifier are then again removed.

### Claim 28 (depends on 15)

The method as claimed in claim 15, wherein a stream reservation protocol comprising at least one of (i) SRP, (ii) RAP and LRP is utilized to reserve resources at the involved network nodes.

### Claim 29 (depends on 15)

The method as claimed in claim 15, wherein in order to reserve resources at the involved network nodes on the at least one new path, a standard advertisement message comprising a talker advertise, is transmitted from the network node closest to the transmitter, in response to the change, to the network nodes which are next in the direction of the receiver on the at least one new path comprising a plurality of new paths are determined; and wherein in order to reserve resources at the involved network nodes on the new paths, a standard advertisement message comprising a talker advertise, is transmitted from the network node closest to the transmitter, in response to the change, to the network nodes which are next in the direction of the receiver on each new path.

### Claim 30 (depends on 15)

The method as claimed in claim 15, wherein in order to reserve resources at the involved network nodes on the at least one new path, a standard participation message comprising a listener ready, is transmitted from the network node closest to the receiver to the network nodes which are next in the direction of the transmitter on the at least one new path comprising a plurality of new paths are determined and, in order to reserve resources at the involved network nodes on the new paths, a standard participation message comprising a listener ready, is transmitted from the network node closest to the receiver to the network nodes that are next in the direction of the transmitter on each new path.

### Claim 31 (depends on 15)

The method as claimed in claim 15, wherein the network comprises at least one of (i) at least a ring topology and (ii) at least a meshed topology.

### Claim 32 (depends on 15)

The method as claimed in claim 15, wherein the network comprises an industrial network.

### Claim 33 (depends on 15)

The method as claimed in claim 15, wherein the data packets are transmitted from a transmitter to a receiver via precisely two redundant paths.

### Claim 34

A network node comprising:
a processor; and
memory;
wherein the network node is configured to:
transmit data packets are transmitted from a transmitter to a receiver via at least two redundant paths, upon which resources for the transmission are reserved at involved network nodes utilizing an identifier comprising a VID assigned to the respective path;
retain previous reservations on all redundant paths, determining a new redundant path for at least one affected path comprising at least one of (i) a change caused by a conversion and (ii) an expansion of the network and attempting to reserve resources for the transmission on this path at the involved network nodes if a new path is to be found for the at least one affected path comprising at least one of (i) the change caused by the conversion and (ii) the expansion of the network, a new identifier assigned to the new path and differing from the previous identifiers being utilized; and
remove the previous reservations on the at least one affected previous path and terminate the transmission of data packets via the at least one affected previous path if the new reservations on the at least one new path are successful.

### Claim 35 (depends on 15)

A computer program comprising program code instructions for implementing the method as claimed in claim 15.

### Claim 36

A non-transitory computer-readable medium encoded with program instructions which, when executed by a processor on at least one computer, cause the at least one computer to implement fail-safe data transmission in a network having a plurality of network nodes, the program instructions comprising:
program code for transmitting data packets from a transmitter to a receiver via at least two redundant paths, upon which resources for the transmission are reserved at involved network nodes utilizing an identifier comprising a VID assigned to the respective path;
program code for retaining previous reservations on all redundant paths, determining a new redundant path for at least one affected path comprising at least one of (i) a change caused by a conversion and (ii) an expansion of the network and attempting to reserve resources for the transmission on this path at the involved network nodes if a new path is to be found for the at least one affected path comprising at least one of (i) the change caused by the conversion and (ii) the expansion of the network, a new identifier assigned to the new path and differing from the previous identifiers being utilized; and
program code for removing the previous reservations on the at least one affected previous path and terminating the transmission of data packets via the at least one affected previous path if the new reservations on the at least one new path are successful.
