DE102017209428A1 - Method and device for identification in a computer network - Google Patents

Abstract

A method of identification in a computer network (100) comprising a first subnetwork (116) comprising a first node (116A) and a second subnetwork (112) comprising a second node (114), characterized in that information about a signal (208) that the first node (116A) requires, (212) checking (212) whether there is a third node (116B) of the first subnetwork (116) providing the signal, depending on the information about the signal, depending on the result of the test, if the third node (116B) is present, an assignment of the signal to the first node (116A) and the third node (116B) is stored in a signal assignment, or if the third node (116B ) is not present or does not provide the signal, a request (216) is sent for the signal to the second node (114), a response is received from the second node (114), the response information via ei A fourth node (112B) provides the signal and an assignment of the signal to the first node (116A) and the fourth node (112B) is stored in a signal assignment. Device and computer program trained to perform the method.

Description

State of the art

The invention relates to a method and a device for identification in a computer network. In particular, a topology and a signal matrix in a single CAN network or a network of CAN networks becomes identifiable.

EP 2573981 A2 discloses a communications controller that creates a communication table of a network (FlexRay, CAN) and forwards signals between network branches using the communication table as a switch. A static network topology is also captured.

DE 102014202071 A1 discloses a device for operating a communication network. For an information to be transmitted between control units, an identifier is assigned, by means of which the information to be transmitted is characterized as being unambiguously identifiable in the communication network. By means of the identifier information from control units can be queried, by means of which an automatic configuration of communication relationships of the communication network is made possible. According to a first variant carried out "on-board", the method disclosed there is executed by a central node. The central node is a control device which is equipped with the functionality of a gateway computer known per se. As an intelligent node, the gateway computer takes over the querying of the relevant communication relationships, as well as the calculation of the communication relationships necessary for the data transmission and the provision of corresponding conversion formulas.

In contrast, it is desirable to specify an improved method for identification.

Disclosure of the invention

This is achieved by a method and apparatus according to the independent claims.

The method of identifying in a computer network having a first subnetwork comprising a first node and a second subnetwork comprising a second node comprises receiving information about a signal that the first node requires, depending on the information about the signal is checked to see if there is a third node of the first subnetwork providing the signal, and depending on the result of the test, if the third node is present, assigning the signal to the first node and the third node in a signal assignment is stored, or if the third node is absent or does not provide the signal, a request for the signal is sent to the second node, a response is received from the second node, the response comprising information about a fourth node containing the Signal provides, and an assignment of the signal to the first node and the fourth node is stored in a signal assignment. This automatically creates a signal assignment, for example a signal matrix. Nodes can be control devices, such as end nodes of the subnetworks or gateway computers. The gateway computers connect the subnetworks.

Advantageously, a plurality of assignments of a plurality of signals to a plurality of nodes of a plurality of subnetworks are stored in the signal allocation by performing the identification of the plurality of signals needed by the plurality of nodes. This automatically creates a signal matrix for a large number of signals.

Advantageously, information about a receive identification and information about a send identification of a node is received, wherein the receive identification in the subnetwork is used exclusively for messages on a data bus of a subnetwork that are addressed to the node with the receive identification, wherein the transmission identification exclusively marks messages that the node with the transmission identification transmits on the data network of the subnetwork, and wherein a topology of the subnetwork is stored after receiving the information about the reception identifications and the information about the transmission identifications. By the signal matrix and the topology of the subnetwork, the control devices, such as terminals or gateway computers and each transmitted and received signals are known. If, for example, the structure of one of the subnetworks changes, this is automatically detectable.

Advantageously, information about a node type of the node is received and stored with the information about the reception identification and the information about the transmission identification in the topology. This automatically creates a topology representation with the node type. The node type is, for example, an identification as gateway computer or end node in one of the subnetworks. This allows a hierarchical structuring. As a result, individual nodes can be queried as end nodes or gateway computers, depending on their type of node, when creating the signal matrix.

Advantageously, a plurality of information about receive identifications, a plurality of information about sender identifications, or a plurality of information about node types is retrieved from a plurality of nodes in a plurality of subnetworks by sending at least one poll in each of the plurality of subnetworks. The entire structure of the computer network is thus automatically detected.

