Method to improve availability of real-time computer networks

10601609 · 2020-03-24

Assignee

Inventors

Cpc classification

International classification

Abstract

A method for transmitting real-time messages in a computer network (100), in particular real-time computer network, wherein said network comprises two or more computing nodes (21, 22, 23, 24, 25, 26) and one or more star couplers (1, 2, 3, 4), wherein said nodes are interconnected via at least one star coupler, wherein each node is connected to at least one star coupler via at least one of the communication links (50), and wherein the nodes exchange messages (M1, M2) with one another and with the at least one star coupler, and wherein star couplers, which are synchronized to a global time base (C), transmit a first non-empty set (SSET) of real-time messages according to a synchronized communication paradigm, and/or wherein computing nodes, which are synchronized to the global time base, transmit said first non-empty set of real-time messages according to the synchronized communication paradigm, wherein a star coupler, which is not synchronized to a global time base, and/or a computing node, which is not synchronized to a global time base, transmits a second non-empty subset (CSET) of said first non-empty subset of real-time messages according to an unsynchronized communication paradigm and stops the transmission of said second non-empty subset of real-time messages according to the synchronized communication paradigm.

Claims

1. A method for transmitting real-time messages in a real-time computer network, wherein the real-time computer network comprises two or more computing nodes (21, 22, 23, 24, 25, 26) and one or more star couplers (1, 2, 3, 4), wherein the two or more computing nodes (21, 22, 23, 24, 25, 26) are interconnected via at least one star coupler (1, 2, 3, 4), wherein each computing node (21, 22, 23, 24, 25, 26) is connected to the at least one star coupler (1, 2, 3, 4) via at least one communication link (50), and wherein the two or more computing nodes exchange messages (M1, M2) with one another and with the at least one star coupler, and wherein star couplers, which are synchronized to a global time base (C), transmit a first non-empty set (SSET) of real-time messages according to a synchronized communication paradigm, and/or wherein computing nodes (21, 22, 23, 24, 25, 26), which are synchronized to a or the global time base (C), transmit said first non-empty set of real-time (SSET) messages according to a or the synchronized communication paradigm, wherein: a star coupler (1, 2, 3, 4), which is not synchronized to a global time base (C), and/or a computing node (21, 22, 23, 24, 25, 26), which is not synchronized to a global time base (C), starts the transmission of a second non-empty subset (CSET) of said first non-empty subset (SSET) of real-time messages according to an unsynchronized communication paradigm and stops the transmission of said second non-empty subset (CSET) of real-time messages according to the synchronized communication paradigm.

2. The method according to claim 1, wherein real-time messages are characterized by message types (T), wherein said message types are uniquely identified by unique identifiers, with a unique combination of bits in the header of said real-time message.

3. The method according to claim 2, wherein a star coupler changes the type (T1, T2) of a received message (M1, M2) belonging to said second subset (CSET) of messages to a predefined message types (T20), before transmitting said real-time messages, according to a predefined mapping, if said at least one star coupler is not synchronized to a global time base (C).

4. The method according to claim 3, wherein a unique subset of said predefined message types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n) is assigned to each star coupler, and to each computing node, and wherein each of said star couplers (1, 2, 3, 4) and each of said computing nodes (21, 22, 23, 24, 25, 26), to which a unique subset is assigned changes the type of received messages to said predefined message types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n), preferably according to a predefined mapping (MAP).

5. The method according to claim 4, wherein star couplers and computing nodes have knowledge of said predefined mapping (MAP) for other star couplers in the network (1, 2, 3, 4) and computing nodes (21, 22, 23, 24, 25, 26) and use this knowledge to detect which star couplers and/or computing nodes have changed the type of the message to one of said types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n) and thus has lost the synchronization to the global time base.

6. The method according to claim 1, wherein the synchronized communication paradigm is realized using: the time-triggered traffic class in TTEthernet standard, in accordance with an IEEE 802.3 standard or a standard based thereon or following on therefrom, and/or the IEEE 802.1Qbv standard.

