Policy rule matching query tree generating method, matching method and device

A strategy configuration and matching method technology, applied in the field of computer networks, can solve the problem of not being able to meet the needs of high efficiency and high accuracy of routing addressing, and achieve the effect of convenient matching and flexible formulation

Active Publication Date: 2013-02-27
BEIJING UNIV OF POSTS & TELECOMM
View PDF2 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, the existing routing addressing policy matching scheme can no longer meet the high efficiency and high accuracy requirements of routing addressing in the future network

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
  • Policy rule matching query tree generating method, matching method and device
  • Policy rule matching query tree generating method, matching method and device
  • Policy rule matching query tree generating method, matching method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] like figure 1 As shown, it is a principle flowchart of the policy rule matching query tree generation method provided by Embodiment 1 of the present invention, specifically as follows:

[0062] Step 11, set the current node position S as the node root, and set the current character C as the first character of the string to be added to the query tree.

[0063] As mentioned above, in the integrated network, a large number of rich policy rules can be set based on UTAG+STAG, that is, the information of the leaf nodes proposed in the embodiment of the present invention, each leaf node is a form of (UTAG, STAG) policy rules. A (STAG, UTAG) will be generated every time the user accesses the service, and whether these policy rules allow the user to access the resource is queried through the method of the embodiment of the present invention. For the query tree in this embodiment, the first step of adding the string information that needs to be added to the query tree accuratel...

Embodiment 2

[0075] like figure 2 As shown, the embodiment of the present invention provides a policy rule matching method, specifically as follows:

[0076] Step 21, set the current node position S as the node root, and set the current character C as the first character of the character string to be matched in the query tree.

[0077]The process of policy matching is similar to the process of query tree generation. It is a cyclic process of matching and comparing each character in the string that needs to be matched in the query tree one by one in the query tree. First, you need to set the current node position S as the node root, that is, the root node. Then set the current character C as the first character of the string to be matched in the query tree, and start matching the first character.

[0078] Step 22, compare the current character C with the lower-level nodes of node S, if there are nodes n1, n2, ... nk equal to character C in the lower-level nodes of node S, then set the cu...

Embodiment 3

[0105] like Figure 4 As shown, the embodiment of the present invention provides a policy rule matching device, the device includes a setting unit 31, a matching unit 32 and a judging unit 33, wherein,

[0106] The setting unit 31 is configured to set the current node position S as the node root, and the current character C as the first character of the character string to be matched in the query tree.

[0107] The matching unit 32 is used to compare the current character C with the lower-level node of the node S. If the lower-level node of the node S has nodes n1, n2, ... nk equal to the character C, the setting unit 31 is notified to set the current The node positions S are respectively set as nodes n1, n2, . . . nk.

[0108] Judgment unit 33, for judging whether the current character C is the last character of the character string that needs to be matched in the query tree, if not the last character, notify the setting unit 31 to set the current character C as the characte...

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 discloses a policy rule matching query tree generating method and a matching method. The generating method comprises the following steps: (A) arranging the current node position S as a node root and arranging the current character C as a first character; (B) comparing the current character C with nodes at a next level of the node S; and if a node n equal to the character C exists in the nodes at the next level of the node S, obtaining that S is equal to n; otherwise, establishing a new sub node n of the node S and setting that n is equal to C and S is equal to n; and (C) judging whether the current character C is the last character or not; if the current character C is the last character, ending up the process; otherwise, setting the current character C as the next character; and executing the step (B). According to the invention, as leaf nodes of the query tree are assigned with values by the characters and values of the leaf nodes are allowed form a set, the policy matching rule is more flexibly made, and a routing and addressing or policy matching problem based on a naming label in a novel network system architecture can be solved.

Description

technical field [0001] The invention relates to the technical field of computer networks, in particular to a policy rule matching query tree generating method, matching method and device. Background technique [0002] With the continuous development of communication technology and computer network technology, the scale of Internet continues to increase, the sharp increase of backbone network routing entries and the high-speed increase of bandwidth make the time required for routers to process packets higher and higher, and routing lookup has become a constraint The bottleneck of router performance. [0003] Existing Internet route lookup method adopts the longest prefix matching lookup method, by looking for the routing entry with the most matching digits from the leftmost with the destination IP address of the data packet in the routing table as the preferred route. The difficulty of the longest prefix matching search is that not only the bit value of the address prefix ne...

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
Inventor 关建峰张宏科许长桥张朝贵权伟戴彧曹远龙
Owner BEIJING UNIV OF POSTS & TELECOMM
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