Advantageously, the at least one query from a gateway computer of the first subnetwork connecting the first subnetwork to the second subnetwork is sent in a message on a first data bus of the first subnetwork, the message being provided with an identification in the first subnetwork is intended exclusively for messages from the gateway computer. This exploits a hierarchical structuring of the computer network for a particularly efficient query.

Advantageously, a plurality of subnetworks are configured as local controller area networks, wherein in each of the subnetworks exclusively different control devices are arranged, wherein each of the at least one control devices is connected to at least one gateway computer of a plurality of gateway computers, wherein the Variety of gateway computers that connects multiple subnetworks as a global controller area network. This allows differentiation of the global controller area network into subnetworks that can be developed separately.

Advantageously, a first list of signals required by nodes in the first subnetwork is created, a second list of signals being provided by nodes in the first subnetwork, the first list being compared to the second list, and depending on the result of the comparison, if a required signal is not included in the list of available signals, the request for this required signal is sent in the second subnetwork.

By means of the method, a detection and a distribution of required and available signals take place on a CAN-based communication network or a CAN-based network of communication networks. For the ECUs their logical position, d. H. Automatically detects and records a position in the hierarchy of the computer network in the network as a topology. For the control units, the required signals are automatically detected and recorded in the signal matrix. For the ECUs is automatically detected in the signal matrix and detects which signals are provided by them. As a result, a complete image of the control units involved is automatically created in the signal matrix. For the gateway computers their logical position in the network is automatically detected and recorded. The required signals are automatically detected and recorded for the gateway computers. For the gateway computer is automatically detected and recorded, which signals are provided by them. This automatically creates a complete picture of the control units and gateway computers involved. Compared to a manual description of the network by a developer, this method allows detection at runtime of an initially unknown CAN-based communication network or a network of CAN-based communication networks. In addition, the process simplifies the development work in the area of network architecture planning in the vehicle and thus saves development effort.

A corresponding device is designed to carry out the method for detecting an operating state.

A corresponding computer program is designed to carry out the method.

Further advantageous embodiments will become apparent from the following description and the drawings.

• 1 schematisch Teile eines Netzwerks von CAN-basierten Kommunikationsnetzwerken,
• 2 schematisch eine Übersicht über ein Verfahren, zur Identifikation einer Topologie und einer Signalmatrix in einem lokalen CAN Netzwerkteil,
• 3 schematisch Schritte einer Topologie-Erkennung,
• 4 schematisch Schritte einer Detektion lokal bereitstellbarer Signale,
• 5 schematisch Schritte einer Detektion lokal benötigter Signale,
• 6 zeigt schematisch Schritte einer globalen Abfrage.

In the drawing shows:

• 1 schematically parts of a network of CAN-based communication networks,
• 2 schematically an overview of a method for identifying a topology and a signal matrix in a local CAN network part,
• 3 schematically steps of a topology detection,
• 4 schematically steps of detection of locally available signals,
• 5 schematically steps of a detection of locally required signals,
• 6 schematically shows steps of a global query.

1 schematically represents parts of a network of CAN-based communication networks. Specifically 1 a first CAN-based communication network 102 representing a first end node 102A and a second end node 102B includes, over a first CAN bus 1021 are connected. 1 provides a second CAN-based communication network 104 representing a third end node 104A and a fourth end node 104B comprising a second CAN bus 1041 are connected. The first CAN-based communication network 102 and the second CAN-based communication network 104 are via a first gateway computer 106 connected.

1 also provides a third CAN-based communication network 108 representing a fifth end node 108A includes. The third CAN-based communication network 108 is with the first CAN-based communication network 102 via a second gateway computer 110 connected. More precisely, a third CAN bus connects 1081 the fifth end node 108A with the second gateway computer 110 , The second gateway computer 110 is with the first CAN bus 1021 connected.

