Method for operating a distributed communications network

• US 8,724,640 B2
• Filed: 08/27/2008
• Issued: 05/13/2014
• Est. Priority Date: 09/13/2007
• Status: Active Grant

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Gerdes, Christoph, Kern, Claus, Kleegrewe, Christian, Southall, Alan, Rusitschka, Sebnem
• Primary Examiner(s): Ton, Dang
• Assistant Examiner(s): Preval, Lionel
• Application Number:
  US12/677,876
• Publication Number:
  US 20100303089A1
• Time in Patent Office: 2,085 Days
• Field of Search: 370/401, 370/389, 370/254, 370/257, 370/338
• US Class Current: 370/401
• CPC Class Codes: F04B 33/005 specially adapted for inflating tyres of non-motorised vehicles, e.g. cycles, tricycles
• CPC Class Codes: H04L 61/4541 Directories for service discovery
• CPC Class Codes: H04L 63/065 for group communications cryptographic mechanisms or cryptographic arrangements for key management involving conference or group key H04L9/0833
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services

Abstract

A method for operating a dezentralized communication network with network nodes is provided. The method is based on protocols in conventional peer-to-peer networks. The method provides rapid searching of resources whereby each network node manages a table containing information regarding all the other network nodes, such that a network that contains the resource is immediately retrieved among the table entries. Furthermore, the table contains device names of technical components on which the network nodes are mapped, so that a technical component is directly addressed also via its device name without use of the search process.

Claims

1. A method for operating a distributed communications network with a plurality of network nodes, each network node being assigned an identity value from a range of identity values and an address to communicate with other network nodes, and each network node being responsible for a sub-range of identity values from the range, comprising:

managing a table by each operational network node, wherein the table is a double-key hash table containing an entry for each operational network node in the communications network, the entry comprising the identity value and the address of the respective network node, wherein the identity values equal hash values, and wherein the double-key hash table further comprises an engineering component identity for each network node, each engineering component identity corresponding to an engineering component or a part of an engineering component of an engineering system;

sending regularly activity messages by each operational network node to the other network nodes of the communications network, the activity messages each containing the identity value, the address of the respective network node and the engineering component identity; and

synchronizing the table by each operational network node, upon receiving an activity message, with the contents of the activity message,

monitoring the network nodes in order to detect when a network node becomes inactive, the monitoring being performed via a monitoring node which is assigned to the network node,

wherein the monitoring node monitors whether the network node is transmitting activity messages,

wherein, when the network node is no longer transmitting activity messages, the monitoring node transmits a deactivation message to all the other network nodes, the deactivation message containing the identity value of the network node,

wherein the inactive network node no longer sends activity messages, and

wherein a network node receiving a deactivation message sets the status field of the entry of the network node given by the identity value in the deactivation message to inactive.

2. The method as claimed in claim 1, wherein the activity messages are transmitted into the communications network by the respective network node as broadcast messages.

3. The method as claimed in claim 1, wherein the deactivation message is transmitted into the communications network by the monitoring node as a broadcast message.

4. The method as claimed in claim 1, wherein the monitoring node is a network node that is a neighbor of the monitored network node in the sequence of identity values, and wherein two neighboring network nodes are the monitoring nodes of a monitored network node.

5. The method as claimed in claim 4, wherein the monitoring node, in the event that it receives an activity message from a network node that is a new addition to the communications network or newly activated network node, checks whether the new network node is a new neighboring network node, wherein, when the new network node is a new neighboring network node, the monitoring node starts to monitor the new network node.

6. The method as claimed in claim 1, wherein a network node transmits a deactivation message containing its identity value to all the other operational network nodes when the network node becomes inactive.

7. The method as claimed in claim 1, wherein the table of a network node contains entries for all the identity values in the range, a status field being used for each entry to indicate whether the network node of the entry is present in the communications network or operational or inactive.

8. The method as claimed in claim 7, wherein, in case a network node receives activity messages from a network node that was previously not yet present in the communications network or was previously inactive, the corresponding entry in the table for the previously not yet present or previously inactive network node is synchronized with the contents of the activity message, the status field of the corresponding entry being set to active.

9. The method as claimed in claim 7, wherein each operational network node is responsible for the sub-range of identity values between its identity value and the next larger or next smaller identity value of its operational neighbor node.

10. The method as claimed in claim 9, wherein, when the status field of an entry in the table for the operational network nodes changes, the sub-ranges of the identity values for which the operational network nodes are responsible are adapted based upon the changing number of operational network nodes.

11. The method as claimed in claim 1, wherein resources are published in the communications network by some of the network nodes by a keyword assigned to a resource being mapped onto an identity value, the resource or a link to the resource being saved on a publication node, which is the network node that is responsible for the sub-range containing the identity value on which the keyword is mapped.

12. The method as claimed in claim 1, wherein a keyword of the hash values is mapped onto the identity value by a hash function, and wherein the hash function is selected to achieve an even distribution of resources on the network nodes.

13. The method as claimed in claim 11, wherein on publishing a resource, a replication is made so that the resource or a link to the resource is saved on other network nodes in addition to the publication node.

14. The method as claimed in claim 13, wherein the additional network nodes are determined by adding prime numbers to the identity value of the publication node.

15. The method as claimed in claim 11, wherein, when the responsibility of a network node for a resource in the communications network changes, the resource is republished in the communications network.

16. The method as claimed in claim 11, wherein searching for resources in the communications network is done by a searching network node mapping the keyword of the resource onto the identity value and using its table to identify the network node responsible for the resource, this network node being addressed via its address in the table.

18. The method as claimed in claim 1, wherein the engineering system comprises a voltage distribution system, and wherein components of the engineering system comprise switching units in the voltage distribution system.

19. The method as claimed in claim 18, wherein the engineering system comprises a power generation system, in particular a turbine, and/or an automation system, in particular a production line.

17. A distributed communications network, comprising:

a plurality of network nodes, each network node being assigned an identity value from a range of identity values and an address to communicate with other network nodes, and each network node being responsible for a sub-range of identity values from the range,

wherein the communications network is configured such that

each operational network node manages a double-key hash table containing an entry for each operational network node in the communications network, the entry comprising the identity value and the address of the network node, wherein the identity values equal hash values, and wherein the double-key hash table further comprises engineering component identities for each network node, each engineering component identity corresponding to an engineering component or a part of an engineering component of an engineering system,

each operational network node regularly sends activity messages to the other network nodes of the communications network, the activity messages each containing the identity value, the address of the network node, and the engineering component identity, and

each operational network node, upon receiving an activity message, synchronizes its table with the contents of the activity message,

wherein each network node is monitored in order to detect when a network node becomes inactive via a monitoring node which are assigned to the network node,

wherein the monitoring node monitors whether the network node is transmitting activity messages,

wherein, when the network node is no longer transmitting activity messages, the monitoring node transmits a deactivation message to all the other network nodes, the deactivation message containing the identity value of the network node,

wherein the inactive network node no longer sends activity messages, and

wherein a network node receiving a deactivation message sets the status field of the entry of the network node given by the identity value in the deactivation message to inactive.