AU2023312212B2 - Synchronized data network system, and method for initializing and synchronizing same - Google Patents

Description

Industry standard methods of time synchronization (hereinafter simply referred to as synchro- nization) are optimized for use in complex, dynamically changing, open networks, and they require sophisticated methods to establish a common time base between all participants. In 5 contrast, avionics network systems are often prefabricated and, moreover, are closed sys- tems to limit complexity. Under these circumstances, it is therefore necessary to find efficient approaches to synchronization and simpler means for verifying a deterministic behavior. 2023312212

In contrast to the avionics system data network standards known in the prior art (such as 10 ARINC-664, Part 7, AFDX) or standards still being developed (such as CAIN on TSN), it is necessary to achieve a significantly lower complexity for network components in order to re- duce costs, to simplify the network computing capacity used for synchronization, to reduce the time required to achieve safety certification, and to achieve an increase in efficiency.

15 The invention is therefore based on the object of providing a synchronized data network sys- tem and a method for initializing and synchronizing the same, through which a lower com- plexity of network components, a reduction in costs, a major simplification of the computing capacity required for synchronization, a reduction in the time required for safety certification, and an increase in efficiency can be achieved.

20

This object is achieved by the synchronized data network system according to claim 1 and by the methods according to claims 13 and 14. Advantageous embodiments and further devel- opments of the invention are set forth in the sub-claims.

25 In accordance with the invention, a synchronized data network system is provided, which in- cludes a data network that connects data network nodes to one another via direct data trans- mission links between neighboring data network nodes for an exchange of data. In accord- ance with the invention, a node chain consisting of successive first, second and third data network nodes is provided among these data network nodes, wherein the second data net- 30 work node is adapted to receive data transmitted on a first direct data transmission link be- tween the first and the second data network nodes from the first data network node on a data forwarding link and to forward said data in transmit mode to the third data network node on a

22248878_1 second direct data transmission link between the second and the third data network nodes. 25 Nov 2025

In this process, the second data network node is adapted to delay forwarding of the data on a single-hop data forwarding link between the first and the third data network nodes such that the hop latency is equal to a predetermined fixed common hop latency.

5

Thus, a synchronized data network system is provided, in which the data network nodes par- ticipating in the network are designed such that, when data coming from a transmitter data 2023312212

network node is forwarded to a receiver data network node, an interposed forwarding data network node delays forwarding of the data such that the time period of the hop or the hop 10 latency no longer depends on network-specific or node-specific latencies, but is equalized or leveled for each forwarding node to a fixed hop latency that is equal and common to all.

Although this delay slightly increases the response times or transmission latencies, the data throughput remains the same, and at the same time the synchronization of the entire network 15 is massively simplified, as synchronization data packets, which are usually normal data pack- ets with corresponding header information, from a master data network node can be used to synchronize the slave clocks of the slave data network nodes with the master clock in the easiest possible way, by enlarging the time stamp of the transmitted synchronization packet of the master upon arrival in a slave data network node by the number of hops times the 20 fixed common hop latency.

The synchronization of a data network system described in the following text can also be used in a decentralized data network if several network components have reliable master clocks. Thus, the invention provides a highly redundant method for synchronizing a data net- 25 work system for deterministic communication among the network participants.

In case of implicit synchronization of the data network system by means of a master data network node that has a master clock, it is preferred when the master data network node transmits synchronization data packets with a master clock time stamp ttx to slave data net- 30 work nodes and synchronizes the slave clocks of the slave data network nodes with the mas- ter clock time in accordance with the completed number of hops h of the synchronization data packet between master data network nodes and respective slave data network nodes,

22248878_1 as well as by means of the common hop latency period dCH according to the formula tmaster = 25 Nov 2025 ttx + dCH * h.

There are two ways of defining a single-hop data forwarding link for leveling to a common 5 hop latency via a single-hop data forwarding link. On one hand, for example, it is possible for the single-hop data forwarding link to correspond to a data forwarding link, which, starting on the transmitter side of the first data network node, passes through the second data network 2023312212

node via the direct data transmission link between the first and the second data network nodes and ends on the transmitter side of the second data network node. On the other hand, 10 it is also possible to define the single-hop data forwarding link such that the single-hop data forwarding link corresponds to a data forwarding link, which, starting on the receiver side of the second data network node, passes through the second data network node and ends, via the direct data transmission link between the second and the third data network nodes, on the receiver side of the third data network node.

15

For a real implementation of the synchronized data network system, it is advantageous if the second data network node comprises a data transmitting unit that is connected to a direct data transmission link for transmitting data to other data network nodes; a data receiving unit that is connected to a direct data transmission link for receiving data from other data network 20 nodes; a latency matching unit that is adapted to calculate, by means of a stored specific hop latency of the current single-hop data forwarding link and by means of the predetermined fixed common hop latency period, a latency matching period specific to the current single- hop data forwarding link; and a delay buffer that is interposed between the data receiving unit and the data transmitting unit for delaying forwarding of data packets on the current single- 25 hop data forwarding link by the specific latency matching period received from the latency matching unit.

In this process, it is useful if the latency matching unit comprises a timer for measuring a roundtrip latency on a single-hop data forwarding link to be measured; a memory for storing 30 the intrinsic node latency, the roundtrip latencies of the single-hop data forwarding links of the second data network node, as well as the predetermined fixed common hop latency; and a computing unit that is adapted to calculate the latency matching period using the formula dARX = dCH - dRT/2- dSRX_B.

22248878_1

For a real implementation of initialization and synchronization of the data network system of the invention, it is advantageous if the second data network node comprises a communica- tion control unit for controlling initialization and synchronization, an initialization control unit 5 that controls the initialization process of the data network nodes; and a synchronization con- trol unit that controls synchronization of the data network nodes. 2023312212

In this process, it is useful if the initialization control unit prompts the second data network node as the slave data network node to perform the steps of: transmitting a roundtrip meas- 10 urement command from the communication control unit to the data transmitting unit; trans- mitting, by the data transmitting unit, a roundtrip signal or ping signal to a data receiving unit of a corresponding receiving data network node via a corresponding direct data transmission link of a single-hop data forwarding link to be measured; starting a timer upon transmission of the roundtrip signal by the latency matching unit; receiving, by the data receiving unit, the 15 roundtrip signal sent back from the corresponding data network node via the corresponding direct data transmission link; stopping the timer by the latency matching unit upon receipt of the roundtrip signal sent back; reading the roundtrip latency from the timer; calculating the specific hop latency of the single-hop data forwarding link to be measured by adding the in- trinsic node latency to half the roundtrip latency; repeating the steps for all the single-hop 20 data forwarding links to be measured; and storing the ascertained hop latencies of all the sin- gle-hop data forwarding links to be measured.

Optionally, if the common hop latency from all the ascertained hop latencies of all the single- hop data forwarding links to be measured is determined by a master data network node dur- 25 ing initialization, an additional step of transmitting the ascertained hop latencies of all the sin- gle-hop data forwarding links to be measured to the master data network node can take place.

If the second data network node acts as a master data network node, it is advantageous 30 when the initialization control unit prompts the second data network node as the slave data network node to perform the steps of: receiving the respectively ascertained hop latencies of the single-hop data forwarding links of all the slave data network nodes to be measured from the slave data network nodes; and specifying a common hop latency from the transmitted

22248878_1 hop latencies, with the predetermined fixed common hop latency being greater than all the 25 Nov 2025 transmitted hop latencies.

To ensure that the fixed common hop latency selected is not unnecessarily large, it is useful 5 if the fixed common hop latency corresponds to a time period equal to a hop latency with the longest time period scaled with a safety factor greater than 1 or with a safety offset. 2023312212

