Abstract: A method of configuring a node comprises receiving a first message having a count field value from a first direct link; receiving a second message having a count field value from a first skip link; adjusting the count field value in the first message by a first adjustment amount; adjusting the count field value in the second message by a second adjustment amount; comparing the adjusted count field value in the first message with the adjusted count field value in the second message; if the adjusted count field value in the first message matches the adjusted count field value in the second message, using the adjusted count field value in the first message to determine a node identity for the node; and processing subsequent messages based on the node identity.

Abstract: A cluster comprises a plurality of end nodes that communicate with one another over at least one communication channel. Each end node is assigned a time slot for transmission of frames; wherein each node comprises a local guardian configured to prevent transmission of timing-related frames sourced from the respective end node. The cluster also comprises a special node that communicates with the plurality of end nodes, wherein the special node establishes a time base and sources timing-related frames to the plurality of end nodes. The transmission schedule includes at least one common scrubbing time slot during which each of the plurality of end nodes is configured to generate a timing-related frame. The special node is configured to determine if the local guardian in any of the plurality of nodes failed to prevent transmission of the respective generated timing-related frame during the common scrubbing time slot.

Abstract: 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.

Abstract: A communication system comprises a plurality of nodes and a switch having a plurality of ports, each port coupled to one of the plurality of nodes. At least one of the plurality of nodes is configured to transmit a first unregulated flow of frames associated with a first virtual link to a first port of the plurality of ports of the switch. The switch is configured to regulate the first unregulated flow of frames by buffering frames of the first unregulated flow in a first input queue associated with the first virtual link, applying traffic shaping parameters associated with the first virtual link to the frames in the first input queue associated with the first virtual link, and outputting the first regulated flow of frames to one or more output queues associated with one or more output ports based on the first virtual link.

Abstract: A method for start-up of a network, including a number of nodes, which are connected via channels. The nodes exchange information in the form of messages via the channels. The transition phase of a synchronizing node from its initial phase to a synchronized phase is separated in a first integration phase and a second subsequent cold-start phase. A synchronizing node in the integration phase listens to messages being sent from nodes in the synchronized phase and only reacts to an integration message (i-frame) if the integration message is a valid message. Furthermore, a synchronizing node, wherein integration of the synchronizing node to a set of already synchronized nodes was not successful after a specifiable period, changes into the cold-start phase, in which a cold-start procedure of the node is extracted, wherein in the cold-start phase the node does not react to integration messages of a node in the synchronized phase.

Abstract: A communication device comprises first and second circuits to implement a plurality of ports via which the communicative device is operable to communicate over a plurality of communication channels. For each of the plurality of ports, the communication device comprises: command hardware that includes a first transmitter to transmit data over a respective one of the plurality of channels and a first receiver to receive data from the respective one of the plurality of channels; and monitor hardware that includes a second receiver coupled to the first transmitter and a third receiver coupled to the respective one of the plurality of channels. The first circuit comprises the command hardware for a first subset of the plurality of ports. The second circuit comprises the monitor hardware for the first subset of the plurality of ports and the command hardware for a second subset of the plurality of ports.

Abstract: A special node is used in a distributed time-triggered cluster. The special node comprises protocol functionality to establish a time base to use in communicating with a plurality of end nodes and to source timing-related frames to the plurality of end nodes in accordance with the distributed time-triggered communication protocol. The protocol functionality establishes the time base without regard to any timing-related frame sourced from any of the plurality of end nodes. In one embodiment, the protocol functionality of the special node is implemented in a low complexity manner. In one embodiment, the cluster comprises a star topology and the special node performs at least one of semantic filtering and rate enforcement. In another embodiment, the cluster comprises a bus or peer-to-peer topology and each end node is coupled to the communication channel using a low-complexity special local bus guardian.

Abstract: A distributed control system comprises a first network section comprising one or more control nodes containing control logic operable to perform control function computations; a second network section, wherein the second network section comprises; a plurality of additional nodes responsive to the one or more control nodes in the first network section, each of the plurality of additional nodes communicatively coupled to two neighbor nodes and to two skip nodes using a plurality of links; first and second gateway interfaces each coupled to the first and second network sections and each operable to interface the first network section to the second network section; wherein the first network section is operable to communicate signals using a first communication protocol; and wherein the plurality of nodes in the second network section are operable to communicate signals over the plurality of links using a second communication protocol that is different from the first communication protocol.

Abstract: A method of communicating node status in a star network comprising a hub and a plurality of nodes comprises sending a first message to the hub from a first node included in the plurality of nodes; forwarding the first message from the hub to at least one second node included in the plurality of nodes; communicating status information to the hub from the at least one second node after receiving at least a portion of the first message at the at least one second node; compiling a status vector based on the status information received from each of the at least one second nodes; and sending the status vector from the hub to at least the first node.