7. The method according to claim 1, wherein the unsynchronized communication paradigm is realized using: IEEE 802.1Qav standard, and/or Avionics Full-Duplex Switched Ethernet (AFDX) standard, and/or non-bounded traffic defined in IEEE 802.3 standard.

8. A real-time computer network for transmitting real-time messages, comprising: two or more computing nodes (21, 22, 23, 24, 25, 26); and one or more star couplers (1, 2, 3, 4), wherein the computing nodes (21, 22, 23, 24, 25, 26) are interconnected via at least one star coupler (1, 2, 3, 4), wherein each computing node (21, 22, 23, 24, 25, 26) is connected to at least one star coupler (1, 2, 3, 4) via at least one communication link (50), and wherein the computing nodes are configured to exchange messages (M1, M2) with one another and with the at least one star coupler, wherein the star couplers are configured such that a star coupler which is synchronized to a global time base (C), transmits a first non-empty set (SSET) of real-time messages according to a synchronized communication paradigm, and/or wherein the computing nodes (21, 22, 23, 24, 25, 26) are configured such that a computing node which is synchronized to a or the global time base (C) transmits said first non-empty set of real-time (SSET) messages according to a or the synchronized communication paradigm, wherein: the star couplers are configured such that a star coupler (1, 2, 3, 4), which is not synchronized to a global time base (C), starts the transmission of a second non-empty subset (CSET) of said first non-empty subset (SSET) of real-time messages according to an unsynchronized communication paradigm and stops the transmission of said second non-empty subset (CSET) of real-time messages according to the synchronized communication paradigm, and/or the computing nodes are configured such that a computing node (21, 22, 23, 24, 25, 26), which is not synchronized to a global time base (C), starts the transmission of a second non-empty subset (CSET) of said first non-empty subset (SSET) of real-time messages according to an or the unsynchronized communication paradigm and stops the transmission of said second non-empty subset (CSET) of real-time messages according to the synchronized communication paradigm.

9. The network according to claim 8, wherein real-time messages are characterized by message types (T), wherein said message types are uniquely identified by unique identifiers, with a unique combination of bits in the header of said real-time message.

10. The network according to claim 9, wherein the star coupler is configured to change the type (T1, T2) of a received message (M1, M2) belonging to said second subset (CSET) of messages to a predefined message types (T20), before transmitting said real-time messages, according to a predefined mapping, if said at least one star coupler is not synchronized to a global time base (C).

11. The network according to claim 10, wherein a unique subset of said predefined message types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n) is assigned to each star coupler, and to each computing node, and wherein each of said star couplers (1, 2, 3, 4) and each of said computing nodes (21, 22, 23, 24, 25, 26), to which a unique subset is assigned is configured to change the type of received messages to said predefined message types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n), according to a predefined mapping (MAP).

12. The network according to claim 11, wherein star couplers and computing nodes have knowledge of said predefined mapping (MAP) for other star couplers in the network (1, 2, 3, 4) and computing nodes (21, 22, 23, 24, 25, 26) and are configured to use this knowledge to detect which star couplers and/or computing nodes have changed the type of the message to one of said types (T101, T102, T1 . . . n, T201, T202, T2 . . . n, Tk01, Tk02, Tk0n) and thus has lost the synchronization to the global time base.

13. The network according to claim 8, wherein the synchronized communication paradigm is realized using the time-triggered traffic class in TTEthernet standard, in accordance with an IEEE 802.3 standard or a standard based thereon or following on therefrom, and/or using the IEEE 802.1Qbv standard.

14. The network according to claim 8, wherein the unsynchronized communication paradigm is realized using IEEE 802.1Qav standard, and/or using Avionics Full-Duplex Switched Ethernet (AFDX) standard, and/or using non-bounded traffic defined in IEEE 802.3 standard.

Description

(1) In the following, in order to further demonstrate the present invention, illustrative and non-restrictive embodiments are discussed, as shown in the drawings, which show:

(2) FIG. 1 an example of the network related to this invention,

(3) FIG. 2 an example of the network related to this invention where some network nodes are not synchronized to the global time base,

(4) FIG. 3 sets of real-time messages,

(5) FIG. 4 an example of message transmissions,