When the data network system is synchronized by the second data network node that acts as a slave data network node, it is advantageous when the synchronization control unit 10 prompts the second data network node as the slave data network node to perform the steps of: receiving, from a master data network node with a master clock, synchronization data packets with a master clock time stamp ttx; and synchronizing the slave clock of the second data network node with the master clock time in accordance with the completed number of hops h of the synchronization data packet between master data network nodes and the sec- 15 ond data network node, as well as by means of the common deterministic hop latency period dCH according to the formula tmaster = ttx + dCH * h.

If the second data network node acts as a master data network node, it is advantageous when the synchronization control unit prompts the second data network node as the master 20 data network node to transmit, at a time ttx, synchronization data packets with a master clock time stamp ttx to the slave data network nodes.

To make the number of hops with the master clock time stamp available to the slave data network nodes in a simple manner and to ensure that synchronization occurs due to author- 25 ized synchronization of the data packet of a master, it is of great advantage if the synchroni- zation data packet includes the number of hops and an identifier of the master data network node in addition to the master clock time stamp.

The synchronized data network system according to the invention has enormous advantages 30 over the prior art when it is used as an avionics system data network for deterministic and/or flight safety-relevant communication between the data network nodes. In this process, it is

22248878_1 useful when the data network has a ring, star or network structure with a bidirectional ex- 25 Nov 2025 change of data.

Furthermore, in accordance with the invention, a method for initializing the synchronized data 5 network system of the invention is provided, including the steps of: transmitting a roundtrip measurement command from a communication control unit of a slave data network node to the data transmitting unit of the slave data network node; transmitting, by the data transmit- 2023312212

ting unit of the slave data network node, a roundtrip signal or ping signal to a data receiving unit of a corresponding additional slave data network node via a corresponding direct data 10 transmission link of a single-hop data forwarding link to be measured; starting a timer of the slave data network node upon transmission of the roundtrip signal by a latency matching unit of the slave data network node; receiving, by the data receiving unit of the slave data net- work node, the roundtrip signal sent back from the corresponding additional slave data net- work node via the corresponding direct data transmission link; stopping the timer by the la- 15 tency matching unit of the slave data network node upon receipt of the roundtrip signal sent back; reading the roundtrip latency from the timer of the slave data network node; calculating the specific hop latency of the single-hop data forwarding link to be measured by adding the intrinsic node latency to half the roundtrip latency; repeating the steps for all the single-hop data forwarding links to be measured; and storing the ascertained hop latencies of all the sin- 20 gle-hop data forwarding links to be measured.

Optionally, if the common hop latency from all the ascertained hop latencies of all the single- hop data forwarding links to be measured is determined by a master data network node dur- ing initialization, the following additional steps can be performed: transmitting the ascertained 25 hop latencies of all the single-hop data forwarding links to be measured to the master data network node; receiving, by the master data network node, the respectively ascertained hop latencies of the single-hop data forwarding links of all the slave data network nodes to be measured; specifying, by the master data network node, a common hop latency from the transmitted hop latencies, wherein the predetermined fixed common hop latency is greater 30 than all the transmitted hop latencies.

Furthermore, in accordance with the invention, a method for synchronizing a synchronized data network system of the invention comprising at least one master data network node and slave data network nodes is provided, including the steps of: transmitting, through the master

22248878_1 data network node at a time ttx, synchronization data packets with a master clock time stamp 25 Nov 2025 ttx to the slave data network nodes; receiving, through the slave data network nodes, syn- chronization data packets with a master clock time stamp ttx from the master data network node with a master clock, and synchronizing the slave clock of the slave data network node 5 with the master clock time in accordance with the completed number of hops h of the syn- chronization data packet between master data network nodes and slave data network nodes, as well as by means of the common deterministic hop latency period dCH according to the for- mula tmaster = ttx + dCH*h. 2023312212

10 In accordance with the invention, a synchronized data network system, a master data net- work node and a slave data network node are also provided, which are each adapted to carry out the above methods according to the invention.

It is to be understood that, if any prior art is referred to herein, such reference does not con- 15 stitute an admission that the prior art forms a part of the common general knowledge in the art, in Australia or any other country.

The invention will be explained in more detail in the following text by way of example based on the drawings.

20

Fig. 1 shows a highly simplified schematic view of a synchronized data network system in a ring structure according to the invention,

Fig. 2 shows a node chain of first, second and third data network nodes, which are con- 25 nected to one another by first and second direct data transmission links,

Fig. 3A shows a time flow chart of the delay of forwarding the data through the second data network node according to a first exemplary embodiment of the invention,

22248878_1

Fig. 3B shows a time flow chart of the delay of the data through the second data network 25 Nov 2025

node according to a second exemplary embodiment of the invention,

Fig. 4A shows a node chain of first, second, third and fourth data network nodes, which illus- 5 trate the delay in data forwarding for the purpose of synchronization according to the first ex- emplary embodiment of the invention, 2023312212

Fig. 4B shows a node chain of a second, third, fourth and fifth data network nodes, which il- lustrates the time flow of the delay in data forwarding for the purpose of synchronization ac- 10 cording to the second exemplary embodiment of the invention,

Fig. 5 shows a highly simplified schematic block diagram of a data network node according to the invention,

15 Figs. 6A and 6B show components of the data network nodes and their role in initialization of the synchronized data network system according to the invention,

Fig. 7 shows a process flow diagram of the method for initializing the synchronized data net- work system according to the invention, and

20

Fig. 8 shows a process flow diagram of a method for synchronizing a synchronized data net- work system according to the invention.

In the various figures in the drawing, components that correspond to one another are pro- 25 vided with identical reference numerals.

Fig. 1 shows an exemplary embodiment of a synchronized data network system 10 accord- ing to the invention. The synchronized data network system 10 includes a data network 100

22248878_1 that connects data network nodes 110 to one another via direct data transmission links x be- 25 Nov 2025 tween neighboring data network nodes 110 for the purpose of data exchange. In the depicted exemplary embodiment of the invention according to Fig. 1, the data network nodes 110A, 110B, 110C and 110D are connected to one another in a ring structure via the direct data 5 transmission links xAB, xBC, xCD, xAD. Although the data network system 10 in Fig. 1 has a ring structure, it is, nevertheless, also possible to provide a data network 100 as the data network system 10, which has a star or network structure. The invention can be introduced onto any network topology and is therefore not limited to a specific network structure. The topology of 2023312212 the network structure is therefore free; the only requirement is the bidirectionality of the con- 10 nections between the nodes and that at least one node must have more than one interface to neighboring nodes in order to be able to generate a topology with more than two participants. The number of data network nodes 110 is also arbitrary; the four data network nodes 110A, 110B, 110C and 110D depicted in Fig. 1 are to be understood purely as an example.

15 Prefabricated avionics components are preferably provided as data network nodes 110 in the data network system 10 in order to provide an avionics system data network via which deter- ministic and potentially flight safety-relevant communication between the avionics compo- nents as data network nodes is enabled. Such deterministic communication is particularly es- sential in flight networks or when using autonomous flight or driving applications, as synchro- 20 nized communication and traceability of causal chains in an avionics system are required, in particular, for proof of flight safety and, of course, for flight safety itself. These systems are used when the preservation of human life, the fulfillment of a military mission, or the transport of high material assets is at stake. As avionics components that are used as data network nodes 110 in the sense of the invention, a variety of avionics components are conceivable, 25 such as computer systems for flight control or mission management, human-machine inter- faces such as display or input devices, flight attitude sensors, engine sensors and actuators, tail sensors and actuation or weapon systems in which weapons can be triggered or decoys launched via the synchronized data network system. Although use in avionics is particularly preferred, the use of the synchronized data network system according to the invention is not 30 to be limited to this, but, for example, can be used in the field of nautics, aerospace such as in satellite systems or in safety-relevant large plants.

