CN112381160B - Node identity information acquisition method and device, storage medium and electronic equipment - Google Patents
Node identity information acquisition method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN112381160B CN112381160B CN202011296851.7A CN202011296851A CN112381160B CN 112381160 B CN112381160 B CN 112381160B CN 202011296851 A CN202011296851 A CN 202011296851A CN 112381160 B CN112381160 B CN 112381160B
- Authority
- CN
- China
- Prior art keywords
- neighbor
- target node
- uplink
- downlink
- node
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000013507 mapping Methods 0.000 claims description 8
- 230000001934 delay Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 4
- 238000012549 training Methods 0.000 claims description 3
- 238000012216 screening Methods 0.000 claims description 2
- 238000012512 characterization method Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000002093 peripheral effect Effects 0.000 description 5
- 238000011144 upstream manufacturing Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- MWZTVLNYXAKUKY-LBEKAKSKSA-N 4-hydroxy-N-[2-[(1R,13S)-3-methyl-8-oxo-11-azatetracyclo[8.4.0.01,13.02,7]tetradeca-2,4,6,9-tetraene-11-carbonyl]imidazo[1,2-a]pyridin-6-yl]benzamide Chemical compound C=1([C@]23C[C@@H]3C3)C(C)=CC=CC=1C(=O)C=C2N3C(=O)C(N=C1C=C2)=CN1C=C2NC(=O)C1=CC=C(O)C=C1 MWZTVLNYXAKUKY-LBEKAKSKSA-N 0.000 description 1
- 206010035148 Plague Diseases 0.000 description 1
- 241000607479 Yersinia pestis Species 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000003066 decision tree Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/21—Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
- G06F18/214—Generating training patterns; Bootstrap methods, e.g. bagging or boosting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
- G06F18/2411—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches based on the proximity to a decision surface, e.g. support vector machines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/243—Classification techniques relating to the number of classes
- G06F18/24323—Tree-organised classifiers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method, a device, a storage medium and electronic equipment for acquiring node identity information, wherein a network topology graph comprises neighbor relations among nodes and IP addresses of the nodes, a characteristic sequence of a target node is acquired according to the network topology graph, the characteristic sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph, the neighbor attributes correspond to the neighbor relations, and the position attributes correspond to the IP addresses; and inputting the characteristic sequence into a classifier to obtain the identity information of the target node. The identity information characterization target node distinguishes the identity information of the node by naming the node relative to the operators in the prior art, and the node identity information acquisition method in the scheme has wider application range and is not limited to a certain specific operator.
Description
Technical Field
The present invention relates to the field of the internet, and in particular, to a method and an apparatus for acquiring node identity information, a storage medium, and an electronic device.
Background
With the development of society and the progress of science, the internet is increasingly important in people's life. The construction and operation of the Internet are independent of nodes, and the nodes comprise routers, servers and the like. With the development of the internet, more and more nodes are added to the internet. Identifying POP nodes in the internet is of great importance for studying internet evolution and internet delay assessment. How to identify the identity information of each node and determine whether it is a point of network service provider (POP node) is a problem that plagues those skilled in the art.
In the prior art, part of operators distinguish the identity information of the nodes through naming, but naming rules of different operators may be different, and even the operators do not distinguish the identity information of the nodes through naming. Therefore, the application range of distinguishing through the identity information of the named nodes is narrow, and the method cannot be widely applied.
Disclosure of Invention
An object of the present invention is to provide a method, an apparatus, a storage medium and an electronic device for obtaining node identity information, so as to at least partially improve the above-mentioned problems. In order to achieve the above purpose, the technical solution adopted in the embodiment of the present application is as follows:
in a first aspect, an embodiment of the present application provides a method for acquiring node identity information, where the method includes:
acquiring a characteristic sequence of a target node according to a network topological graph;
the network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph;
and inputting the characteristic sequence into a classifier to obtain the identity information of the target node, wherein the identity information characterizes whether the target node is a network service providing node or not.
In a second aspect, an embodiment of the present application provides a node identity information obtaining apparatus, where the apparatus includes:
the sequence unit is used for acquiring the characteristic sequence of the target node according to the network topological graph;
the network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph;
and the classifying unit is used for inputting the characteristic sequence into a classifier to obtain the identity information of the target node, wherein the identity information characterizes whether the target node is a network service providing node or not.
In a third aspect, embodiments of the present application provide a storage medium having stored thereon a computer program which, when executed by a processor, implements the method described above.
In a fourth aspect, an embodiment of the present application provides an electronic device, including: a processor and a memory for storing one or more programs; the above-described method is implemented when the one or more programs are executed by the processor.
Compared with the prior art, in the method, the device, the storage medium and the electronic equipment for acquiring the node identity information provided by the embodiment of the application, the network topology graph comprises the neighbor relation among all nodes and the IP address of each node, the characteristic sequence of the target node is acquired according to the network topology graph, the characteristic sequence comprises the neighbor attribute of the target node and the position attribute of the target node in the network topology graph, the neighbor attribute corresponds to the neighbor relation, and the position attribute corresponds to the IP address; and inputting the characteristic sequence into a classifier to obtain the identity information of the target node. The identity information characterization target node distinguishes the identity information of the node by naming the node relative to the operators in the prior art, and the node identity information acquisition method in the scheme has wider application range and is not limited to a certain specific operator.
In order to make the above objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting in scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
fig. 2 is a flow chart of a method for obtaining node identity information according to an embodiment of the present application;
fig. 3 is one of flow diagrams of a method for obtaining node identity information according to an embodiment of the present application;
fig. 4 is a schematic diagram of sub-steps of S102 provided in an embodiment of the present application;
FIG. 5 is one of the sub-step diagrams of S102 provided in the embodiments of the present application;
FIG. 6 is a schematic diagram of sub-steps of S102-6 provided in an embodiment of the present application;
fig. 7 is a schematic unit diagram of a node identity information obtaining apparatus according to an embodiment of the present application.
In the figure: 10-a processor; 11-memory; 12-bus; 13-a communication interface; 201-sequence units; 202-classification unit.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only to distinguish the description, and are not to be construed as indicating or implying relative importance.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the description of the present application, it should be noted that, the terms "upper," "lower," "inner," "outer," and the like indicate an orientation or a positional relationship based on the orientation or the positional relationship shown in the drawings, or an orientation or a positional relationship conventionally put in use of the product of the application, merely for convenience of description and simplification of the description, and do not indicate or imply that the apparatus or element to be referred to must have a specific orientation, be configured and operated in a specific orientation, and therefore should not be construed as limiting the present application.
In the description of the present application, it should also be noted that, unless explicitly specified and limited otherwise, the terms "disposed," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the terms in this application will be understood by those of ordinary skill in the art in a specific context.
Some embodiments of the present application are described in detail below with reference to the accompanying drawings. The following embodiments and features of the embodiments may be combined with each other without conflict.
Network service providing nodes (Point of Presence, POP for short) are used for computers and enterprise networks to connect to internet service providing systems (ISPs for short). The internet service providing system is, for example, a telecommunication network system, a mobile network system or a converged network system. POP is located at the edge of ISP network and serves only a specific region. The POP can provide a local access point and authentication for multiple end user terminals. Multiple ISPs may share a POP, which scenario typically occurs at a superior or subordinate operator, or a peer operator does not have its own POP, but routes traffic to the POP of the nearest partner. It is therefore necessary to know the identity of POP nodes in the network. It becomes important how to accurately identify the identity information of each node in the network.
The embodiment of the application provides electronic equipment which can be a computer or other server equipment. Referring to fig. 1, a schematic structure of an electronic device is shown. The electronic device comprises a processor 10, a memory 11, a bus 12. The processor 10 and the memory 11 are connected by a bus 12, the processor 10 being adapted to execute executable modules, such as computer programs, stored in the memory 11.
The processor 10 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the node identity information acquisition method may be performed by integrated logic circuitry of hardware or instructions in software form in the processor 10. The processor 10 may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU for short), a network processor (Network Processor, NP for short), etc.; but also digital signal processors (Digital Signal Processor, DSP for short), application specific integrated circuits (Application Specific Integrated Circuit, ASIC for short), field-programmable gate arrays (Field-Programmable Gate Array, FPGA for short) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
The memory 11 may comprise a high-speed random access memory (RAM: random Access Memory) and may also comprise a non-volatile memory (non-volatile memory), such as at least one disk memory.
Bus 12 may be a ISA (Industry Standard Architecture) bus, PCI (Peripheral Component Interconnect) bus, EISA (Extended Industry Standard Architecture) bus, or the like. Only one double-headed arrow is shown in fig. 1, but not only one bus 12 or one type of bus 12.
The memory 11 is used for storing programs such as programs corresponding to the node identity information acquiring means. The node identity information acquiring means comprises at least one software function module which may be stored in the memory 11 in the form of software or firmware (firmware) or cured in an Operating System (OS) of the electronic device. The processor 10, upon receiving the execution instruction, executes the program to implement the node identity information acquisition method.
Possibly, the electronic device provided in the embodiment of the present application further includes a communication interface 13. The communication interface 13 is connected to the processor 10 via a bus. The communication interface 13 is used for the electronic device to interact with other terminals.
It should be understood that the structure shown in fig. 1 is a schematic structural diagram of only a portion of an electronic device, which may also include more or fewer components than shown in fig. 1, or have a different configuration than shown in fig. 1. The components shown in fig. 1 may be implemented in hardware, software, or a combination thereof.
The method for acquiring node identity information provided by the embodiment of the invention can be applied to the electronic device shown in fig. 1, but is not limited to the specific flow, please refer to fig. 2:
s102, obtaining a characteristic sequence of the target node according to the network topological graph.
The network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph.
Specifically, the neighbor attribute corresponds to a neighbor relation, and the location attribute corresponds to an IP address.
S104, inputting the characteristic sequence into a classifier to obtain the identity information of the target node.
Wherein the identity information characterizes whether the target node is a network service providing node.
Specifically, identity information of each node in the network topology graph is different, and corresponding feature sequences are also different. The feature sequence can be classified through the classifier, so that the identity information of the target node corresponding to the feature sequence is determined, and whether the target node is the network service providing point POP is judged. When multiple ISPs share a POP, this scenario typically occurs at a superior or subordinate operator, or the peer operator does not have its own POP, but routes traffic to the POP of the nearest partner. Thereby facilitating the propagation of messages by each neighbor node of the target node in the network topology.
In summary, in the method for acquiring node identity information provided in the embodiment of the present application, a network topology graph includes a neighbor relation between each node and an IP address of each node, and a feature sequence of a target node is acquired according to the network topology graph, where the feature sequence includes a neighbor attribute of the target node and a location attribute of the target node in the network topology graph, the neighbor attribute corresponds to the neighbor relation, and the location attribute corresponds to the IP address; and inputting the characteristic sequence into a classifier to obtain the identity information of the target node. The identity information characterization target node distinguishes the identity information of the node by naming the node relative to the operators in the prior art, and the node identity information acquisition method in the scheme has wider application range and is not limited to a certain specific operator.
On the basis of fig. 2, regarding how to obtain the network topology map, a possible implementation manner is further provided in the embodiments of the present application, please refer to fig. 3, and the method for obtaining node identity information further includes:
s101, drawing a network topological graph through a mapping tool.
Optionally, the active probing method performs network topology mapping, and obtains an IP topology of the target network based on a plurality of mapping points distributed in different networks by using a traceroute tool. In order to reduce mapping errors caused by network jitter, mapping is repeated in a specific period in multiple time periods, and an average value of ten minimum link delays is used as a mapping result of the link delays. And forming a topological directed graph of the edge taking the IP address as a node and taking the link delay as a weight according to the IP and the link delay discovered by the mapping tool.
With continued reference to fig. 3, regarding how to train the classifier, a possible implementation manner is further provided in the embodiments of the present application, where the method for obtaining node identity information further includes:
s103, training the classifier according to the characteristic sequence with the tag, wherein the tag carries identity information corresponding to the characteristic sequence.
Alternatively, the classifier is a multi-valued classifier, such as an SVM, decision tree, or the like. After training, the existing data set is used for verification, the classification accuracy exceeds 75%, and the recall rate is 80%.
On the basis of fig. 2, when the network topology graph includes time delay between any two adjacent nodes, and the neighbor relation includes an uplink relation or a downlink relation between any two adjacent nodes, the neighbor attribute includes the number of neighbors, an uplink neighbor delay median value and a downlink neighbor delay median value; with respect to the content in S102, the embodiment of the present application further provides a possible implementation manner, please refer to fig. 4, S102 includes:
s102-1, determining the number of neighbors of the target node according to the neighbor relation.
The number of neighbors includes the number of uplink neighbors and the number of downlink neighbors.
The uplink neighbor is a node in the network topology graph, where a hop distance can reach the target node. The number of uplink neighbors is used to measure the number of uplink routers connected to the router represented by the target node. The downlink neighbor is a node which can reach the one-hop distance of the target node in the network topological graph. The number of downstream neighbors is used to measure the number of downstream routers connected to the router represented by the target node.
S102-2, according to the time delay between any two adjacent nodes, obtaining the uplink neighbor delay median value and the downlink neighbor delay median value of the target node.
The median value of the uplink neighbor delay represents the median value of the time delay from each uplink neighbor to the target node, and the median value of the downlink neighbor delay represents the median value of the time delay from the target node to each downlink neighbor.
The uplink neighbor delay median is used to measure the physical distance between the uplink neighbor and the target node. The downlink neighbor delay median is used to measure the physical distance of the target node to the downlink neighbor.
S102-6, according to the IP address of each node, the position attribute of the target node in the network topological graph is obtained.
On the basis of fig. 4, when the neighbor attribute further includes: the number of the first class nodes, the number of the second class nodes, the first characteristic value and the second characteristic value are; the first class node is a co-neighbor node with the same uplink relationship as the target node, the second class node is a co-neighbor node with the same downlink relationship as the target node, with respect to the content in S102, the embodiment of the present application further provides a possible implementation manner, please refer to fig. 5, and S102 further includes:
s102-3, determining the number of the first type nodes and the number of the second type nodes according to the neighbor relation.
Specifically, for example, the target node a has uplink adjacencies UA and UB, while UA and UB are also uplink neighbors of the node B, and a and B have the same uplink adjacency, and the node B is a first type node with respect to the target node a. The target node A has downlink adjacencies MA and MC, and MA and MC are downlink neighbors of the node C, so that the A and the C have the same downlink adjacencies, and the node C is a second type node relative to the target node A.
S102-4, according to the time delay between any two adjacent nodes, the uplink co-neighbor delay ratio of the target node and each first type node and the downlink co-neighbor delay ratio of the target node and each second type node are obtained.
The uplink co-neighbor delay ratio represents the median value of the proportion of the time delays of the uplink neighbor nodes to the target node and the first class node respectively, and the downlink co-neighbor delay ratio represents the median value of the proportion of the time delays of the target node and the second class node to the downlink neighbors respectively. The uplink co-neighbor delay ratio is used for measuring whether the delay from the co-neighbor to the target node is close to that of the first class node or not, so that whether the co-neighbor node is close to the target node or not is judged. The downlink co-neighbor delay ratio is used for measuring whether the delay from the target node to the common neighbor is close to that from the second class node, so as to judge whether the position of the co-neighbor node is close to that of the target node.
The calculation method is as follows:
the target node a and the node B have a common upstream neighbor (UA, UB, uc..un), delay (UA, a) represents the Delay of the upstream neighbor to the target node a, denoted by Duaa, delay (UA, B) represents the Delay of the upstream neighbor to the node B, denoted by Duab. Duaa/Duab is the delay ratio. The vector vab= [ Duaa/Duab, duba/Dubb, duca/ducb. The upstream co-neighbor delay ratio is v=abs (mean (Vab)), i.e., the absolute value of the median of the vector Vab.
And similarly, a downlink co-adjacent delay ratio vector can be obtained.
S102-5, respectively screening out a first characteristic value and a second characteristic value from the uplink co-adjacent delay ratio and the downlink co-adjacent delay ratio.
The first characteristic value is the uplink co-adjacent delay ratio closest to 1, and the second characteristic value is the downlink co-adjacent delay ratio closest to 1.
Extracting the peripheral topological features of the target node router in the network topological graph is equivalent to searching sub-graphs in the graph calculation field, and the calculation complexity and the space complexity increase exponentially along with the increase of the search mode and the graph scale. It is not suitable for large-scale network topology calculation. In the embodiment of the application, the peripheral topological feature of the target node router is subjected to dimension reduction and converted into the multiple features, and each node in the graph is independently calculated.
On the basis of fig. 4, when the location attribute includes: when the uplink neighbor geographical distance mean value, the uplink neighbor geographical distance median value, the uplink neighbor geographical distance variance, the downlink neighbor geographical distance mean value, the downlink neighbor geographical distance median value, and the downlink neighbor geographical distance variance are used, for the content in S102-6, the embodiment of the present application further provides a possible implementation manner, please refer to fig. 6, S102-6 includes:
s102-6-1, determining the geographic positions of the target node, the uplink neighbor and the downlink neighbor according to the IP addresses of the target node, the uplink neighbor and the downlink neighbor.
Specifically, the IP geographic information base may be queried to obtain the geographic location corresponding to the IP address.
S102-6-2, according to the geographical positions of the target node, the uplink neighbor and the downlink neighbor, obtaining an uplink neighbor geographical distance mean value, an uplink neighbor geographical distance median value, an uplink neighbor geographical distance variance, a downlink neighbor geographical distance mean value, a downlink neighbor geographical distance median value and a downlink neighbor geographical distance variance.
The average value of the geographical distances of the uplink neighbor nodes represents the average value of the geographical distances of the uplink neighbor nodes to the target node. The median value of the geographical distances of the uplink neighbors represents the median value of the geographical distances of each uplink neighbor node to the target node. The uplink neighbor geographical distance variance represents the variance of the geographical distance of each uplink neighbor node to the target node. The average value of the geographical distances of the downlink neighbors represents the average value of the geographical distances of the target node to the downlink neighbors. The median value of the downlink neighbor geographical distances represents the median value of the geographical distances of the target node to the downlink neighbor nodes. The downstream neighbor geographical distance variance represents the variance of the geographical distance of the target node to the downstream neighbor node.
Optionally, please continue with reference to fig. 6, the location attribute further includes: the number of autonomous systems where the target node and its uplink neighbors, downlink neighbors are located, and the number of internet service providing systems where the target node and its uplink neighbors are located, S102-6 further includes:
s102-6-3, acquiring the number of autonomous systems where the target node, the uplink neighbor and the downlink neighbor are located and the number of the Internet service providing systems where the target node and the uplink neighbor and the downlink neighbor are located by querying an IP database.
The number of autonomous systems where the target node and its uplink and downlink neighbors are located represents the total number of autonomous systems (ases) where the target node and the peripheral neighbor nodes are located, and is used to measure whether the target is destined to cross-domain ases. Number of internet service providing systems (ISPs) where the target node and its upstream neighbors and downstream neighbors are located: the total number of ISPs where the target node and the peripheral neighbor nodes are located is used for measuring whether the target spans the domain ISPs.
In the node identity information acquisition method provided by the embodiment of the application, the identity judgment is carried out on the target node not only by relying on time delay, but also by fully combining the neighbor feature and the IP feature, and finally the acquired identity information is more accurate.
Referring to fig. 7, fig. 7 is a schematic diagram illustrating an embodiment of a node identity information obtaining apparatus according to the present application, and the node identity information obtaining apparatus is optionally applied to the electronic device described above.
The node identity information acquisition means comprises a sequence unit 201 and a classification unit 202.
A sequence unit 201, configured to obtain a feature sequence of the target node according to the network topology graph.
The network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph. Alternatively, the sequence unit 201 may perform S102 described above.
The classification unit 202 is configured to input the feature sequence into a classifier, and obtain identity information of the target node, where the identity information characterizes whether the target node is a network service providing node. Alternatively, the classification unit 202 may perform S104 described above.
It should be noted that, the node identity information obtaining apparatus provided in this embodiment may execute the method flow shown in the method flow embodiment to achieve the corresponding technical effects. For a brief description, reference is made to the corresponding parts of the above embodiments, where this embodiment is not mentioned.
The embodiment of the invention also provides a storage medium, which stores computer instructions and programs, and the computer instructions and the programs execute the node identity information acquisition method of the embodiment when being read and executed. The storage medium may include memory, flash memory, registers, combinations thereof, or the like.
The following provides an electronic device, which may be a computer or a server, as shown in fig. 1, and may implement the method for acquiring node identity information; specifically, the electronic device includes: a processor 10, a memory 11, a bus 12. The processor 10 may be a CPU. The memory 11 is used to store one or more programs that, when executed by the processor 10, perform the node identity information acquisition method of the above-described embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners as well. The apparatus embodiments described above are merely illustrative, for example, flow diagrams and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the same, but rather, various modifications and variations may be made by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Claims (8)
1. A method for obtaining identity information of a node, the method comprising:
acquiring a characteristic sequence of a target node according to a network topological graph;
the network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph;
inputting the characteristic sequence into a classifier to obtain the identity information of the target node, wherein the identity information characterizes whether the target node is a network service providing node or not;
the network topology graph comprises time delay between any two adjacent nodes, the neighbor relation comprises an uplink relation or a downlink relation between any two adjacent nodes, and the neighbor attribute comprises neighbor number, an uplink neighbor delay median and a downlink neighbor delay median;
the step of obtaining the characteristic sequence of the target node according to the network topological graph comprises the following steps:
determining the number of neighbors of the target node according to the neighbor relation, wherein the number of neighbors comprises the number of uplink neighbors and the number of downlink neighbors;
obtaining an uplink neighbor delay median and a downlink neighbor delay median of the target node according to the time delay between any two adjacent nodes, wherein the uplink neighbor delay median represents the median of the time delay from each uplink neighbor to the target node, and the downlink neighbor delay median represents the median of the time delay from the target node to each downlink neighbor;
acquiring the position attribute of the target node in the network topological graph according to the IP address of each node;
the location attribute includes: an uplink neighbor geographical distance mean value, an uplink neighbor geographical distance median value, an uplink neighbor geographical distance variance, a downlink neighbor geographical distance mean value, a downlink neighbor geographical distance median value and a downlink neighbor geographical distance variance; the step of obtaining the position attribute of the target node in the network topological graph according to the IP address of each node comprises the following steps:
determining the geographic positions of the target node, the uplink neighbors and the downlink neighbors according to the IP addresses of the target node, the uplink neighbors and the downlink neighbors;
and acquiring an uplink neighbor geographical distance mean value, an uplink neighbor geographical distance median value, an uplink neighbor geographical distance variance, a downlink neighbor geographical distance mean value, a downlink neighbor geographical distance median value and a downlink neighbor geographical distance variance according to the geographical positions of the target node, the uplink neighbors and the downlink neighbors.
2. The node identity information acquisition method of claim 1, wherein the neighbor attribute further comprises: the number of the first class nodes, the number of the second class nodes, the first characteristic value and the second characteristic value; the first type node is a co-neighbor node with the same uplink relation as the target node, and the second type node is a co-neighbor node with the same downlink relation as the target node;
the step of obtaining the characteristic sequence of the target node according to the network topological graph further comprises the following steps:
determining the number of the first type nodes and the number of the second type nodes according to the neighbor relation;
according to the time delay between any two adjacent nodes, obtaining an uplink co-neighbor delay ratio of the target node and each first type node and a downlink co-neighbor delay ratio of the target node and each second type node, wherein the uplink co-neighbor delay ratio represents a median value of the proportion of the time delays of the uplink neighbor nodes to the target node and the first type node respectively, and the downlink co-neighbor delay ratio represents a median value of the proportion of the time delays of the target node and the second type node to the downlink neighbors respectively;
and respectively screening a first characteristic value and a second characteristic value from the uplink co-adjacent delay ratio and the downlink co-adjacent delay ratio, wherein the first characteristic value is the uplink co-adjacent delay ratio closest to 1, and the second characteristic value is the downlink co-adjacent delay ratio closest to 1.
3. The node identity information acquisition method of claim 1, wherein the location attribute further comprises: the target node and the number of autonomous systems where the uplink neighbors and the downlink neighbors are located and the number of Internet service providing systems where the target node and the uplink neighbors and the downlink neighbors are located;
the step of obtaining the position attribute of the target node in the network topological graph according to the IP address of each node further comprises the following steps:
and acquiring the number of autonomous systems where the target node, the uplink neighbor and the downlink neighbor thereof are located and the number of the internet service providing systems where the target node, the uplink neighbor and the downlink neighbor are located by querying an IP database.
4. The node identity information acquisition method according to claim 1, wherein before the feature sequence of the target node is acquired from the network topology, the method further comprises:
and drawing the network topological graph through a mapping tool.
5. The node identity information acquisition method of claim 1, wherein before inputting the signature sequence into a classifier to obtain the identity information of the target node, the method further comprises:
training the classifier according to a characteristic sequence with a tag, wherein the tag carries identity information corresponding to the characteristic sequence.
6. A node identity information obtaining apparatus, the apparatus comprising:
the sequence unit is used for acquiring the characteristic sequence of the target node according to the network topological graph;
the network topology graph comprises neighbor relations among all nodes and IP addresses of all nodes, and the feature sequence comprises neighbor attributes of the target node and position attributes of the target node in the network topology graph;
the classification unit is used for inputting the characteristic sequence into a classifier to obtain the identity information of the target node, wherein the identity information characterizes whether the target node is a network service providing node or not;
the network topology graph comprises time delay between any two adjacent nodes, the neighbor relation comprises an uplink relation or a downlink relation between any two adjacent nodes, and the neighbor attribute comprises neighbor number, an uplink neighbor delay median and a downlink neighbor delay median; obtaining a characteristic sequence of a target node according to a network topological graph, wherein the characteristic sequence comprises the following steps: determining the number of neighbors of the target node according to the neighbor relation, wherein the number of neighbors comprises the number of uplink neighbors and the number of downlink neighbors; obtaining an uplink neighbor delay median and a downlink neighbor delay median of the target node according to the time delay between any two adjacent nodes, wherein the uplink neighbor delay median represents the median of the time delay from each uplink neighbor to the target node, and the downlink neighbor delay median represents the median of the time delay from the target node to each downlink neighbor; acquiring the position attribute of the target node in the network topological graph according to the IP address of each node;
the location attribute includes: an uplink neighbor geographical distance mean value, an uplink neighbor geographical distance median value, an uplink neighbor geographical distance variance, a downlink neighbor geographical distance mean value, a downlink neighbor geographical distance median value and a downlink neighbor geographical distance variance; the obtaining the position attribute of the target node in the network topological graph according to the IP address of each node comprises the following steps: determining the geographic positions of the target node, the uplink neighbors and the downlink neighbors according to the IP addresses of the target node, the uplink neighbors and the downlink neighbors; and acquiring an uplink neighbor geographical distance mean value, an uplink neighbor geographical distance median value, an uplink neighbor geographical distance variance, a downlink neighbor geographical distance mean value, a downlink neighbor geographical distance median value and a downlink neighbor geographical distance variance according to the geographical positions of the target node, the uplink neighbors and the downlink neighbors.
7. A storage medium having stored thereon a computer program which, when executed by a processor, implements the method of any of claims 1-5.
8. An electronic device, comprising: a processor and a memory for storing one or more programs; the method of any of claims 1-5 is implemented when the one or more programs are executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011296851.7A CN112381160B (en) | 2020-11-18 | 2020-11-18 | Node identity information acquisition method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011296851.7A CN112381160B (en) | 2020-11-18 | 2020-11-18 | Node identity information acquisition method and device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112381160A CN112381160A (en) | 2021-02-19 |
| CN112381160B true CN112381160B (en) | 2024-04-09 |
Family
ID=74585144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011296851.7A Active CN112381160B (en) | 2020-11-18 | 2020-11-18 | Node identity information acquisition method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112381160B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562569A (en) * | 2009-05-26 | 2009-10-21 | 中国科学院计算技术研究所 | Method and device for selecting forward nodes |
| CN106416182A (en) * | 2014-05-09 | 2017-02-15 | 思科技术公司 | Distributed voting mechanism for attack detection |
| WO2017181587A1 (en) * | 2016-04-20 | 2017-10-26 | 乐视控股（北京）有限公司 | Method and electronic equipment for managing nodes in cdn |
| CN108600942A (en) * | 2018-04-04 | 2018-09-28 | 清华大学 | A kind of method for routing of unmanned plane ad hoc network |
| CN109982406A (en) * | 2019-04-11 | 2019-07-05 | 湖南工业大学 | A kind of vehicle-carrying communication method for routing |
| CN111695583A (en) * | 2019-07-18 | 2020-09-22 | 广东电网有限责任公司信息中心 | Feature selection method based on causal network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130036236A1 (en) * | 2011-08-01 | 2013-02-07 | Xerox Corporation | Method and system for creating peer-to-peer geographical routing and multi-attribute similarity routing |
-
2020
- 2020-11-18 CN CN202011296851.7A patent/CN112381160B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562569A (en) * | 2009-05-26 | 2009-10-21 | 中国科学院计算技术研究所 | Method and device for selecting forward nodes |
| CN106416182A (en) * | 2014-05-09 | 2017-02-15 | 思科技术公司 | Distributed voting mechanism for attack detection |
| WO2017181587A1 (en) * | 2016-04-20 | 2017-10-26 | 乐视控股（北京）有限公司 | Method and electronic equipment for managing nodes in cdn |
| CN108600942A (en) * | 2018-04-04 | 2018-09-28 | 清华大学 | A kind of method for routing of unmanned plane ad hoc network |
| CN109982406A (en) * | 2019-04-11 | 2019-07-05 | 湖南工业大学 | A kind of vehicle-carrying communication method for routing |
| CN111695583A (en) * | 2019-07-18 | 2020-09-22 | 广东电网有限责任公司信息中心 | Feature selection method based on causal network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112381160A (en) | 2021-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9729504B2 (en) | Method of near real-time automated global geographical IP address discovery and lookup by executing computer-executable instructions stored on a non-transitory computer-readable medium | |
| KR102189609B1 (en) | Associating attributes with network addresses | |
| EP3389220B1 (en) | Network status evaluation | |
| US8565122B2 (en) | Method and apparatus for measuring and extracting proximity in networks | |
| US11388196B2 (en) | System and method for analyzing relationships between clusters of electronic devices to counter cyberattacks | |
| Zhao et al. | IP Geolocation based on identification routers and local delay distribution similarity | |
| Zhang et al. | Topology inference with network tomography based on t-test | |
| CN113949748A (en) | Network asset identification method and device, storage medium and electronic equipment | |
| Lee et al. | Identifying and aggregating homogeneous ipv4/24 blocks with hobbit | |
| CN111064817B (en) | City-level IP positioning method based on node sorting | |
| CN112381160B (en) | Node identity information acquisition method and device, storage medium and electronic equipment | |
| Comarela et al. | Detecting unusually-routed ases: Methods and applications | |
| Shavitt et al. | Geographical internet pop level maps | |
| Giotsas et al. | Detecting and assessing the hybrid IPv4/IPv6 as relationships | |
| Eriksson et al. | Posit: An adaptive framework for lightweight ip geolocation | |
| CN112532448B (en) | Network topology processing method and device and electronic equipment | |
| Yuan et al. | A high completeness PoP partition algorithm for IP geolocation | |
| CN115955323A (en) | Network security situation sensing method and device and electronic equipment | |
| Shavitt et al. | Improving IP geolocation by crawling the internet PoP level graph | |
| JP6742539B2 (en) | Network management device, control circuit, and program storage medium | |
| US9344990B1 (en) | Device location accuracy metrics for applications on wireless communication devices | |
| JP2020154637A (en) | Network scanning apparatus, program executed by computer, and computer-readable recording medium recording program | |
| JP2020135471A (en) | Estimation device, estimation method and program | |
| CN111294809A (en) | Method, apparatus, device and medium for identifying problem concentrated area | |
| US11894997B2 (en) | Methods and systems for network diagnostic |
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 |