Distributed Network Node Hash Table for Rapid Resource Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional peer-to-peer protocols in industrial engineering systems fail to meet the requirements for rapid and reliable communication between network nodes, as they rely on time-consuming lookup mechanisms for resource location and do not efficiently manage communication speed.
Innovation Solution
A method for operating a distributed communications network where each network node maintains a hash table with identity values and addresses of all operational nodes, synchronizing this information through activity messages, allowing direct addressing and quick resource search, and utilizing a double-key hash table to manage device identities and resource publication with redundancy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If conventional peer-to-peer protocols are used for resource location, then the system maintains decentralized structure, but the communication speed and resource search efficiency deteriorate due to time-consuming lookup mechanisms
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing hash tables mapping resource identifiers to network node addresses before actual resource search operations. Each network node maintains a local hash table that is pre-populated with resource-location mappings, allowing O(1) direct lookup instead of time-consuming distributed search. This pre-computation eliminates the need for iterative lookup mechanisms during runtime, directly resolving the speed-time contradiction.
Solution Approach 2:
The patent introduces hash tables as intermediary data structures that mediate between resource identifiers and network node addresses. Instead of direct peer-to-peer lookup or iterative search, the hash table serves as an intermediary layer that translates resource IDs to node addresses in constant time. This intermediary mechanism decouples the resource search process from the underlying network topology, achieving fast communication while maintaining decentralized architecture.
2Ease of operation
If each network node maintains complete information about all other nodes, then direct addressing and resource search are simplified and accelerated, but the memory requirements and table management complexity increase
Solution Approach 1:
The patent applies segmentation by dividing the global network state information into distributed hash tables maintained at each network node. Instead of one centralized directory containing all node information, the system segments the addressing information across multiple decentralized hash tables, each node maintaining only the portion relevant to its responsibilities. This segmentation reduces individual node memory requirements while preserving global addressability capabilities.
Solution Approach 2:
The patent changes the parameter representation by using hash functions to transform resource identifiers into compact table indices. Instead of storing and searching through complete node lists or hierarchical structures, the system transforms the search key (resource ID) into a direct array index via hashing. This parameter transformation reduces the complexity of table management from O(n) linear search to O(1) direct access, simplifying operations while maintaining completeness of information.
3Reliability
If activity messages are transmitted regularly to synchronize node information, then the hash tables remain up-to-date with current node addresses, but the network traffic and energy consumption increase
Solution Approach 1:
The patent implements periodic action through scheduled activity messages that circulate through the network at regular intervals. Each network node transmits its current state information (address, status) in these periodic messages, allowing other nodes to update their hash tables systematically. This periodic synchronization ensures information accuracy without requiring continuous communication, reducing energy consumption compared to event-driven or continuous update mechanisms while maintaining reliable up-to-date information.
Data Source
AI summary
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.