In the data network system 10 according to the invention, the direct data transmission link x between two data network nodes 110 can enable bidirectional or dual simplex communica- 35 tion. The temporal behavior of data sent through the network 100 is mainly characterized by

22248878_1 a unidirectional hop latency dH and a combined roundtrip latency dRT, which depends for 25 Nov 2025 each link on external factors such as the physical medium or environmental conditions and internal factors such as the design or implementation of the data network node 110.

5 Due to the variation in hop latencies dH across the data network system 10, the runtime for the transmission of data packets from a source data network node 110 to an end receiver data network node 110 is not a direct function of the data forwarding link selected by the data 2023312212

network 100 and the number of hops on this data forwarding link. Rather, it is necessary that all specific latencies caused by external or internal factors of the network are taken into ac- 10 count, which means an enormous computational effort if one wants to implicitly synchronize the data network system 10. In this case, implicit synchronization means synchronization of all the network node slave clocks to a master clock of a master data network node 110M (Fig. 5) by transmitting synchronization data packets from the master data network node 110M to the data network nodes 110.

15

Furthermore, such synchronization is not only computationally intensive, but also depends on runtime initialization and thus also has an influence on the determinism of the system, as it requires tolerances over the entire runtime-dependent value range.

20 In Fig. 2, the synchronized data network system 10 according to the invention is depicted in even further detail, with the various latencies generated either by the data network nodes 110 or by the direct data transmission links x being discussed in more detail herein. Fig. 2 shows a node chain of the data network nodes 110 according to the invention consisting of successive first, second and third data network nodes 110A, 110B and 110C, which are con- 25 nected to one another via direct data transmission links xAB and xBC during transmission of data from the data network node 110A to the data network node 110C. Bidirectional commu- nication is also possible via the direct transmission links xCB and xBA, however, for reasons of simplicity, only the forwarding direction from the nodes 110A to 110C is to be taken into ac- count.

30

In accordance with the invention, the second data network node 110B is adapted to receive data transmitted on the first direct data transmission link xAB between the first and the second data network nodes 110A, 110B from the first data network node 110A on a data forwarding

22248878_1 link xABBC and to forward said data to the third data network node 110C on a second direct 25 Nov 2025 data transmission link xBC between the second and the third data network nodes 110B, 110C.

In accordance with the invention, a distinction is therefore to be made between the direct 5 data transmission link x that is part of the data network 100, and a data forwarding link xABBC, which also comprises the transmission link through a data network node 110 with a corre- sponding intrinsic node latency. 2023312212

In particular, the single-hop data forwarding links xAAB, xABB, xBBC, xBCC or in the following also 10 generally referred to as xXZZ or xZZY are of interest for the invention, since it is the smallest unit of a data forwarding hop from one data network node 110 to another data network node 110. There are two possible approaches for defining a single-hop data forwarding link:

(a) The single-hop data forwarding link can be defined such that it corresponds to the 15 data forwarding links xABB and xBCC. Thus, the direct data transmission link xAB from the trans- mitter data network node 110A to the forwarding data network node 110B and the data for- warding link through the data network node 110B are combined in this case as a single-hop data forwarding link. In the case where the data network node 110C is the forwarding data network node 110, the direct data transmission link xBC and the data forwarding link through 20 the data network node 110C are combined as the single-hop data forwarding link xBCC. Thus, in the case where the second data network node 110B is the forwarding data network node 110, the single-hop data forwarding link corresponds to a data forwarding link xABB, which, starting on the transmitter side of the first data network node 110A, passes through the sec- ond data network node 110B via the direct data transmission link xAB between the first and 25 the second data network nodes 110A, 110B and ends on the transmitter side of the second data network node 110B.

(b) According to a second exemplary embodiment, the single-hop data forwarding link xAAB, xBBC consists of the forwarding link with a corresponding latency of the forwarding node 30 110 and the subsequent direct data transmission link xAB, xBC, via which the data, originating from the forwarding data network node 110A, 110B, is transmitted to a corresponding addi- tional data network node 110B, 110C. This, therefore, means that, in case that the second

22248878_1 data network node 110B is the data forwarding data network node, the single-hop data for- 25 Nov 2025 warding link corresponds to the data forwarding link xBBC, which, starting on the receiver side of the second data network node 110B, passes through the second data network node 110B and ends, via the direct data transmission link xBC between the second and the third data net- 5 work nodes 110B, 110C, on the receiver side of the third data network node 110C.

As can further be seen in Fig. 2, corresponding latencies are assigned to the corresponding 2023312212

forwarding links through the data network nodes 110 and through the direct data transmis- sion links x, which latencies relate either to the runtime or latency dSRX_A, dSRX_B, dSRX_C when 10 data is forwarded through the data network node 110 or to the runtime or latency when data is forwarded via the direct data transmission links xAB and xBC with latencies dAB and dBC.

With regard to the single-hop data forwarding links, the hop latencies dH_AAB, dH_ABB, dH_BBC and dH_BCC result accordingly from the sum of the intrinsic node latency dSRX and the trans- 15 mission latency via the direct data forwarding links x. Although the hop latencies in Fig. 2 are all depicted as having the same size, the problem with a known data network system 10 im- mediately arises that the variance in the intrinsic node latencies and transmission latencies makes implicit synchronization of the data network system 10 very complex.

20 This problem, however, is overcome by the synchronized data network system 10 according to the invention, as, for example, illustrated in Figs. 3A and 3B. Fig. 3A shows a detailed view from Fig. 2, where a delay in data forwarding according to a first exemplary embodiment takes place therein, with the section of Fig. 2 depicted in Fig. 3B representing a delay in data forwarding according to the second exemplary embodiment of the invention.

25

As depicted in Fig. 3A, the second data network node 110B is adapted to delay forwarding of the data on a single-hop data forwarding link XABB between the first and the third data net- work nodes 110A, 110C such that the hop latency dH_ABB is equal to a predetermined fixed common hop latency dCH. In this process, the single-hop data forwarding link corresponds to 30 a data forwarding link xABB which, starting on the transmitter side of the first data network node 110A, passes through the second data network node 110B via the direct data transmis- sion link xAB between the first and the second data network nodes 110A, 110B and ends on the transmitter side of the second data network node 110B.

22248878_1

In Fig. 3B, the second data network node 110B is adapted to delay forwarding of the data on a single-hop data forwarding link xBBC between the first and the third data network nodes 110A, 110C such that the hop latency dH_BBC is equal to a predetermined fixed common hop 5 latency dCH. In this process, the single-hop data forwarding link corresponds to a data for- warding link xBBC, which, starting on the receiver side of the second data network node 110B, passes through the second data network node 110B and ends, via the direct data transmis- sion link xBC between the second and the third data network nodes 110B, 110C, on the re- 2023312212

ceiver side of the third data network node 110C.

10

Even if both exemplary embodiments (a) (Fig. 3A) and (b) (Fig. 3B) are discussed for the sake of completeness, the first exemplary embodiment (a) is preferred, since a real imple- mentation of the second exemplary embodiment (b) is somewhat more difficult. In particular, in the second exemplary embodiment in Fig. 3B, outgoing locally generated packets must be 15 generated in the RX path of the second data network node 110B, time-stamped and delayed towards the transmission link TX of the second data network node 110B. This also delays any data transfers between neighboring nodes 110 that would not have to be delayed (see also paths IDP -> RDP_loc and IDP -> RDP_fwd_AC in Fig. 5).

