Binary tree-based stream classification checking method
A binary tree and flow classification technology, applied in the field of flow classification search based on binary tree, can solve the problem of long search time, achieve the effect of improving throughput, reducing average time, and realizing dynamic flow classification rule update
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0031] The technical solutions of the present invention will be further described through specific embodiments below in conjunction with the accompanying drawings.
[0032] This specific embodiment requires two pieces of RAM as the master-slave binary tree to store the rules of the flow classification. The number of entries in the RAM is 2L, and L is the number of stages of the binary tree nodes, depending on the number of flow classification rules. The content of the entry is shown in Table 1:
[0033] Table 1
[0034] name
bit
illustrate
Key fields of the rule base
(L+n-1):L
The key field in the rule base, used to follow the key of the data packet
Fields are compared, and if they are equal, the lookup succeeds.
Packet Flow ID
(L-1):0
ID of the stream to which the packet belongs when the binary tree search succeeds
[0035] In the present invention, M registers are also required to be used to preserve the k...
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