1 also provides a fourth CAN-based communication network 112 representing a sixth end node 112A and a seventh end node 112B includes. The fourth CAN-based communication network 112 is with the second CAN-based communication network 104 via a third gateway computer 114 connected. More precisely, a fourth CAN bus connects 1121 the sixth end node 112A , the seventh end node 112B and the third gateway machine 114 , The third gateway computer 114 is with the second CAN bus 1041 connected.

1 also provides a fifth CAN-based communications network 116 This is an eighth end node 116A and a ninth end node 116B includes. The fifth CAN-based communication network 116 is with the fourth CAN-based communication network 112 via a fourth gateway computer 118 connected. More precisely, a fifth CAN bus connects 1161 the eighth end node 116A , the ninth end node 116B and the fourth gateway machine 118 , The fourth gateway computer 118 is with the fourth CAN bus 1121 connected.

1 also provides a sixth CAN-based communication network 120 This is a tenth end node 120A and an eleventh end node 120B includes. The sixth CAN-based communication network 120 is with the second CAN-based communication network 104 via a fifth gateway computer 122 and the third gateway machine 114 connected. More precisely, a sixth CAN bus connects 1201 the tenth end node 120A , the eleventh end node 120B and the fifth gateway machine 122 , The fifth gateway machine 122 is via a seventh CAN bus 1221 with the third gateway computer 114 connected.

The data connections are based on a CAN protocol according to the ISO 11898 standard family. For example, the data connection on the physical layer is after ISO 11898-2 (High speed CAN) or ISO 11898-3 (Low-speed CAN) realized. Instead of a CAN bus which operates according to the CAN protocol, another protocol operating according to the "multi-master principle" may be provided, which connects several computers of equal value. The computers are nodes, preferably control devices in a motor vehicle.

Messages exchanged over the CAN network include CAN identifiers. Messages in which CAN networks are sent are received by all nodes connected within this CAN network. The nodes can be designed as gateway computers or as end nodes. The nodes are preferably control devices or computing devices. The nodes have a communication stack that is configured to process CAN messages. More specifically, CAN messages and CAN identifiers are processed in the communication stack to send or receive CAN messages by accessing the CAN bus.

This in 1 Network of CAN-based networks shown is an exemplary embodiment of a network topology, in the example below, a method for identifying a topology and a signal assignment, for example a signal matrix in a local CAN network part, via a gateway computer with a global CAN network is connected described. The application for other network topologies is done accordingly.

In 1 is a combination of local CAN networks with a different number of gateways and end nodes shown as nodes. These local CAN networks are connected via the gateways as described to form a global CAN network. In the example of 1 a hierarchical structure is formed, so that a logical position of the first gateway computer 106 in the hierarchy above the second gateway computer 110 and the third gateway machine 114 stands. The third gateway computer 114 is again in the hierarchy above the fourth gateway computer 118 and the fifth gateway computer 122 , The subordinate gateway computers are in this case connected to a local CAN network of the parent gateway computer and in turn have at least one local CAN network.

Each local CAN network is equipped with at least one CAN identifier, which may only be used by a gateway computer, which directly accesses the local CAN bus, which connects the end nodes of the local CAN network with each other. The CAN identifier is used exclusively in messages from the gateway computer. The CAN identifier is used to send messages as For example, send broadcast messages to all end nodes within this local CAN network. Messages with this CAN identifier are received by all nodes connected within this local CAN network, ie directly connected end nodes and gateway computers, and are sent in their respective communication stack for processing.

For example, two unique CAN identifiers are provided for each node of the local CAN network. In combination with a master-slave approach, an exclusive communication between gateway computer and end node can also be realized with more than two or only one identifier. For each node, a unique "receive ID" is given, which can be used to send messages to the associated node in the local CAN network in singlecast mode. For each node, a unique "Send ID" is given, which can be used by this node to send messages within this local CAN network.

For example, for all communication stacks of end nodes that are part of the local CAN network, and for all communication stacks of the gateway computers that can be directly connected to the local CAN network, the at least one CAN identifier and the "receive ID" and the "send ID" specified and stored.

Each of the local CAN networks forms a CAN-based communication network. The network of CAN-based communication networks forms a global CAN network.

