# US 2016/0366686 A1 · Method and computer network for transmitting messages

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

- Number: US 2016/0366686 A1
- Document ID: US20160366686A1
- Status: Published application
- Kind: A1
- Application number: 15/120,760
- Filed: 2015-02-20
- Published: 2016-12-15
- Earliest claimed: 2014-02-24
- Assignees: FTS Computertechnik GmbH
- Applicants: Fts Computertechnik GmbH
- Inventors: Wilfried STEINER
- Web page: https://patentgrep.com/patent/US20160366686A1

## CPC

- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04L 12/417: with deterministic access, e.g. token passing
- H04L 12/44: Star or tree networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The invention related to a method for transmitting messages in a computer network of a real-time system comprising components in the form of computing nodes and star couplets. A first group of components sends, relays or receives time-controlled messages according to a communication schedule, and a second group of components does not communicate according to a communication schedule. For example, the computing node 104 does not execute a communication schedule, i.e. the computing node 104 does not send time-controlled messages. Instead, the computing node 104 reacts to receiving a message 1-201a by sending a message 1-104a in response. According to the invention, the message 1-201a is sent in a time-controlled manner, for example by a star coupler 201. The computing node 104 receives the message 1-201a at time 17-104a and reacts to receiving the message 1-201a by sending the message 1-104a at time 17-104b to the star coupler 201. The star coupler 201 receives the message 1-104a at time 14-201b. Preferably an upper limit OBS of the maximum time interval between the receiving time 17-104a and the sending time 17-104b is determined in the computing node 104. In this way, the star coupler 201 can schedule the relaying time 14-201c, at which the message 1-104a is relayed in the network, as a time-controlled time. Alternatively, the computing node 104 reacts by reading a current value from a local sensor, by altering the state of an actuator.

## Claims

### Claim 1

A method for transmitting messages in a computer network, wherein the computer network comprises computing nodes (101-105, X104, X105), the computing nodes (101-105) of which are connected with each other via at least one star coupler (201, 203, 205, 207, X204, X205) and/or at least one multi-hop network (1000), wherein each computing node (101-105, X104, X105) is connected via at least one communication link (110) with the at least one star coupler (201, 203, 205, 207, X204, X205) and/or the at least one multi-hop (1000) network, and wherein the computing nodes (101-105, X104, X105) exchange messages with one another and with the at least one star coupler (201, 203, 205, 207, X204, X205) and/or the at least one multi-hop network (1000),
wherein:
a first group of components is provided, wherein the components of the first group send and/or forward and/or receive time-controlled messages according to a communication schedule, wherein the first group comprises one, two or several component(s), and wherein each component of the first group is either a computing node (101, 102, 103), a star coupler (201, 203, 205, 207) or a star coupler of a multi-hop network,
a second group of components is provided, wherein the components of the second group do not send and/or forward and/or receive time-controlled messages according to a communication schedule, wherein the second group comprises one, two or several component(s), and wherein each component of the first group is either a computing node (104, 105, X104, X105), a star coupler (X204, X205) or a star coupler of a multi-hop network,
at least one component (101, 102, 103, 201, 203, 205, 207) of the first group of components sends one, two or several time-controlled messages according to the communication schedule to one, two or several components (104, 105, X104, X105, X204, X205) of the second group of components,
each of the computing nodes (104, 105, X104, X105) of the second group of components reacts in one of the following ways upon receipt of a time-controlled message:
Reading out a current value/values of one local sensor/of two or more local /sensors;
Changing the state or the states of one or more local actors;
Executing an application-specific task;
Sending a new message (1-104a, 1-105a, 1-X105a),
and/or
each of the star couplers (X204, X205) of the second group of components reacts in one of the following ways upon receipt of a time-controlled message:
Sending a new message (1-X205a), or
Forwarding the received, time-controlled message, wherein the forwarding does not occur according to a communication schedule.

### Claim 2 (depends on 1)

The method of claim 1, wherein one, two or more of the communication links (110), for example all communication links, are wired.

### Claim 3 (depends on 1)

The method of claim 1, wherein one, two or more of the communication links (110), or all communication links, are wireless.

### Claim 4 (depends on 3)

The method of claim 3, wherein transmission times of the time-controlled messages in the communication schedule are selected in this context in such a way that the time-controlled messages are sent at the same time or only overlapping those wireless communication links, for which no interference of the message transmission exists.

### Claim 5 (depends on 1)

The method of claim 1, wherein two or more star couplers of the first group of components send and/or forward time-controlled messages to computing nodes at the same time or at overlapping times.

### Claim 6 (depends on 2)

The method of claim 2, wherein the transmission of messages via wired communication links is based on an IEEE 802.3 Standard or a standard building upon this or subsequent to it.

### Claim 7 (depends on 2)

The method of claim 2, wherein the transmission of messages via wireless communication links is based on an IEEE 802.11 Standard or a standard building upon this or subsequent to it or based on an IEEE 802.15 Standard or a standard building upon this or subsequent to it.

### Claim 8 (depends on 1)