20 In accordance with the invention, the intrinsic node latency dSRX_B is thus extended by a vari- able node latency dAX_ABB or dAX_BBC by means of a delay circuit in a forwarding data network node 110 such that, irrespective of the data transmission link latencies dAB or dBC and irre- spective of the intrinsic node latency dSRX_B in a forwarding hop through the second data net- work node 110B, the forwarding runtime or the forwarding latency or the single-hop data for- 25 warding latency dH_ABB or dH_BBC is always equal to a predetermined common hop latency dCH, no matter which data network node 110 or which associated direct data transmission link x of a selected single-hop data forwarding link is selected in the synchronized data network system 10 according to the invention.

30 Although the delay circuit in the second network node 110B and all other forwarding data network nodes 110 delays data transmission in the data network system 10 according to the

22248878_1 invention, this approach extremely simplifies synchronization of the entire data network sys- 25 Nov 2025 tem 10. This is illustrated in Fig. 4A for the first exemplary embodiment of the invention and in Fig. 4B for the second exemplary embodiment of the invention.

5 Thus, synchronization of the data network system 10 according to the invention can, for ex- ample, be achieved by using a master data network node 110M (Fig. 5) to synchronize corre- sponding slave data network nodes 110S of the data network system 10 with a master clock 2023312212

CLK_M (Fig. 5). For this purpose, the master data network node 110M is adapted to transmit synchronization data packets SDP with a master clock time stamp ttx to slave data network 10 nodes 110S at periodic intervals or on instruction by a user and to synchronize the slave clocks CLK_S of the slave data network nodes 110S with the master clock time of the master data network node 110M in accordance with the completed number of hops h of the synchro- nization data packet SDP between master data network nodes 110M and respective slave data network nodes 110S, as well as by means of the common hop latency period dCH ac- 15 cording to the formula tmaster = ttx + dCH * h.

Synchronization with this above simple formula is made possible by the fact that, as depicted in Figs. 4A and 4B, forwarding of a synchronization data packet SDP from the data network nodes 110A to 110D (Fig. 4A) or from the data network nodes 110B to 110E (Fig. 4B) has a 20 clearly defined time period from the master data network node 110M to a slave data network node 110S to be synchronized, namely the number of hops from the master data network node 110M to the respective slave data network node 110S times the predetermined fixed common hop latency dCH. The data transmission links xAB, xBC, xCD, xDE can be of various na- tures, where, in addition to a wired or cabled connection or a fiber optic connection, for ex- 25 ample, a cable-free or wireless radio connection for a direct data transmission link x is also possible. Furthermore, the intrinsic node latencies dSRX can also be different, since a hop la- tency is always adjusted or leveled to a predetermined common fixed hop latency dCH during data forwarding, irrespective of the selection of the data network node 110.

30 It is emphasized that although synchronization of the data network system 10 according to the invention by means of a master data network node 110M is preferred, synchronization can also occur in a decentralized data network system if several network nodes are equipped with clocks suitable as master clocks. For example, it is also conceivable that not only one master data network node 110M is provided, but that a plurality of data network nodes 110 or

22248878_1 even all of the data network nodes 110 can operate as a master data network node 110M, 25 Nov 2025 whereby the failure safety and redundancy of the synchronized data network system 10 ac- cording to the invention are maximized. In this case, only a corresponding coordination be- tween the data network nodes 110 needs to take place so that no two data network nodes 5 110 perform the master role at the same time.

By means of the synchronization method according to the invention, it is therefore possible to 2023312212

achieve synchronization of all the data network nodes in a simple manner by means of a hop latency that is the same for all the data network nodes and corresponding forwarding links 10 and is common for all connections in a closed network.

In Fig. 5, a block diagram of a data network node 110 according to the invention is depicted. In this case, for example, the second data network node 110B comprises a data transmitting unit TX, which is connected to a direct data transmission link x for transmitting data ODP to 15 other data network nodes 110, which are either locally generated data packets TDP_loc to be transmitted or forwarded data packets RDP_fwd to be transmitted. The second data net- work node 110B further comprises a data receiving unit RX, which is connected to a direct data transmission link x to receive data IDP from other data network nodes 110. As depicted in Fig. 5, the second data network node 110B further includes a latency matching unit LMU 20 which is adapted to calculate, by means of a stored specific hop latency dH_ABB, dH_BBC of the current single-hop data forwarding link xABB, xBBC and by means of the predetermined fixed common hop latency period dCH, a latency matching period dARX specific to the current single- hop data forwarding link xABB, xBBC. In case of forwarding data packets IDP from the data re- ceiving unit RX via the data transmitting unit TX to other data network nodes 110, the data 25 packet RDP_fwd (e.g., RDP_fwd_AC or RDP_fwd_CA) passes through a delay buffer CDB interposed between the data receiving unit RX and a data transmitting unit TX designated for forwarding in order to delay forwarding of data packets RDP_fwd_AC on the current single- hop data forwarding link xABB, xBBC by the specific latency matching period dARX received from the data latency matching unit LMU.

30

The structure of the latency matching unit LMU is depicted in Fig. 6A. The LMU has a timer for measuring a roundtrip latency dRT on a single-hop data forwarding link xABB, xBBC to be measured and a memory for storing the intrinsic node latency dSRX_B , the roundtrip latencies dRT of the single-hop data forwarding links xABB, xBBC of the second data network node 110B

22248878_1 and the predetermined fixed common hop latency dCH. Furthermore, the latency matching 25 Nov 2025 unit LMU has a calculation unit which is adapted to calculate the latency matching period dARX_ABB specific to a single-hop data forwarding link using the formula dARX= dCH - dRT/2 - dSRX_B.

5

As depicted in Fig. 5, a delay of the data packets only takes place if they are designated for forwarding, while, on the other hand, received data packets RDP_loc which are no synchro- 2023312212

nization data packets and are designated for local further processing in the corresponding second data network node 110B are not delayed. Thus, the configurable delay of data for- 10 warding is preferably provided on the receiver side of each node according to the first exem- plary embodiment, exclusively for packets which have not reached their destination address and which are forwarded to the data transmitting unit TX for forwarding from the data receiv- ing unit to the data transmitting unit. In this way, packets which are further processed locally can be sent promptly and directly to the end user without further delay, in contrast to an im- 15 plementation according to the second exemplary embodiment of the invention, in which a de- lay occurs on the transmitter side for the forwarding link to be covered until the next data net- work node 110.

As further depicted in Fig. 5, the second data network node 110B has either a master clock 20 CLK_M or a slave clock CLK_S, depending on whether the second data network node 110B operates as the master data network node 110M or the slave data network node 110S. In the case where the second data network node 110B operates as the slave data network node 110S, the slave clock CLK_S is synchronized with the master clock CLK_M of another mas- ter data network node 110M by a synchronization data packet SDP either without delay fol- 25 lowing receipt according to the second exemplary embodiment or after a delay by the delay buffers CDB according to the first exemplary embodiment. The second data network node 110B further includes a communication control unit LCU/CONFIG for controlling initialization and synchronization, wherein the communication control unit LCU/CONFIG comprises an ini- tialization control unit LCU that controls the initialization process of the data network nodes 30 110 and a synchronization control unit CONFIG that controls synchronization of the data net- work nodes 110.

22248878_1

In the following text, an initialization process of the synchronized data network system ac- 25 Nov 2025

cording to the invention and subsequently a synchronization process of the data network 10 according to the invention will be described.

5 During network initialization, all nodes in the network are prompted to independently deter- mine the latencies on all the data transmission links to their neighboring nodes in the net- work. In this process, the data network node interface implementation must be symmetrical 2023312212

