Network topology reliability evaluation method and device and storage medium
By introducing the concept of facepick and comprehensive topology, link and node indicators, the problem of inaccurate evaluation of the topology reliability of optical cable network networks is solved, and the accuracy and comprehensiveness of the evaluation are improved.
Patent Information
- Application Number
- CN202411412920.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-10
- Publication Date
- 2025-01-10
- Estimated Expiration
- 2044-10-10
AI Technical Summary
The prior art lacks consideration for the overall connectivity of the network when calculating the network topology reliability of the optical cable network, resulting in inaccurate evaluation.
By introducing the concept of jumping, the connection relationship between nodes and nodes in the network is transformed into the connection relationship between nodes and jumping and jumping, and combining topological indicators, link indicators and node indicators to comprehensively evaluate the network. Topological reliability.
It improves the accuracy and comprehensiveness of network topology reliability evaluation, and ensures full consideration of the overall connectivity of optical cable networks.
Smart Images

Figure CN119299340A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of network security technology, and in particular to a network topology reliability evaluation method, device and storage medium. Background Art
[0002] In optical communication networks, optical cable networks, as the core infrastructure, carry the transmission of optical signals and the circulation of business data. Their security and reliability directly affect the performance of optical transmission networks. However, the management and maintenance of optical cable networks usually focus on the response and processing after failures, and there is a lack of evaluation of the reliability of optical cable networks in the early stages of network construction.
[0003] In the related art, for a relatively fixed network topology, the reliability calculation model usually uses the minimum path set algorithm to calculate the reliability of the optical cable network. This method obtains the minimum path set by obtaining all the minimum paths from the source node to the target node in the network, and then finds the minimum disjoint set based on the minimum path set of the network. The network topology reliability is calculated through the minimum disjoint set and the reliability probability of each link in the network.
[0004] However, the above-mentioned calculation of network topology reliability using the minimum path set algorithm can only reflect the connectivity between network nodes, lacks consideration of the overall connectivity of the network, and may result in inaccurate evaluation of network topology reliability, resulting in an inability to conduct a comprehensive evaluation of network topology reliability. Summary of the invention
[0005] The present application provides a network topology reliability evaluation method, device and storage medium, aiming to solve the problem of inaccurate network topology reliability evaluation due to lack of consideration of the overall network connectivity.
[0006] In order to achieve the above objectives, this application adopts the following technical solutions:
[0007] In a first aspect, the present application provides a network topology reliability evaluation method, the method comprising: first, obtaining network topology information, the network topology information being used to indicate nodes in the network and connection relationships between nodes; second, determining network reliability influencing indicators based on the network topology information, wherein the network reliability influencing indicators include topology indicators, the topology indicators are determined based on the network topology reliability of each node in the network, the network topology reliability of a node is the weighted sum of the reliabilities of the node to all its hop surfaces, the Xth hop surface of a node is a node in the network that is X hops away from the node, and X is a positive integer; finally, determining the reliability of the network topology based on the network reliability influencing indicators.
[0008] Based on the above technical solution, due to the lack of consideration of the overall connectivity of the network, the network topology reliability evaluation is inaccurate. Therefore, this application introduces the concept of hop plane, which converts the connectivity relationship between nodes in the network into the connectivity relationship between nodes and hop planes and between hop planes, so as to strengthen the consideration of the overall connectivity of the network, thereby improving the accuracy of the network topology reliability evaluation.
[0009] In a first possible implementation manner of the first aspect, the topology indicator is determined according to the following method:
[0010] Determine the network topology reliability of each node in the network, determine the reliability weight of each node in the network, and determine the topology index based on the network topology reliability of each node in the network and the reliability weight of each node in the network.
[0011] In a second possible implementation manner of the first aspect, the reliability of the one node to the Xth hop plane is determined according to the following method:
[0012] Determine the reliability of the node to the first hop surface, determine the reliability of each adjacent two hop surfaces among the X hop surfaces, and determine the reliability of the node to the Xth hop surface based on the reliability of the node to the first hop surface and the reliability of each adjacent two hop surfaces among the X hop surfaces.
[0013] In a third possible implementation manner of the first aspect, the determining the reliability of the node to the first hop plane includes:
[0014] Merge all nodes included in the first hop in the network topology into the same first virtual node to obtain a first updated topology of the network;
[0015] Determine the reliability of the node to the first virtual node based on a minimum path set algorithm and a first updated topology of the network;
[0016] The reliability from the node to the first virtual node is used as the reliability from the node to the first hop.
[0017] In a fourth possible implementation manner of the first aspect, the determining the reliability of every two adjacent hop surfaces among the X hop surfaces includes:
[0018] Merge all nodes included in the m-1th hop surface in the network topology into the same m-1th virtual node, and merge all nodes included in the mth hop surface in the network topology into the same mth virtual node, to obtain the mth updated topology of the network, where m is an integer greater than 1 and less than or equal to X;
[0019] Determine the reliability between the m-1th virtual node and the mth virtual node based on the minimum path set algorithm and the mth updated topology of the network;
[0020] The reliability between the m-1th virtual node and the mth virtual node is used as the reliability between the m-1th hop surface and the mth hop surface.
[0021] In a fifth possible implementation of the first aspect, the above-mentioned network reliability influencing index also includes: a link index and / or a node index, wherein the link index is used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; the node index is used to characterize the degree of influence of the association of nodes in the network on the reliability of the network.
[0022] In a sixth possible implementation manner of the first aspect, the topology information of the network includes the number of links in the network, and the link indicator is determined according to the following method:
[0023] Based on the number of links in the network and the connection relationship between nodes in the network, the connectivity and graph density of the network are determined. The connectivity is the minimum number of links that need to be removed when the network topology is not connected, and the graph density is the ratio of the number of actual links in the network topology to the maximum number of possible links. Based on the connectivity and graph density of the network, the link index is determined.
[0024] In a seventh possible implementation manner of the first aspect, the topology information of the network includes the degree of each node in the network, and the node index is determined according to the following method:
[0025] Based on the degree of each node in the network and the number of nodes in the network, the node index is determined.
[0026] In an eighth possible implementation manner of the first aspect, determining the reliability of the network topology based on the network reliability impact indicator includes:
[0027] The reliability of the network topology is determined based on the topology index, the link index and / or the node index.
[0028] In a second aspect, the present application provides a network topology reliability evaluation device, which includes: an acquisition unit and a determination unit, wherein the acquisition unit is used to acquire network topology information, and the network topology information is used to indicate nodes in the network and connection relationships between nodes; the determination unit is used to determine network reliability influencing indicators based on the network topology information acquired by the acquisition unit, wherein the network reliability influencing indicators include topology indicators, and the topology indicators are determined based on the network topology reliability of each node in the network. The network topology reliability of a node is the sum of the reliabilities of the node to all its hop surfaces, and the Xth hop surface of a node is a node in the network that is X hops away from the node, and X is a positive integer; the determination unit is also used to determine the reliability of the network topology based on the network reliability influencing indicators determined by the determination unit.
[0029] In a first possible implementation manner of the second aspect, the topology indicator is determined according to the following method:
[0030] The above-mentioned determination unit is specifically used to determine the network topology reliability of each node in the network, determine the reliability weight of each node in the network, and determine the topology index based on the network topology reliability of each node in the network and the reliability weight of each node in the network.
[0031] In a second possible implementation manner of the second aspect, the reliability of the one node to the Xth hop plane is determined according to the following method:
[0032] The above-mentioned determination unit is specifically used to determine the reliability of the node to the first hop surface, determine the reliability of each two adjacent hop surfaces among the X hop surfaces, and determine the reliability of the node to the Xth hop surface based on the reliability of the node to the first hop surface and the reliability of each two adjacent hop surfaces among the X hop surfaces.
[0033] In a third possible implementation manner of the second aspect, the determining the reliability of the node to the first hop plane includes:
[0034] Merge all nodes included in the first hop in the network topology into the same first virtual node to obtain a first updated topology of the network;
[0035] The above-mentioned determination unit is specifically used to determine the reliability of the node to the first virtual node based on the minimum path set algorithm and the first updated topology of the network;
[0036] The reliability from the node to the first virtual node is used as the reliability from the node to the first hop.
[0037] In a fourth possible implementation manner of the second aspect, the determining the reliability of every two adjacent hop surfaces among the X hop surfaces includes:
[0038] Merge all nodes included in the m-1th hop surface in the network topology into the same m-1th virtual node, and merge all nodes included in the mth hop surface in the network topology into the same mth virtual node, to obtain the mth updated topology of the network, where m is an integer greater than 1 and less than or equal to X;
[0039] The determination unit is specifically used to determine the reliability between the m-1th virtual node and the mth virtual node based on the minimum path set algorithm and the mth updated topology of the network;
[0040] The reliability between the m-1th virtual node and the mth virtual node is used as the reliability between the m-1th hop surface and the mth hop surface.
[0041] In a fifth possible implementation of the second aspect, the above-mentioned network reliability influencing index also includes: a link index and / or a node index, wherein the link index is used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; the node index is used to characterize the degree of influence of the association of nodes in the network on the reliability of the network.
[0042] In a sixth possible implementation manner of the second aspect, the topology information of the network includes the number of links in the network, and the link indicator is determined according to the following method:
[0043] The above-mentioned determination unit is specifically used to determine the connectivity and graph density of the network based on the number of links in the network and the connection relationship between nodes in the network. The connectivity is the minimum number of links that need to be removed when the network topology is not connected, and the graph density is the ratio of the number of actual links in the network topology to the maximum number of possible links. Based on the connectivity and graph density of the network, the link index is determined.
[0044] In a seventh possible implementation manner of the second aspect, the topology information of the network includes the degree of each node in the network, and the node index is determined according to the following method:
[0045] The above-mentioned determination unit is specifically used to determine the node index based on the degree of each node in the network and the number of nodes in the network.
[0046] In an eighth possible implementation manner of the second aspect, determining the reliability of the network topology based on the network reliability impact indicator includes:
[0047] The above-mentioned determination unit is further used to determine the reliability of the network topology according to the topology index, link index and / or node index.
[0048] In a third aspect, the present application provides a network topology reliability evaluation device, which includes: a processor and a communication interface; the communication interface and the processor are coupled, and the processor is used to run a computer program or instructions to implement a network topology reliability evaluation method as described in the first aspect and any possible implementation method of the first aspect.
[0049] In a fourth aspect, the present application provides a computer-readable storage medium, which stores instructions. When the instructions are executed on a terminal, the terminal executes the network topology reliability evaluation method described in the first aspect and any possible implementation of the first aspect.
[0050] In a fifth aspect, an embodiment of the present application provides a computer program product comprising instructions. When the computer program product runs on a network topology reliability evaluation device, the network topology reliability evaluation device executes the network topology reliability evaluation method as described in the first aspect and any possible implementation method of the first aspect.
[0051] In a sixth aspect, an embodiment of the present application provides a chip, the chip including a processor and a communication interface, the communication interface and the processor are coupled, and the processor is used to run a computer program or instructions to implement a network topology reliability evaluation method as described in the first aspect and any possible implementation method of the first aspect.
[0052] Specifically, the chip provided in the embodiment of the present application also includes a memory for storing computer programs or instructions. BRIEF DESCRIPTION OF THE DRAWINGS
[0053] Figure 1 A flowchart of a network topology reliability evaluation method provided in an embodiment of the present application;
[0054] Figure 2 One of the schematic diagrams of the network topology provided in the embodiment of the present application;
[0055] Figure 3 A second schematic diagram of a network topology provided in an embodiment of the present application;
[0056] Figure 4 The third schematic diagram of the network topology provided in the embodiment of the present application;
[0057] Figure 5 A fourth schematic diagram of a network topology provided in an embodiment of the present application;
[0058] Figure 6 This is a diagram of a logarithmic function with a base of 10;
[0059] Figure 7 A fifth schematic diagram of a network topology provided in an embodiment of the present application;
[0060] Figure 8 A flowchart of a method for calculating topological indicators provided in an embodiment of the present application;
[0061] Fig. 9 A schematic diagram of the structure of a network topology reliability evaluation device provided in an embodiment of the present application;
[0062] Fig.10 A schematic diagram of the structure of another network topology reliability evaluation device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0063] The network topology reliability evaluation method, device and storage medium provided in the embodiments of the present application are described in detail below in conjunction with the accompanying drawings.
[0064] The term "and / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone.
[0065] The terms "first" and "second" and the like in the specification and drawings of this application are used to distinguish different objects, or to distinguish different processing of the same object, rather than to describe a specific order of objects.
[0066] In addition, the terms "including" and "having" and any variations thereof mentioned in the description of the present application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.
[0067] It should be noted that, in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.
[0068] In the description of the present application, unless otherwise specified, “plurality” means two or more.
[0069] With the rapid development of information technology, optical cable networks, as the cornerstone of modern communication networks, carry the transmission of optical signals and the circulation of business data. Their security and reliability directly affect the stable operation of optical transmission networks. Therefore, it is particularly important to conduct a scientific and comprehensive evaluation of the reliability of optical cable networks.
[0070] The optical cable network has inherent reliability. After the network is built, the reliability of the network is determined. In the related art, for a relatively fixed network topology, the reliability calculation model usually uses the minimum path set algorithm to calculate the reliability of the optical cable network. This method can well reflect the connectivity between network nodes. However, using only the minimum path set algorithm will lack consideration of the connectivity of the network, resulting in inaccurate evaluation of the network topology reliability.
[0071] In this context, in order to solve the problem of inaccurate network topology reliability evaluation caused by lack of consideration of the connectivity of network organization in related technologies, the present application provides a network topology reliability evaluation method, device and storage medium. The implementation of the embodiment of the present application is described in detail below in conjunction with the accompanying drawings of the specification.
[0072] like Figure 1 As shown, it is a flowchart of a network topology reliability evaluation method provided in an embodiment of the present application. The method may include the following S101 to S103:
[0073] S101: Obtain network topology information.
[0074] The network topology information is used to indicate the nodes in the network and the connection relationship between the nodes.
[0075] In some embodiments, the network topology information includes the number of links in the network, the degree of each node in the network, and the connection relationship between nodes in the network.
[0076] Among them, the number of links in the network refers to the sum of all edges in the network; the degree of each node in the network refers to the number of edges directly connected to each node in the network.
[0077] For example, Figure 2 The figure shows a schematic diagram of the network topology. In this network topology, there are 6 links and 5 nodes, among which the degree of node A is 2, the degree of node B is 4, the degree of node C is 2, the degree of node D is 2, and the degree of node E is 2. Node A is connected to node B and node C respectively, node B is connected to node A, node C, node D, and node E respectively, node C is connected to node A and node B respectively, node D is connected to node B and node E respectively, and node E is connected to node B and node D respectively.
[0078] S102: Determine network reliability influencing indicators based on network topology information.
[0079] The network reliability influencing index includes a topology index, which is used to characterize the overall connectivity of the network topology.
[0080] In some embodiments, the above network reliability influencing index further includes a link index and / or a node index. The link index is used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network. The node index is used to characterize the degree of influence of the association of nodes in the network on the reliability of the network.
[0081] S103: Determine the reliability of the network topology based on the network reliability impact index.
[0082] In some embodiments, the network reliability influencing index only includes the topology index, and the above S103 is: determining the reliability of the network topology based on the topology index. For example, the topology index is equal to the reliability of the network topology. In this way, by strengthening the consideration of the overall connectivity of the network, the accuracy of the network topology reliability evaluation is improved.
[0083] In some embodiments, the network reliability influencing index includes a topology index, a link index and / or a node index, and the above S103 is: based on the topology index, the link index and / or the node index, the reliability of the network topology is determined. For example, the sum of the topology index, the link index and the node index is equal to the reliability of the network topology. In this way, the network topology reliability is evaluated by combining the topology index, the link index and / or the node index, thereby improving the accuracy and comprehensiveness of the network topology reliability evaluation.
[0084] The following is an introduction to how to determine each of the above indicators:
[0085] (1) Topological indicators
[0086] In some embodiments, the topology indicator is determined based on the network topology reliability of each node in the network. The network topology reliability of a node is the sum of the reliabilities of the node to all its hop surfaces. The Xth hop surface of a node is a node in the network that is X hops away from the node, and X is a positive integer.
[0087] For example, Figure 2 As shown, for node A, the nodes that are 1 hop away are node B and node C, and the nodes that are 2 hops away are node D and node E. Then the first hop surface of node A includes node B and node C, and the second hop surface of node A includes node D and node E.
[0088] In some embodiments, the topology indicator is determined in the following manner: determining the network topology reliability of each node in the network, determining the reliability weight of each node in the network, and determining the topology indicator based on the network topology reliability of each node in the network and the reliability weight of each node in the network.
[0089] The reliability weight of a node is the ratio of the number of edges connected to the node to the number of all edges in the network.
[0090] For example, the topological index can be calculated by formula (1), and formula (1) is as follows:
[0091]
[0092] Among them, R G is the topological index; N is the number of nodes in the network; R i is the reliability of node i to all its hops; w iis the reliability weight of node i; M is the maximum number of hops of all hops of node i; r ij is the reliability of the node i to the jth hop; t i is the number of edges connected to node i; ∑T is the number of all edges in the network.
[0093] In some embodiments, the reliability of a node to an X-th hop plane is determined in the following manner: determining the reliability of the node to a first hop plane, determining the reliability of every two adjacent hop planes among the X hop planes, and determining the reliability of the node to the X-th hop plane based on the reliability of the node to the first hop plane and the reliability of every two adjacent hop planes among the X hop planes.
[0094] In some embodiments, determining the reliability of a node to a first hop plane includes: merging all nodes included in the first hop plane in the topology of the network into the same first virtual node to obtain a first updated topology of the network; determining the reliability of the node to the first virtual node based on a minimum path set algorithm and the first updated topology of the network; and using the reliability of the node to the first virtual node as the reliability of the node to the first hop plane.
[0095] For example, Figure 3 As shown, the sub-network composed of node A and the first hop surface is first separated, and the nodes B and C included in the first hop surface are represented by virtual node T. Then, the reliability from node A to node T is the reliability from node A to the first hop surface.
[0096] In some embodiments, determining the reliability of every two adjacent hop surfaces among X hop surfaces includes: merging all nodes included in the m-1 hop surface in the topology of the network into the same m-1 virtual node, and merging all nodes included in the m hop surface in the topology of the network into the same m virtual node, to obtain the m th updated topology of the network, where m is an integer greater than 1 and less than or equal to X; determining the reliability between the m-1 virtual node and the m th virtual node based on a minimum path set algorithm and the m th updated topology of the network; and using the reliability between the m-1 virtual node and the m th virtual node as the reliability between the m-1 hop surface and the m th hop surface.
[0097] For example, Figure 4 As shown, the nodes B and C included in the first hop plane are represented by virtual node S, and the nodes D and E included in the second hop plane are represented by virtual node T. Then the reliability from node S to node T is the reliability from the first hop plane to the second hop plane of node A.
[0098] In this way, by considering the connectivity relationship between nodes and hop planes and between hop planes, the consideration of the overall connectivity of the network can be strengthened and the accuracy of the network topology reliability evaluation can be improved.
[0099] Optionally, the reliability calculation method between nodes includes but is not limited to a minimum path set algorithm.
[0100] The algorithm flow of the minimum path set algorithm is as follows: According to the network topology, the connection matrix C is obtained, and the generalized connection matrix C is constructed. ′ ; According to the serial numbers of source node s and sink node t, we can get the matrix C about element a ts The co-factor of is expanded to obtain the minimum path set from the source node s to the sink node t; a new matrix M(m×(n+3)) is constructed based on the minimum path set.
[0101] Among them, C ′ =C+I, I is the unit matrix, and the contact matrix is used to represent the connection relationship between network nodes; m is the minimum number of paths contained in the minimum path set, a row vector represents a minimum path, the number corresponding to the edge contained in a minimum path is 1, and the number corresponding to the edge not contained is 0; n is the number of edges contained in the network, the n+1th column (s) represents the source node number, the n+2th column (t) represents the sink node number, and the n+3th column (p) is initialized to 1.
[0102] Create the matrix M n2l (2×n), matrix M n (m×h), matrix M n When all the component values in the Lth column are 1 except for the source node and the sink node, it means that the Lth node is a cut point, and the following operations are performed: Delete the matrix M n2l There are columns of L in the matrix M ′ n2l ; Create a new matrix M ns and the matrix M nd ; Let a=1, b=1, when M ns (1,a)≠0 and M nd When (1,b)≠0, traverse M ′ n2l , equal the component to M ns The other component of the column of (1,a) replaces the matrix M ns (1,a+1), equalize the component to M nd (1,b) replaces the matrix M with another component of the column nd (1, b+1), a=a+1, b=b+1; create a new matrix M ls and the matrix M ld , traverse the matrix M n2l , the component in M ns The columns in are stored in the matrix M ls , the component in M nd The columns in are stored in the matrix M ld ; Based on the matrix M(m×(n+3)), create a new zero matrix M ′(2m×(n + 3)), let c = 1, when c < m, do the outer loop: let d = 1, when d < n, do the inner loop: If d is in matrix M ls M ′ (c, d) = M(c, d), M ′ (c, n + 1) = M(c, n + 1), M ′ (c, n + 2) = L, M ′ (c, n + 3) = M(c, n + 3), If d is in matrix M ld M ′ (c + m, d) = M(c, d), M ′ (c + m, n + 1) = L, M ′ (c + m, n + 2) = M(c, n + 2), M ′ (c + m, n + 3) = M(c, n + 3), d = d + 1, c = c + 1; Delete the same row vectors in matrix M ′ Continue to judge whether there are cut points in matrix M ′ If there are cut points, create matrix M n2l (2×n), matrix M n (m×h), and repeat the above operations.
[0103] Among them, the value of the y-th column in matrix M n2l (2×n) is the serial numbers of the nodes at both ends of the y-th edge; In matrix M n (m×h), h is the number of nodes in the network, the y-th row represents the nodes included in the y-th minimum path, the corresponding value of the nodes included in the minimum path is 1, and the corresponding value of the nodes not included is 0; Matrix M ns and matrix M nd are both 1×h matrices, used to store the nodes of two subgraphs, matrix M ns The first component is the serial number of the source node, matrix M nd The first component is the serial number of the sink node, and the rest are all 0; Matrix M ns and matrix M nd are both 1×h all-zero matrices, used to store the serial numbers of the edges of two subgraphs; Deleting the same row vectors in matrix M ′ means deleting the duplicate row vectors and only keeping one.
[0104] When there are no cut points in matrix M ′ , perform the following operations: Create matrix P(t×1), and initialize P(j) = j (1 ≤ j ≤ t); Let r = 1, when r ≤ n, judge in matrix M ′ If the r-th column of some rows j1···j k are all 1, then P(j i ) = min(P(j1···jk )) (1 ≤ i ≤ k), r = r + 1.
[0105] Where t is the number of rows of matrix M ′ and the (n + 3)-th column of matrix M ′ is equal to matrix P.
[0106] Extract from matrix M ′ a non-zero submatrix M ′ a where the (n + 1)-th, (n + 2)-th, and (n + 3)-th columns are the same; let i = 1, S i = E i , i = i + 1; compare T i and E i . If at the positions of some non-zero elements in T i the elements of E i are 0, arrange them in ascending order according to the position numbers in T i and denote them as K1, K2, ···, K r ; decompose E i with respect to K r into two components E i (K r ) and If the positions containing 1 or -1 in E i (K r ) include all the positions where any E j (j < i) has all 1s, then delete E i (K r ). If at least one of the positions containing 1 or -1 in each E j (j < i) corresponds to the 1 or -1 at the same position in E i (K r ), then retain E i (K r ); If the positions containing 1 or -1 include all the positions where any E j (j < i) has all 1s, then delete If at least one of the positions containing 1 or -1 in each E j (j < i) corresponds to the 1 or -1 at the same position in , then retain If E i (K r ) or is neither deleted nor retained, continue to decompose.
[0107] Where E i is the row vector of matrix M ′ a , E i (Kr )and Replace vector E with 1 and -1 respectively i No. K r Position 0, S i 1 indicates that the link is intact, 0 indicates that there is no such link, and -1 indicates a link failure.
[0108] Exemplarily, the reliability of the sub-network topology can be calculated by formula (II), and formula (II) is as follows:
[0109]
[0110] Among them, S i are disjoint paths in S.
[0111] Exemplarily, the reliability of the sub-network topology after parallel connection can be calculated by formula (III), and formula (III) is as follows:
[0112] P r (G″)=1-∏(1-P r (G ′ ))Formula (III)
[0113] Among them, P r (G ′ ) is the reliability of the subgraphs with the same values in the s column and the t column in the matrix M″, the matrix M″ is an a×4 matrix, a represents the non-zero submatrix M ′ a The number of components in each row of the matrix M″ is P r (G ′ ), the values of s, t, and p.
[0114] Exemplarily, the reliability between two nodes in the network topology can be calculated by formula (IV), and formula (IV) is as follows:
[0115] P r (G) = ∏P r (G″) Formula (IV)
[0116] In this way, by converting the reliability calculation from node to hop surface and from hop surface to hop surface into the reliability calculation from node to node, not only the overall connectivity of the network is taken into account, but also the calculation of topological indicators can be simplified and the calculation efficiency can be improved.
[0117] (2) Link indicators
[0118] In some embodiments, the connectivity and graph density of the network are determined based on the number of links in the network and the connection relationship between nodes in the network; and the link index is determined based on the connectivity and graph density of the network.
[0119] Among them, connectivity is the minimum number of links that need to be removed when the network topology is not connected, and graph density is the ratio of the number of actual links in the network topology to the maximum number of possible links.
[0120] For example, Figure 5 As shown, it is a schematic diagram of the network topology. Figure 5 The network topology of (a) and (b) in the figure is no longer connected without edge DE, so the network topology connectivity of (a) and (b) is 1. The graph density of (a) is 0.5, and the graph density of (b) is 0.7.
[0121] Exemplarily, the link index may be calculated by formula (V), which is as follows:
[0122]
[0123] Among them, T is the network topology connectivity, ρ is the graph density, and N is the number of nodes in the network topology.
[0124] (3) Node indicators
[0125] In some embodiments, the node metric is determined based on the degree of each node in the network and the number of nodes in the network.
[0126] When calculating node indicators, the logarithmic function is introduced as the evaluation function, such as Figure 6 As shown, it is a schematic diagram of the logarithmic function image with a base of 10. When the independent variable is small, the function gradient is high, which can reflect the importance of isolated nodes in the network.
[0127] For example, the node index can be calculated by formula (six), and formula (six) is as follows:
[0128]
[0129] Among them, X is the maximum value of the node degree in the network topology, N i is the number of nodes with node degree i.
[0130] Optionally, the evaluation function of the node index includes but is not limited to a logarithmic function.
[0131] The following is an introduction to the method of determining the reliability of the above network topology:
[0132] Exemplarily, the network topology reliability can be calculated by formula (VII), which is as follows:
[0133] R=R G Formula (VII)
[0134] Exemplarily, the network topology reliability can be calculated by formula (eight), and formula (eight) is as follows:
[0135] R=R G +R L +R I Formula (8)
[0136] Optionally, the calculation method of the network topology reliability includes but is not limited to the above-mentioned method of adding the topology index, the link index, and the node index.
[0137] For example, Figure 2 As shown, the reliability probability of each link in the network topology is 0.9, and the topology index R is calculated. G =0.7376, connectivity is 2, graph density is 0.6, then the link index R L =2×0.6=1.2, the node degrees of nodes A, C, D and E are 2, and the node degree of node B is 4, then the node index The network topology reliability R is 2.2988.
[0138] For example, Figure 7 As shown, the reliability probability of each link in the network topology is 0.9, and the topology index R is calculated. G =0.7494, connectivity is 2, and graph density is 0.6, then the link index R L =2×0.6=1.2, the node degrees of nodes A, D and E are 2, and the node degrees of nodes B and C are 3, then the node index The network topology reliability R is 2.3209.
[0139] The following is an exemplary description of the complete process of the topology index calculation method provided in the embodiment of the present application.
[0140] For example, Figure 8 As shown, the topology index calculation method provided in the embodiment of the present application may include the following S801 to S811:
[0141] S801: Input network topology information and reliability probability of each link.
[0142] The network topology information includes the number of links in the network and the connection relationship between nodes in the network.
[0143] S802. Initialize i to 1.
[0144] S803, determine whether i is equal to the number of nodes in the network plus 1. If yes, execute S811; if no, execute S804.
[0145] Among them, the number of nodes in the network is greater than or equal to 2.
[0146] S804: Calculate the maximum number of hops of the i-th node.
[0147] S805: Calculate the reliability of the connection from the i-th node to its first hop.
[0148] S806. Initialize j to 1.
[0149] S807: Determine whether j is less than or equal to the maximum number of hops of all hop planes minus 1. If yes, execute S808; if no, execute S810.
[0150] S808: Calculate the reliability from the j-th hop surface to the j+1-th hop surface.
[0151] S809, calculate the reliability from node i to the j+1th hop surface, assign j+1 to j, and continue to loop through S807 until j is equal to the maximum number of hops of all hop surfaces, and then execute S810.
[0152] S810, calculate the network topology reliability of node i and the weight of node i, assign i+1 to i, continue to loop through the above S803 until i is equal to the number of nodes in the network plus 1, and then execute S811.
[0153] S811. Calculate topological indicators of the network topology.
[0154] In the network topology reliability evaluation method provided in the embodiment of the present application, due to the lack of consideration of the overall connectivity of the network, the network topology reliability evaluation is inaccurate. Therefore, the present application introduces the concept of hop plane, converts the connectivity relationship between nodes in the network into the connectivity relationship between nodes and hop planes and between hop planes, so as to strengthen the consideration of the overall connectivity of the network, and comprehensively evaluates the network topology reliability by integrating link indicators and / or node indicators, thereby improving the accuracy of the network topology reliability evaluation.
[0155] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of the method. In order to achieve the above functions, the network topology reliability evaluation device includes a hardware structure and / or software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0156] The embodiment of the present application can divide the network topology reliability evaluation device into functional modules or functional units according to the above method. For example, each functional module or functional unit can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules or functional units. Among them, the division of modules or units in the embodiment of the present application is schematic, which is only a logical function division. There may be other division methods in actual implementation.
[0157] like Fig. 9 , which is a schematic diagram of the structure of a network topology reliability evaluation device provided in an embodiment of the present application, the network topology reliability evaluation device 900 includes: an acquisition unit 901 and a determination unit 902.
[0158] Among them, the acquisition unit 901 is used to acquire the topology information of the network, and the network topology information is used to indicate the nodes in the network and the connection relationship between the nodes; the determination unit 902 is used to determine the network reliability impact index based on the network topology information acquired by the acquisition unit 901, wherein the network reliability impact index includes the topology index, and the topology index is determined based on the network topology reliability of each node in the network. The network topology reliability of a node is the sum of the reliabilities of the node to all its hop surfaces, and the Xth hop surface of a node is a node in the network that is X hops away from the node, and X is a positive integer; the determination unit 902 is also used to determine the reliability of the network topology based on the network reliability impact index determined by the determination unit 902.
[0159] In some embodiments, the above-mentioned topological indicators are determined according to the following method: the above-mentioned determination unit 902 is specifically used to determine the network topological reliability of each node in the network, determine the reliability weight of each node in the network, and determine the topological indicators based on the network topological reliability of each node in the network and the reliability weight of each node in the network.
[0160] In some embodiments, the reliability of the above-mentioned one node to the Xth hop surface is determined according to the following method: the above-mentioned determination unit 902 is specifically used to determine the reliability of the node to the first hop surface, determine the reliability of each adjacent two hop surfaces among the X hop surfaces, and determine the reliability of the node to the Xth hop surface based on the reliability of the node to the first hop surface and the reliability of each adjacent two hop surfaces among the X hop surfaces.
[0161] In some embodiments, the above-mentioned determination of the reliability of the node to the first hop surface includes: merging all nodes included in the first hop surface in the topology of the network into the same first virtual node to obtain a first updated topology of the network; the above-mentioned determination unit 902 is specifically used to determine the reliability of the node to the first virtual node based on the minimum path set algorithm and the first updated topology of the network; and using the reliability of the node to the first virtual node as the reliability of the node to the first hop surface.
[0162] In some embodiments, the above-mentioned determination of the reliability of every two adjacent hop surfaces in the X hop surfaces includes: merging all nodes included in the m-1 hop surface in the topology of the network into the same m-1 virtual node, and merging all nodes included in the m hop surface in the topology of the network into the same m th virtual node, to obtain the m th updated topology of the network, where m is an integer greater than 1 and less than or equal to X; the above-mentioned determination unit 902 is specifically used to determine the reliability between the m-1 virtual node and the m th virtual node based on the minimum path set algorithm and the m th updated topology of the network; and using the reliability between the m-1 virtual node and the m th virtual node as the reliability between the m-1 hop surface and the m th hop surface.
[0163] In some embodiments, the above-mentioned network reliability influencing index also includes: link index and / or node index, wherein the link index is used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; the node index is used to characterize the degree of influence of the correlation of nodes in the network on the reliability of the network.
[0164] In some embodiments, the topology information of the above-mentioned network includes the number of links in the network, and the above-mentioned link indicators are determined according to the following method: based on the number of links in the network and the connection relationship between nodes in the network, the connectivity and graph density of the network are determined, the connectivity is the minimum number of links that need to be removed when the network topology is not connected, and the graph density is the ratio of the number of actual links in the network topology to the maximum number of possible links; the above-mentioned determination unit 902 is specifically used to determine the link indicator based on the connectivity and graph density of the network.
[0165] In some embodiments, the topology information of the above network includes the degree of each node in the network, and the above node index is determined according to the following method: the above determination unit 902 is specifically used to determine the node index based on the degree of each node in the network and the number of nodes in the network.
[0166] In some embodiments, the above-mentioned determination of the reliability of the network topology based on the network reliability impact index includes: the above-mentioned determination unit 902 is also used to determine the reliability of the network topology according to the topology index, the link index and the node index.
[0167] In the network topology reliability evaluation device provided in the embodiment of the present application, due to the lack of consideration for the overall connectivity of the network, the network topology reliability evaluation is inaccurate. Therefore, the present application introduces the concept of hop planes to convert the connectivity relationship between nodes in the network into the connectivity relationship between nodes and hop planes and between hop planes and hop planes, so as to strengthen the consideration for the overall connectivity of the network, and comprehensively evaluate the network topology reliability by integrating link indicators and / or node indicators, thereby improving the accuracy of the network topology reliability evaluation.
[0168] Fig.10 Another possible structural diagram of the network topology reliability evaluation device involved in the above-mentioned embodiment is shown. The network topology reliability evaluation device includes: a processor 1002 and a communication interface 1003. The processor 1002 is used to control and manage the actions of the network topology reliability evaluation device, for example, to execute the steps performed by the above-mentioned acquisition unit 901 and determination unit 902, and / or to execute other processes of the technology described herein. The communication interface 1003 is used to support the communication between the network topology reliability evaluation device and other network entities. The network topology reliability evaluation device may also include a memory 1001 and a bus 1004, and the memory 1001 is used to store program code and data of the network topology reliability evaluation device.
[0169] Among them, the memory 1001 can be a memory in a network topology reliability evaluation device, etc. The memory can include a volatile memory, such as a random access memory; the memory can also include a non-volatile memory, such as a read-only memory, a flash memory, a hard disk or a solid-state drive; the memory can also include a combination of the above types of memory.
[0170] The processor 1002 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
[0171] The bus 1004 may be an extended industry standard architecture (EISA) bus, etc. The bus 1004 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.10 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0172] Through the description of the above implementation methods, technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. The specific working process of the system, device and unit described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.
[0173] An embodiment of the present application provides a computer program product including instructions. When the computer program product is run on a computer, the computer is enabled to execute the network topology reliability evaluation method in the above method embodiment.
[0174] The embodiment of the present application also provides a computer-readable storage medium, in which instructions are stored. When the instructions are executed on a computer, the computer executes the network topology reliability evaluation method in the method flow shown in the above method embodiment.
[0175] Among them, the computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read only memory (EPROM), a register, a hard disk, an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above, or any other form of computer-readable storage medium known in the art. An exemplary storage medium is coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and the storage medium can be located in an application specific integrated circuit (ASIC). In the embodiments of the present application, a computer-readable storage medium may be any tangible medium that contains or stores a program, which may be used by or in conjunction with an instruction execution system, apparatus, or device.
[0176] An embodiment of the present invention provides a computer program product comprising instructions, which, when executed on a computer, causes the computer to execute the following Figure 1 The network topology reliability evaluation method described in .
[0177] Since the network topology reliability evaluation device, computer-readable storage medium, and computer program product in the embodiments of the present invention can be applied to the above method, the technical effects that can be obtained can also refer to the above method embodiments, and the embodiments of the present invention will not be repeated here.
[0178] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0179] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0180] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0181] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
Claims
1. A network topology reliability evaluation method, characterized in that: The method comprises: Acquire network topology information, where the network topology information is used to indicate nodes in the network and connection relationships between nodes; Based on the topological information of the network, determine the network reliability influencing index; wherein the network reliability influencing index includes the topological index; the topological index is determined based on the network topological reliability of each node in the network; the network topological reliability of a node is the sum of the reliability of the node to all its hop surfaces; the Xth hop surface of a node includes the node in the network that is X hops away from the node, and X is a positive integer; Based on the network reliability impact index, the reliability of the network topology is determined.
2. The method according to claim 1, characterized in that The topological index is determined in the following manner: Determining the network topology reliability of each node in the network; Determining the reliability weight of each node in the network; The topology index is determined based on the network topology reliability of each node in the network and the reliability weight of each node in the network.
3. The method according to claim 1, characterized in that The reliability of a node to the Xth hop is determined in the following manner: Determining the reliability of the node to the first hop surface; Determine the reliability of every two adjacent hop surfaces among the X hop surfaces; The reliability of the node to the Xth hop plane is determined based on the reliability of the node to the first hop plane and the reliability of every two adjacent hop planes among the X hop planes.
4. The method according to claim 3, characterized in that The determining the reliability of the node to the first hop plane includes: Merging all nodes included in the first hop plane in the topology of the network into the same first virtual node to obtain a first updated topology of the network; Determining the reliability of the node to the first virtual node based on a minimum path set algorithm and a first updated topology of the network; The reliability from the node to the first virtual node is used as the reliability from the node to the first hop plane.
5. The method according to claim 3, characterized in that: The step of determining the reliability of each two adjacent hop surfaces among the X hop surfaces comprises: Merge all nodes included in the m-1th hop plane in the topology of the network into the same m-1th virtual node, and merge all nodes included in the m-th hop plane in the topology of the network into the same m-th virtual node, to obtain an m-th updated topology of the network, where m is an integer greater than 1 and less than or equal to X; Determining the reliability between the m-1th virtual node and the mth virtual node based on a minimum path set algorithm and the mth updated topology of the network; The reliability between the m-1th virtual node and the mth virtual node is used as the reliability between the m-1th hop surface and the mth hop surface.
6. The method according to claim 1, characterized in that The network reliability influencing index also includes: link index and / or node index; wherein the link index is used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; the node index is used to characterize the degree of influence of the association of nodes in the network on the reliability of the network.
7. The method according to claim 6, characterized in that The topology information of the network includes the number of links in the network, and the link index is determined according to the following method: Determine the connectivity and graph density of the network based on the number of links in the network and the connection relationship between nodes in the network; the connectivity is the minimum number of links that need to be removed when the network topology is not connected; the graph density is the ratio of the number of actual links in the network topology to the maximum number of possible links; Based on the connectivity and graph density of the network, a link metric is determined.
8. The method according to claim 6, characterized in that The topological information of the network includes the degree of each node in the network, and the node index is determined according to the following method: A node index is determined based on the degree of each node in the network and the number of nodes in the network.
9. The method according to any one of claims 6 to 8, characterized in that: The determining the reliability of the network topology based on the network reliability impact index includes: The reliability of the network topology is determined according to the topology indicator, the link indicator and / or the node indicator.
10. A network topology reliability evaluation device, characterized in that: The device comprises: an acquisition unit and a determination unit, wherein: The acquisition unit is used to acquire network topology information, where the network topology information is used to indicate nodes in the network and connection relationships between nodes; The determining unit is used to determine the network reliability impact index based on the topology information of the network acquired by the acquiring unit; wherein the network reliability impact index includes a topology index; the topology index is determined based on the network topology reliability of each node in the network; the network topology reliability of a node is the sum of the reliability of the node to all its hop surfaces; the Xth hop surface of a node is a node in the network that is X hops away from the node, and X is a positive integer; The determining unit is further configured to determine the reliability of the network topology based on the network reliability impact index determined by the determining unit.
11. A network topology reliability evaluation device, characterized in that: include: A processor and a communication interface; the communication interface is coupled to the processor, and the processor is used to run a computer program or instruction to implement the network topology reliability evaluation method as described in any one of claims 1 to 9 above.
12. A computer-readable storage medium, wherein instructions are stored in the computer-readable storage medium, characterized in that: When a computer executes the instruction, the computer executes the network topology reliability evaluation method as described in any one of claims 1 to 9 above.
13. A computer program product, comprising instructions, characterized in that: When the instructions are executed on a computer, the computer executes the network topology reliability evaluation method as described in any one of claims 1 to 9 above.
Citation Information
Patent Citations
Method and device for monitoring network reliability
CN101710867A
Network security assessment method, system and device and storage medium
CN116566635A
Method and device for evaluating network topology data
CN116962192A
Resource allocation system, method, and program
WO2018134911A1
Power market transaction and evaluation method based on weak centralized consortium blockchain
WO2022007356A1
Cited By
Main and standby network switching method and system for server and intelligent terminal
CN121984917A
A method, system, and smart terminal for primary / backup network switching of a server.
CN121984917B