CN113328893B - Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium - Google Patents
Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN113328893B CN113328893B CN202110646020.6A CN202110646020A CN113328893B CN 113328893 B CN113328893 B CN 113328893B CN 202110646020 A CN202110646020 A CN 202110646020A CN 113328893 B CN113328893 B CN 113328893B
- Authority
- CN
- China
- Prior art keywords
- mapping
- nodes
- node
- network connection
- total number
- 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
Images
Classifications
-
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method, a system, an electronic device and a computer readable storage medium for evaluating completeness of network topology mapping, which belong to the technical field of internet, wherein the evaluation method comprises the following steps: according to all mapping nodes and all second time delay links of the measured network topology obtained through mapping, a topological directed graph is obtained, a source set and a target set are obtained, any node is selected from the mapping nodes of the source set to serve as an observation node, according to the topological directed graph, all the mapping nodes in the target set are sequentially used as one vertex of a network connection path, the observation node is used as the other vertex of each network connection path, the sum of the times that the mapping nodes in the target set are not covered by each network connection path is obtained, the total number of estimated nodes is further obtained, the mapping completeness of the measured network topology is obtained, and therefore whether the mapping result reaches an ideal state or not can be judged according to the mapping completeness, and the mapping observation points can be adjusted to enable the network topology mapping result to approach to an ideal measurement state.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a method and a system for evaluating completeness of network topology mapping, an electronic device, and a computer-readable storage medium.
Background
A Network Topology (Network Topology) architecture refers to the physical layout of interconnecting various devices using a transmission medium. Refers to a particular physical, i.e., real, or logical, i.e., virtual, arrangement of members that make up a network. If the connection structure of two networks is the same, their network topology is the same, although their respective internal physical wiring, inter-node distance may be different.
The network topology mapping is an extremely important basic component in the current networking war and is the foundation of other various network researches at the present stage, so the network topology mapping has important significance. Network topology mapping is usually performed based on a plurality of observation points and target sets, and the selection of the observation points and the target sets has a great influence on the topology mapping result. Therefore, during measurement, the observation point and the target set should be adjusted according to the measurement result so as to achieve a relatively ideal measurement state. However, it is currently unknown whether the measurement result reaches the ideal state.
Disclosure of Invention
In order to make the aforementioned objects, features and advantages of the present disclosure more comprehensible, preferred embodiments accompanied with figures are described in detail below.
The object of the present application includes providing a method, a system, an electronic device, and a computer-readable storage medium for evaluating completeness of network topology mapping, which can evaluate completeness of network topology mapping results to help network topology mapping achieve a relatively ideal measurement state.
The embodiment of the application can be realized as follows:
in a first aspect, an embodiment of the present application provides a method for evaluating completeness of network topology mapping, which adopts the following technical scheme:
a network topology mapping completeness evaluation method comprises the following steps:
obtaining a topological directed graph according to all mapping nodes and all second time delay links of the measured network topology obtained by mapping, and obtaining a source set and a target set according to all the mapping nodes, wherein the source set is a set of senders in the mapping nodes, and the target set is a set of receivers in the mapping nodes;
selecting any node from the mapping nodes of the source set as an observation node, sequentially using each mapping node in the target set as one vertex of a network connection path according to the topological directed graph, using the observation node as the other vertex of each network connection path, performing network connection, and randomly removing any mapping node which is not a vertex in the target set before performing network connection every time to obtain the sum of the times that the mapping node in the target set is not covered by each network connection path;
obtaining the total number of estimated nodes according to the sum of times that the mapping nodes in the target set are not covered by each network connection path and the total number of the mapping nodes in the source set and the target set;
and obtaining the mapping completeness of the tested network topology according to the total mapping number of all mapping nodes of the tested network topology and the total number of the pre-estimated nodes.
Optionally, the step of obtaining the total number of the estimated nodes according to the sum of the number of times that the mapping node in the target set is not covered by each network connection path and the total number of the mapping nodes in the source set and the target set includes:
obtaining the total number of the estimated nodes based on an estimation algorithm, wherein the estimation algorithm is as follows:
wherein, ω is * ＝X/(n T -1)，
Represents the total number of predicted nodes, n S Representing the total number of mapping nodes in the source set, n T Representing the total number of mapping nodes in the target set, X representing the sum of the number of times that a mapping node in the target set is not covered by each of said network connection paths, N * Representing the total number of mapping nodes actually measured.
Optionally, the step of obtaining a sum of times that the mapping node in the target set is not covered by each network connection path includes:
if the number of the mapping nodes which are not covered by the single network connection path in the target set is n, recording the probability and the number of the undiscovered mapping nodes in the target set as delta respectively i ＝1,i＝n；
Counting the sum of times that the target centralized mapping node is not covered by each network connection path after the connection of all the network connection paths is finished as X, wherein,
k represents the total number of network connection paths.
Optionally, the average number of times of single uncovering is obtained according to the sum of the number of times of uncovering of the target centralized mapping node by each network connection path and the total number of network connection paths;
taking a ratio of the total number of actual measured mapping nodes and the single uncovered average number to infer an actual total number of nodes for the measured network topology.
Optionally, the method further includes a step of mapping the topology of the network under test to obtain the mapping node and the second delay link, where the step includes:
and mapping the IP node and the second time delay link of the tested network topology by using a route tracking tool based on a plurality of mapping points distributed in different networks, wherein the IP node is taken as the mapping node.
Optionally, the second time delay link is obtained by mapping through the following steps:
and enabling the route tracking tool to measure the first time delay link at each mapping point in a periodic mode for multiple times, and taking the average value of the first time delay link measured for multiple times as a second time delay link.
Optionally, the topological directed graph uses the mapping node as a connection node, and uses the second delay link as a weight of a connection edge of the connection node.
In a second aspect, the present application provides a system for evaluating completeness of network topology mapping, which adopts the following technical solutions:
a system for evaluating completeness of network topology mapping, comprising:
the data processing module is used for obtaining a topological directed graph according to all mapping nodes and all second time delay links of the measured network topology obtained by mapping, and obtaining a source set and a target set according to all the mapping nodes, wherein the source set is a set of senders in the mapping nodes, and the target set is a set of receivers in the mapping nodes;
the traversal connection module is used for selecting any node from the mapping nodes of the source set as an observation node, sequentially using each mapping node in the target set as one vertex of a network connection path according to the topological directed graph, using the observation node as another vertex of each network connection path, performing network connection, and randomly removing any mapping node which is not a vertex in the target set before performing network connection every time to obtain the sum of the times that the mapping node in the target set is not covered by each network connection path;
a node total number estimation module, configured to obtain an estimated node total number according to a sum of times that the mapping nodes in the target set are not covered by each network connection path and a total number of mapping nodes in the source set and the target set;
and the mapping completeness acquisition module is used for acquiring the mapping completeness of the tested network topology according to the total mapping number and the total number of the pre-estimated nodes of all the mapping nodes of the tested network topology.
In a third aspect, the present application provides an electronic device, which adopts the following technical solutions:
an electronic device, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method according to any of the first aspect when executing the computer program.
In a fourth aspect, the present application provides a computer-readable storage medium, which adopts the following technical solutions:
a computer-readable storage medium comprising a computer program which, when executed, controls an electronic device in which the computer-readable storage medium is located to perform the method of any of the first aspects.
The beneficial effects of the embodiments of the present application are, for example:
the method, system, electronic device and computer readable storage medium for evaluating completeness of network topology mapping provided by the embodiment of the application obtain a topological directed graph according to all mapping nodes and second time delay links obtained by mapping, obtain a source set and a target set, select any node in the source set as an observation node, use the observation node as one vertex of a network connection path, sequentially use each mapping node in the target set as another vertex of the network connection path to form a plurality of network connection paths, obtain the sum of times that the mapping nodes in the target set are not covered by each network connection path, combine the total number of the mapping nodes in the source set and the target set to obtain the total number of estimated nodes based on an estimation algorithm to evaluate completeness of mapping, thereby being capable of judging whether mapping results reach an ideal state according to completeness, and then whether the survey observation point is adjusted or not can be judged according to the completeness evaluation so that the network topology survey result approaches to a relatively ideal measurement state continuously.
Drawings
In order to more clearly explain the technical solutions of the present disclosure, the drawings needed for the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present disclosure and therefore should not be considered as limiting the scope, and that those skilled in the art can also derive other related drawings from these drawings without inventive effort.
Fig. 1 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Fig. 2 is a schematic first flowchart of a method for evaluating completeness of network topology mapping according to an embodiment of the present application.
Fig. 3 is a schematic flowchart of a second process of the method for evaluating completeness of mapping of network topology according to the embodiment of the present application.
Fig. 4 is a flowchart illustrating the sub-step of step S30 in fig. 2.
Fig. 5 is a third flow chart of the network topology mapping completeness evaluation method according to the embodiment of the present application.
Fig. 6 is a schematic structural diagram of a network topology mapping completeness evaluation system according to an embodiment of the present application.
Description of the figures: 100-an electronic device; 110-a processor; 120-a memory; 101-a data processing module; 102-traverse join module; 103-a node total number pre-estimating module; 1031-a calculation unit; 104-map completeness acquisition module.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions of the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, may be arranged and designed in various configurations.
Thus, the following detailed description of the embodiments of the present application, as presented in the figures, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments in the present application, are within the scope of protection of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Furthermore, the appearances of the terms "first," "second," and the like, if any, are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
Referring to fig. 1, fig. 1 is a schematic block diagram of an electronic device according to an embodiment of the present disclosure, where the electronic device 100 may include, but is not limited to, a memory 120 and a processor 110.
Wherein, the processor 110 and the memory 120 are both located in the electronic device 100 and are separately provided. It should be understood that a computer-readable storage medium is also one type of memory 120, and in turn, memory 120 may be replaced with a computer-readable storage medium, and that both memory 120 and the computer-readable storage medium may be separate from electronic device 100 and accessible by processor 110 via a bus interface. Further, the memory 120 may be integrated into the processor 110, e.g., may be a cache and/or general purpose registers.
In this embodiment, both the computer-readable storage medium and the memory 120 can be used to store a computer program, and when the processor 110 executes the computer program, the method for evaluating the completeness of mapping of network topology according to this embodiment of the present application can be implemented.
It should be noted that, in the structural schematic diagram of the electronic device 100 shown in fig. 1, the electronic device 100 may further include more or less components than those shown in fig. 1, or have a different configuration from that shown in fig. 1. The components in fig. 1 may be implemented in hardware, software, or a combination thereof. The electronic device 100 may be, but is not limited to, a computer, a mobile phone, an IPad, a server, a laptop, a mobile internet device, etc.
Referring to fig. 2, a first flowchart of a network topology completeness evaluation method provided for the embodiment of the present application is shown, where the order of some steps in the network topology completeness evaluation method may be interchanged according to actual needs, or some steps may be omitted or deleted.
Referring to fig. 2, in step S20, a topological directed graph is obtained according to all mapping nodes and all second delay links of the measured network topology obtained by mapping, and a source set and a target set are obtained according to all mapping nodes.
And step S30, selecting any node from the mapping nodes in the source set as an observation node, sequentially using each mapping node in the target set as a vertex of a network connection path and using the observation node as another vertex of each network connection path according to the topological directed graph, performing network connection, and randomly removing any mapping node which is not a vertex in the target set before performing network connection every time to obtain the sum of the times that the mapping node in the target set is not covered by each network connection path.
And step S40, obtaining the total number of the estimated nodes according to the sum of the times that the mapping nodes in the target set are not covered by each network connection path and the total number of the mapping nodes in the source set and the target set.
And step S50, obtaining the mapping completeness of the tested network topology according to the total mapping numbers of all mapping nodes of the tested network topology and the total number of the pre-estimated nodes.
The source set is a set of sending parties in the mapping nodes, the target set is a set of receiving parties in the mapping nodes, namely the mapping nodes in the source set are all sending nodes, and the mapping nodes in the target set are all receiving nodes. In the topology directed graph obtained in step S20, the mapping node is used as a connection node, and the second delay link is used as a weight of a connection edge of the connection node.
Obtaining a topological directed graph according to all mapping nodes and second time delay links obtained by mapping, obtaining a source set and a target set, selecting any node in the source set as an observation node, taking the observation node as one vertex of a network connection path, sequentially taking each mapping node in the target set as the other vertex of the network connection path, to form multiple network connection paths, and obtain the sum of times that the mapping node in the target set is not covered by each network connection path, and combine the mapping node numbers of the source set and the target set to obtain the total number of estimated nodes, so as to evaluate the completeness of the surveying and mapping, and can judge whether the surveying and mapping result reaches an ideal state according to the completeness of the surveying and mapping, and then whether the survey observation point is adjusted or not can be judged according to the completeness evaluation so that the network topology survey result approaches to a relatively ideal measurement state continuously.
In step S30, before each network connection, any mapping node in the target set that is not a vertex is randomly removed, which means that the removed mapping node cannot be covered by the network connection path, i.e. the network connection path only can select the mapping node in the target set after removing the mapping node for connection. And when the sum of the times that the mapping node in the target set is not covered by each network connection path is counted, the removed mapping node is not considered.
It should be noted that all mapping nodes and all second delay links of the measured network topology obtained by mapping may be obtained according to any network topology mapping method, that is, the network topology mapping completeness evaluation method provided by the present application may be applicable to evaluating the mapping completeness of any network topology mapping method.
Referring to fig. 3, in the present embodiment, as one of the methods for mapping the topology of the network under test to obtain the mapping node and the second delay link, step S10 is included.
And step S10, based on a plurality of mapping points distributed in different networks, using a route tracking tool to map out the IP node and the second time delay link of the network topology to be tested, and using the IP node as the mapping node.
The route tracking tool may be, but is not limited to, a Traceroute tool, and the mapping point is a point set by the Traceroute tool.
It should be noted that, the step of acquiring the second delay link is: and enabling the route tracking tool to measure the first time delay link at each mapping point in a periodic mode for multiple times, and taking the average value of the first time delay link measured for multiple times as a second time delay link.
The first time delay link can be repeatedly measured in multiple time intervals in a periodic mode, and the average value of the first time delay link measured in multiple times is used as the second time delay link, so that the mapping error caused by network jitter can be reduced, the subsequent obtained topological directed graph can be closer to the actual network topological structure, and the completeness evaluation error can be reduced.
In step S20, if the total number of mapping nodes obtained by mapping is N * The source set is S { S1, …, sn }, the target set is T { T1, …, tnST }, and the total number of mapping nodes in the source set is n S The total number of mapping nodes in the target set is n T ，N * >n S +n T I.e., the total number of all mapping nodes is greater than the sum of the source set mapping nodes and the target set mapping nodes.
Referring to fig. 4, further, steps S301 and S302 are substeps of summing the number of times that the target centralized mapping node is not covered by each network connection path in step S30.
Referring to fig. 4, in step S301, if the number of mapping nodes in the target set that are not covered by a single network connection path is n, the probability and the number of the mapping nodes in the target set that are not found are respectively δ i ＝1,i＝n。
Step S302, after the connection of all network connection paths is finished, the sum of the times that the target centralized mapping node is not covered by each network connection path is counted to be X.
Wherein the content of the first and second substances,
k represents the total number of network connection paths.
It should be noted that the observation node first passes through other part or all of the surveying nodes in the source set and part of the surveying nodes in the target set and then is connected to the observation node as a vertex in the target set, that is, the surveying node covered by each network connection path may include part or all of the observation nodes in the source set and part of the surveying nodes in the target set.
And X is the sum of the times that the mapping node in the target set is not covered by each network connection path. Generally, each mapping node in the target set may be considered to correspond to a vertex of a network connection path, that is, if there are 10 mapping nodes in the target set, there are ten network connection paths, each mapping node in the target set is a vertex of one of the network connection paths, and the observation node is another vertex of all the network connection paths. Assuming that some mapping nodes in the target set are absent from the mapping nodes covered by a certain network connection path, and the total number of the absent mapping nodes is m, the number of the mapping nodes in the target set that are not covered by the network connection path is m. For ten network connection paths, ten different m values may be provided, and the ten m values are multiplied by the probability respectively and then added, so that the obtained value is the sum of the times that the target concentrated mapping node is not covered by each network connection path. These missing mapping nodes may be anonymous nodes or indicate that the IP nodes with which they have a connection relationship are not mapped.
Referring to fig. 5, the method for evaluating completeness of network topology mapping provided by the embodiment of the present application further includes step S60 and step S70. Here, the step S60 may be executed after the step S30, or may be executed before or after any of the steps S40 and S50.
And step S60, obtaining the average times of single uncovered according to the sum of times of the mapping nodes in the target set not covered by each network connection path and the total number of the network connection paths.
Step S70, taking the ratio of the total number of actual measured mapping nodes and the average number of times of single uncovered to deduce the actual total number of nodes of the measured network topology.
Assume a single uncovered average number of times of
The total number of actually measured mapping nodes is N * And then:
wherein N represents the total number of predicted nodes. Therefore, from the ratio of the single uncovered average Ci lake to the total number of mapping nodes actually measured, the actual node total can be inferred, so that the accuracy of the predicted node total can be verified from the ratio of the two.
Further, as a specific embodiment of step S40 in the embodiment of the present application, the method includes:
obtaining the total number of the estimated nodes based on an estimation algorithm, wherein the estimation algorithm is as follows:
wherein, ω is * ＝X/(n T -1)，
Represents the total number of predicted nodes, n S Representing the total number of mapping nodes in the source set, n T Representing the total number of mapping nodes in the target set, X representing the sum of the times that the mapping nodes in the target set are not covered by each network connection path, N * Representing the total number of mapping nodes actually measured.
The pre-estimation algorithm is derived according to a leave-one-out algorithm, which is called leave-one-out cross-validation (LOOCV), and the leave-one-out cross-validation means that only one of the original samples is used as the validation data, and the rest of the samples are left as the training data. This step is continued until each sample is regarded as one-time verification data, which can be equivalent to k-fold cross-validation, where k is the original number of samples.
The derivation process of the estimation algorithm comprises the following steps:
assuming that the number of all nodes of the network topology to be tested is N, j is any mapping node which is used as an observation node in a source set, and any measurement in a target set is appointed in a certain network connectionPlot the node t i Target nodes (or vertices) t to be connected for observation nodes i Then a mapping node t is concentrated in the target j Probability of not being discovered, i.e. mapping node t j The probability of not being covered by this network connection path is:
wherein v is * Indicating the number of nodes covered by the network connection path,
indicating that the nodes covered by the network connection path do not include node t j Set of (2), N * Representing the total number of sets of actual measured mapping nodes,
total number of sets of mapping nodes not including node j, n, representing actual measurements S Representing the total number of source-concentrated mapping nodes, n T Represents the total number of mapping nodes in the target set, and 1 in formula (2) represents the target node t j The number of the cells.
Due to the fact that
The nodes covered by the represented network connection path do not include node t j The set of (a) and (b),
the mapping node representing the actual measurement does not include the total number of sets of nodes j, and therefore has
And because of symmetry, all expected values for node j are the same, equation (2) can be derived from these two characteristics, with the following results:
from equation (3) we can obtain:
wherein E [ X ] would be expected]Is the same for all nodes, and therefore all nodes j can be labeled as
For equation (4), when the sample size is small, N will be infinite, and for this case, 1/(N) is used T -X) replacement of E [ X ]]Thereby obtaining:
in the actual test process, the discovery rates of 3 nodes are found to be highly similar, namely:
equation (6) and equation (7) mean that for all nodes j, the same one can be substituted, and thus equation (1) can be obtained by combining equation (5), equation (6), and equation (7):
wherein the content of the first and second substances,
representing the total number of nodes estimated.
In step S50, the completeness of mapping of the measured network topology may be represented by a ratio between the total mapping numbers of the mapped mapping nodes and the total number of the predicted nodes. In other embodiments, the completeness of a survey may be represented by the difference between the total number of predicted nodes and the total number of surveys, or in other ways.
It will be appreciated that n, i, j, k, t occur as described above i ，t j Are all natural numbers.
Referring to fig. 6, the embodiment of the present application further provides a system for evaluating completeness of mapping of a network topology, which includes a data processing module 101, a traversal connection module 102, a total number of nodes estimation module 103, and a completeness of mapping acquisition module 104.
And the data processing module 101 is configured to obtain a topological directed graph according to all mapping nodes and all second delay links of the measured network topology obtained through mapping, and obtain a source set and a target set according to all mapping nodes. The source set is a set of senders in the mapping node, and the target set is a set of receivers in the mapping node. I.e. the data processing module 101 is adapted to perform the above-mentioned step S20.
And the traversal connection module 102 is configured to select any node from the mapping nodes in the source set as an observation node, sequentially use each mapping node in the target set as one vertex of a network connection path according to the topological directed graph, use the observation node as another vertex of each network connection path, perform network connection, and randomly remove any mapping node that is not a vertex in the target set before performing network connection each time, so as to obtain a sum of times that the mapping node in the target set is not covered by each network connection path. I.e., the traverse connection module 102, is used to perform the above step S30.
And the total node number estimation module 103 is configured to obtain the total number of estimated nodes according to the sum of the number of times that the mapping node in the target set is not covered by each network connection path, and the total number of mapping nodes in the source set and the target set. Namely, the total node number estimation module 103 is used for executing the above step S40.
And a mapping completeness acquisition module 104, configured to obtain mapping completeness of the network topology according to the total mapping numbers of all mapping nodes of the measured network topology and the total number of the pre-estimated nodes. I.e., the map completeness acquisition module 104 is configured to perform the above step S50.
Referring to fig. 5, further, the total node number estimation module 103 includes a calculation unit 1031.
A calculating unit 1031, configured to obtain the total number of estimated nodes based on an estimation algorithm, where the estimation algorithm is:
wherein, ω is * ＝X/(n T -1)，
Representing the total number of predicted nodes, n S Representing the total number of mapping nodes in the source set, n T Representing the total number of mapping nodes in the target set, X representing the sum of the number of times that a mapping node in the target set is not covered by each of said network connection paths, N * Representing the total number of mapping nodes actually measured.
In the several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus, system, and method may be implemented in other manners. The apparatus, system, and method embodiments described above are merely illustrative, for example, the flowcharts 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 disclosure. 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 disclosure may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent 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 solutions of the present disclosure, which are essential or part of the technical solutions contributing to the prior art, may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, an electronic device, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes. It should be noted that, in this document, 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 an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is intended only as an alternative embodiment of the disclosure, and not as a limitation thereof, as numerous modifications and variations of the disclosure will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
Claims (9)
1. A network topology mapping completeness evaluation method is characterized by comprising the following steps:
obtaining a topological directed graph according to all mapping nodes and all second time delay links of the measured network topology obtained by mapping, and obtaining a source set and a target set according to all mapping nodes, wherein the source set is a set of senders in the mapping nodes, and the target set is a set of receivers in the mapping nodes;
selecting any node from the mapping nodes of the source set as an observation node, sequentially using each mapping node in the target set as one vertex of a network connection path according to the topological directed graph, using the observation node as the other vertex of each network connection path, performing network connection, and randomly removing any mapping node which is not a vertex in the target set before performing network connection every time to obtain the sum of the times that the mapping node in the target set is not covered by each network connection path;
obtaining the total number of estimated nodes according to the sum of times that the mapping nodes in the target set are not covered by each network connection path and the total number of the mapping nodes in the source set and the target set;
obtaining the mapping completeness of the tested network topology according to the total mapping number of all mapping nodes of the tested network topology and the total number of the pre-estimated nodes;
the step of obtaining the total number of the estimated nodes according to the sum of the times that the mapping nodes in the target set are not covered by each network connection path and the total number of the mapping nodes in the source set and the target set respectively comprises the following steps:
obtaining the total number of the estimated nodes based on an estimation algorithm, wherein the estimation algorithm is as follows:
wherein, ω is * ＝X/(n T -1)，
Represents the total number of predicted nodes, n S Representing the total number of mapping nodes in the source set, n T Representing the total number of mapping nodes in the target set, X representing the sum of the number of times that a mapping node in the target set is not covered by each of said network connection paths, N * Representing the total number of mapping nodes actually measured.
2. The method of claim 1, wherein the step of obtaining a sum of the number of times that the target centralized mapping node is not covered by each of the network connection paths comprises:
if the number of the mapping nodes which are not covered by the single network connection path in the target set is n, recording the probability and the number of the undiscovered mapping nodes in the target set as delta respectively i ＝1,i＝n；
Counting the sum of times that the target centralized mapping node is not covered by each network connection path after the connection of all network connection paths is finished as X, wherein,
k represents the total number of network connection paths.
3. The method of claim 1, further comprising:
obtaining the average times of single uncovering according to the sum of the times of uncovering the target centralized mapping node by each network connection path and the total number of the network connection paths;
taking a ratio of the total number of actual measured mapping nodes and the single uncovered average number to infer an actual total number of nodes for the measured network topology.
4. The method of claim 1, further comprising the step of mapping the measured network topology to a mapping node and a second time delay link, the step comprising:
and mapping the IP node and the second time delay link of the tested network topology by using a route tracking tool based on a plurality of mapping points distributed in different networks, wherein the IP node is taken as the mapping node.
5. The method of claim 4, wherein the second time-delay link is mapped by:
and enabling the route tracking tool to measure the first time delay link at each mapping point in a periodic mode for multiple times, and taking the average value of the first time delay link measured for multiple times as a second time delay link.
6. The method of claim 1, wherein the topological directed graph has mapping nodes as connecting nodes and second time delay links as weights for connecting edges of the connecting nodes.
7. A system for evaluating completeness of network topology mapping, comprising:
a data processing module (101) configured to obtain a topological directed graph according to all mapping nodes and all second delay links of a measured network topology obtained through mapping, and obtain a source set and a target set according to all mapping nodes, where the source set is a set of senders in the mapping nodes, and the target set is a set of receivers in the mapping nodes;
a traversal connection module (102) configured to select any node from the mapping nodes in the source set as an observation node, sequentially use each mapping node in the target set as one vertex of a network connection path according to the topological directed graph, use the observation node as another vertex of each network connection path, perform network connection, and randomly remove any mapping node that is not a vertex in the target set before performing network connection each time, so as to obtain a sum of times that the mapping node in the target set is not covered by each network connection path;
a total node number estimation module (103) for obtaining an estimated total node number according to the sum of the times that the mapping nodes in the target set are not covered by each network connection path and the total number of the mapping nodes in the source set and the target set;
a mapping completeness acquisition module (104) for obtaining the mapping completeness of the tested network topology according to the total mapping numbers and the total number of the pre-estimated nodes of all mapping nodes of the tested network topology;
the node total number pre-estimation module (103) is further configured to:
obtaining the total number of the estimated nodes based on an estimation algorithm, wherein the estimation algorithm is as follows:
wherein, ω is * ＝X/(n T -1)，
Represents the total number of predicted nodes, n S Representing the total number of mapping nodes in the source set, n T Representing the total number of mapping nodes in the target set, X representing the sum of the number of times that a mapping node in the target set is not covered by each of said network connection paths, N * Representing the total number of mapping nodes actually measured.
8. An electronic device, comprising: memory (120), processor (110) and a computer program stored on the memory (120) and executable on the processor (110), the processor (110) implementing the method of any one of claims 1 to 6 when executing the computer program.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium comprises a computer program which, when executed, controls an electronic device (100) in which the computer-readable storage medium is located to perform the method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110646020.6A CN113328893B (en) | 2021-06-10 | 2021-06-10 | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110646020.6A CN113328893B (en) | 2021-06-10 | 2021-06-10 | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113328893A CN113328893A (en) | 2021-08-31 |
| CN113328893B true CN113328893B (en) | 2022-09-20 |
Family
ID=77421261
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110646020.6A Active CN113328893B (en) | 2021-06-10 | 2021-06-10 | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113328893B (en) |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006002665A1 (en) * | 2004-06-30 | 2006-01-12 | Telecom Italia S.P.A. | Method and system for network topology updating using topology perturbation |
| GB2536606A (en) * | 2014-11-28 | 2016-09-28 | Aria Networks Ltd | Network topology optimization |
| CN105933148B (en) * | 2016-04-15 | 2019-04-02 | 烽火通信科技股份有限公司 | A kind of SDNization GIS network topology model implementation method |
| CN106254123B (en) * | 2016-08-17 | 2019-07-02 | 郑州埃文计算机科技有限公司 | A kind of mapping method towards network topology in the domain Metropolitan Area Network (MAN) rank AS |
| US10931539B2 (en) * | 2018-12-21 | 2021-02-23 | Cisco Technology, Inc. | Graphical user interface for displaying a network traffic route in a single-view display |
| CN112242950B (en) * | 2019-07-18 | 2022-05-17 | 华为技术有限公司 | Method for determining path and related equipment |
| CN111917645A (en) * | 2020-08-20 | 2020-11-10 | 深圳多拉多通信技术有限公司 | SDN-based path optimization method and system for mobile network |
-
2021
- 2021-06-10 CN CN202110646020.6A patent/CN113328893B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113328893A (en) | 2021-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Weinberg et al. | How to catch when proxies lie: Verifying the physical locations of network proxies with active geolocation | |
| Chen et al. | Phoenix: A weight-based network coordinate system using matrix factorization | |
| Bender et al. | Fixing Ally's growing pains with velocity modeling | |
| EP3058487B1 (en) | Processing search queries using a data structure | |
| CN105227689B (en) | Target IP location algorithm based on local time delay distribution similarity measurement | |
| CN108683564B (en) | Network simulation system reliability evaluation method based on multidimensional decision attributes | |
| CN110334544A (en) | Federal model degeneration processing method, device, federal training system and storage medium | |
| Panda et al. | Efficient fault node detection algorithm for wireless sensor networks | |
| CN113328893B (en) | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium | |
| CN112491489B (en) | Method, device and system for time synchronization based on in-band telemetry | |
| Chen et al. | An efficient solution to locate sparsely congested links by network tomography | |
| CN111770528B (en) | Visual distance and non-visual distance identification method and device based on channel parameter extraction method | |
| CN109347680B (en) | Network topology reconstruction method and device and terminal equipment | |
| CN108400907B (en) | Link packet loss rate reasoning method under uncertain network environment | |
| Salah et al. | Characterizing Graph-theoretic Properties of a large-scale DHT: Measurements vs. Simulations | |
| JP6180369B2 (en) | Topology estimation apparatus and program | |
| Bakhshaliyev et al. | Generation of 2-mode scale-free graphs for link-level internet topology modeling | |
| CN106888133B (en) | Using speed-measuring method and device | |
| CN110149277B (en) | Network congestion link diagnosis method and system based on link congestion intensity distribution | |
| Schiller et al. | Gtna 2.0-a framework for rapid prototyping and evaluation of routing algorithms | |
| Kunzmann et al. | Efficient simulation of large-Scale p2p networks: modeling network transmission times | |
| Hillmann et al. | Modelling of IP Geolocation by use of Latency Measurements | |
| CN114039889B (en) | Network anomaly detection method and related device based on round trip delay time sequence | |
| Ukkonen | Indirect estimation of shortest path distributions with small-world experiments | |
| CN113179184A (en) | Network mapping method and device, electronic equipment and storage medium |
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 |