Inter-domain routing recovery method based on degree constraint minimum spanning tree

A recovery method and spanning tree technology, applied in the field of Internet security, to achieve the effect of easy backtracking and error correction

Active Publication Date: 2020-05-08
HENAN INST OF ENG
View PDF13 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The technical problem to be solved by the present invention is: to overcome the deficiencies of the prior art, to construct a degree-constrained minimum spanning tree as the goal of restoring the topology, and to provide basic migration algorithms, complex migration algorithms, single-tree forest correction algorithms, FT key node selection algorithms and The CT key node selection algorithm constructs a new recovery topology based on the survival topology of the attacked routing system under the condition of satisfying degree constraints. Inter-domain Routing Restoration Method Based on Degree Constrained Minimum Spanning Tree Based on Secondary Attack

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
  • Inter-domain routing recovery method based on degree constraint minimum spanning tree
  • Inter-domain routing recovery method based on degree constraint minimum spanning tree
  • Inter-domain routing recovery method based on degree constraint minimum spanning tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0042] Example: see figure 1 , figure 2 , image 3 , Figure 4 , Figure 5 , Figure 6 and Figure 7 .

[0043] The inter-domain routing recovery method based on the degree-constrained minimum spanning tree expresses the inter-domain routing system after the BGP-LDoS attack as a spanning forest, using the basic migration algorithm, complex migration algorithm, single-tree forest correction algorithm, and FT key node selection algorithm Algorithms such as CT key node selection and other algorithms, construct inter-domain routing recovery topology based on degree-constrained minimum spanning tree under the condition of satisfying the established degree constraints. The steps are: Step 1. Establish a mathematical model of degree-constrained minimum spanning tree;

[0044] Step 2. Based on Node Representation (Node Representation, NR), encode the inter-domain routing system after being attacked by BGP-LDoS, and express it as Forest Representation (Forest Representation, Fo...

Embodiment 1

[0129] Using the BRITE topology generator, a random graph is generated based on the GLP model, which represents the AS-level simulation topology in the inter-domain routing system. In the regional inter-domain routing system established with small-scale multi-autonomous domain communities, the number of nodes in the random graph is set as 10, 50, 100, 200, 400, 600, 800, 1000.

[0130] Simulate the BGP-LDoS attack to attack the above random graph. For the surviving nodes and links, respectively use the DR algorithm proposed in this application and the classic ESR algorithm to generate DCMST as the recovery topology after the inter-domain routing system is attacked. The simulation environment is Windows 10, Intel i5 6200U, 16G memory. In order to effectively control the aggregation of nodes in the restored topology, the spanning tree node degree value range is limited to [3,6]; the average node degree of the random graph generated by the GLP model is 4.1. As a classic spanning...

Embodiment 2

[0133] The real Internet AS-Level topology from CAIDA is used for simulation verification, and the sample topology is obtained from BGP_tables and WHOIS respectively. Both BGP_tables and WHOIS original data sets contain 30,000+ nodes. Considering that the actual Internet inter-domain routing recovery mechanism needs to be implemented within a certain range, the topologies covering the first 3000 AS nodes are respectively extracted from the two original data sets for simulation. Among them, the local topology obtained from BGP_tables is named B_tpl, and its average degree value is 2.51; the local topology obtained from WHOIS is named W_tpl, and its average degree value is 6.53.

[0134] Similar to Embodiment 1, BGP-LDoS is simulated to attack the B_tpl and W_tpl topologies, and for the surviving nodes and links, the DR algorithm proposed in this application and the classic ESR algorithm are used to generate DCMST as the recovery after the inter-domain routing system is attacked ...

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 an inter-domain routing recovery method based on a degree constraint minimum spanning tree. The inter-domain routing system subjected to the BGP-LDoS attack is expressed as a generation forest, by utilizing a basic migration algorithm, a complex migration algorithm, a single-tree forest correction algorithm, an FT key node selection algorithm, a CT key node selection algorithm and the like, an inter-domain routing recovery topology based on a degree constraint minimum spanning tree is constructed under the condition of meeting a set degree constraint, meanwhile, node migration information during topology generation can be recorded in the creation process of an orientation constraint minimum spanning tree. In the process of recovering topology establishment, aggregation of node degrees can be effectively controlled, nodes with over-height numbers are prevented from being generated, and the calculation complexity of the topology generation process is effectively reduced.

Description

Technical field: [0001] The invention relates to the field of Internet security, in particular to an inter-domain route restoration method based on degree-constrained minimum spanning tree. Background technique: [0002] With the rapid development of the Internet, the inter-domain routing system (Inter-domain routing system), as the key infrastructure of the Internet, has gradually increased the pressure of security protection in recent years. At present, the main threats to the inter-domain routing system mainly come from route prefix hijacking (Prefix hijacking), route leakage (Route leak) and low-rate denial of service attack (BGP Low-rate Denial of Service, BGP-LDoS). In terms of attack speed and intensity, BGP-LDoS is even better. BGP-LDoS attacks have gone through the initial Shrew and FB-Shrew, developed to ZMW and CXPST, and then to the variants of IHD, DNP and LAAEM, and the attack threats and complexity are constantly rising. [0003] BGP-LDoS attacks can lead to...

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): H04L12/715H04L12/703H04L12/721H04L29/06H04L45/28
CPCH04L45/04H04L45/28H04L45/12H04L63/1458
Inventor 王禹陈素霞王旭辉周岩刘珺李松阳焦飒镧
Owner HENAN INST OF ENG
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