Natural Name Graph for Duplicate Detection in Distributed Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In asynchronous distributed networks, duplicate objects can cause erroneous results due to the asynchronous nature of data exchange, leading to incorrect programming of hardware and software resources and resource wastage in correcting these errors.
Innovation Solution
A network device generates a natural name graph based on received objects and determines duplicates, removing them to prevent erroneous results by updating the graph and notifying other devices to remove duplicates as well.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If objects are exchanged in an asynchronous distributed network, then data exchange flexibility is improved, but duplicate objects cause erroneous results and resource wastage
Solution Approach 1:
The system implements feedback mechanisms where network devices monitor and track objects in the natural name graph, detecting duplicates through continuous state synchronization. When duplicates are detected, the system provides feedback signals to remove redundant objects, ensuring data consistency while maintaining asynchronous operation flexibility
Solution Approach 2:
The natural name graph serves as an intermediary data structure that mediates between incoming objects and the network device state. This intermediary layer allows the system to check for duplicates before processing, preventing erroneous results while preserving the asynchronous exchange model
2Reliability
If duplicate objects are detected and removed, then data consistency is improved, but additional processing overhead is introduced
Solution Approach 1:
The system performs preliminary actions by pre-establishing the natural name graph structure and pre-checking for duplicates before objects are fully processed. This preliminary organization reduces the complexity of duplicate detection during active processing, as the graph structure provides efficient lookup mechanisms
3Reliability
If the natural name graph is continuously updated to remove duplicates, then erroneous results are prevented, but network communication overhead increases
Solution Approach 1:
The system implements periodic action by updating the natural name graph at specific intervals or triggered by certain events rather than continuously. This periodic update mechanism prevents erroneous results while reducing network communication overhead compared to constant synchronization
Solution Approach 2:
The system extracts and removes only the duplicate objects from the natural name graph rather than retransmitting entire data structures. This extraction approach maintains error prevention while minimizing network communication overhead by transmitting only the necessary removal notifications
Data Source
AI summary
A network device receives first objects defining first network data associated with an asynchronous distributed network and an asynchronous distributed network operating system and generates a natural name graph based on the first objects. The network device provides information describing the natural name graph to other network devices in the asynchronous distributed network and receives a second object defining second network data. The network device determines whether one of the first objects in the natural name graph is a duplicate of the second object and removes the one of the first objects from the natural name graph, to generate an updated natural name graph, when the one of the first objects in the natural name graph is a duplicate of the second object. The network device provides the updated natural name graph to the other network devices to prevent the other network devices from generating erroneous results.