Unlock instant, AI-driven research and patent intelligence for your innovation.

Reference node selection method based on the combination of spectral clustering and random selection

A reference node and random selection technology, applied in the field of information security, can solve problems such as the deviation of the predicted node delay from the actual value and prediction failure, so as to avoid the failure of prediction delay and reduce the effect of error

Active Publication Date: 2020-11-24
PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The selection of reference nodes in the existing network coordinate system mostly adopts the method of random selection. Although this method can select reference nodes with the same probability, it will also select some outliers. The constructed initial network coordinate system predicts that the node delay time seriously deviates from the actual value, which causes the prediction to fail

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
  • Reference node selection method based on the combination of spectral clustering and random selection
  • Reference node selection method based on the combination of spectral clustering and random selection
  • Reference node selection method based on the combination of spectral clustering and random selection

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] Such as figure 1 As shown, a reference node selection method based on the combination of spectral clustering and random selection in the present invention includes the following steps: Step S101: Perform spectral clustering on network nodes.

[0038] Step S102: Determine whether the network node is an outlier, if yes, remove the outlier; if not, directly proceed to the next step.

[0039] Step S103: Randomly select a reference node.

[0040] Step S104: Optimizing the selected reference nodes.

Embodiment 2

[0042] Such as figure 2 As shown, another reference node selection method based on the combination of spectral clustering and random selection of the present invention includes the following steps:

[0043] Step S201: performing spectral clustering on network nodes, including:

[0044] Step S2011: Construct all points in the network node delay data set into a weighted undirected graph. All vertices in the graph are all network nodes in the data set, and the weight is the similarity between two node delay vectors. In order to calculate The similarity of the delay vector, the Gaussian kernel function is introduced to calculate the similarity of the delay vector of two nodes, the weight calculation formula is shown in formula (1):

[0045]

[0046] Among them, F i and F j is the time-delay feature vector of the two nodes, and the correlation between the two can be calculated by using the above formula. The greater the weight of the edge, the more similar the time-delay vec...

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 technical field of information security, in particular to a reference node selection algorithm based on the combination of spectrum clustering and random selection. The reference node selection method based on the combination of spectral clustering and random selection includes the following steps: performing spectral clustering on the network nodes; judging whether the network nodes are outliers, and if so, removing the outliers; if not, proceeding directly to the following steps: One step; randomly select reference nodes; optimize the selected reference nodes. The present invention utilizes spectral clustering to cluster network nodes, and regards nodes with similar time delays as a class, then performs outlier processing on the clustering results, and finally randomly selects several points in each class as reference nodes, and the reference nodes The weighted undirected graph formed is divided into two or more optimal subgraphs, and according to the similarity of the delay vectors, the internal differences of the subgraphs are made as small as possible, while the differences between the subgraphs are relatively large, so that The purpose of clustering is achieved, and the situation of local optimum is avoided.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to a reference node selection algorithm based on the combination of spectrum clustering and random selection. Background technique [0002] Large-scale distributed services and applications need to obtain the network distance between any two network host nodes is becoming more and more common. These applications include distributed file sharing, location-based routing protocols, content distribution networks, etc. In these applications, the delay between two network hosts can be obtained through end-to-end direct measurement, but when the number of network nodes is large, the measurement overhead of this method will increase sharply, and the complexity will also increase . Assuming that there are M hosts in the network, obtaining the delay between any two hosts requires M 2 In addition, there is also the problem that the delay between nodes cannot be measured in the n...

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): H04L12/24H04L12/26G06K9/62
CPCH04L41/0823H04L41/12H04L43/0852G06F18/00G06F18/2323
Inventor 罗向阳柴理想赵帆刘斯奇李明月刘粉林
Owner PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU