CN107835175A - Using the network connection tracing method of balanced binary tree algorithm - Google Patents

Using the network connection tracing method of balanced binary tree algorithm Download PDF

Info

Publication number
CN107835175A
CN107835175A CN201711096312.7A CN201711096312A CN107835175A CN 107835175 A CN107835175 A CN 107835175A CN 201711096312 A CN201711096312 A CN 201711096312A CN 107835175 A CN107835175 A CN 107835175A
Authority
CN
China
Prior art keywords
node
binary tree
subtree
present
balanced binary
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711096312.7A
Other languages
Chinese (zh)
Other versions
CN107835175B (en
Inventor
肖立昕
程雅峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Shield Technology Co Ltd
Original Assignee
Shenzhen Shield Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Shield Technology Co Ltd filed Critical Shenzhen Shield Technology Co Ltd
Priority to CN201711096312.7A priority Critical patent/CN107835175B/en
Publication of CN107835175A publication Critical patent/CN107835175A/en
Application granted granted Critical
Publication of CN107835175B publication Critical patent/CN107835175B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/02Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2483Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of network connection tracing method using balanced binary tree algorithm, methods described comprises the following steps:The five-tuple Y each connected is obtained, the Y includes:Source IP, Target IP, source port, target port and agreement, the Y is inserted into balanced binary tree;Step S102, search whether the Y be present in balanced binary tree T, the Y as described in existing, update current root node RXData, if the Y is not present.Technical scheme provided by the invention has the advantages of application layer equipment tracking networks such as high speed matching connection and the fire wall realized under limited memory connection.

Description

Using the network connection tracing method of balanced binary tree algorithm
Technical field
The present invention relates to information security field, more particularly to a kind of network connection track side using balanced binary tree algorithm Method.
Background technology
Prior art provides the optimization method that tracking is connected under a kind of netfilter frameworks, there is provided a kind of netfilter The optimization method of tracking is connected under framework, including:Define and initialize current connection tracking number M, maximum connection tracking number Mmax, The current connection tracking number N applied, connection tracking the number Nmax, Nmax of maximum application>Mmax;In new application connection tracking When, N adds 1, judges M>MmaxIf it is, new connection tracking is created after carrying out burin-in process;If it is not, then judge N> NmaxIf then returning to mistake, if otherwise creating new connection tracking;After the connection tracking newly applied confirms, M adds 1, and It is added into and has confirmed that connection tracking chained list.The embodiment of the present invention ensure that the quantity of effectively connection tracking;Optimize exception Reason;It specify that connection tracking confirms the responsibility in two stages in alloc initialization with confirm;Normal online is ensure that, under The good resource of speed can be also effectively maintained during load.
Prior art also provides a kind of network traffics identifying system and method based on dynamic data packet sampling, there is provided a kind of Network connection tracing method and system, methods described include connection trace logic, wherein the connection trace logic includes processing The table of connection unconfirmed and processing have confirmed that the table of connection, the described method comprises the following steps:For connection unconfirmed, judgement is It is no to meet confirmation condition;If meeting confirmation condition, move to processing and have confirmed that in the table of connection;Processing is had confirmed that connection Connection in table carries out protocol stack subsequent processes successively.The present invention is using the nullified connection of two-stage connection Track Table structure or is not intended to Justice connection takes limited Internet resources and is preferably minimized, while data packets in advance is distinguished by track its connection status.
Prior art can not realize the application layer equipment tracking network such as high speed matching connection and fire wall under limited memory The problem of network connects.
The content of the invention
The application provides a kind of network connection tracing method using balanced binary tree algorithm.It solves the skill of prior art Art scheme can not realize asking for the application layer equipment such as high speed matching connection and fire wall under limited memory tracking network connection Topic.
On the one hand, there is provided a kind of network connection tracing method using balanced binary tree algorithm, methods described include as follows Step:
Step S101, the five-tuple Y each connected is obtained, the Y includes:Source IP, Target IP, source port, target port And agreement, the Y is inserted into balanced binary tree;
Step S102, search whether the Y be present in balanced binary tree T, the Y as described in existing, update current root node RXData, if the Y, step 103 and subsequent step is not present;
Step S103, it is vacant to judge whether balanced binary tree T interior joints number has, such as balanced binary tree T interior joint numbers Without vacant, end operation, if any vacant, the R is judgedXWith the presence or absence of data, such as described RXIn the absence of data, data are inserted To the RX, perform step 105 and subsequent step;Such as RXData be present, perform step S104;
Step S104, by the Y and current root node five-tuple XXCompare, if Y<Xx, into the left side son section of the Rx Point Rx-1 carries out step D again, if Y>Xx, the right child node Rx+1 into the Rx carries out step D again, if Y=Xx, renewal is worked as Preceding root node Rx data;
Step S105, it is F1 or F2 according to the order of the balanced turning of Determines binary tree;
The right subtree of current root node is designated as R, and the left subtree of current root node is designated as L;
F1:If the node number of R right subtree is more than L node number, binary tree T is overturn to the left, if R left subtree Node number be more than L node number, then first overturn R to the right, update R nodal information, then overturn binary tree T to the left;
F2:If the node number of L left subtree is more than R node number, binary tree T is overturn to the right, if L right subnumber Node number be more than R node number, then first overturn L to the left, update L nodal information, then overturn binary tree T to the right;
Step S106, child node is overturn, is specifically included:
The left subtree of current root node is carried out step F upset left subtrees as root node, updates left subtree information;
The right subtree of current root node is carried out step F upset right subtrees as root node, updates right subtree information;
Step S107, in doubly linked list, after carrying out data processing, the five-tuple of current data is moved to doubly linked list The head node of middle time linked list;
Step S108, when the connection ends, the five-tuple in balanced binary tree is deleted, while also deleted in doubly linked list Remove.
Optionally, it is described to search whether the Y be present in balanced binary tree T, including:
To Y compared with Xx,
If Y<Xx, the left child node Rx-1 into root node Rx are compared again,
If Y>Xx, the right child node Rx+1 into root node Rx are compared again,
If Y=Xx, the Y is present in binary tree T;If node is sky, the Y is not present in binary tree T.
Optionally, whether the balanced binary tree T interior joints number is vacant, including:
If present node number N >=maximum node number M, y-bend tree node is without residue;
If N<M, then y-bend tree node have residue.
Optionally, it is described when the connection ends to delete the five-tuple in balanced binary tree, while also in doubly linked list Delete, including:
First look for needing the node A deleted, check that node A whether there is left and right subtree;
If left and right subtree, direct deletion of node A is not present.
If in the presence of only existing left subtree or right subtree, deletion of node A, and replace node A using its child node;
If left and right subtree is all present, deletion of node A, it is replaced according to the condition selection wherein big right child node of numerical value Node A, while renewal time chained list content.
Second aspect, there is provided a kind of computer program product, the computer program product include storing computer journey The non-transient computer-readable recording medium of sequence, the computer program are operable to make computer perform described in first aspect Method.
The third aspect, a kind of computer-readable recording medium, it stores the computer program for electronic data interchange, its In, the computer program causes computer to perform the method described in first aspect.
Technical scheme provided by the invention, can be with higher speed by being attached tracking using balanced binary tree Complete insertion, matching and delete, in the case where connection quantity has 2n-1 growth, the matching speed for connecting tracking increases speed Spend for n times.After being attached tracking using balanced binary tree, due to computational methods are stable and it is estimated that consumption internal memory and Time can accurately calculate and control, and flow address change is not influenceed in by network, no matter five-tuple whether concentration or Scattered, matching speed is stablized constant.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment Accompanying drawing be briefly described, it should be apparent that, drawings in the following description are some embodiments of the present invention, for this area For those of ordinary skill, on the premise of not paying creative work, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the network connection tracing method using balanced binary tree algorithm that the first better embodiment of the invention provides Flow chart;
Fig. 2 is a kind of network connection tracking system structure chart that the second better embodiment of the invention provides.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, rather than whole embodiments.Based on this hair Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained under the premise of creative work is not made Example, belongs to the scope of protection of the invention.
Fig. 1 is refer to, Fig. 1 is a kind of net using balanced binary tree algorithm that the first better embodiment of the invention proposes Network connects tracking, and this method is as shown in figure 1, comprise the following steps:
A, the five-tuple { source IP, Target IP, source port, target port, agreement } each connected is obtained, Y is designated as, will connect Y inserts balanced binary tree.
B:Binary tree is designated as T, and binary tree maximum node number is designated as M, and present node number is designated as N, current root node note For Rx, current root node five-tuple is designated as Xx.
C:Search whether Y be present in binary tree T:
Performing C concrete mode can be:
To Y compared with Xx.
If Y<Xx, the left child node Rx-1 into root node Rx are compared again.
If Y>Xx, the right child node Rx+1 into root node Rx are compared again.
If Y=Xx, illustrate that Y is present in binary tree T, it is only necessary to update current root node R x data;If node is Sky, then illustrate that Y is not present in binary tree T, carry out step D.
D:It is vacant to judge whether binary tree T interior joints number has.
Performing D concrete mode can be:To N compared with M.
If N >=M, illustrate y-bend tree node without residue, it is without any processing.
If N<M, judge that current root node Rx whether there is data, i.e., whether can be inserted into data.If Rx has data, enter Row step E;If data are not present in Rx, data are inserted Rx, carry out step F, overturn binary tree.
E:Carry out five-tuple Y and five-tuple Xx comparison.
If Y<Xx, the left child node Rx-1 into root node Rx carry out step D again.
If Y>Xx, the right child node Rx+1 into root node Rx carry out step D again.
If Y=Xx, illustrate that data are identical, it is only necessary to update current root node R x data.
F:The balanced turning of binary tree.It is F1 or F2 according to the order that Determines are overturn.
The right subtree of current root node is designated as R, and the left subtree of current root node is designated as L.
F1:Update R.If the node number of R right subtree is more than L node number, binary tree T is overturn to the left.If R's The node number of left subtree is more than L node number, then first overturns R to the right, update R nodal information, then overturn y-bend to the left Set T.Otherwise it is without any processing;
F2:Update L.If the node number of L left subtree is more than R node number, binary tree T is overturn to the right.If L's The node number of right subnumber is more than R node number, then first overturns L to the left, update L nodal information, then overturn y-bend to the right Set T.Otherwise it is without any processing.
G:Overturn child node.
The left subtree of current root node is carried out step F upset left subtrees as root node, updates left subtree information.
The right subtree of current root node is carried out step F upset right subtrees as root node, updates right subtree information.
Current root node carries out step F upset left subtrees.
Current root node carries out step F upset right subtrees.
H:In doubly linked list, after carrying out data processing, the five-tuple of current data is moved to the time in doubly linked list The head node of chained list, ensure that the data of current accessed always come most starting for time linked list.
I:When the connection ends, the five-tuple in balanced binary tree is deleted, while also deleted in doubly linked list.
First look for needing the node A deleted, check that node A whether there is left and right subtree.
If left and right subtree, direct deletion of node A is not present.
If in the presence of only existing left subtree or right subtree, deletion of node A, and replace node A using its child node.
If left and right subtree is all present, deletion of node A, it is replaced according to the condition selection wherein big right child node of numerical value Node A.
Renewal time chained list content simultaneously.
The beneficial effects of the invention are as follows:
By the way that insertion, matching to being attached tracking using balanced binary tree, can be completed with higher speed and deleted, In the case where connection quantity has 2n-1 growth, the matching speed growth rate for connecting tracking is n times.
After being attached tracking using balanced binary tree, due to computational methods are stable and it is estimated that consumption internal memory and Time can accurately calculate and control, and flow address change is not influenceed in by network, no matter five-tuple whether concentration or Scattered, matching speed is stablized constant.
It should be noted that for foregoing each embodiment of the method, in order to be briefly described, therefore it is all expressed as to a system The combination of actions of row, but those skilled in the art should know, the present invention is not limited by described sequence of movement, because For according to the present invention, certain some step can use other orders or carry out simultaneously.Secondly, those skilled in the art also should Know, embodiment described in this description belongs to preferred embodiment, involved action and module not necessarily this hair Necessary to bright.
In the above-described embodiments, the description to each embodiment all emphasizes particularly on different fields, and is not described in some embodiment Part, may refer to the associated description of other embodiment.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can To instruct the hardware of correlation to complete by program, the program can be stored in a computer-readable recording medium, storage Medium can include:Flash disk, read-only storage (English:Read-Only Memory, referred to as:ROM), random access device (English Text:Random Access Memory, referred to as:RAM), disk or CD etc..
The content download method and relevant device that are there is provided above the embodiment of the present invention, system are described in detail, Specific case used herein is set forth to the principle and embodiment of the present invention, and the explanation of above example is simply used Understand the method and its core concept of the present invention in help;Meanwhile for those of ordinary skill in the art, according to the present invention's Thought, there will be changes in specific embodiments and applications, in summary, this specification content should not be construed as Limitation of the present invention.

Claims (6)

1. a kind of network connection tracing method using balanced binary tree algorithm, it is characterised in that methods described includes following step Suddenly:
Step S101, the five-tuple Y each connected is obtained, the Y includes:Source IP, Target IP, source port, target port and association View, the Y is inserted into balanced binary tree;
Step S102, search whether the Y be present in balanced binary tree T, the Y as described in existing, update current root node RXNumber According to if the Y, step 103 and subsequent step is not present;
Step S103, it is vacant to judge whether balanced binary tree T interior joints number has, if balanced binary tree T interior joint numbers are without sky It is remaining, end operation, if any vacant, judge the RXWith the presence or absence of data, such as described RXIn the absence of data, institute is inserted data into State RX, perform step 105 and subsequent step;Such as RXData be present, perform step S104;
Step S104, by the Y and current root node five-tuple XXCompare, if Y<Xx, into the left child node Rx-1 of the Rx Step D is carried out again, if Y>Xx, the right child node Rx+1 into the Rx carries out step D again, if Y=Xx, updates current root section Point Rx data;
Step S105, it is F1 or F2 according to the order of the balanced turning of Determines binary tree;
The right subtree of current root node is designated as R, and the left subtree of current root node is designated as L;
F1:If the node number of R right subtree is more than L node number, binary tree T is overturn to the left, if the section of R left subtree Point number is more than L node number, then first overturns R to the right, updates R nodal information, then overturn binary tree T to the left;
F2:If the node number of L left subtree is more than R node number, binary tree T is overturn to the right, if the section of L right subnumber Point number is more than R node number, then first overturns L to the left, updates L nodal information, then overturn binary tree T to the right;
Step S106, child node is overturn, is specifically included:
The left subtree of current root node is carried out step F upset left subtrees as root node, updates left subtree information;
The right subtree of current root node is carried out step F upset right subtrees as root node, updates right subtree information;
Step S107, in doubly linked list, after carrying out data processing, when the five-tuple of current data is moved in doubly linked list Between chained list head node;
Step S108, when the connection ends, the five-tuple in balanced binary tree is deleted, while also deleted in doubly linked list.
2. according to the method for claim 1, it is characterised in that described to be searched whether in balanced binary tree T in the presence of described Y, including:
To Y compared with Xx,
If Y<Xx, the left child node Rx-1 into root node Rx are compared again,
If Y>Xx, the right child node Rx+1 into root node Rx are compared again,
If Y=Xx, the Y is present in binary tree T;If node is sky, the Y is not present in binary tree T.
3. according to the method for claim 1, it is characterised in that whether the balanced binary tree T interior joints number is vacant, bag Include:
If present node number N >=maximum node number M, y-bend tree node is without residue;
If N<M, then y-bend tree node have residue.
4. according to the method for claim 1, it is characterised in that it is described when the connection ends, by five in balanced binary tree Tuple is deleted, while is also deleted in doubly linked list, including:
First look for needing the node A deleted, check that node A whether there is left and right subtree;
If left and right subtree, direct deletion of node A is not present.
If in the presence of only existing left subtree or right subtree, deletion of node A, and replace node A using its child node;
If left and right subtree is all present, deletion of node A, node is replaced according to the condition selection wherein big right child node of numerical value A, while renewal time chained list content.
5. a kind of computer program product, it is characterised in that the computer program product includes storing computer program Non-transient computer-readable recording medium, the computer program are operable to make computer perform such as claim 1-4 Method described in one.
A kind of 6. computer-readable recording medium, it is characterised in that it stores the computer program for electronic data interchange, its In, the computer program causes computer to perform the method as described in claim any one of 1-4.
CN201711096312.7A 2017-11-09 2017-11-09 Network connection tracking method adopting balanced binary tree algorithm Active CN107835175B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711096312.7A CN107835175B (en) 2017-11-09 2017-11-09 Network connection tracking method adopting balanced binary tree algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711096312.7A CN107835175B (en) 2017-11-09 2017-11-09 Network connection tracking method adopting balanced binary tree algorithm

Publications (2)

Publication Number Publication Date
CN107835175A true CN107835175A (en) 2018-03-23
CN107835175B CN107835175B (en) 2020-09-22

Family

ID=61654085

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711096312.7A Active CN107835175B (en) 2017-11-09 2017-11-09 Network connection tracking method adopting balanced binary tree algorithm

Country Status (1)

Country Link
CN (1) CN107835175B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109445763A (en) * 2018-10-25 2019-03-08 长沙新弘软件有限公司 A kind of non-equilibrium binary tree building method calculated based on two points of boundary values
CN109787755A (en) * 2018-12-14 2019-05-21 魏勇 A kind of key generation method, key generating device and electronic equipment
CN113778948A (en) * 2021-09-01 2021-12-10 中国人民银行清算总中心 Message persistent storage method and device

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1493040A (en) * 2001-02-24 2004-04-28 �Ҵ���˾ Global tree network for computing structures
US20050201330A1 (en) * 2004-03-12 2005-09-15 Samsung Electronics Co., Ltd. Fast handover method, apparatus, and medium
CN1831830A (en) * 2006-04-13 2006-09-13 复旦大学 Topological structure optimization method of clock tree
CN1934561A (en) * 2004-02-12 2007-03-21 城域信息包系统公司 Restoration mechanism for network topologies
CN101068186A (en) * 2007-06-05 2007-11-07 华为技术有限公司 Customer end node network topological structure method and stream media distributing system
CN101188535A (en) * 2007-12-06 2008-05-28 上海大学 Method for identifying the section energy balance route of wireless sensor network based on 2-child tree
CN101436981A (en) * 2007-11-13 2009-05-20 中国电信股份有限公司 Domain name server system of extended IPv4 network
CN101554021A (en) * 2006-08-02 2009-10-07 佛罗里达大学研究基金会股份有限公司 Succinct representation of static packet classifiers
US20100161793A1 (en) * 2008-12-18 2010-06-24 Electronics And Telecommunications Research Institute Method for composing on-chip network topology
US7865608B1 (en) * 2005-01-21 2011-01-04 Oracle America, Inc. Method and apparatus for fast and scalable matching of structured data streams
CN104253712A (en) * 2013-06-26 2014-12-31 北京思普崚技术有限公司 Method utilizing deep packet detection technology to carry out P2P network identification
US20160269278A1 (en) * 2015-03-10 2016-09-15 Dell Products L.P. Path selection based on error analysis
US20160344614A1 (en) * 2015-05-23 2016-11-24 Cisco Technology, Inc. Network Topology Discovery by Resolving Loops

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1493040A (en) * 2001-02-24 2004-04-28 �Ҵ���˾ Global tree network for computing structures
CN1934561A (en) * 2004-02-12 2007-03-21 城域信息包系统公司 Restoration mechanism for network topologies
US20050201330A1 (en) * 2004-03-12 2005-09-15 Samsung Electronics Co., Ltd. Fast handover method, apparatus, and medium
US7865608B1 (en) * 2005-01-21 2011-01-04 Oracle America, Inc. Method and apparatus for fast and scalable matching of structured data streams
CN1831830A (en) * 2006-04-13 2006-09-13 复旦大学 Topological structure optimization method of clock tree
CN101554021A (en) * 2006-08-02 2009-10-07 佛罗里达大学研究基金会股份有限公司 Succinct representation of static packet classifiers
CN101068186A (en) * 2007-06-05 2007-11-07 华为技术有限公司 Customer end node network topological structure method and stream media distributing system
CN101436981A (en) * 2007-11-13 2009-05-20 中国电信股份有限公司 Domain name server system of extended IPv4 network
CN101188535A (en) * 2007-12-06 2008-05-28 上海大学 Method for identifying the section energy balance route of wireless sensor network based on 2-child tree
US20100161793A1 (en) * 2008-12-18 2010-06-24 Electronics And Telecommunications Research Institute Method for composing on-chip network topology
CN104253712A (en) * 2013-06-26 2014-12-31 北京思普崚技术有限公司 Method utilizing deep packet detection technology to carry out P2P network identification
US20160269278A1 (en) * 2015-03-10 2016-09-15 Dell Products L.P. Path selection based on error analysis
US20160344614A1 (en) * 2015-05-23 2016-11-24 Cisco Technology, Inc. Network Topology Discovery by Resolving Loops

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
DAVID WOOD,PAUL GEARON,TOM ADAMS: "《Kowari: A Platform for Semantic Web Storage and Analysis》", 《XTECH 2005 CONFERENCE》 *
SAI JI, LIPING HUANG ,JIN WANG: "《A Novel Key Management Scheme Supporting Network Dynamic Update in Wireless Sensor Network》", 《INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING》 *
刘钊: "《几种BC网络上完全二叉树的嵌入研究》", 《中国博士学位论文全文数据库》 *
彭邓华: "《基于P2P网络的分布式存储关键技术研究》", 《湖南理工学院》 *
沈华: "《二叉树顺序存储结构探讨》", 《电脑编程技巧与维护》 *
纪祥敏,纪祥敏,戴英侠,连一峰,刘青普戴英侠,连一峰,刘青普: "《一种基于二叉树结构的入侵检测研究》", 《计算机应用研究》 *
高洪涛,林峰,颜永年: "《ε实数比较方法对平衡二叉树节点归并算法的影响》", 《清华大学学报(自然科学版) 》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109445763A (en) * 2018-10-25 2019-03-08 长沙新弘软件有限公司 A kind of non-equilibrium binary tree building method calculated based on two points of boundary values
CN109445763B (en) * 2018-10-25 2022-02-01 长沙新弘软件有限公司 Unbalanced binary tree construction method based on binary boundary value calculation
CN109787755A (en) * 2018-12-14 2019-05-21 魏勇 A kind of key generation method, key generating device and electronic equipment
CN109787755B (en) * 2018-12-14 2021-11-12 魏勇 Key generation method, key generation device and electronic equipment
CN113778948A (en) * 2021-09-01 2021-12-10 中国人民银行清算总中心 Message persistent storage method and device

Also Published As

Publication number Publication date
CN107835175B (en) 2020-09-22

Similar Documents

Publication Publication Date Title
JP6755325B2 (en) State control method and equipment
CN104580027B (en) A kind of OpenFlow message forwarding methods and equipment
CN105247831B (en) Flow table amending method, flow table modification device and open flows network system
CN103795644B (en) Policy Table&#39;s list item collocation method, apparatus and system
CN107835175A (en) Using the network connection tracing method of balanced binary tree algorithm
CN102945249B (en) A kind of policing rule matching inquiry tree generation method, matching process and device
US11334567B2 (en) Efficient SQL-based graph random walk
CN102831167B (en) XML (extensive makeup language) processing method and device for graph structure
CN108259218A (en) A kind of IP address distribution method and device
CN103207813B (en) The method and apparatus for managing resource
CN108199967A (en) Route processing method and device
Wang et al. Containing misinformation spreading in temporal social networks
CN105429879A (en) Flow table item querying method, flow table item querying equipment and flow table item querying system
CN104283736B (en) A kind of network communication five-tuple Fast Match Algorithm based on improvement automatic state machine
CN109120431A (en) The method, apparatus and terminal device that propagating source selects in complex network
US9705978B1 (en) Dependency graph management
CN106487769A (en) A kind of implementation method of access control list ACL and device
CN105207825A (en) Fast synchronizing system and synchronizing method for network elements
US10693731B2 (en) Flow entry management method and device
CN106657436B (en) Message processing method and device
CN107679107A (en) A kind of grid equipment accessibility querying method and system based on chart database
CN102571609B (en) Fast serial interface PCI E protocol datas complete the restructuring sort method of bag
CN108536541A (en) flow engine object processing method and device
CN107800630A (en) Message processing method and device
CN107800738A (en) The method and apparatus of data renewal

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP02 Change in the address of a patent holder
CP02 Change in the address of a patent holder

Address after: Unit 308, unit a and B, MinLong Pavilion, New District Avenue, Mintai community, Minzhi street, Longhua District, Shenzhen City, Guangdong Province

Patentee after: SHENZHEN CLOUDSECURITY TECHNOLOGY Co.,Ltd.

Address before: 518000 Guangdong city of Shenzhen province Futian District North Road Home sculpture 27-33B

Patentee before: SHENZHEN CLOUDSECURITY TECHNOLOGY Co.,Ltd.

CP02 Change in the address of a patent holder
CP02 Change in the address of a patent holder

Address after: A708, Huibaojiang Building, No. 398, Minzhi Avenue, Minzhi Community, Longhua District, Shenzhen, Guangdong 518000

Patentee after: SHENZHEN CLOUDSECURITY TECHNOLOGY CO.,LTD.

Address before: 518000 Unit 308, Minlongge A and B, New Area Avenue, Mintai Community, Minzhi Street, Longhua District, Shenzhen City, Guangdong Province

Patentee before: SHENZHEN CLOUDSECURITY TECHNOLOGY CO.,LTD.