Compressed Tree Structure for Network Packet Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for filtering and classifying network packets in datacenters require significant processing resources, leading to increased latency and service impairment during DDoS attacks, as they rely on inefficient tree structures that necessitate excessive memory accesses.
Innovation Solution
A method is introduced to compress the tree structure associating network packet signatures with metadata, using single bit test nodes and leaf nodes, where sub-portions with consecutive single child non-leaf nodes are compressed into a sequence of bits, reducing memory accesses and improving filtering efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional tree structures are used for filtering and classifying network packets, then comprehensive packet analysis can be performed, but the number of memory accesses increases significantly, leading to increased latency and processing resource consumption
Solution Approach 1:
The patent implements a hierarchical tree structure where compressed paths are nested within the overall filtering tree. Consecutive single-child non-leaf nodes are collapsed into compressed path representations that contain sequences of bit values, effectively nesting multiple levels of traversal into a single compressed node that can be processed in one memory access.
Solution Approach 2:
The patent merges multiple consecutive single-child nodes into a single compressed path node. Instead of traversing each node separately (requiring multiple memory accesses), the compressed path combines the traversal logic of multiple nodes into one unified structure that can be evaluated in a single memory access, thereby reducing latency while maintaining classification accuracy.
2Reliability
If traditional tree structures are used for filtering and classifying network packets, then complete packet signature matching can be achieved, but processing resources are significantly consumed due to excessive memory accesses
Solution Approach 1:
The hierarchical tree structure with compressed paths nested within enables complete packet signature matching by preserving the full traversal logic in a condensed form. The compressed paths contain sequences of bit values that represent the complete path through what would otherwise be multiple intermediate nodes, ensuring matching accuracy is maintained while reducing memory access operations.
Solution Approach 2:
By merging consecutive single-child nodes into compressed path representations, the patent reduces the number of memory access operations required for packet filtering. This merging increases processing throughput by decreasing the number of sequential memory accesses, while the compressed paths preserve the complete matching logic to ensure filtering accuracy remains intact.
3Productivity
If tree structure compression is applied to reduce memory accesses, then filtering efficiency improves, but the complexity of managing compressed and non-compressed nodes increases
Solution Approach 1:
The patent segments the tree structure into distinct compressed path nodes and regular nodes. Each compressed path node is clearly identified and structured with specific fields (such as path length and bit sequences), while regular nodes maintain their traditional structure. This segmentation allows the system to manage different node types with appropriate handling logic, reducing the overall management complexity despite the introduction of compression.
Data Source
AI summary
Methods and systems are described for compressing a tree structure associating network packet signatures with network packet metadata, the tree structure comprising a plurality of non-leaf nodes of single bit test nodes and a plurality of leaf nodes comprising network packet metadata, the method comprising determining whether the sub-portion of the tree structure is to be compressed. If determination is made that the sub-portion of the tree structure is to be compressed, generating a compressed node data structure, the compressed node data structure comprising a path of the sub-portion of the tree structure, the path comprising a sequence of bits formed by a concatenation of the single bits associated with each one of the consecutive non-leaf nodes of the sub-portion of the tree structure, the number of bits of the sequence being equal or greater than the compression threshold.