Abstract: A network configuration for the transmission of communication flows in a real-time communication network, wherein the network comprises components, which are connected by links, wherein an arrangement of the components and links of the network is described by a network topology, wherein said components of the network communicate via a defined set of communication flows, wherein the method comprises a first, a second, and a third module, as well as a first and a second feedback loop, wherein in a first step the first module computes, based on said network topology and said set of communication constraints, one route for each communication flow of said set of communication flows, and wherein, in a second step, after the first step has finished, said second module, computes a time-triggered schedule for the communication of said TT flows, so that one or more of the constraints related to said TT flows are fulfilled.

Abstract: A method for generating a schedule for the transmission of time-triggered, TT, messages in a network, wherein said network communicates TT messages according to said schedule and based on a global, network-wide time, wherein said network communicates rate-constrained, RC messages, wherein for each of said RC messages real-time requirements are provided, wherein the method comprises: Step 1: setting the transmission time of all TT messages which are communicated in the network, and Step 2: executing a search function to find a set of TT transmission times so that the real-time requirements of all RC messages are fulfilled, and when all real-time requirements or at least real-time requirements for defined RC messages are fulfilled, generating in Step 3: the schedule based on the transmission times retrieved in Step 2, or executing Step 2 again when not all real-time requirements or not all real-time requirements for the defined RC messages are fulfilled.

Abstract: A method is provided for error detection in a ternary content addressable memory, TCAM, preferably in real-time, wherein the error detection is initiated with a read operation at a specified input address (200), wherein an additional random access memory, RAM, is provided, wherein said RAM has the same number of locations as the TCAM, wherein in both memories, TCAM and RAM, corresponding read data entries (210) which each consist of data and a mask are placed at the same address locations. In addition, a method is provided for error detection in a TCAM, preferably in real-time, wherein the error detection is triggered by the found of searched input key (400) and starts with a read operation at a specified memory address (410), wherein an additional RAM is provided, wherein said RAM has the same number of locations as the TCAM, wherein in both memories, TCAM and RAM, corresponding read data entries (420) which each consist of data and a mask are placed at the same address locations.

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 a) an a priori configured set of components of the network generates synchronization messages and sends these synchronization messages to the network, and b) an a priori configured set of components consumes the generated synchronization messages, and c) 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, d) a component that is configured to consume a synchronization message will delay a received synchronization message upon reception for a duration that is calculated by an a priory configured value for the maximum transmission

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 method for synchronizing local clocks in a distributed computer network includes a number of components that are connected to each other via bi-directional communication links. An a priori configured set of components generates synchronization messages and sends these messages to the network. An a priori configured set of components consumes the generated messages. One or more message-relaying components in between a component that generates a synchronization message and the component that consumes the message adds delay value to the message reflecting the delay imposed by the message-relaying component. A component that is configured to consume a synchronization message delays a received synchronization message upon reception for a duration that is calculated by an a priori configured value for the maximum transmission delay minus the value of the sum of all delay values added to the received message before further usage of the message in the synchronization process.

Abstract: A method for synchronizing local clocks in a distributed computer network, wherein end systems and switches of the network executes the method as a synchronization state machine, which uses three different frame types. The states in the state machine belong to an unsynchronized or to a synchronized set of states. All end systems being configured as Synchronization Master periodically send coldstart frames in one of the unsynchronized states, all end systems being configured as Synchronization Master react to the reception of a coldstart frame by sending a coldstart acknowledgment frame a first timeout after the reception of the coldstart frame on all replicated communication channels. First timeout is reset when a consecutive coldstart frame is received before the coldstart acknowledge is sent, and all Synchronization Masters react to the reception of a coldstart acknowledgment frame by starting a second timeout and enter a synchronized state when the second timeout expires.

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

Abstract: To relay messages in a time-controlled communication system with a star coupler arranged as a multirouter, messages arriving via ports are relayed according to a rule defined in the star coupler. Relaying paths are switched according to a rule defined in the star router which describes relaying paths for messages, namely in the synchronized operating state depending on the time according to the global time basis of the communication system. Two relaying paths can occur simultaneously in at least one time slot whereby they are in disjunction to one another. Each port belongs to only one relaying path respectively at any time. A check is conducted on the basis of a message's content as to whether the relaying of the message complies with an acceptance rule. Relaying of the message to those target ports which do not match the rule is cancelled or ended under the invalidation of the message.

Abstract: Disclosed is a method for transmitting CAN messages via a CAN bus in a communication system including several network nodes with at least one respective CAN controller. According to the method, the authorization of a network mode to send a CAN message is arbitrated, an arbitration decision being made in a higher protocol layer than the transmission of the CAN message, and the CAN message is already sent by the transmitting network node, the latter providing a dominant level in the ACK field of the message. A network node which receives the CAN message does not generate a dominant level in the ACK field and does not send a complete error frame.

Abstract: Disclosed is a method for transmitting CAN messages via a CAN bus in a communication system including several network nodes with at least one respective CAN controller. According to the method, the authorization of a network mode to send a CAN message is arbitrated, an arbitration decision being made in a higher protocol layer than the transmission of the CAN message, and the CAN message is already sent by the transmitting network node, the latter providing a dominant level in the ACK field of the message. A network node which receives the CAN message does not generate a dominant level in the ACK field and does not send a complete error frame.

Abstract: To relay messages in a time-controlled communication system with a star coupler arranged as a multirouter, messages arriving via ports are relayed according to a rule defined in the star coupler. Relaying paths are switched according to a rule defined in the star router which describes relaying paths for messages, namely in the synchronized operating state depending on the time according to the global time basis of the communication system. Two relaying paths can occur simultaneously in at least one time slot whereby they are in disjunction to one another. Each port belongs to only one relaying path respectively at any time. A check is conducted on the basis of a message's content as to whether the relaying of the message complies with an acceptance rule. Relaying of the message to those target ports which do not match the rule is cancelled or ended under the invalidation of the message.

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.