For a local CAN network whose nodes are connected via the same CAN bus, for example, as described below, a unique identification of all nodes in the local CAN network and a list of required and / or provided signals is queried by means of a broadcast. Preferably, this broadcast is sent by those gateway computers of a local CAN network, which is hierarchically highest in terms of the global CAN network. In response to receiving such a broadcast, the nodes are configured to send, for example, a self-description message. In response to receiving such a broadcast, the nodes are configured to send, for example, a list of needed and / or provided signals. The self-description message or list is sent to the gateway computer or broadcast.

Optionally, transmission of the list or self-description message through various nodes to avoid collisions on the CAN bus is sequentially possible. Otherwise, the CAN protocol is used to resolve collisions.

The gateway computer is designed to possibly detect signals that are required in the local CAN network and that can not be provided by nodes in the local CAN network. The gateway computer is designed to request signals in the global CAN network that are required in the local CAN network. The gateway computer is configured to receive requests for signals from the global CAN network and, if appropriate, to send signals provided by nodes in the local CAN network to the global CAN network. If needed, signals are provided locally and / or globally.

2 provides an overview of the process. The process is divided into three phases.

In a first phase 202 After the start of the procedure, a preparation of the determination of required and available signals takes place. Optionally, this is a topology discovery 204 carried out.

In a second phase 206 The process searches for required and available signals at the local level. There is a first detection 208 required signals. For example, a first list of signals required in the local CAN network is generated. There is a second detection 210 Provisionable signals. For example, a second list with signals that can be provided in the local CAN network is generated. It will be an adjustment 212 between the first list and the second list. The adjustment comprises signals that are needed and / or provided locally and / or globally.

In a third phase 214 In the method, signals which are required by terminal nodes in the local CAN network but can not be provided by terminal nodes from the local CAN network are searched globally, ie in the network of all connected CAN communication networks. For example, a query is made 216 , The query 216 is repeated, for example, repeatedly during operation of the local CAN network. For example, in addition to or instead of the query 216 repeatedly sends signals needed by other local CAN networks from the network of all connected CAN communication networks.

Then the process ends.

3 schematically shows steps of topology detection 204 , The topology detection 204 expires within the local CAN network for which topology discovery is running.

After starting the topology detection 204 gets in one step 302 within the local CAN network the broadcast is sent with the CAN identifier. The topology detection starts with that in step 302 the corresponding gateway computer of a local CAN network sends the broadcast message to the network, which requests the connected nodes to identify themselves. This message includes, for example, a trigger topology detection.

Subsequently, in one step 304 receive the self-description message. For example, the corresponding gateway computer receives and stores the self-description messages. The self-description message contains information such as the type of the sending node (end node or gateway computer) as well as the "send ID" and "receive ID" of the node.

In one step 306 a check is made as to whether a given time has expired. For example, a timeout for topology discovery is checked. When the given time has expired, one step will be taken 308 otherwise, the step becomes 304 executed.

As soon as the timeout time has expired, for example, the gateway computer evaluates in step 308 the self-description message. For example, the information about the "send ID" or the "receive ID" and the information about the nature of the sending node, the topology of the local CAN network is generated, the connected nodes (control units), their type (end node or gateway ) as well as their addressing.

Then the process ends.

Possible alternative for the first phase 202 :
Instead of merely waiting for new messages during the timeout period, the gateway computer can also repeat the trigger topology detection once or several times in order to prevent the individual node in the network from missing the message and therefore not being recognized.

Instead of a general trigger that requires all nodes to identify themselves, the gateway computer can also use individual queries for detection. In this case, the gateway computer sends individual queries, i. as a singlecast, for example, by interrogating the ID continuously, polling the entire range of receive IDs and awaiting the response of a node responding to that receive ID.

4 schematically shows steps of the first detection 208 locally required signals.

After the start becomes a one step 402 sent a first CAN message to query required signals. For example, the first CAN message includes a request to the receiver to send signals needed by the receiver. In the example, the first CAN message is sent by the gateway computer as a broadcast in the local CAN network. This request includes, for example, a trigger Required signals.

