Network Device Wildcard Domain Name Hashing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network devices face high computational resource utilization when using tree-based or regular expression-based search techniques for pattern matching of domain names, especially when wildcards are involved, limiting their ability to handle massive domain name matching efficiently.
Innovation Solution
A network device employs a hashing-based approach to process domain names with wildcard characters by extracting primary patterns, generating hash keys, and storing them in a hash table, allowing for efficient search and matching of domain names with reduced resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If tree-based or regular expression-based search techniques are used for pattern matching of domain names with wildcards, then pattern matching capability is achieved, but computational resource utilization increases
Solution Approach 1:
The patent replaces the mechanical tree-based traversal or regular expression matching system with a hashing-based system. Domain names and search queries are transformed into hash values through a hash function, enabling direct access to pattern matches without sequential traversal or complex pattern evaluation, thereby reducing computational resource utilization while maintaining pattern matching capability
Solution Approach 2:
The patent transforms the domain name data from its original string format into hash values through a hash function. This parameter transformation changes the search space from linear/text-based to numerical/hash-based, enabling efficient comparison and matching operations that consume fewer computational resources while preserving the ability to match domain names with wildcards
2Adaptability or versatility
If tree-based or regular expression-based search techniques are used for pattern matching of domain names with wildcards, then pattern matching capability is achieved, but processing time increases
Solution Approach 1:
The patent replaces the mechanical tree-based traversal or regular expression matching system with a hashing-based system. Domain names and search queries are transformed into hash values through a hash function, enabling direct access to pattern matches without sequential traversal or complex pattern evaluation, thereby reducing processing time while maintaining pattern matching capability
Solution Approach 2:
The patent performs preliminary hashing of domain names into the hash table before search operations. This preliminary action transforms the data into a format that enables rapid lookup, so that when a search query arrives, it can be immediately hashed and compared against pre-computed hash values, significantly reducing processing time compared to real-time tree traversal or regular expression evaluation
Data Source
AI summary
A network device may receive data, may extract primary patterns from a plurality of domain names included in the data, may process the primary patterns, with a hash model, to generate hash keys for the primary patterns, wherein a hash key includes a hash value associated with a wildcard character, and may store the plurality of domain names in a hash table. The network device may extract a particular primary pattern from a particular domain name included in a search request, may determine potential matching patterns based on the particular primary pattern, and may process the potential matching patterns, with the hash model, to generate potential matching hash keys for the potential matching patterns, wherein a hash key includes a hash value associated with a wildcard character. The network device may search, based on the potential matching hash keys, the hash table to identify a matching domain name.