Honeywell International Inc.

Tttech Computertechnik Ag

Other

Ittech Computertechnik Aktiengesellschaft

Fts Computertechnik Gmbh

Brendan Hall

Kevin Raymond Driscoll

Michael Ray Elgersma

Michael Paulitsch

Srivatsan Varadarajan

Wilfried Steiner

William Todd Smithgall

Matthias Wachter

Ted Bonk

Guenther Bauer

Benjamin F DeLay

Philip Zumsteg

Hermann Kopetz

Paul Frederick Dietrich

Harald Angelow

Stefan Poledna

Larry James Yount

Günther Bauer

Nicholas J Wilt

Devesh Bhatt

Timothy D Mahoney

Aaron Raymond Larson

Richard F Hess

Byron F Birkedahl

Martin Schwarz

Joseph M Horvath

Phil Rose

Kelly Dean Morrell

Art McCready

Brian J Sellner

Philip E Rose

John Teager

William M McMahon

Scot E Griffiths

Dwayne (Dewey) Benson

Wilfred Steiner

Matthias Wächter

Günter Bauer

Benjamin F Delay

In an example, a node in a network includes four ports coupled to respective nodes via respective links. A first port and a third port are coupled to respective nodes via respective near links and a second port and a fourth port are coupled to respective nodes via respective skip links. The node further includes at least one processor configured to send a first message in a first direction via the second port, and the first message includes a first destination address that corresponds to the second side of the node. The at least one processor is further configured to send a second message in a second direction via the fourth port, and the second message includes a second destination address that corresponds to the first side of the node.

Unicast addressing for redundant communication paths

In an example, a method includes forming a first self-checking pair including a self-checking node and a first node adjacent to the self-checking node in a network. The method further includes forming a second self-checking pair including the self-checking node and a second node adjacent to the self-checking node in the network, wherein the self-checking node is between the first node and the second node. The method further includes transmitting a first paired broadcast with the first self-checking pair and transmitting a second paired broadcast with the second self-checking pair.

Self-checking node

Systems and methods for a controller area network braided ring are provided. In certain embodiments, a node within a controller area network braided ring includes a controller area network (CAN) controller that transmits and receives CAN messages according to CAN protocol. The node also includes braided ring availability integrity network (BRAIN) circuitry coupled to the CAN controller, wherein the BRAIN circuitry alters the received CAN messages from the CAN controller for transmission to other nodes within a BRAIN network and alters BRAIN messages received from the other nodes into CAN messages for processing by the CAN controller.

Controller area network braided ring

In an example, a node in a network includes four ports coupled to respective nodes via respective links. Two of the ports are coupled to respective nodes via respective near links and two of the port are coupled to respective nodes via respective skip links. The node further includes a processor configured to compare first and second data streams, sourced from a self-checking pair of nodes, received in a first direction and to compare third and fourth data streams, sourced from the self-checking pair of nodes, received in a second direction. The processor is configured to relay the second data stream in the first direction and fourth data stream in the second direction and a hop count at the end of the respective data stream that is indicative of integrity of the respective data stream.

Compressed and efficient byzantine agreement

A network includes a plurality of nodes and a plurality of links communicatively coupling each of the nodes to at least one respective adjacent node via a first communication channel and to another respective adjacent node via a second communication channel. The nodes and links have a braided ring topology. First and second nodes of the plurality of nodes source data, are adjacent nodes, and at least one is a source node. The first node sends a first communication to the second node via a third node that is adjacent the first node and via a fourth node that is adjacent the second node. The second node sends a second communication to the first node via the third node and via the fourth node. At least one of the first and second nodes terminates transmission of the first and second communications when the first and second communications do not match.

Dual fault-tolerant network using guardian interlocking

In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to receive each of at least one input-data message. The comparing circuit is configured to compare each of the at least one received input-data message to a list of input-data-message identifiers. And the indicator circuit is configured, for each of the at least one input-data message that corresponds to a respective input-data-message identifier, to generate a respective portion of a first status message, the respective portion indicating that the input-data message was received. For example, such computing node can determine the congruency of a received input-data message between coupled redundancy circuits with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Efficient ingress-congruency determination in a network