Subsequently, in one step 404 Checked if a second CAN message was received to start a transmission of signals. If the second CAN message has been received, one step will be taken 406 otherwise, the step becomes 404 executed. In the example, the second CAN message is sent as singlecast by one of the other nodes in the local CAN network as soon as it receives the first CAN message. For example, this message includes a trigger start transmission of signals.

Subsequently, in one step 406 a third CAN message sent to confirm the transmission. In the example, the third CAN message is sent by the gateway computer as a singlecast in the local CAN network. This message is also referred to below as "confirmation".

When the trigger start transmission of required signals from a node has been received, in one step 408 started a phase of transmission from this node. At least one fourth CAN message is received.

In one step 410 it is checked whether all signals in the transmission have been received by this node. In the example, the gateway computer is only ready to transfer from another node in the local CAN network if all necessary signals have been received by this node in the transmission.

If all required signals have been received, the phase of transmission from this node is terminated and a step 412 otherwise, the step becomes 408 repeated.

In step 412 It is checked whether all connected nodes in the network have transmitted their required signals. When all connected nodes in the network have transmitted their required signals, a step will be taken 414 otherwise, the step becomes 404 executed.

In step 414 The first list of all signals required in this network is created.

Then the process ends.

5 schematically shows steps of the second detection 210 locally available signals.

After the start becomes a one step 502 sent a fifth CAN message to query available signals. For example, the fifth CAN message includes a request to the receiver to send receivable signals. In the example, the fifth CAN message is sent by the gateway computer as a broadcast in the local CAN network. For example, this message includes a trigger of deliverable signals.

Subsequently, in one step 504 Checked if a sixth CAN message was received to start a transmission of signals. If the sixth CAN message has been received, one step will be taken 506 otherwise, the step becomes 504 executed. In the example, the sixth CAN message is sent as a singlecast by one of the other nodes in the local CAN network as soon as it receives the fifth CAN message. This message includes, for example, a trigger start transmission of deliverable signals.

Subsequently, in one step 506 a seventh CAN message is sent to confirm the transmission. In the example, the seventh CAN message is sent by the gateway computer as a singlecast in the local CAN network. This message includes, for example, a confirmation.

When the trigger start transmission of deliverable signals has been received from a node, in one step 508 started a phase of transmission from this node.

In one step 510 it is checked whether all signals in the transmission have been received by this node. In the example, the gateway computer is only ready to transmit from another node in the local CAN network if all available signals were received in the transmission from this node.

If all available signals have been received, the phase of transmission from this node is terminated and a step 512 otherwise, the step becomes 508 repeated.

In step 512 It is checked whether all connected nodes in the network have transmitted their available signals. When all connected nodes in the network have transmitted their deliverable signals, a step will be taken 514 otherwise, the step becomes 504 executed.

In step 514 the second list of all available signals in this network is created.

Then the process ends.

Possible alternatives for the second phase 204 and the third phase 206 Instead of the first CAN message, which prompts all nodes to initiate the transmission of the required signals, or instead of the fifth CAN message, which requests all nodes to initiate the transmission of the available signals, it can be provided that the gateway computer also uses individual queries for detection. In this case, the gateway computer sends corresponding individual queries, ie singlecast to each node.

The individual queries can be sent by sending continuous CAN messages to the receiver ID, thus polling the entire range of possible receive IDs. The response of any node responding to a first of these receive IDs is awaited before a second of these receive IDs is used to send the corresponding CAN message.

The individual queries can be sent by selectively using individual queries for detection. In this case, the gateway computer sends individual queries, ie single cast, to the nodes previously determined in the first phase.
Instead of the sequential query of nodes, a simultaneous query of all signals that can be used or provided is possible. All nodes then try to answer the request at the same time. Collisions on the data bus are resolved by the CAN protocol. As a further supplement to this, a "busy" message can be used by the gateway computer to counteract an overload of the gateway computer.

It can also be provided that the nodes after the transmission of all required and / or after the transmission of all available signals indicate the completion by a final message "end transmission of required signals" or "end transmission of available signals".

The second list of all available signals in this network and the first list of all the signals required in this network will be compared in a further step. This identifies the signals that are required in the local CAN network but can not be provided by the local CAN network.

