Host IP Range Matching for Overlapping Subnet Queries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional methods for matching host IP addresses with overlapping subnets and IP ranges are inefficient, particularly in large-scale networks with dynamic updates, leading to performance degradation and inconsistent query results.
Innovation Solution
A method involving preprocessing subnet and IP range information, converting IP addresses to a standardized format, and maintaining a sorted data structure for rapid querying and matching, using techniques like binary search to identify the most specific subnet or IP range containing a given host IP address.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If traditional linear search methods are used for IP address matching, then the implementation is simple, but the query efficiency deteriorates as the number of IP ranges increases
Solution Approach 1:
The patent transforms IP address matching from linear search to a parameter-based approach using prefix length and numeric conversion. IP addresses are converted to integers and ranges are defined by start/end integers with associated prefix lengths, enabling efficient comparison operations that scale with the number of ranges.
Solution Approach 2:
The patent segments the IP address space into discrete ranges with specific prefix lengths. Each IP range is divided into manageable units (individual IP addresses or subnets) that can be independently processed and compared, allowing the system to handle large numbers of ranges without performance degradation.
2Speed
If data structures like binary trees are used for IP address matching, then query speed improves, but the system complexity increases
Solution Approach 1:
The patent uses a simplified data structure that copies only the essential elements needed for matching: start integer, end integer, and prefix length for each range. This avoids the complexity of traditional binary tree structures while maintaining efficient query performance through straightforward integer comparisons.
3Reliability
If traditional matching methods are used, then the system can handle static IP ranges, but performance degrades with dynamic updates and frequent changes
Solution Approach 1:
The patent implements a dynamic matching system where IP ranges can be efficiently added, removed, or modified. The numeric conversion and range-based structure allow for O(log n) or better update performance, enabling the system to handle dynamic network configurations with frequent changes without significant performance degradation.
4Ease of manufacture
If linear search through lists of ranges is used, then the implementation is straightforward, but the matching precision deteriorates with overlapping ranges
Solution Approach 1:
The patent resolves overlapping range ambiguity by introducing prefix length as a tiebreaker parameter. When multiple ranges contain a given IP address, the system selects the match with the longest prefix length (most specific match), ensuring precise and consistent results even with overlapping ranges.
Data Source
Figure 1
Figure 2A
Figure 2B
AI summary
A method can include generating a data structure comprising a set of subnets or Internet Protocol (IP) ranges by calculating the lowest and highest IP addresses for each of a plurality of subnets or IP ranges, converting each calculated IP address into an integer value, and sorting the plurality of subnets or IP ranges in descending order based on a lowest converted integer value of each of the plurality of subnets or IP ranges. The method further comprises identifying a host IP address, iteratively querying, using the identified host IP address, individual subnets or IP ranges of the set of subnets or IP ranges in order of increasing size beginning with a subnet or IP range with a smallest size until identifying a subnet or IP range in which the host IP address falls, and labeling the host IP address with an indication of the identified subnet or IP range.