or have a known asymmetry that is taken into account by the neighboring nodes. Thus, the hop latency can be correctly derived from a roundtrip latency measurement. Before initializa- 10 tion of the network is completed, each individual node is then prompted to insert an addi- tional delay or a specific latency matching period dARX into the data receiving path associated with all the data transmission links and connections to the neighboring node, so that the re- sulting hop latency on all these connection links corresponds to a configurable common value for the entire network, this value being determined from all the single-hop data forward- 15 ing latencies before the network is commissioned. This value is the predetermined fixed com- mon hop latency dCH or the common deterministic hop latency dCH.

At this point, it should be emphasized that initialization of the network is completely decen- tralized and the distinction between slave data network nodes 110S and master data network 20 nodes 110M is initially irrelevant, since the subsequent master data network node 110M as the slave data network node 110S also initially undergoes the same initialization process as all the other data network nodes 110. This means that all the nodes determine the roundtrip latency to their neighbors as part of the network initialization (generating requests, receiving responses, as well as receiving requests and generating responses). There are no roles 25 here, and all nodes are equal. As soon as each node has determined the necessary infor- mation, the target latency is set and the initialization phase ends. The uniform hop latency then enables implicit time synchronization simply because the defined master communicates regularly with all the other nodes (unidirectional, no response required).

30 In detail, from the perspective of the second data network node 110B in its role as the slave data network node 110S, the initialization proceeds as follows in an exemplary probing of the single-hop data forwarding link to its neighboring node 110A, as illustrated in Figs. 6A and 6B.

22248878_1

Thus, the initialization control unit LCU prompts the second data network node 110B as the slave data network node 110S to perform the following steps during an initialization process of the synchronized data network system 10. First, a roundtrip measurement request RTMR 5 is sent from the communication control unit LCU to the data transmitting unit TX. Then, the data transmitting unit TX transmits a roundtrip signal or a ping signal to a data receiving unit RX of a corresponding receiving data network node 110A via a corresponding direct data transmission link x, in this case xAB, of the exemplary single-hop data forwarding link xABB to 2023312212

be measured in case of an implementation of the first exemplary embodiment of the inven- 10 tion. When the roundtrip signal is transmitted, the timer of the latency matching unit LMU is simultaneously started by the latency matching unit LMU. The roundtrip signal or ping signal transmitted to the data network node 110A is received by the data receiving unit RX of the data network node 110A and is sent back again directly to the receiving unit RX of the sec- ond data network node 110B by means of a measurement request response MRR (Fig. 6B) 15 via the data transmitting unit TX of the data network node 110A. As soon as the data receiv- ing unit RX has received the roundtrip signal sent back from the corresponding first data net- work node 110A via the corresponding direct data transmission link xAB, the timer is stopped by the latency matching unit LMU upon receipt of this roundtrip signal sent back.

20 After reading the roundtrip latency dRT from the timer of the latency matching unit LMU, the latency matching unit LMU calculates the specific hop latency dH_ABB of the single-hop data forwarding link xABB to be measured in the example of Fig. 6A and Fig. 6B by adding the in- trinsic node latency dSRX_B to half the roundtrip latency dRT. The intrinsic node latency dSRX_B can be ascertained by the second data network node 110B itself by internally measuring an 25 internal forwarding latency of data packets from the data receiving unit RX to the data trans- mitting unit TX. This intrinsic node latency value can also be measured when the participat- ing data network node is established and stored or saved in the memory of the latency matching unit LMU.

30 Since the second data network node 110B must measure any and all single-hop data for- warding links xXBB, xBBY according to the first or second exemplary embodiment for complete initialization of the initialized data network system 10, the initialization process described above is repeated until the second data network node 110B has measured any and all sin- gle-hop data forwarding links to data network nodes 110 directly connected to it.

22248878_1

In case that a "worst case" hop latency is already ascertained during the verification phase of the platform, this is then made known as a predetermined common hop latency dCH to each data network node 110 as a configuration.

5

However, it is also possible for the network to dynamically ascertain the common hop latency dCH itself in order to optimize the overall latency. In this case, this can, for example, be done 2023312212

via a master data network node 110M, but an external reader can also be used that is con- nected once to the network during initialization in order to read out all the ascertained hop la- 10 tencies dH_XZZ, dH_ZZY of all the single-hop data forwarding links xXZZ, xZZY of all the data net- work nodes 110 to be measured.

In principle, however, there is no exchange of the ascertained hop latencies between the nodes and there are no master/slave roles in this respect. Each node is solely responsible for 15 determining the roundtrip latency to the neighboring node and calculating the necessary de- lay therefrom to adapt, in terms of time, the forwarding paths through the local node to a tar- get latency established in the system in advance.

Following the complete measurement of all the single-hop data forwarding links and the as- 20 sociated hop latencies dH_XBB, dH_BBY of all the single-hop data forwarding links xXBB, xBBY to be measured, the ascertained hop latencies can be transmitted to the master data network node 110M in case that the master data network node 110M is designated for determining the common hop latency dCH.

25 Thus, in case that the second data network node 110B operates as such a master data net- work node 110M, the initialization unit LCU prompts the second data network node 110B as the master data network node 110M to perform the following steps. Thus, the second data network node 100B receives, from the slave data network nodes 110S, the respectively as- certained hop latencies dH_XZZ, dH_ZZY of the single-hop data forwarding links xXZZ, xZZY of all 30 the slave data network nodes 110S to be measured. Since the master data network node 110M is aware of any and all hop latencies of all the single-hop data forwarding links of all the slave data network nodes to be measured, the master data network node 110M specifies

22248878_1 a common hop latency dCH from the hop latencies transmitted. The master data network 25 Nov 2025 node 110M is relatively free in the type of specification; the only condition that applies is that the predetermined fixed common hop latency dCH is equal to the largest or greater than all the transmitted hop latencies dH_XZZ, dH_ZZY, since otherwise at least one transmitted hop la- 5 tency would be greater than the fixed common hop latency dCH and thus synchronization in the sense of the invention would not be possible. 2023312212

In addition to the fact that the common hop latency dCH must be greater than all the hop la- tencies of all the single-hop data forwarding links in the network 10, it is further advanta- 10 geous if the difference in time period between the specified common hop latency dCH and the hop latencies with the longest time period transmitted by the slave data network node 110S is chosen to be as small as possible in order not to unnecessarily delay the data traffic within the synchronized data network system 10 by an unnecessarily large common hop latency dCH. Thus, a typical hop latency period in an avionics data network system 10 according to 15 the invention is in the range of 350ns, where, for example, a specified common hop latency dCH of 500ns would be an acceptable value for the common hop latency. It should be empha- sized that the figures mentioned are only orders of magnitude, since only a small part of the latency is caused by cable lengths. The majority of latencies is introduced by the transceivers and through implementation of the network interface of the nodes.

20

In a practical implementation of the ascertainment of the fixed common hop latency dCH, the fixed common hop latency dCH can therefore correspond to a time period that is equal to a hop latency dH_XZZ, dH_ZZY with the longest time period scaled with a safety factor greater than 1 or with a safety offset. For example, the safety factor can correspond to a value greater 25 than 1 and less than 1.5, less than 1.4, less than 1.3, less than 1.2 or less than 1.1, or less than 1.05. The safety offset can lie in a range between 100ns and 200ns. It should be noted at this point that the cable lengths, as described above, only account for a small proportion of the overall latency for data transmission in the network 10 on the data transmission links x. The required range depends on the runtime variations (minimum) and the resources used for 30 delay buffers (maximum). In any case, the additive latency is usually low compared to the la- tencies that have already incurred due to transceivers and cable lengths. It is important to note that the cable length has much less influence on short transmission links (e.g., less than 10m) than the structure of the interface and the transceivers in the nodes themselves. In a prototype implementation, total latencies of approx. 300ns were measured for a transmission 35 link with 3m connection cables, of which approx. 5ns/m are attributable to the optical fiber.