In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to generate a first redundant message that corresponds to, and that is independent of, a source message propagating over a network during at least one time period. The comparing circuit is configured to compare information content of one or more corresponding portions of the source message and the first redundant message during each of the at least one time period to generate a comparison result. And the indicator circuit is configured to indicate whether the source message is valid or invalid in response to the comparison result. For example, such computing node can determine the validity of a redundant result with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Efficient self-checking redundancy comparison in a network

Systems and methods for interference cognizant network scheduling are provided. In certain embodiments, a method of scheduling communications in a network comprises identifying a bin of a global timeline for scheduling an unscheduled virtual link, wherein a bin is a segment of the timeline; identifying a pre-scheduled virtual link in the bin; and determining if the pre-scheduled and unscheduled virtual links share a port. In certain embodiments, if the unscheduled and pre-scheduled virtual links don't share a port, scheduling transmission of the unscheduled virtual link to overlap with the scheduled transmission of the pre-scheduled virtual link; and if the unscheduled and pre-scheduled virtual links share a port: determining a start time delay for the unscheduled virtual link based on the port; and scheduling transmission of the unscheduled virtual link in the bin based on the start time delay to overlap part of the scheduled transmission of the pre-scheduled virtual link.

Interference cognizant network scheduling

Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

System and method for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees

Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

Systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints

The invention relates to a method for synchronizing local clocks in a distributed computer network, where said computer network consists of a number of components that are connected to each other via bi-directional communication links, characterized in that

Method for synchronizing local clocks in a distributed computer system

The goal of the present invention is to improve the useful data efficiency and reliability in the use of commercially available ETHERNET controllers, in a distributed real time computer system, by a number of node computers communicating via one or more communication channels by means of TT ETHERNET messages. To achieve this goal, a distinction is made between the node computer send time (KNSZPKT) and the network send time (NWSZPKT) of a message. The KNSZPKT must wait for the NWSZPKT, so that under all circumstances, the start of the message has arrived in the TT star coupler at the NWSZPKT, interpreted by the clock in the TT star coupler. The TT star coupler is modified, so that a message arriving from a node computer is delayed in an intelligent port of the TT star coupler until the NWSZPKT can send it precisely at the NWSZPKT into the TT network.

Communication method for the transmission of TT ethernet messages in a distributed real time computer system

A communication switch comprises a plurality of ports and a processing unit configured to identify source ports and destination ports from the plurality of ports on a per virtual link basis. Each virtual link comprises one or more source ports via which frames are received from one or more source nodes and one or more destination ports via which received frames are forwarded to one or more destination nodes. For at least one virtual link, the processing unit is configured to accept more than one of the plurality of ports as source ports.

Versatile source port enforcement for data networks

A method comprises transmitting a plurality of copies of a message from each of a first transmission node and a second transmission node, each copy having a respective identification and forwarding each of the plurality of copies of the message among other nodes in the network based, at least in part, on the respective identification of each copy such that each copy of the message traverses a predetermined communication path among the other nodes. A respective first received copy is compared to a respective second received copy at each of the other nodes. The integrity of the respective first and second copies is validated at each of the other nodes if the copies match and the copies traversed disjoint communication paths.

Disjoint data path routing for integrity and availability augmentation

A method of communicating data in a network comprises receiving a copy of a message on a first channel via at least one of a first port and a second port, the first port coupled to a first neighbor node and the second port coupled to a first neighbor's neighbor node; and selecting either the copy of the message received via the first port or the copy of the message received via the second port if a copy of the message is received via both the first port and the second port. If a copy of the message is only received via one of the first port or the second port, the received copy of the message is selected. The selected copy of the message is forwarded on the first channel to a second neighbor node via a third port and to a second neighbor's neighbor node via a fourth port; and the integrity of the selected copy of the message is determined based on supplemental integrity data received from another node, wherein the supplemental integrity data is exclusive of a copy of the message communicated on a second channel.

Growing community of inventors

Eden Prairie, MN, United States of America

Brendan Hall