(6) FIG. 5 an example of message transmissions with message types,

(7) FIG. 6 an example of message transmissions with message types, including the changing of massage types,

(8) FIG. 7 an example of message transmissions with message types, including the changing of massage types such that each network devices has assigned message types,

(9) FIG. 8 an example of a message frame, where a MAC header is used for identifying the message type,

(10) FIG. 9 an example of a message frame, where IP/UDP headers are used for identifying the message type,

(11) FIG. 10 an example of a message frame, where MAC and IP/UDP headers are used for identifying the message type,

(12) FIG. 11 an example of a mapping MAP of message types to network devices,

(13) FIG. 12 a (simplified) example of a switch schedule S based on Virtual Links, and

(14) FIG. 13 a (simplified) example of a switch schedule, similar to FIG. 12.

(15) FIG. 1 shows an example of a computer network 100 comprising four star couplers 1, 2, 3, 4 and six computing nodes 21, 22, 23, 24, 25, 26 connected via bidirectional communication links 50. Each star coupler and computing node comprises a local clock C. All local clocks C of said computing nodes and star couplers are synchronized to a global time base in this figure (represented in the figure by S).

(16) Message transfer in said network can occur, for example, using the time-triggered traffic class in TTEthernet standard, and/or the IEEE 802.1Qbv standard for synchronized communication and/or IEEE 802.1Qav standard, and/or Avionics Full-Duplex Switched Ethernet (AFDX) standard, and/or non-bounded traffic defined in IEEE 802.3 standard for unsynchronized communication.

(17) FIG. 2 shows an example of a computer network similar to the one shown in FIG. 1, where the clocks C of the star coupler 2 and the computing device 23 are not synchronized to the global time base. In this case, the star coupler 2 sends a subset of messages originally configured for synchronized communication paradigm using the unsynchronized communication paradigm.

(18) FIG. 3 depicts a set of messages to be transmitted over a network separated in three subsets: a subset BE of messages being sent using unsynchronized best effort paradigm without any bounds or guarantees, a subset USET of messages being sent using unsynchronized rate constrained paradigm (examples are messages UM1 and UM2), and a subset SSET of messages to be sent using synchronized communication paradigm (examples are message types SM1, SM2, SM3, SM4 and SM5). In the case of lost synchronization (as shown on the right side of the figure), messages belonging to the subset CSET (examples are messages SM3, SM4 and SM5) of the subset SSET originally configured to be transferred using synchronized communication paradigm are sent using unsynchronized communication paradigm (for example, said subset CSET comprises messages SM3, SM4 and SM5). Messages SM1 and SM2 are not sent at all in the case of lost synchronization. So in the case of lost synchronization, no messages are sent using synchronized communication paradigm (the subset of messages sent using synchronized communication paradigm thus the subset SSET is empty).

(19) FIG. 4 shows an example of a sequence of message transmissions in the case where all network nodes are synchronized to the global time base (upper part of the figure), and the case where the star coupler Switch 2 has lost synchronization to the global time base (lower part of the figure). Message M1 belongs to a first subset of a set of all messages, configured for the transmission according to an unsynchronized communication paradigm. Message M2 belongs to a second subset of said set of all messages, configured to be transmitted according to synchronized communication paradigm if the global time base is available, and according to unsynchronized communication paradigm if the global time base is not available. Sender and star couplers Switch 1 and Switch 2 are configured to send messages from said second subset at predefined points in time t1, t2 and t3. In this example, star coupler Switch 2 loses the synchronization to the global time base (depicted in the lower part of the figure) and sends the message M2 with high priority using unsynchronized communication paradigm. Different than in the previous case depicted in the upper part of the figure, Switch 2 sends the message M2 prior to the message M1.