22248878_1

In any case, the offset should be dimensioned such that the system does not have to be completely reconfigured and initialized again if the system is modified or if an additional cable section of 10cm to 50cm is inserted. The larger the offset selected, the more robust the data 5 network system 10 is in the event of a change in components with regard to their latencies. It should also be emphasized here that discrete values make little sense in this case. The larger the safety offset, the greater changes in length are possible, provided that the runtime variation is known. 2023312212

10 The safety offset therefore only specifies the maximum compensation possibility, but this does not mean that this must always be exhausted. Rather, it depends on the target network. Even in a system that can variably add node delays of up to 1s, it is still possible to work with a maximum offset of 5ns, as all the nodes have a very low delay that is so determined before commissioning and is then, naturally, also set as the target latency. It should not be possible 15 to dynamically optimize a network after the system has changed, for example. If there are any changes in the system, then the common target latency must be ascertained anew and transmitted to all the nodes.

After, as depicted in Fig. 5, the second data network node 110B as the master data network 20 node 110M has received any and all hop latencies dH_XZZ, dH_ZZY of the single-hop forwarding links of all the slave data network nodes 110S to be measured and has determined a com- mon hop latency dCH, the specified common hop latency dCH is transmitted to all the slave data network nodes 110S, which then store the value dCH in a memory of the latency match- ing unit LMU, after it has been transmitted to them by the communication control unit 25 LCU/CONFIG.

Since the latency matching unit LMU has now stored any and all important latencies in the forwarding of data packets, namely the intrinsic node latency dSRX_B, the common hop latency dCH and for each relevant single-hop forwarding link in which the second data network node 30 110B can be involved, the latency matching unit LMU can now, depending on the data for- warding link, calculate a corresponding matching period dARX specific to the single-hop data forwarding link and transmit it to the delay buffer CDB, which then delays data packets RDP_fwd accordingly. In this process, the delay buffer CDB can be a normal FIFO buffer

22248878_1

(first-in-first-out buffer), which buffers data briefly and reads it out again and forwards it after 25 Nov 2025

a predetermined delay period. In addition, the latency matching unit LMU is in a data connec- tion with the communication control unit LCU/CONFIG in order to communicate its latency matching status LMS to the LCU/CONFIG.

5

In the following text, a synchronization process of the synchronized data network system 10 according to the invention is to be described. 2023312212