Abstract: A distributed engine control system is provided. The engine control system includes first and second engine data concentrators. Each of the first and second engine data concentrators include a processor module, a signal conditioning module coupled to the processor module, a data transfer module coupled to the processor module, and a data bus coupled between the first and second engine data concentrators and a hydro-mechanical unit (HMU).

Abstract: A network for a dual lane control system is provided. The network comprises at least one hub for a first channel and at least one hub for a second channel. A first plurality of end nodes is in a first lane. Each of the first plurality of end nodes is coupled to the first and second channels by being in communication with the hubs for the first and second channels. A second plurality of end nodes in a second lane are each redundant with a respective end node in the first lane. Each of the second plurality of end nodes is coupled to the first and second channels by being in communication with the hubs for the first and second channels.

Abstract: Methods and systems for a scalable self-checking processing platform are described herein. According to one embodiment, during an execution frame, a first processing element executes both a high-criticality application and a first low-criticality application. During that same execution frame, a second processing element executes both the high-criticality application and a second low-criticality application. The high-criticality application output from the first processing element is compared with that from the second processing element before the next execution frame, and a fault occurs when the output does not match. The low-criticality application is not duplicated or compared. This and other embodiments allow high-criticality applications to be appropriated checked while avoiding the over-dedication of resources to low-criticality applications that do not warrant self-checking.

Abstract: The invention relates to a method for synchronizing local clocks in a distributed computer network, where said computer network consists of a number of end systems and at least two switches. Each end system is connected to at least two switches via bi-directional communication links. A configured subset of end systems and switches executes the method in form of a synchronization state machine. The state machine uses at least three different frame types. The states in the state machine are either said to belong to an unsynchronized set of states or belong to a synchronized set of states.

Abstract: 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 an a priori configured set of components of the network generates synchronization messages and sends these synchronization messages to the network. An a priori configured set of components consumes the generated synchronization messages. One or more message-relaying components in between a component that generates a synchronization message and the component that consumes the synchronization message will add a delay value to the synchronization message reflecting the delay imposed by the message-relaying component.

Abstract: A system comprises a plurality of nodes; and a hub that is communicatively coupled to each of the plurality of nodes via a plurality of point-to-point links, wherein a priority-based arbitration scheme is used by the plurality of nodes and the hub to communicate over each of the plurality of point-to-point links. When the hub determines that one or more of the plurality of nodes is each transmitting a message having an identification field comprising a first sub-field and a second sub-field, the hub uses the first sub-field to select which node's message should be forwarded to the other nodes based, at least in part, on the priority-based arbitration scheme and forwards the selected node's message as it is received to the other nodes, continuing with the second sub-field of the selected node's message.

Abstract: Systems and methods for network clock synchronization are provided. In one embodiment, a method for clock synchronization in a braided ring network comprises: providing a schedule for a braided ring network comprising a plurality of nodes, wherein at least two nodes comprise a self-checking pair of a first node and a second node, the first node performing a method comprising: determining when a first rendezvous message is received from the second node; when the second rendezvous message is received, calculating a time difference between the send instance of the first rendezvous message and a local time; when the time difference is not greater than a reference bound, calculating a sending point for transmitting a synchronization message, wherein the sending point is calculated based on the time difference; and selectively sending the synchronization message to the braided ring network when the sending point is reached based on the time difference.

Abstract: A multi-channel TDMA network having priority based is provided. A network includes a plurality of channels, and a plurality of nodes adapted to transmit and received data. Through each channel, every node is coupled to communicate data with every other node. Within each channel, each node is assigned a unique priority rank. Only the node with the highest priority rank is permitted to transmit data during a time slot. For each channel of the multi-channel network, the plurality of nodes are ranked in a different priority direction.

Abstract: A half-duplex communication network comprises a plurality of communication links, each link being configured a priori to communicate in one direction; and a plurality of nodes, each node coupled to a first and second direct neighbor nodes and a first and second skip neighbor nodes via the plurality of communication links. Each node comprises propagation logic adapted to arbitrate conflicts between concurrent messages based on at least one of higher level policies and a comparison between a priority of each message, wherein each node is adapted to communicate a message without waiting to determine if another node is transmitting another message with a higher priority.

Abstract: Method and systems of transmission schedule enforcement in a hub-based network is provided. Method includes receiving guardian messages from one or more of a plurality of nodes, implementing a voting function, voting the received guardian messages using the voting function, and when a clear winner of the received guardian messages is detected, enabling a port indicated by the clear winner to propagate. The guardian messages are received outside of TDMA communications. The guardian messages contain information pertaining to the next slot or slots to transmit.

Abstract: A method of configuring a node comprises receiving a first message having a count field value from a first direct link; receiving a second message having a count field value from a first skip link; adjusting the count field value in the first message by a first adjustment amount; adjusting the count field value in the second message by a second adjustment amount; comparing the adjusted count field value in the first message with the adjusted count field value in the second message; if the adjusted count field value in the first message matches the adjusted count field value in the second message, using the adjusted count field value in the first message to determine a node identity for the node; and processing subsequent messages based on the node identity.