A storage and query method and device for regional information of IP address
A technology of IP address and regional information, which is applied in the field of communication and can solve problems such as large storage space
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0164] For example, the IP address segment to be stored is: 5.2.1.10-5.2.1.255, and the region information it carries is Y.
[0165] First, compare the first address with the last address, and obtain the sequence number M=N=4 of the first subsection among the subsections with different numbers between the first address and the last address.
[0166] Then, the IP address segment is split into one continuous IP address segment, and the fourth sub-segment in the continuous IP address segment is a continuous number.
[0167] Next, store the element of the root node: store the obtained number 5 of the first sub-segment into the element of the root node of the multi-fork tree.
[0168] Finally, store the sub-node elements: store the numbers obtained from the second sub-section to the third sub-section in the elements of the first-level sub-nodes of the multi-fork tree respectively; In the layer child node, the stored consecutive numbers (10-255) are used as an element, and the regi...
example 2
[0170] For example, the IP address segment to be stored is: (5.1.10.12-5.1.255.255), and the region information it carries is Y.
[0171] First, compare the first address with the last address, and obtain the sequence number M=3 of the first subsection among the subsections with different numbers between the first address and the last address, where M
[0172] Then, according to the allocation rule of the IP address and the segmentation rule of the sub-segment, the IP address is split into several consecutive IP address segments: (5.1.10.12-5.1.10.255) and (5.1.11.0-5.1.255.255).
[0173] First store the IP address segment (5.1.10.12-5.1.10.255): obtain the numbers of each sub-segment in turn (5, 1, 10, 12-255); store the number 5 of the first sub-segment to the root of the multi-fork tree In the first element of the node; if it is judged that the second subsection is not a continuous number, then the number of the second subsection is stored in the element of the first lay...
example 3
[0176] For example, the IP address segments to be stored are: (5.1.10.0-5.1.10.11) and (5.1.10.12-5.1.10.255), the region information carried by the former is Y 1 , the region information carried by the latter is Y 2 .
[0177] First, store the IP address segment (5.1.10.0-5.1.10.11):
[0178] Apparently, among the subsections with different numbers of the first address and the last address, the sequence number of the first subsection is M=4, M=N; The 4th sub-section is a continuous number; store the root node element: store the number 5 of the first sub-section obtained in the element of the root node of the multi-fork tree; store the child node element: store the obtained 2nd sub-section to the 3rd The numbers of sub-sections are stored in the elements of the first-level sub-nodes of the multi-fork tree respectively; in the next-level sub-nodes of the elements storing the numbers of the third sub-section, the stored consecutive numbers (0-11) are used as an element , and ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



