Subnet Address Generation Using Binary Tree LPM Coverage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Generating a network address that is an LPM on a specific subnet and not on other subnets is a high-complexity operation, requiring checks against all network addresses in a subnet scope, which is time and processor intensive.
Innovation Solution
A virtual arrangement of nodes with respective counters is used to simulate a network in a binary tree format, allowing for the generation of network addresses with O(1) time complexity, where each node's counter accumulates unique network addresses, enabling efficient traversal to find an LPM on a requested subnet.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If all network addresses in a subnet scope are checked against all other subnets to determine LPM, then the accuracy of LPM matching is improved, but the time complexity and processor intensity increase significantly
Solution Approach 1:
The patent segments the network address space into a binary tree structure where each node represents a subnet. This segmentation allows the system to traverse only the relevant paths in the tree rather than checking all network addresses against all subnets, reducing time complexity while maintaining LPM matching accuracy.
Solution Approach 2:
The patent performs preliminary organization of network addresses into a binary tree structure with counters at each node. This pre-processing allows the system to efficiently determine LPM matches through tree traversal without requiring exhaustive checks during actual matching operations, thus reducing runtime.
2Loss of time
If a binary tree virtual arrangement with counters is used to generate network addresses, then the time complexity is reduced to O(1), but the device complexity increases due to the virtual node arrangement
Solution Approach 1:
The patent creates a virtual copy of the network address space in the form of a binary tree structure. This virtual arrangement allows the system to perform LPM matching operations more efficiently without manipulating actual network addresses, thereby reducing time complexity while the virtual structure itself manages the complexity.
Solution Approach 2:
The patent transforms the traditional flat network address checking approach into a hierarchical tree structure. This dimensional change from linear checking to tree traversal enables O(1) time complexity by organizing data in a multi-level structure that allows efficient navigation and counting.
Data Source
AI summary
Systems and methods for coverage of network addresses in a network enables a network end point to provide communication in the network based in part on a virtual arrangement of the network that includes a root node with a root counter and includes one or more sub-nodes with respective sub-node counters, where the virtual arrangement can be used to provide at least one network address that may be associated with a representative longest prefix match (LPM) having a prefix from the root node to a representative node and using a suffix that is based in part on a node level of the representative node with respect to the root node, and where the representative node can be a lower absent sub-node relative to a subnet node in the virtual arrangement.