Check patentability & draft patents in minutes with Patsnap Eureka AI!

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

A computing method and database technology, applied in computing, electrical digital data processing, special data processing applications, etc., can solve problems such as error-prone, low-efficiency calculation of key routing, large scale of cyberspace data, and different routing data characteristics, etc. Accuracy, large scalability and flexibility, the effect of improving efficiency

Inactive Publication Date: 2018-06-22
NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[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
However, due to the large scale of cyberspace data and the huge differences in the characteristics of different routing data, the calculation efficiency of key routing is low and error-prone

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
  • Key routing node calculation method and device based on graph database and label migration
  • Key routing node calculation method and device based on graph database and label migration
  • Key routing node calculation method and device based on graph database and label migration

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0060] Embodiment 1, the weight value of the migration The calculation process is: calculated according to the maximum mean difference algorithm (MMD) and r distance, the result is recorded as in Represents the source node xi to the destination node x j The pth route of .

Embodiment 2

[0061] Embodiment 2, the migration classification label The calculation process is: for in and n q The classification label of the most adjacent routing node, so it is calculated using the K-Nearest Neighbor (KNN) algorithm with n q The classification label of the most adjacent routing node, and the result is recorded as the migration classification label

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 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...

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): G06F17/30
CPCG06F16/9024
Inventor 刘杰陈剑锋饶志宏李明桂孙治杨慧
Owner NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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