In the third phase of the global CAN network, this will be queried in a global query and made available if necessary.

6 schematically shows steps of the global query. In the example, the global query runs on an executing gateway computer.

After the start will be in one step 602 Checks whether the executing gateway computer is the top gateway computer in the hierarchy. If the executing gateway machine is the top-level gateway machine in the hierarchy, a step will be taken 604 otherwise, a step will be taken 606 executed.

In step 606 a check is made as to whether a request has been received for the notification of a signal list comprising signals required by the executing gateway computer and available signals. If the request to notify a signal list has been received, the step will be 604 executed. Otherwise, the step becomes 606 executed.

It is distinguished in which hierarchical level the executing gateway computer is located. For example, a gateway computer in the top hierarchical level can start the process. Gateway computers in underlying hierarchy levels must wait to be prompted to begin.

In step 604 a check is made as to whether there are further gateway computers which are in subordinate hierarchy levels with respect to the executing gateway computer. If there are more gateway computers in lower hierarchy levels, there will be a step 608 executed. Otherwise, a step 610 executed.

If there are no further gateway computers, all available signals are already known to the executing gateway computer, for example from the detection of locally available signals. If there are no further gateway computers, all required signals are already known to the executing gateway computer, for example in the first list and the second list from the detection locally required signals.

If there are other gateway computers that are in a lower hierarchical level relative to the executing gateway computer, information about the required signals and provideable signals may be provided by these gateway computers. However, it is also possible that not all known signals required known signals is available.

In step 610 It is checked whether all known required signals are included in the known available signals. For example, the first list is compared with the second list. If all known required signals are included in the known deliverable signals, the method ends. Otherwise, a step 612 executed.

In step 612 the signal list is sent from the still known required signals to the higher-level gateway computer. If there is no higher-level gateway computer, and not all the required signals are present, an error message can be provided.

Then the process ends.

In step 608 Gateway computers in the lower hierarchical level are asked to send information about signals that are needed. For this purpose, for example, an eighth CAN message is sent. The eighth CAN message is sent, for example, in broadcast or in singlecast individually to each subordinate gateway computer.

Subsequently, a step 614 is executed.

In step 614 a message is received via at least one required signal from one of the gateway computers in subordinate hierarchical levels. For example, at least a ninth CAN message is received containing information about whether the at least one required signal is available or not.

Subsequently, a step 616 is executed.

In step 616 the signal list is updated. A required signal is entered in the signal list, for example, if it is required by a gateway computer in a subordinate hierarchical level.

Subsequently, a step 618 is executed.

In step 618 a check is made as to whether all required signals have been transmitted from a specific gateway computer. If all the required signals have been transmitted, a step will be taken 620 otherwise, the step becomes 614 executed.

In step 620 It is checked whether all requested gateway computers transmitted their required signals. If all queried gateway computers transmitted their required signals, a step 622 executed. Otherwise, the step becomes 608 executed.

In step 622 a request for a required signal from the signal list is sent to at least one gateway computer, which is hierarchically subordinate. This will be For example, sent a tenth CAN message containing information about the required signal.

Subsequently, in one step 624 checked whether a positive response to the request was received from at least one subordinate gateway computer. When a positive response to the request has been received, a step will be taken 626 executed. Otherwise, a step 628 executed.

The positive answer is transmitted, for example, in an eleventh CAN message. The positive response confirms that a deliverable signal corresponding to the required signal is available on the sending gateway computer.

In step 628 it is checked whether the request has been sent to the subordinate gateways for all required signals from the signal list. If the request for the subordinate gateways has been sent from the signal list for all required signals, the step becomes 610 executed. Otherwise, the step becomes 622 executed.

A recursive execution terminates the query mechanism step by step. As soon as the uppermost gateway computer of the hierarchy has processed the mechanism, the entire process of detecting and distributing required and deployable signals in the CAN network or a network of CAN networks has been completed.

QUOTES INCLUDE IN THE DESCRIPTION

This list of the documents listed by the applicant has been generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• EP 2573981 A2 [0002]
• DE 102014202071 A1 [0003]