(20) FIG. 5 shows an example of the sequence of message transmissions similar to FIG. 4, with the realization of the invention based on message types. The figure shows an example where all network nodes are synchronized to the global time base (upper part of the figure), and the case where the star coupler Switch 2 has lost the synchronization to the global time base (lower part of the figure). There are two types of messages transmitted in this example: messages with the type T1 (e.g., M1) are configured, in particular according to the type T1, to be sent using unsynchronized communication paradigm, and messages with the type T2 (e.g., message M2) are configured, in particular according to the type T2, to be sent using synchronized communication paradigm if global time base is available, and to be sent using unsynchronized communication paradigm if global time base is not available. Sender and star couplers Switch 1 and Switch 2 are configured to send messages with the type T2 at the predefined points in time t1, t2 and t3. In this example, star coupler Switch 2 loses the synchronization to the global time base (depicted in the lower part of the figure) and sends the message M2 with the type T2 with high priority using unsynchronized communication paradigm (prior to the message M1, due to higher priority).

(21) FIG. 6 shows an example of a sequence message transmission similar to the one in FIG. 5. In this figure, however, star coupler Switch 2 changes the type of the message M2 from the type T2 to type T20, prior to sending the message, where the type T20 is specifically defined as the type to be sent in the case of lost synchronization (called, for example, degraded message type), if said star coupler loses the synchronization to the global time base. Such other nodes in the network will get aware that synchronization in one of the star couplers is lost (after receiving the message with the type T20).

(22) FIG. 7 shows an example of the sequence message transmission similar to the one in FIG. 6. This figure, however, shows the case where each star coupler in the network has assigned an unique set of message types T101, T103, T10n, . . . , (called for example degraded assigned message type), assigned exclusively to each star coupler and defined in a mapping MAP. Star couplers change the type of a message prior to sending the message, according to this mapping, if said star couplers lose the synchronization to the global time base. So other star couplers will become aware (after receiving the message characterized by one of said types), which node in the network is currently not synchronized to the global time base. In this figure, star coupler Switch 2 changes the type the message M2 from T2 to T202 in the case of lost synchronization to the global time base.

(23) FIG. 8 shows an Ethernet frame, where a combination of MAC addresses, VLAN Tag and EtherType can be used to identify the message type T.

(24) FIG. 9 shows an Ethernet frame similar to the one in FIG. 8, where the content of the Ethernet payload is an IP/UDP packet and a combination of IP and UPD header can be used to identify the message type T.

(25) FIG. 10 shows an Ethernet frame similar to the one in FIG. 8 and FIG. 9, where the content of the Ethernet payload is an IP/UDP packet and a combination of MAC addresses, VLAN Tag and EtherType, IP and UPD header can be used to identify the message type T.

(26) FIG. 11 shows an example of a mapping MAP of message types to network devices where each network device SC1, SC2, . . . SCn, has a unique set of types to be used to modify the messages types 1, 2, . . . , n originally configured for synchronized communication paradigm to the new types 101, 102, . . . , 10n, 201, 202, . . . , 20n, k01, k02, ..., k0n, when said network devices are not synchronized to the shared global time base. In such way, other star couplers will get aware (after receiving the message characterized by one of said types), which node in the network is currently not synchronized to the global time base.

(27) FIG. 12 shows a (simplified) example of a switch schedule S based on Virtual Links to be executed according to the state of the art TTEthemet (Virtual Link is a possible implementation of the message type). Messages received with VLID 1 on Port 1 will be forwarded by the switch on ports 4 and 8.

(28) FIG. 13 shows a (simplified) example of a switch schedule, similar to FIG. 12, where, according to this invention, messages of the types 1 and 2 (identified with VLID) will be changed to the types 4 and 5 (called DegradedVL in this figure), if sad switch is currently not synchronized to the global time base.

REFERENCES

(29) [1] INC Aronautical Radio. ARINC 664, P7: Avionics Full Duplex Switched Ethernet (AFDX) Network. ARINC Specification 664 Part 7, June 2005.

(30) [2] AS6802: Time-Triggered Ethernet, http://standards.sae.org/as6802/

(31) [3] IEEE 802.1Time Sensitive Networking Task Group, http://www.ieee802.org/1/pages/tsn.html, 3 Nov. 2014

(32) [4] IEEE 802.1QbvEnhancements for Scheduled Traffic, http://www.ieee802.org/1/pages/802.1bv.html, Draft, 7 Oct. 2015.