Dynamic Query Area Adjustment for Network Device Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In communication networks, especially those with subnets, identifying all devices efficiently is challenging due to bandwidth limitations and packet losses, leading to incomplete device identification and uncertainty about unresponsive devices.
Innovation Solution
A method that dynamically adjusts the query area by monitoring the number of identifiers received and using the addresses of identified devices to define reduced request areas, ensuring that only a threshold value of identifiers are processed, and iteratively refining the query range to ensure complete identification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a Who-Is query is broadcast to reach a group of devices in an unknown communication network, then more devices can be identified, but packet loss occurs due to bandwidth limitations and router forwarding thresholds
Solution Approach 1:
The address space is divided into multiple query areas, allowing the identification process to be segmented into manageable portions. This prevents overwhelming the network bandwidth while systematically covering the entire address space, thus avoiding packet loss while maintaining identification completeness.
Solution Approach 2:
The query area size is dynamically adjusted based on the number of devices identified in previous iterations. The method learns from network responses and adapts the broadcast scope to match actual network conditions, optimizing between identifying all devices and avoiding packet loss from excessive bandwidth usage.
2Reliability
If the address space is searched in sections by sending identification requests for specific areas, then packet loss is avoided, but the identification process becomes time-consuming
Solution Approach 1:
The method dynamically determines query area sizes based on actual device distribution patterns observed during the identification process. Instead of using fixed or conservative section sizes, the algorithm adapts to the network's actual device density, reducing unnecessary queries in sparse areas while maintaining thorough coverage in dense areas, thus minimizing identification time without sacrificing completeness.
Solution Approach 2:
The identification method uses feedback from previous query results to optimize subsequent queries. By analyzing the distribution and density of identified devices, the system adjusts future query strategies to avoid redundant searches in already-explored or sparse regions, significantly reducing total identification time while ensuring all devices are eventually identified.
3Productivity
If a large query range is used to identify devices quickly, then identification speed increases, but packet loss and loss of identification identifiers occurs due to exceeding bandwidth and router thresholds
Solution Approach 1:
The identification process segments the address space into controlled query areas, preventing any single broadcast from exceeding network bandwidth capacity or router forwarding thresholds. This segmentation maintains identification speed by systematically processing multiple segments rather than requiring repeated full-range broadcasts.
Solution Approach 2:
The method performs partial identification actions in each iteration, focusing on specific query areas rather than attempting to identify all devices in one exhaustive broadcast. This partial action approach prevents information loss by keeping each query within reliable transmission limits while progressing toward complete identification through multiple targeted iterations.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The method involves subdividing an address space into request regions. An identification request is sent (42) from higher-level device to all the addresses in the request region. The identification codes received from the devices are collected. The number of identification codes is compared (48) with a predefined threshold value. A new request region is obtained when the number of identification codes is below threshold value. A reduced request region is obtained when the number of identification codes is above threshold value. Independent claims are included for the following: (1) a non-transitory computer readable medium storing program for identifying devices in communication network; and (2) an electrical device.