Cited non-patent literature

• ISO 11898-2 [0024]
• ISO 11898-3 [0024]

Claims (10)

A method of identification in a computer network (100) comprising a first subnetwork (116) comprising a first node (116A) and a second subnetwork (112) comprising a second node (114), characterized in that information about a signal (208) that the first node (116A) requires, (212) checking (212) whether there is a third node (116B) of the first subnetwork (116) providing the signal, depending on the information about the signal, depending on the result of the test, if the third node (116B) is present, an assignment of the signal to the first node (116A) and the third node (116B) is stored in a signal assignment, or if the third node (116B ) is not present or does not provide the signal, a request (216) is sent for the signal to the second node (114), a response is received from the second node (114), the response informing about e a fourth node (112B) that provides the signal, and an assignment of the signal to the first node (116A) and the fourth node (112B) is stored in a signal map. Method according to Claim 1 characterized in that a plurality of assignments of a plurality of signals to a plurality of nodes (102A, 102B, 104A, 104B, 106, 108A, 112A, 112B, 116A, 116B, 120A, 120B) of a plurality of subnetworks (102, 104 , 108, 112, 116, 120) is stored in the signal map by identifying for the plurality of signals received from the plurality of nodes (102A, 102B, 104A, 104B, 106, 108A, 112A, 112B, 116A, 116B, 120A, 120B) are required. Method according to Claim 1 or 2 Characterized in that information about a reception identification and information about a transmission identification of a node (116A) is received, said reception identification in a subnetwork (116) exclusively for messages on a data bus (1161) of the subnetwork (116 ) which are addressed at the node (116A) with the receive identification, the send identification marking exclusively messages which the node (116A) with the transmit identification on the data bus (1161) of the subnetwork (116) and wherein a topology of the subnetwork (116) is stored after receiving the information about the reception identifications and the information about the transmission identifications. Method according to Claim 3 , characterized in that information about a node type of the node (116) is received and stored with the information about the reception identification and the information about the transmission identification in the topology. Method according to Claim 4 characterized in that a plurality of information about receive identifications, a plurality of information about transmit identifications, or a plurality of information about node types from a plurality of nodes (102A, 102B, 104A, 104B, 106, 108A, 112A, 112B , 116A, 116B, 120A, 120B) in a plurality of subnetworks (102, 104, 106, 108, 112, 116, 120) by sending at least one poll in each of the plurality of subnetworks (102, 104, 106, 108, 112, 116, 120) is queried. Method according to Claim 5 characterized in that the at least one polling by a gateway computer (118) of the first subnetwork (116) connecting the first subnetwork (116) to the second subnetwork (112) in a message on a first data bus (1161) the first subnetwork (116) is sent, the message being provided with an identification determined in the first subnetwork (116) exclusively for messages from the gateway computer (118). Method according to one of Claims 1 to 6 characterized in that a plurality of subnetworks (102, 104, 108, 112, 116, 120) are configured as local controller area networks, wherein in each of the subnetworks (102, 104, 108, 112, 116, 120) different controllers (102A, 102B, 104A, 104B, 108A, 112A, 112B, 116B, 120A, 120B) are arranged, each of the controllers (102A, 102B, 104A, 104B, 108A, 112A, 112B, 116A, 116B, 120A , 120B) is connected to at least one gateway computer (106, 110, 114, 118, 122) from a plurality of gateway computers (106, 110, 114, 118, 122), wherein the plurality of gateway computers (106, 110, 114, 118, 122) connects the plurality of subnetworks as a global controller area network. Method according to one of the preceding claims, characterized in that a first list of signals which are required by nodes (116A, 116B) in the first subnetwork (116) is created, wherein a second list of signals which are generated by nodes (116) is applied. 116A, 116B) being providable in the first subnetwork (116), wherein the first list is compared to the second list, and wherein, depending on the result of the comparison, if a required signal is not included in the list of deployable signals, the request ( 216) is sent after this required signal in the second subnetwork (112). Device configured the method according to one of Claims 1 to 8th perform. Computer program, trained the method according to one of Claims 1 to 8th perform.

Images