Domain name matching method based on tree automaton

A matching method and automaton technology, applied in the fields of information technology and domain names, can solve problems such as low efficiency, achieve the effects of ensuring accuracy, saving node storage space, and avoiding hash conflicts

Active Publication Date: 2016-08-03
CHINA INTERNET NETWORK INFORMATION CENTER
View PDF6 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The existing algorithm performs byte-by-byte matching, and the CPU operation bit width of modern computer systems has generally reached 64 bits, so the existing domain name matching method is inefficient

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Domain name matching method based on tree automaton
  • Domain name matching method based on tree automaton
  • Domain name matching method based on tree automaton

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] In order to make the above objects, features and advantages of the present invention more obvious and understandable, the present invention will be further described below through specific embodiments and accompanying drawings.

[0031] A domain name is a character string representing an IP address, consisting of several fields, each field (label) is separated by ".", such as www.sina.com. The domain name itself has obvious hierarchical structure characteristics, and the domain name matching is also carried out segmented matching with the label as the unit. For the segmentation feature of domain name matching, the present invention divides the matching process into the following steps:

[0032] 1. Fill each segment of the domain name to be matched and the pattern substring to an integer multiple of n bytes. If this segment is already an integer multiple of n bytes, no padding is required, and n depends on the minimum operation bit of the computer system Width L, the ca...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a domain name matching method based on a tree automaton. The method comprises the following steps: filling a domain name to be matched and each fragment of a model substring to integer multiples of n bytes, wherein n is equal to L divided by 8 and L is a minimum operation bit width of a computer system; then constructing the tree automaton by taking the n bytes of the model substring as units; then, sequentially executing the tree automaton of the domain name to be matched until a domain name matching is finished from a root node. By taking the n bytes as the matching units when a matching operation is carried out, the matching operation efficiency of the method is much higher than that of an existing character string matching method; the tree automaton takes a hash value as a table item storage address, and a storage space occupied by table items can be reduced; a hash collision domain is limited in a local-grade node. The domain name matching method based on the tree automaton is applicable to fixed prefix matching or fixed postfix matching of the domain name, and the matching operation of other character strings with same stratification characteristics.

Description

technical field [0001] The invention belongs to the fields of information technology and domain name technology, and in particular relates to a domain name matching method based on tree automata. Background technique [0002] With the rapid development of Internet technology, the access traffic of domain names has also increased rapidly, and the background server is required to have higher resolution capabilities and security protection capabilities. When the background server performs domain name service, it needs to match domain names, and how to quickly match domain names is the key issue. [0003] Most of the existing matching methods are string matching: the domain name to be matched is regarded as a string T, and there are n pattern substrings P1, P2, ..., Pn, and it is searched whether there is any pattern string in T. The common way to implement this type of algorithm is: firstly, n pattern strings are calculated to generate a tree structure, and the string T only n...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/2255G06F16/951
Inventor 李晓东李洪涛孙云刚罗瑶武丽帅
Owner CHINA INTERNET NETWORK INFORMATION CENTER
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap