Network Connection Tracking Method Using Balanced Binary Tree Algorithm

A balanced binary tree and network connection technology, applied in the field of network connection tracking using the balanced binary tree algorithm, can solve problems such as the inability to achieve high-speed connection matching, and achieve the effects of stable calculation method, stable matching speed, and accurate memory and time.

Active Publication Date: 2020-09-22
深圳市云盾科技有限公司
View PDF13 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It solves the problem that the technical solutions of the prior art cannot realize high-speed connection matching under limited memory and that application layer devices such as firewalls track network connections

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
  • Network Connection Tracking Method Using Balanced Binary Tree Algorithm
  • Network Connection Tracking Method Using Balanced Binary Tree Algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are some of the embodiments of the present invention, but not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0040] Please refer to figure 1 , figure 1 It is a network connection tracking method using a balanced binary tree algorithm proposed in the first preferred embodiment of the present invention. The method is as follows figure 1 shown, including the following steps:

[0041] A. Obtain the five-tuple {source IP, destination IP, source port, destination port, protocol} of each connection, record it as Y, and insert the connection Y into the balanced bin...

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 network connection tracking method adopting the balanced binary tree algorithm. The method comprises the following steps: Step 101, acquiring each connected quintuple Y, andinserting each Y in a balanced binary tree T, wherein each Y comprises a source IP, a target IP, a source port, a target port, and a protocol; and Step 102, searching the balanced binary tree T to find out whether each Y exists or not, updating data of a current root node RX if the corresponding Y exists, and carrying out subsequent steps if the corresponding Y does not exist. The method adoptingthe technical scheme has the advantage that under the condition of a limited memory, high-speed connection matching and network connection tracking by firewalls and other application layer equipment can be achieved.

Description

technical field [0001] The invention relates to the field of information security, in particular to a network connection tracking method using a balanced binary tree algorithm. Background technique [0002] The prior art provides an optimization method for connection tracking under the netfilter framework, and provides an optimization method for connection tracking under the netfilter framework, including: defining and initializing the current connection tracking number M, the maximum connection tracking number Mmax, the currently applied connection Tracking number N, the maximum number of connection tracking applications Nmax, Nmax>Mmax; when applying for new connection tracking, add 1 to N, and judge M>Mmax? If yes, create a new connection track after performing aging processing; if no, then judge N>Nmax? , if so, return an error, otherwise create a new connection tracking; after the newly applied connection tracking is confirmed, add 1 to M, and add it to the co...

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 Patents(China)
IPC IPC(8): H04L29/06H04L29/08H04L12/851H04L12/801
CPCH04L47/10H04L47/2483H04L63/02H04L69/329
Inventor 肖立昕程雅峰
Owner 深圳市云盾科技有限公司
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