Since, after the initialization process, the data forwarding latency on arbitrary routes through 10 the network is now an integer multiple of the specified common deterministic hop latency dCH, this situation can be exploited to perform an extremely simplified synchronization procedure of the local time of all the nodes in the network with a local time of a specific master node with a master clock CLK_M. In this process, synchronization occurs implicitly by a periodic transmission of packets from the timing master node to all the other nodes, selecting arbi- 15 trary routes through the network. These packets can carry a time stamp that reflects the local time at the timing master node that is immediately current at the start of the transmission (time stamp ttx). In addition, these data packets or synchronization data packets SDP can in- clude a unique identifier of the timing master node as the sender address (node ID) and can, moreover, indicate how many hops (#hop) have been performed on the current route through 20 the network to the node that is currently receiving the packet.

Based on the synchronization data packets SDP transmitted by the timing master node, the current local time at the timing master node when such a synchronization data packet arrives at the node is equal to the time stamp ttx included in the synchronization data packet SDP 25 plus the number of hops h times the specified common deterministic hop latency dCH:

Tmaster = ttx + dCH * h.

This method according to the invention is an implicit synchronization method, where no spe- 30 cific protocol needs to be implemented in order to implement the time between a timing mas- ter and a slave node in a network, since synchronization can occur implicitly for any type of

22248878_1 communication between the timing master and the slave node if it takes place at periodic in- 25 Nov 2025 tervals or recurrently within a certain time window. For example, the data packet SDP can be dedicated to synchronization of the entire data network on one hand, but it is also conceiva- ble that the synchronization data packet information containing the time stamp, the number 5 of hops and the node ID of the master data network node 110M is inserted into the header at periodic intervals or recurrently within a specific time window for normal data packets to cor- responding slave data network nodes 110S. The repetition period of periodic transmission of the synchronization data packet SDP can be selected in accordance with the accuracy re- 2023312212 quirements, the drift of the slave clocks over time and other factors.

10

Dedicated synchronization data packets are therefore only required if there is no regular or recurring communication between the timing master and the other nodes in the network within a certain time window anyway. Synchronization occurs implicitly via arbitrary data packets, as the information required for synchronization is embedded in each packet header. 15 Of course, these fields are only relevant if the source node corresponds to the timing master. A synchronization data packet SDP is then nothing more than a normal packet, which does not necessarily have to transport data.

Each node uses the currently valid local time as the TX time stamp ttx for all packets that it 20 generates. This is not affected in case of forwarding by subsequent nodes, only the hop count h is increased. Each node is potentially capable of taking on the role of the timing mas- ter. This is configured firmly in advance without any particular effect on the transmission be- havior of the nodes. Only during reception it is important that synchronization information is only taken from packets that originate from the timing master (TX ID = master). This greatly 25 abstracts the process of time synchronization and no special control is required, apart from specifying the roles in advance and ensuring that the application layer schedules network traffic between the timing master and all other nodes at regular intervals, which then implicitly ensures time synchronization in the network. Synchronization information comprises the combination of TX time stamp ttx, hop count h, and the TX ID, all of which can be transported 30 as part of the packet header (fields), for example, as well as the common deterministic hop latency period dCH stored locally at each node. In detail, the synchronization control unit CONFIG prompts the second data network node 110B, if it is operating as a slave data net- work node 110S, to perform the following steps.

22248878_1

Thus, it receives synchronization data packets SDP with a master clock time stamp ttx from a 25 Nov 2025

master data network node 110M with the master clock CLK_M. Then, as depicted in Fig. 5, after the synchronization data packet has been received by the data receiving unit RX, either a delay of the synchronization data packet SDP (path (a) in Fig. 5) occurs when the single- 5 hop data forwarding link is defined according to the first exemplary embodiment or as de- picted in Figs. 3A or 4A. In case that the single-hop forwarding link is defined according to the second exemplary embodiment, i.e., as depicted in Figs. 3B and 4B, no delay by the de- lay buffers CDB need occur (path (b) in Fig. 5), since the specific latency matching period 2023312212

dARX has already been added up by the preceding transmitting data network node 110 for the 10 input transmission link x. The slave clock CLK_S of the second data network node 110B or 110S is then synchronized by means of control by the communication control unit LCU/CON- FIG. The slave clock CLK_S of the second data network node 110B is thus synchronized with the master clock time in accordance with the completed number of hops h of the syn- chronization data packet SDP between master data network nodes 110M and the second 15 data network node 110B, as well as by means of the common deterministic hop latency pe- riod dCH according to the formula tmaster = ttx + dCH * h.

In case that the second data network node 110B operates as the master data network node 110M, the synchronization control unit CONFIG prompts it to perform the following steps. 20 Thus, the synchronization control unit CONFIG ensures that, at a time ttx, synchronization data packets SDP with a master clock time stamp ttx are transmitted to the slave data net- work nodes 110S, whereas the synchronization data packet SDP can include the number of hops h and an identifier ID_M of the master data network node 110M in addition to the mas- ter clock time stamp ttx.

25

In accordance with the invention, a method for initializing a synchronized data network sys- tem 10 is also provided that includes the following steps, as depicted in Fig. 7. Thus, in step S210, a roundtrip measurement command RTMR is transmitted from a communication con- trol unit LCU of a slave data network node 110S to the data transmitting unit TX of the slave 30 data network node 110S. In step S220, the data transmitting unit TX of the slave data net- work node 110S transmits a roundtrip signal or ping signal to a data receiving unit RX of a corresponding additional slave data network node 110S via a corresponding direct data transmission link x of a single-hop data forwarding link xXBB, xBBY to be measured.

22248878_1

In this process, in step S230, a timer of the slave data network node 110S is started upon 25 Nov 2025

transmission of the roundtrip signal by a latency matching unit LMU of the slave data network node 110S. After receiving (step S240) the roundtrip signal sent back from the corresponding additional slave data network node 110S by the data receiving unit RX of the slave data net- 5 work node 110S via the corresponding direct data transmission link x, the timer is stopped, in step S250, by the latency matching unit LMU of the slave data network node 110S upon re- ceipt of the roundtrip signal sent back. In step S260, the roundtrip latency dRT is read from the timer of the slave data network node 110S, and, in step S270, the specific hop latency 2023312212

dH_XBB, dH_BBY of the single-hop data forwarding link xXBB, xBBY to be measured is calculated by 10 adding the intrinsic node latency dSRX_B to half the roundtrip latency dRT. After repeating the steps (S280) for all the single-hop data forwarding links xXBB, xBBY to be measured, the ascer- tained hop latencies dH_XBB, dH_BBY of all the single-hop data forwarding links xXBB, xBBY to be measured are stored (S290).

15 Optionally, if the common hop latency from all the ascertained hop latencies of all the single- hop data forwarding links to be measured is specified by a master data network node 110M during initialization, the following additional steps can be performed: In step S2100, the as- certained hop latencies dH_XBB, dH_BBY of all the single-hop data forwarding links xXBB, xBBY to be measured are transmitted to the master data network node 110M. After the master data 20 network node 110M, in step S2110, has received the respectively ascertained hop latencies dH_XZZ, dH_ZZY of the single-hop data forwarding links xXZZ, xZZY of all the slave data network nodes 110S to be measured, the latter specifies, in step S2120, the common hop latency dCH from the transmitted hop latencies dH_XZZ, dH_ZZY, with the predetermined fixed common hop latency dCH being greater than all the transmitted hop latencies dH_XZZ, dH_ZZY.

25

Fig. 8 further illustrates the method provided by the invention for synchronizing a synchro- nized data network system 10 with at least one master data network node 110M and slave data network nodes 110S, said method including the following steps:

30 Thus, in step S310, synchronization data packets SDP with a master clock time stamp ttx are transmitted by the master data network node 110M to the slave data network nodes 110S at a time ttx. In step S320, the slave data network nodes 110S receive synchronization data packets SDP with a master clock time stamp ttx sent by the master data network node 110M with a master clock CLK_M. Having received a synchronization data packet SDP, the slave

22248878_1 clock CLK_S of the slave data network node 110S is then, in step S330, synchronized with 25 Nov 2025 the master clock time in accordance with the completed number of hops h of the synchroni- zation data packet SDP between master data network nodes 110M and slave data network nodes 110S, as well as by means of the common deterministic hop latency period dCH ac- 5 cording to the formula tmaster = ttx + dCH* h.

In accordance with the invention, a synchronized data network system 10, a master data net- 2023312212

work node 110M and a slave data network node 110S are also provided that are adapted to carry out the above initialization or synchronization methods according to the invention.

10 In the claims which follow and in the preceding description of the disclosure, except where the context requires otherwise due to express language or necessary implication, the word “comprise” or variations such as “comprises” or “comprising” is used in an inclusive sense, i.e. to specify the presence of the stated features but not to preclude the presence or addition of further features in various embodiments of the disclosure.

15

22248878_1

Claims (15)

Claims 25 Nov 2025

1. A synchronized data network system, comprising: - a data network that connects data network nodes to one another via direct bidirec- 5 tional data transmission links between neighboring data network nodes for an exchange of data; - a node chain of the data network nodes consisting of successive first, second and third data network nodes, wherein the second data network node is adapted to receive data 2023312212

transmitted on a first direct data transmission link (xAB) between the first and the second data 10 network nodes from the first data network node on a data forwarding link (xABBC) and to for- ward said data in transmit mode to the third data network node on a second direct data trans- mission link (xBC) between the second and the third data network nodes, wherein the second data network node is adapted to delay forwarding of the data on a single- 15 hop data forwarding link (xABB, xBBC) between the first and the third data network nodes such that the hop latency (dH_ABB, dH_BBC) is equal to a hop latency (dCH), which is identical, prede- termined, fixed and common for all data network nodes of the data network system that for- ward data between data network nodes of the data network system and which is not depend- ent on network-specific or node-specific latencies. 20

2. The synchronized data network system according to claim 1, further comprising: - a master data network node with a master clock (CLK_M) that is adapted to transmit synchronization data packets (SDP) with a master clock time stamp ttx to slave data network nodes and to synchronize the slave clocks (CLK_S) of the slave data network nodes with the 25 master clock time in accordance with the completed number of hops h of the synchronization data packet (SDP) between master data network nodes and the respective slave data net- work node, as well as by means of the common hop latency period dCH according to the for- mula tmaster = ttx + dCH * h.

30

3. The synchronized data network system according to claim 1 or 2, wherein the single- hop data forwarding link (xABB, xBBC) corresponds to a data forwarding link (xABB), which, start- ing on the transmitter side of the first data network node, passes through the second data

22248878_1 network node via the direct data transmission link (xAB) between the first and the second data 25 Nov 2025 network nodes and ends on the transmitter side of the second data network node.

4. The synchronized data network system according to claim 1 or 2, wherein the single- 5 hop data forwarding link (xABB, xBBC) corresponds to a data forwarding link (xBBC), which, start- ing on the receiver side of the second data network node, passes through the second data network node and ends, via the direct data transmission link (xBC) between the second and 2023312212

the third data network nodes, on the receiver side of the third data network node.

10

5. The synchronized data network system according to any one of the preceding claims, wherein the second data network node comprises: - a data transmitting unit (TX) which is connected to a direct data transmission link (x) in order to transmit data (ODP) to other data network nodes; - a data receiving unit (RX) which is connected to a direct data transmission link (x) in 15 order to receive data (IDP) from other data network nodes; - a latency matching unit (LMU) which is adapted to calculate, by means of a stored specific hop latency (dH_ABB, dH_BBC) of the current single-hop data forwarding link (xABB, xBBC) and by means of the predetermined fixed common hop latency period (dCH), a latency match- ing period (dARX) specific to the current single-hop data forwarding link (xABB, xBBC); and 20 - a delay buffer (CDB) that is interposed between the data receiving unit (RX) and the data transmitting unit (TX) to delay forwarding of data packets (RDP_fwd) on the current sin- gle-hop data forwarding link (xABB, xBBC) by the specific latency matching period (dARX) re- ceived from the latency matching unit (LMU).

25

6. The synchronized data network system according to claim 5, wherein the latency matching unit (LMU) comprises: - a timer for measuring a roundtrip latency (dRT) on a single-hop data forwarding link (xABB, xBBC) to be measured; - a memory for storing the intrinsic node latency (dSRX_B), the roundtrip latencies (dRT) of 30 the single-hop data forwarding links (xABB, xBBC) of the second data network node and the predetermined fixed common hop latency (dCH); and - a calculation unit which is adapted to calculate the latency matching period (dARX) us- ing the formula dARX = dCH - dRT/2- dSRX_B.

22248878_1

7. The synchronized data network system according to any one of the preceding claims, wherein the second data network node comprises a communication control unit (LCU/CON- FIG) for controlling initialization and synchronization, including: 5 - an initialization control unit (LCU) that controls the initialization process of the data network nodes; and - a synchronization control unit (CONFIG) that controls synchronization of the data net- 2023312212

work nodes.

10

8. The synchronized data network system according to claim 7, wherein the initialization control unit (LCU) prompts the second data network node as the slave data network node to perform the steps of: - transmitting a roundtrip measurement command (RTMR) from the communication control unit (LC) to the data transmitting unit (TX); 15 - transmitting, by the data transmitting unit (TX), a roundtrip signal or ping signal to a data receiving unit (RX) of a corresponding receiving data network node via a corresponding direct data transmission link (x) of a single-hop data forwarding link (xXBB, xBBY) to be meas- ured; - starting a timer by the latency matching unit (LMU) upon transmission of the roundtrip 20 signal; - receiving, by the data receiving unit (RX), the roundtrip signal sent back from the cor- responding data network node via the corresponding direct data transmission link (x); - stopping the timer by the latency matching unit (LMU) upon receipt of the roundtrip signal sent back; 25 - reading the roundtrip latency (dRT) from the timer; - calculating the specific hop latency (dH_XBB, dH_BBY) of the single-hop data forwarding link (xXBB, xBBY) to be measured by adding the intrinsic node latency (dSRX_B) to half the round- trip latency (dRT); - repeating the steps for all the single-hop data forwarding links (xXBB, xBBY) to be meas- 30 ured; and - storing the ascertained hop latencies (dH_XBB, dH_BBY) of all the single-hop data for- warding links (xXBB, xBBY) to be measured.

22248878_1

9. The synchronized data network system according to claim 7, wherein the synchroni- 25 Nov 2025

zation control unit (CONFIG) prompts the second data network node as the slave data net- work node to perform the steps of: - receiving, from a master data network node with a master clock (CLK_M), synchroni- 5 zation data packets (SDP) with a master clock time stamp ttx; and - synchronizing the slave clock (CLK_S) of the second data network node with the master clock time in accordance with the completed number of hops h of the synchronization 2023312212

data packet (DLP) between master data network nodes and the second data network node, as well as by means of the common deterministic hop latency period dCH according to the for- 10 mula tmaster = ttx + dCH * h.

10. The synchronized data network system according to claim 7, wherein the synchroni- zation control unit (CONFIG) prompts the second data network node as the master data net- work node to perform the steps of: 15 - transmitting, at a time ttx, synchronization data packets (SDP) with a master clock time stamp ttx to the slave data network nodes.

11. The synchronized data network system according to claim 9 or 10, wherein the syn- chronization data packet (SDP), in addition to the master clock time stamp (ttx), includes the 20 number of hops (h) and an identifier (ID_M) of the master data network node.

12. The synchronized data network system according to any one of the preceding claims, wherein it is an avionics system data network for deterministic communication between the data network nodes. 25

13. A method for initializing a synchronized data network system, comprising the steps of: - transmitting a roundtrip measurement command (RTMR) from a communication con- trol unit (LC) of a slave data network node to the data transmitting unit (TX) of the slave data network node; 30 - transmitting, by the data transmitting unit (TX) of the slave data network node, a roundtrip signal or ping signal to a data receiving unit (RX) of a corresponding additional slave data network node via a corresponding direct data transmission link (x) of a single-hop data forwarding link (xXBB, xBBY) to be measured;

22248878_1

- starting a timer of the slave data network node upon transmission of the roundtrip sig- 25 Nov 2025

nal by a latency matching unit (LMU) of the slave data network node; - receiving, by the data receiving unit (RX) of the slave data network node, the round- trip signal sent back from the corresponding additional slave data network node via the corre- 5 sponding direct data transmission link (x); - stopping the timer by the latency matching unit (LMU) of the slave data network node upon receipt of the roundtrip signal sent back; 2023312212

- reading the roundtrip latency (dRT) from the timer of the slave data network node; - calculating the specific hop latency (dH_XBB, dH_BBY) of the single-hop data forwarding 10 link (xXBB, xBBY) to be measured by adding the intrinsic node latency (dSRX_B) to half the round- trip latency (dRT); - repeating the steps for all the single-hop data forwarding links (xXBB, xBBY) to be meas- ured; - storing the ascertained hop latencies (dH_XBB, dH_BBY) of all the single-hop data for- 15 warding links (xXBB, xBBY) to be measured; and - delaying forwarding of data on the single-hop data forwarding links (xXBB, xBBY) such that the hop latency (dH_XBB, dH_BBY) becomes equal to a hop latency (dCH), which is identical, predetermined, fixed and common for all data network nodes of the data network system that forward data between data network nodes of the data network system, and which is not de- 20 pendent on network-specific or node-specific latencies.

14. A method for synchronizing a synchronized data network system comprising at least one master data network node and slave data network nodes, comprising the steps of: - transmitting, through the master data network node at a time ttx, synchronization data 25 packets (SDP) with a master clock time stamp ttx to the slave data network nodes, - receiving, through the slave data network nodes, synchronization data packets (SDP) with a master clock time stamp ttx from the master data network node with a master clock (CLK_M), - synchronizing the slave clock (CLK_S) of the slave data network node with the mas- 30 ter clock time in accordance with the completed number of hops h of the synchronization data packet (SDP) between master data network nodes and slave data network nodes, as well as by means of a hop latency dCH, which is identical, predetermined, fixed and common

22248878_1 for all data network nodes of the data network system that forward data between data net- 25 Nov 2025 work nodes of the data network system and which is not dependent on network-specific or node-specific latencies, according to the formula tmaster = ttx + dCH * h.

5

15. A synchronized data network system comprising at least one master data network node and slave data network nodes, which is adapted to carry out the methods according to claim 13 or 14. 2023312212

22248878_1

Fig. 1

dH

110

110 dRT

110A XAB 110B

XAD 100 XBC

110D XCD 110C

110

Fig. 2 10 100 110

XAB XBC 110A - XBC 110C 110B XBA XCB

XAAB

XABB

XBBC

XBCC

XABBC

SRX_A dAB dsrx_B dBC dsRx_c

dH AAB

dH ABB

dH BBC

dH BCC

Fig. 3A 10

110A XAB 110B

XABB

I

dAB dsRX_B + darx ABB

dH ABB = dch

Fig. 3B 10

110B XBC 110C

XBBC

I

dsRX_B + dARX_BBC dBC

dH_BBC = dch

Fig. 4A 10

110A

XAB

dch dsRX_B 110B

+ darx ABB

XBC

* dsRX_C N d CH 110C dch

+ ARX_BCC

XCD XCD

dSRX_D 110D dch

+ ARX_CDD

Fig. 4B 10

XAB

dSRX_B 110B

+ ARX_BBC dch

XBC

* dsRX_C N d CH 110C

dch + dARX_CCD

XCD

110D dsRX_D

dch + darx_DDE

XDE

110E

PCT/EP2023/070018 6/10

110B / 110M / 110S Fig. 5

TDP_loc/ X RDP_fwd_CA TX ODP

SDP

RTMR LCU/CONFIG dH_XZZ / d H ZZY

dch

CLK CLK

dch CLK CLK_M CLK_S CLK_M CLK_S LMS SDP SDP LMU (a) (b)

dARX

RDP_fwd_AC X TX RX IDP CDB

RDP_loc RDP_loc

Fig. 6A

110B dch dsrx_B LMU dch

/2 LMS LCU - dRT

RTMR Timer START

TXD TX 110A

dARX_ABB STOP

RXD CDB RXD RX 110A

darx_ABB dsRX_B

Fig. 6B

110A

110B RX CDB RXD

MRR

110B TX TXD

LCU LMU

dsrx_A

Fig. 7 200

S210

S220

S230 S280

S240 S290

S250

S2100

S260

S2110

S270

S2120

Fig. 8

300

S310

S320

S330