Key routing node calculation method and device based on graph database and label migration

Abstract

The invention relates to the field of network space key routing calculation, in particular to a key routing node calculation method and device based on a graph database and label migration. The methodcomprises the steps that firstly, all network routing data is stored into the graph database in a graph structure organization mode; then, suspicious key routing equipment is determined through a spectral clustering method in a target domain; finally, suspicious routing nodes are classified through a classifier on the basis of routing node label distribution migration, and therefore the key routing node is determined. The method can be used for finding the key routing node in the network space, and supports are provided for safety protection and any network application service of the key routing node.

Description

technical field [0001] The invention relates to the calculation field of key routing in cyberspace, in particular to a calculation method and device for key routing nodes based on graph database and label migration. Background technique [0002] The calculation of key routing in cyberspace faces two problems: one is the storage mode of large-scale network routing data; the other is the calculation method of key routing nodes. In terms of data storage mode, network routing data was mainly stored in relational databases in the form of tables in the past. From the perspective of data processing of network and graph structures, traditional relational databases are stored in relational mode, but the complexity of storing graph structures and implementing graph-related algorithms on the relational model is relatively high, and a large number of relational table joins make the performance relatively slow. Difference. In terms of key routing calculation methods, currently it mainl...

Images