The method of claim 1, wherein one or more of the following standards or standards building upon it or subsequent to it will be used for time-controlled communication: SAE AS6802, IEEE 802.1Q, IEEE 802.1AS, and IEEE 1588.

### Claim 9 (depends on 1)

The method of claim 1, wherein an upper limit (OBS) is intended for the maximum permissible time interval between the time of reception (17-104a) of a time-controlled message with a component of the second group and the time point of the reaction of this component of the second group, specifically the transmission time (17-104b) of the transmission of a message of this component of the second group.

### Claim 10 (depends on 9)

The method of claim 9, wherein each component of the second group reacts to messages in a constant time interval before reaching its upper limit (OBS), specifically sends messages, wherein the constant time interval preferably approaches zero.

### Claim 11 (depends on 9)

The method of claim 9, wherein the upper limit (OBS) is calculated with the worst case execution time analysis.

### Claim 12

A computer network for transmitting messages, wherein the computer network comprises computing nodes (101-105, X104, X105), the computing nodes (101-105) of which are connected with each other via at least one star coupler (201, 203, 205, 207, X204, X205) and/or at least one multi-hop network (1000), wherein each computing node (101-105, X104, X105) is connected via at least one communication link (110) with the at least one star coupler (201, 203, 205, 207, X204, X205) and/or the at least one multi-hop (1000) network, and wherein the computing nodes (101-105, X104, X105) exchange messages with one another and with the at least one star coupler (201, 203, 205, 207, X204, X205) and/or the at least one multi-hop network (1000),
wherein:
a first group of components is provided, wherein the components of the first group are also set up to send and/or to forward and/or to receive time-controlled messages according to a communication schedule, wherein the first group comprises one, two or several component(s), and wherein each component of the first group is either a computing node (101, 102, 103), a star coupler (201, 203, 205, 207) or a star coupler of a multi-hop network,
a second group of components is provided, wherein the components of the second group are not also set up to send and/or to forward and/or to receive time-controlled messages according to a communication schedule, wherein the second group comprises one, two or several component(s), and wherein each component of the first group is either a computing node (104, 105, X104, X105), a star coupler (X204, X205) or a star coupler of a multi-hop network,
at least one component (101, 102, 103, 201, 203, 205, 207) of the first group of components is also set up to send one, two or several time-controlled messages according to the communication schedule to one, two or several components (104, 105, X104, X105, X204, X205) of the second group of components,
each of the computing nodes (104, 105, X104, X105) of the second group of components is also set up to react in one of the following ways upon receipt of a time-controlled message:
Reading out a current value/values of one local sensor/of two or more local /sensors;
Changing the state or the states of one or more local actors;
Executing an application-specific task;
Sending a new message (1-104a, 1-105a, 1-X105a),
and/or
each of the star couplers (X204, X205) of the second group of components is also set up to react in one of the following ways upon receipt of a time-controlled message:
Sending a new message (1-X205a), or
Forwarding the received, time-controlled message, wherein the forwarding does not occur according to a communication schedule.

### Claim 13 (depends on 12)

The computer network of claim 12, wherein one, two or more of the communication links (110), or all communication links, are wired.

### Claim 14 (depends on 12)

The computer network of claim 12, wherein one, two or more of the communication links (110), or all communication links, are wireless.

### Claim 15 (depends on 14)

The computer network of claim 14, wherein transmission times of the time-controlled messages in the communication schedule are selected in this context in such a way that the time-controlled messages are sent at the same time or only overlapping those wireless communication links, for which no interference of the message transmission exists.

### Claim 16 (depends on 12)

The computer network of claim 12, wherein two or more star couplers of the first group of components send and/or forward time-controlled messages to computing nodes at the same time or at overlapping times.

### Claim 17 (depends on 13)

The computer network of claim 13, wherein the transmission of messages via wired communication links is based on an IEEE 802.3 Standard or a standard building upon this or subsequent to it.

### Claim 18 (depends on 13)

The computer network of claim 13, wherein the transmission of messages via wireless communication links is based on an IEEE 802.11 Standard or a standard building upon this or subsequent to it or based on an IEEE 802.15 Standard or a standard building upon this or subsequent to it.

### Claim 19 (depends on 12)

The computer network of claim 12, wherein one or more of the following standards or standards building upon it or subsequent to it will be used for time-controlled communication: SAE AS6802, IEEE 802.1Q, IEEE 802.1AS, and IEEE 1588.

### Claim 20 (depends on 12)

The computer network of claim 12, wherein an upper limit (OBS) is intended for the maximum permissible time interval between the time of reception (17-104a) of a time-controlled message with a component of the second group and the time point of the reaction of this component of the second group, specifically the transmission time (17-104b) of the transmission of a message of this component of the second group.

### Claim 21 (depends on 20)

he computer network of claim 20, wherein each component of the second group reacts to messages in a constant time interval before reaching its upper limit (OBS), specifically sends messages, wherein the constant time interval preferably approaches zero.

### Claim 22 (depends on 20)

The computer network of claim 20. wherein the upper limit (OBS) is calculated with the worst case execution time analysis.
