Network topology reliability evaluation methods, devices and storage media

Abstract

The application provides a network topology reliability evaluation method and device and a storage medium, relates to the technical field of network security, and can solve the problem of inaccurate network topology reliability evaluation caused by the lack of consideration of the overall connectivity of the network. The method comprises the following steps: acquiring topology information of a network, wherein the network topology information is used to indicate nodes in the network and connection relationships between the nodes; determining a reliability influence index based on the topology information of the network; and determining the reliability of the network topology according to the reliability influence index, wherein the reliability influence index comprises a topology index, a link index and a node index. The embodiments of the application are used for evaluating the reliability of the network topology.

Description

Technical Field

[0001] This application relates to the field of network security technology, and in particular to a method, apparatus and storage medium for evaluating network topology reliability. Background Technology

[0002] In optical communication networks, the optical fiber network serves as the core infrastructure, carrying the transmission of optical signals and the flow of service data. Its security and reliability directly affect the performance of the optical transmission network. However, the management and maintenance of the optical fiber network usually focuses on response and handling after a fault occurs, lacking an evaluation of the network's reliability during the initial stages of network construction.

[0003] In related technologies, for relatively fixed network topologies, the reliability calculation model typically employs the minimum path set algorithm to calculate the reliability of optical fiber networks. This method obtains the minimum path set by finding all the shortest paths from the source node to the target node in the network. Based on the minimum path set, the minimum disjointness is calculated. Then, the network topology reliability is calculated using the minimum disjointness and the reliability probability of each link in the network.

[0004] However, the above-mentioned method of using the minimum path set algorithm to calculate network topology reliability can only reflect the connectivity between network nodes and lacks consideration of the overall connectivity of the network. This may lead to inaccurate evaluation of network topology reliability, resulting in the inability to conduct a comprehensive evaluation of network topology reliability. Summary of the Invention

[0005] This application provides a method, apparatus, and storage medium for evaluating network topology reliability, aiming to solve the problem of inaccurate network topology reliability evaluation due to a lack of consideration for the overall network connectivity.

[0006] To achieve the above objectives, this application adopts the following technical solution:

[0007] In a first aspect, this application provides a method for evaluating network topology reliability. The method includes: first, acquiring network topology information, which is used to indicate the nodes in the network and the connection relationships between the nodes; second, determining network reliability impact indicators based on the network topology information, wherein the network reliability impact indicators include topology indicators, which 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 reliability of the node to all its hop surfaces, and the Xth hop surface of a node is the node in the network that is X hops away from the node, where X is a positive integer; and finally, determining the reliability of the network topology based on the network reliability impact indicators.

[0008] Based on the above technical solutions, the lack of consideration for the overall network connectivity leads to inaccurate network topology reliability evaluation. Therefore, this application introduces the concept of jump surfaces to transform the connectivity relationship between nodes in the network into the connectivity relationship between nodes and jump surfaces, as well as between jump surfaces, in order to strengthen the consideration of the overall network connectivity and thus improve the accuracy of network topology reliability evaluation.

[0009] In the first possible implementation of the first aspect, the above topological indices are determined as follows:

[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 and the reliability weight of each node in the network.

[0011] In the second possible implementation of the first aspect, the reliability of the aforementioned node to the Xth jump surface is determined as follows:

[0012] Determine the reliability of the node to the first jump surface, determine the reliability of each pair of adjacent jump surfaces in the X jump surfaces, and based on the reliability of the node to the first jump surface and the reliability of each pair of adjacent jump surfaces in the X jump surfaces, determine the reliability of the node to the Xth jump surface.

[0013] In the third possible implementation of the first aspect, the reliability of determining the node to the first jump surface includes:

[0014] The first updated topology of the network is obtained by merging all nodes contained in the first jump surface of the network topology into the same first virtual node.

[0015] Based on the minimum path set algorithm and the first updated topology of the network, the reliability of the node to the first virtual node is determined;

[0016] The reliability of a node to the first virtual node is used as the reliability of a node to the first jump surface.

[0017] In the fourth possible implementation of the first aspect, determining the reliability of each pair of adjacent jump surfaces among the X jump surfaces includes:

[0018] Merge all nodes contained in the (m-1)th jump surface of the network topology into the same (m-1)th virtual node, and merge all nodes contained in the m-th jump surface of the network topology 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;

[0019] Based on the minimum path set algorithm and the m-th updated topology of the network, determine the reliability between the (m-1)-th virtual node and the m-th virtual node;

[0020] The reliability between the (m-1)th virtual node and the mth virtual node is used as the reliability between the (m-1)th jump surface and the mth jump surface.

[0021] In the fifth possible implementation of the first aspect, the aforementioned network reliability impact indicators further include: link indicators and / or node indicators, wherein the link indicators are used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; and the node indicators are used to characterize the degree of influence of the correlation of nodes in the network on the reliability of the network.

[0022] In the sixth possible implementation of the first aspect, the topology information of the network includes the number of links in the network, and the link metrics are determined in the following manner:

[0023] Based on the number of links in the network and the connection relationships between nodes, the network connectivity and graph density are determined. Connectivity is the minimum number of links that need to be removed when the network topology is disconnected, and graph density is the ratio of the actual number of links in the network topology to the maximum number of possible links. Based on the network connectivity and graph density, link metrics are determined.

[0024] In the seventh possible implementation 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] Node metrics are determined based on the degree of each node in the network and the number of nodes in the network.

[0026] In the eighth possible implementation of the first aspect, the determination of network topology reliability based on network reliability impact indicators includes:

[0027] Determine the reliability of the network topology based on topology metrics, link metrics, and / or node metrics.

[0028] Secondly, this 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, the network topology information being used to indicate nodes in the network and the connection relationships between nodes; the determination unit is used to determine network reliability impact indicators based on the network topology information acquired by the acquisition unit, wherein the network reliability impact indicators include topology indicators, the topology indicators being determined based on the network topology reliability of each node in the network, the network topology reliability of a node being the sum of the reliability of the node to all its hop surfaces, the Xth hop surface of a node being the node in the network that is X hops away from the node, where X is a positive integer; the determination unit is further used to determine the reliability of the network topology based on the network reliability impact indicators determined by the determination unit.

[0029] In the first possible implementation of the second aspect, the above topology index is determined as follows:

[0030] The aforementioned determining 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 and the reliability weight of each node in the network.

[0031] In a second possible implementation of the second aspect, the reliability of the aforementioned node to the Xth jump surface is determined as follows:

[0032] The aforementioned determining unit is specifically used to determine the reliability of the node to the first jump surface, determine the reliability of each two adjacent jump surfaces among the X jump surfaces, and determine the reliability of the node to the Xth jump surface based on the reliability of the node to the first jump surface and the reliability of each two adjacent jump surfaces among the X jump surfaces.

[0033] In a third possible implementation of the second aspect, the reliability of determining the node to the first jump surface includes:

[0034] The first updated topology of the network is obtained by merging all nodes contained in the first jump surface of the network topology into the same first virtual node.

[0035] The aforementioned determining unit is specifically used to determine the reliability of a node to a first virtual node based on the minimum path set algorithm and the first updated topology of the network;

[0036] The reliability of a node to the first virtual node is used as the reliability of a node to the first jump surface.

[0037] In the fourth possible implementation of the second aspect, determining the reliability of each pair of adjacent jump surfaces among the X jump surfaces includes:

[0038] Merge all nodes contained in the (m-1)th jump surface of the network topology into the same (m-1)th virtual node, and merge all nodes contained in the m-th jump surface of the network topology 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;

[0039] The aforementioned determining unit is specifically used to determine the reliability between the (m-1)th 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-1)th virtual node and the mth virtual node is used as the reliability between the (m-1)th jump surface and the mth jump surface.

[0041] In the fifth possible implementation of the second aspect, the aforementioned network reliability impact indicators further include: link indicators and / or node indicators, wherein the link indicators are used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; and the node indicators are used to characterize the degree of influence of the correlation of nodes in the network on the reliability of the network.

[0042] In the sixth possible implementation of the second aspect, the network topology information includes the number of links in the network, and the link metrics are determined as follows:

[0043] The aforementioned determining unit is specifically used to determine the connectivity and graph density of a network based on the number of links in the network and the connection relationships 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 actual number of 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 the seventh possible implementation 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 aforementioned determining unit is specifically used to determine node indicators based on the degree of each node in the network and the number of nodes in the network.

[0046] In the eighth possible implementation of the second aspect, the determination of network topology reliability based on network reliability impact indicators includes:

[0047] The aforementioned determining unit is also used to determine the reliability of the network topology based on topology indicators, link indicators, and / or node indicators.

[0048] Thirdly, this application provides a network topology reliability evaluation apparatus, which includes: a processor and a communication interface; the communication interface and the processor are coupled, and the processor is used to run computer programs or instructions to implement the network topology reliability evaluation method as described in the first aspect and any possible implementation of the first aspect.

[0049] Fourthly, this application provides a computer-readable storage medium storing instructions that, when executed on a terminal, cause the terminal to perform the network topology reliability evaluation method as described in the first aspect and any possible implementation thereof.

[0050] Fifthly, embodiments of this application provide a computer program product containing instructions that, when run on a network topology reliability evaluation device, cause the network topology reliability evaluation device to perform the network topology reliability evaluation method as described in the first aspect and any possible implementation thereof.

[0051] In a sixth aspect, embodiments of this application provide a chip including a processor and a communication interface, the communication interface being coupled to the processor, the processor being used to run computer programs or instructions to implement the network topology reliability evaluation method as described in the first aspect and any possible implementation thereof.

[0052] Specifically, the chip provided in this application embodiment also includes a memory for storing computer programs or instructions. Attached Figure Description

[0053] Figure 1 A flowchart illustrating a network topology reliability evaluation method provided in this application embodiment;

[0054] Figure 2 One of the schematic diagrams of the network topology provided in the embodiments of this application;

[0055] Figure 3 A second schematic diagram of the network topology provided in the embodiments of this application;

[0056] Figure 4 A schematic diagram of the network topology provided in the embodiments of this application (Part 3);

[0057] Figure 5 A fourth schematic diagram of the network topology provided for an embodiment of this application;

[0058] Figure 6 A schematic diagram of the graph of a logarithmic function with base 10;

[0059] Figure 7 Fifth schematic diagram of the network topology provided for embodiments of this application;

[0060] Figure 8 A flowchart illustrating the topology index calculation method provided in this application embodiment;

[0061] Figure 9 This is a schematic diagram of the structure of a network topology reliability evaluation device provided in an embodiment of this application;

[0062] Figure 10 This is a schematic diagram of another network topology reliability evaluation device provided in an embodiment of this application. Detailed Implementation

[0063] The network topology reliability evaluation method, apparatus, and storage medium provided in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0064] In this article, the term "and / or" is merely a description of the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone.

[0065] The terms "first" and "second," etc., used in the specification and drawings of this application are used to distinguish different objects or to distinguish different treatments of the same object, rather than to describe a specific order of objects.

[0066] Furthermore, the terms "comprising" and "having," and any variations thereof, used in the description of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0067] It should be noted that in the embodiments of this application, the words "exemplary" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the words "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0068] In the description of this application, unless otherwise stated, "a plurality of" means two or more.

[0069] With the rapid development of information technology, optical fiber networks, as the cornerstone of modern communication networks, carry the transmission of optical signals and the flow of service data. Their security and reliability directly affect the stable operation of the optical transmission network. Therefore, it is particularly important to conduct a scientific and comprehensive assessment of the reliability of optical fiber networks.

[0070] Optical fiber networks possess inherent reliability; once the network is built, its reliability is determined. In related technologies, for relatively fixed network topologies, the reliability calculation model typically employs the minimum path set algorithm to assess the reliability of the optical fiber network. This method effectively reflects the connectivity between network nodes. However, relying solely on the minimum path set algorithm neglects to consider the overall connectivity of the network, leading to inaccurate evaluations of network topology reliability.

[0071] Against this backdrop, in order to address the problem of inaccurate network topology reliability evaluation caused by the lack of consideration for network connectivity in related technologies, this application provides a network topology reliability evaluation method, apparatus, and storage medium. The implementation methods of this application will be described in detail below with reference to the accompanying drawings.

[0072] like Figure 1 The diagram shown is a flowchart of a network topology reliability evaluation method provided in an embodiment of this application. The method may include the following steps 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 connections between them.

[0075] In some embodiments, network topology information includes the number of links in the network, the degree of each node in the network, and the connection relationships between nodes in the network.

[0076] In this context, the number of links in a network refers to the sum of all edges in the network; the degree of each node in a network refers to the number of edges that are directly connected to each node in the network.

[0077] For example, such as Figure 2 The diagram shows a network topology. This network topology has 6 links and 5 nodes. Node A has a degree of 2, node B has a degree of 4, node C has a degree of 2, node D has a degree of 2, and node E has a degree of 2. Node A is connected to nodes B and C, node B is connected to nodes A, C, D, and E, node C is connected to nodes A and B, node D is connected to nodes B and E, and node E is connected to nodes B and D.

[0078] S102. Based on network topology information, determine the indicators affecting network reliability.

[0079] Among the network reliability impact metrics are topology metrics. Topology metrics are used to characterize the overall connectivity of the network topology.

[0080] In some embodiments, the network reliability impact metrics further include link metrics and / or node metrics. Link metrics characterize the degree to which the interconnection of nodes in the network affects network reliability. Node metrics characterize the degree to which the correlation of nodes in the network affects network reliability.

[0081] S103. Determine the reliability of the network topology based on network reliability impact indicators.

[0082] In some embodiments, the network reliability impact indicators only include topology indicators, and S103 above refers to: determining the reliability of the network topology based on the topology indicators. For example, the topology indicators are equated with the reliability of the network topology. In this way, by strengthening the consideration of the overall network connectivity, the accuracy of network topology reliability evaluation is improved.

[0083] In some embodiments, network reliability impact indicators include topology indicators, link indicators, and / or node indicators. S103 above refers to determining the reliability of the network topology based on the topology indicators, link indicators, and / or node indicators. For example, the reliability of the network topology is equal to the sum of the topology indicators, link indicators, and node indicators. In this way, by comprehensively evaluating the network topology reliability using topology indicators, link indicators, and / or node indicators, the accuracy and comprehensiveness of the network topology reliability evaluation are improved.

[0084] The determination methods for each of the above indicators are described below:

[0085] (1) Topological Indicators

[0086] In some embodiments, the topology metric 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 the node in the network that is X hops away from the node, where X is a positive integer.

[0087] For example, such as Figure 2 As shown, for node A, nodes B and C are 1 hop apart, and nodes D and E are 2 hop apart. Therefore, the first hop surface of node A includes nodes B and C, and the second hop surface of node A includes nodes D and E.

[0088] In some embodiments, topology metrics are determined by: 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 metrics 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 total number of edges in the network.

[0090] For example, the topology index can be calculated using formula (I), which is as follows:

[0091]

[0092] Among them, R G R is a topology indicator; N is the number of nodes in the network; i w represents the reliability of node i to all its jump surfaces; iLet r be the reliability weight of node i; M be the maximum number of hops across all hop surfaces of node i; ij The reliability of the jump surface from node i to the j-th node; t i Let ∑T be the number of edges connected to node i; ∑T is the total number of edges in the network.

[0093] In some embodiments, the reliability of a node to the Xth jump surface is determined by: determining the reliability of the node to the first jump surface, determining the reliability of each two adjacent jump surfaces in the X jump surfaces, and determining the reliability of the node to the Xth jump surface based on the reliability of the node to the first jump surface and the reliability of each two adjacent jump surfaces in the X jump surfaces.

[0094] In some embodiments, determining the reliability of a node to a first hop surface includes: merging all nodes contained in the first hop surface in the network topology into the same first virtual node to obtain the first updated topology of the network; determining the reliability of a node to a first virtual node based on the minimum path set algorithm and the first updated topology of the network; and using the reliability of a node to a first virtual node as the reliability of a node to a first hop surface.

[0095] For example, such as Figure 3 As shown, the subnetwork consisting of node A and the first jump surface is first separated. The nodes B and C contained in the first jump 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 jump surface.

[0096] In some embodiments, determining the reliability of each pair of adjacent hops in the X hops includes: merging all nodes contained in the (m-1)th hop in the network topology into the same (m-1)th virtual node, and merging all nodes contained in the m-th hop in the network topology 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; determining the reliability between the (m-1)th 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)th virtual node and the m-th virtual node as the reliability between the (m-1)th hop and the m-th hop.

[0097] For example, such as Figure 4 As shown, nodes B and C contained in the first jump surface are represented by virtual node S, and nodes D and E contained in the second jump surface are represented by virtual node T. Then the reliability from node S to node T is the reliability from the first jump surface to the second jump surface of node A.

[0098] Thus, by considering the connectivity between nodes and jump surfaces, as well as between jump surfaces, we can strengthen the consideration of the overall network connectivity and improve the accuracy of network topology reliability evaluation.

[0099] Optionally, the reliability calculation method between nodes includes, but is not limited to, the minimum path set algorithm.

[0100] The algorithm flow of the minimum path set algorithm is as follows: Obtain the connection matrix C based on the network topology, and construct the generalized connection matrix Cn. ′ ; Based on the indexes of the source node s and the sink node t, matrix C is obtained with respect to element a. ts The cofactor is obtained by expanding the cofactor 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, where I is the identity matrix, and the connection matrix is ​​used to represent the connection relationship between network nodes; m is the number of minimum paths contained in the minimum path set, where a row vector represents a minimum path, and the number corresponding to the edge contained in a minimum path is 1, and the number corresponding to the edge not contained in a minimum path is 0; n is the number of edges contained in the network, the (n+1)th column (s) represents the source node index, the (n+2)th column (t) represents the sink node index, and the (n+3)th column (p) is initialized to 1.

[0102] Create matrix M n2l (2×n), matrix M n (m×h), matrix M n In a matrix M, if all component values ​​in column L are 1 (excluding the source and sink nodes), then the Lth node is a cut point, and the following operation is performed: delete matrix M. n2l Given L columns, we obtain matrix M. ′ n2l Create a new matrix M ns And matrix M nd Let a = 1, b = 1, when M ns (1,a)≠0 and M nd When (1,b)≠0, traverse M ′ n2l , make the component equal to M ns The other component of column (1,a) is replaced by matrix M. ns (1, a+1), the component is equal to M nd The other component of column (1,b) is replaced by matrix M. nd (1, b+1), a = a+1, b = b+1; create a new matrix M ls And matrix M ld Traverse matrix M n2l , will the component in M ns The columns are stored in matrix M ls , will the component in M nd The columns are stored in matrix M ld Based on matrix M(m×(n+3)), create a new zero matrix M. ′(2m×(n + 3)), let c = 1, when c < m, do an outer loop: let d = 1, when d < n, do an inner loop: If d is in matrix M ls among, 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 among, 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 ′ , In the case of existing 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 sub - graphs, the first component of matrix M ns is the serial number of the source node, the first component of matrix M nd is the serial number of the sink node, and the rest are 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 sub - graphs; Deleting the same row vectors in matrix M ′ means deleting 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 sub-matrix 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) are all 1, 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) are all 1, 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 Kth r 0, S at position i In the code, 1 indicates that the link is intact, 0 indicates that the link is not present, and -1 indicates that the link is faulty.

[0108] For example, the reliability of the sub-network topology can be calculated using formula (II), which is as follows:

[0109]

[0110] Among them, S i These are non-intersecting paths in S.

[0111] For example, the reliability of the sub-network topology after parallel connection can be calculated using formula (iii), which is as follows:

[0112] P r (G″)=1-∏(1-P r (G ′ Formula (3)

[0113] Among them, P r (G ′ The matrix M″ represents the reliability of subgraphs where the values ​​in columns s and t are the same. Matrix M″ is an a×4 matrix, where a represents a non-zero submatrix M. ′ a The number of components in matrix M″, where each row of matrix M″ is P r (G ′ ), s, t, p values.

[0114] For example, the reliability between two nodes in the network topology can be calculated using formula (iv), which is as follows:

[0115] P r (G)=∏P r (G″) Formula (IV)

[0116] In this way, by transforming the reliability calculations from node to hop surface and from hop surface to hop surface into node to node reliability calculations, not only is the overall network connectivity considered, but the calculation of topology indicators can also be simplified and computational efficiency improved.

[0117] (2) Link metrics

[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 relationships between nodes in the network; and the link index is determined based on the connectivity and graph density of the network.

[0119] 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 actual number of links in the network topology to the maximum number of possible links.

[0120] For example, such as Figure 5 The diagram shown is a schematic of the network topology. Figure 5 In the network topologies of (a) and (b), removing edge DE results in disconnected networks, so the connectivity of the networks in (a) and (b) is 1. The graph density of (a) is 0.5, and the graph density of (b) is 0.7.

[0121] For example, the link metric can be calculated using formula (5), which is as follows:

[0122]

[0123] Where 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, node metrics are determined based on the degree of each node in the network and the number of nodes in the network.

[0126] When calculating node metrics, a logarithmic function is introduced as the evaluation function, such as... Figure 6 The figure shows a schematic diagram of a logarithmic function with a base of 10. When the independent variable is small, the gradient of the function is high, which can reflect the importance of isolated nodes in the network.

[0127] For example, the node index can be calculated using formula (VI), which is as follows:

[0128]

[0129] Where X is the maximum degree of a node in the network topology, and N... i This represents the number of nodes with degree i.

[0130] Optionally, the evaluation function for node indicators includes, but is not limited to, a logarithmic function.

[0131] The following describes how the reliability of the above network topology is determined:

[0132] For example, the reliability of the network topology can be calculated using formula (VII), which is as follows:

[0133] R = R G Formula (VII)

[0134] For example, the reliability of the network topology can be calculated using formula (eight), which is as follows:

[0135] R = R G +R L +R I Formula (8)

[0136] Optionally, the calculation method for network topology reliability includes, but is not limited to, the above-mentioned method of adding topology indicators, link indicators, and node indicators.

[0137] For example, such as Figure 2 As shown, the reliability probability of each link in this network topology is 0.9, and the calculated topology index R is... G =0.7376, connectivity is 2, graph density is 0.6, then the link index R L =2 × 0.6 = 1.2, the degree of nodes A, C, D, and E is 2, and the degree of node B is 4, then the node index The network topology reliability R is 2.2988.

[0138] For example, such as Figure 7 As shown, the reliability probability of each link in this network topology is 0.9, and the calculated topology index R is... G =0.7494, connectivity is 2, graph density is 0.6, then the link index R L =2 × 0.6 = 1.2, the degree of nodes A, D, and E is 2, and the degree of nodes B and C is 3, then the node index The network topology reliability R is 2.3209.

[0139] The following provides an exemplary description of the complete process of the topology index calculation method provided in the embodiments of this application.

[0140] For example, such as Figure 8 As shown, the topology index calculation method provided in this application embodiment may include the following steps 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 relationships between nodes in the network.

[0143] S802, Initialize i to 1.

[0144] S803. Determine if i is equal to the number of nodes in the network plus 1. If yes, execute S811; otherwise, execute S804.

[0145] The number of nodes in the network is greater than or equal to 2.

[0146] S804. Calculate the maximum number of jump surfaces for the i-th node.

[0147] S805. Calculate the reliability of the i-th node to its first jump surface.

[0148] S806, Initialize j to 1.

[0149] S807. Determine if j is less than or equal to the maximum number of jumps across all jump surfaces minus 1. If yes, proceed to S808; otherwise, proceed to S810.

[0150] S808. Calculate the reliability of the jump from the j-th jump surface to the (j+1)-th jump surface.

[0151] S809. Calculate the reliability from node i to the (j+1)th hop surface, assign j+1 to j, and continue to execute S807 in a loop until j equals the maximum number of hops for all hop surfaces, then execute S810.

[0152] S810: Calculate the network topology reliability of node i and the weight of node i, assign i+1 to i, and continue to execute the above S803 in a loop until i equals the number of nodes in the network plus 1, then execute S811.

[0153] S811. Calculate the topology index of the network topology.

[0154] In the network topology reliability evaluation method provided in this application embodiment, the lack of consideration for the overall network connectivity leads to inaccurate network topology reliability evaluation. Therefore, this application introduces the concept of jump surfaces, transforming the connectivity relationship between nodes in the network into the connectivity relationship between nodes and jump surfaces, as well as between jump surfaces, to strengthen the consideration of the overall network connectivity. Furthermore, by comprehensively evaluating link indicators and / or node indicators, a comprehensive evaluation of network topology reliability is conducted, thereby improving the accuracy of network topology reliability evaluation.

[0155] The above primarily describes the solutions provided by the embodiments of this application from a methodological perspective. To achieve the above functions, the network topology reliability evaluation device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0156] This application embodiment can, based on the above method, illustrate the division of a network topology reliability evaluation device into functional modules or functional units. For example, each function can be divided into its own functional modules or functional units, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module or functional unit. The module or unit division in this application embodiment is illustrative and represents only one logical functional division; in actual implementation, other division methods may be used.

[0157] like Figure 9 The diagram shown is a structural schematic of a network topology reliability evaluation device provided in an embodiment of this application. The network topology reliability evaluation device 900 includes: an acquisition unit 901 and a determination unit 902.

[0158] The acquisition unit 901 is used to acquire network topology information, which indicates the nodes in the network and the connection relationships between nodes. The determination unit 902 is used to determine network reliability impact indicators based on the network topology information acquired by the acquisition unit 901. The network reliability impact indicators include topology indicators, which 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 reliability of the node to all its hop surfaces. The Xth hop surface of a node is the node in the network that is X hops away from the node, where 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 indicators determined by the determination unit 902.

[0159] In some embodiments, the topology index is determined in the following manner: the determining unit 902 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.

[0160] In some embodiments, the reliability of a node to the Xth jump surface is determined in the following manner: the determining unit 902 is specifically used to determine the reliability of a node to the first jump surface, determine the reliability of each two adjacent jump surfaces in the X jump surfaces, and determine the reliability of a node to the Xth jump surface based on the reliability of a node to the first jump surface and the reliability of each two adjacent jump surfaces in the X jump surfaces.

[0161] In some embodiments, determining the reliability of a node to a first hop surface includes: merging all nodes contained in the first hop surface in the network topology into the same first virtual node to obtain the first updated topology of the network; the determining unit 902 is specifically used to determine the reliability of a node to a first virtual node based on the minimum path set algorithm and the first updated topology of the network; and using the reliability of a node to a first virtual node as the reliability of a node to a first hop surface.

[0162] In some embodiments, determining the reliability of each pair of adjacent jump surfaces in the X jump surfaces includes: merging all nodes contained in the (m-1)th jump surface in the network topology into the same (m-1)th virtual node, and merging all nodes contained in the m-th jump surface in the network topology 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 determining unit 902 is specifically used to determine the reliability between the (m-1)th 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)th virtual node and the m-th virtual node as the reliability between the (m-1)th jump surface and the m-th jump surface.

[0163] In some embodiments, the above-mentioned network reliability impact indicators further include: link indicators and / or node indicators, wherein the link indicators are used to characterize the degree of influence of the interconnection of nodes in the network on the reliability of the network; and the node indicators are 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 network includes the number of links in the network, and the link index is determined in the following manner: 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, where 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 actual number of links in the network topology to the maximum number of possible links; the determining unit 902 is specifically used to determine the link index based on the network connectivity and graph density.

[0165] In some embodiments, the topology information of the network includes the degree of each node in the network, and the node index is determined in the following manner: the 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 determination of network topology reliability based on network reliability impact indicators includes: the determination unit 902 is further configured to determine the reliability of network topology based on topology indicators, link indicators, and node indicators.

[0167] In the network topology reliability evaluation device provided in this application embodiment, the lack of consideration for the overall network connectivity leads to inaccurate network topology reliability evaluation. Therefore, this application introduces the concept of jump surfaces to transform the connectivity relationship between nodes in the network into the connectivity relationship between nodes and jump surfaces, as well as between jump surfaces, to strengthen the consideration of the overall network connectivity. Furthermore, by comprehensively evaluating link indicators and / or node indicators, a comprehensive evaluation of network topology reliability is conducted, thereby improving the accuracy of network topology reliability evaluation.

[0168] Figure 10 A schematic diagram of another possible structure of the network topology reliability evaluation device involved in the above embodiments is shown. This network topology reliability evaluation device includes a processor 1002 and a communication interface 1003. The processor 1002 is used to control and manage the operation of the network topology reliability evaluation device, for example, executing the steps performed by the acquisition unit 901 and the determination unit 902, and / or performing other processes of the technology described herein. The communication interface 1003 is used to support 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. The memory 1001 is used to store the program code and data of the network topology reliability evaluation device.

[0169] The memory 1001 may be a memory in a network topology reliability evaluation device, and the memory may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, hard disk or solid-state drive; the memory may also include a combination of the above types of memory.

[0170] The processor 1002 described above can implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor can be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor can also be a combination that implements computing functions, such as including one or more microprocessor combinations, a combination of a DSP and a microprocessor, etc.

[0171] Bus 1004 can be an extended industry standard architecture (EISA) bus, etc. Bus 1004 can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 10 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0172] Through the above description of the embodiments, those skilled in the art will clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In practical applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be 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 be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0173] This application provides a computer program product containing instructions that, when run on a computer, cause the computer to execute the network topology reliability evaluation method described in the above method embodiments.

[0174] This application also provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the network topology reliability evaluation method in the method flow shown in the above method embodiments.

[0175] The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires; a portable computer disk drive; a hard disk drive; random access memory (RAM); read-only memory (ROM); erasable programmable read-only memory (EPROM); a register; a hard disk drive; an optical fiber; a compact disc read-only memory (CD-ROM); an optical storage device; a magnetic storage device; or any suitable combination thereof; or any other form of computer-readable storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium may also be a component of the processor. The processor and the storage medium may reside in an application-specific integrated circuit (ASIC). In the embodiments of this application, the computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0176] Embodiments of the present invention provide a computer program product containing instructions that, when executed on a computer, cause the computer to perform actions such as... Figure 1 The network topology reliability evaluation method described in [the document].

[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 obtained can also be referred to the above method embodiments. The embodiments of the present invention will not be described again here.

[0178] In the several embodiments provided in this 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 merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0179] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0180] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0181] The above are merely specific embodiments of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A network topology reliability evaluation method, characterized by, The method comprises: obtaining network topology information, the network topology information being used to indicate nodes in the network and connection relationships between the nodes; determining a network reliability influence index based on the network topology information, wherein the network reliability influence index comprises a topology index, the topology index being determined based on network topology reliabilities of the nodes in the network, the network topology reliability of one node being a sum of reliabilities of the node to all hop surfaces of the node, and the Xth hop surface of one node comprising nodes in the network having a distance of X hops from the node, X being a positive integer; determining a reliability of the network topology based on the network reliability influence index; the reliability of one node to the Xth hop surface being determined in the following manner: merging all nodes in a first hop surface of the network topology into a same first virtual node to obtain a first updated topology of the network, and determining a 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 taking the reliability of the node to the first virtual node as the reliability of the node to the first hop surface; merging all nodes in an (m-1)th hop surface of the network topology into a same (m-1)th virtual node and merging all nodes in an mth hop surface of the network topology into a same mth virtual node to obtain an mth updated topology of the network, m being an integer greater than 1 and less than or equal to X, and determining a reliability between the (m-1)th virtual node and the mth virtual node based on a minimum path set algorithm and the mth updated topology of the network, and taking the reliability between the (m-1)th virtual node and the mth virtual node as the reliability between the (m-1)th hop surface and the mth hop surface; determining 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 in the X hop surfaces.

2. The method of claim 1, wherein, The topology index is determined in the following manner: determining network topology reliabilities of the nodes in the network; determining reliability weight values of the nodes in the network; determining the topology index based on the network topology reliabilities of the nodes in the network and the reliability weight values of the nodes in the network.

3. The method of claim 1, wherein, The network reliability influence index further comprises a link index and / or a node index, wherein the link index is used to represent an influence degree of an interconnection of nodes in the network on the reliability of the network, and the node index is used to represent an influence degree of a correlation degree of nodes in the network on the reliability of the network.

4. The method of claim 3, wherein, The network topology information comprises a number of links in the network, and the link index is determined in the following manner: determining a connectivity and a graph density of the network based on the number of links in the network and the connection relationships between the nodes in the network, the connectivity being a minimum number of links to be removed when the network topology is not connected, and the graph density being a ratio of an actual number of links in the network topology to a maximum number of links that can exist; determining the link index based on the connectivity and the graph density of the network.

5. The method of claim 3, wherein, The topology information of the network comprises degrees of nodes in the network, and the node indicator is determined according to the following manner: The node indicator is determined based on the degrees of nodes in the network and the number of nodes in the network.

6. The method according to any one of claims 3-5, characterized in that, The network topology reliability is determined based on the network reliability influence indicator, comprising: The network topology reliability is determined according to the topology indicator, the link indicator and / or the node indicator.

7. A network topology reliability evaluation apparatus, characterized by comprising: The device comprises an acquisition unit and a determination unit, wherein: The acquisition unit is configured to acquire topology information of a network, the topology information of the network being used to indicate nodes in the network and connection relationships between the nodes; The determination unit is configured to determine a network reliability influence indicator based on the topology information of the network acquired by the acquisition unit; wherein the network reliability influence indicator comprises a topology indicator; the topology indicator is determined based on network topology reliabilities of nodes in the network; the network topology reliability of one node is a sum of reliabilities of the node to all hop faces of the node; the Xth hop face of one node is a node in the network which is X hops away from the node, and X is a positive integer; The determination unit is further configured to determine a network topology reliability based on the network reliability influence indicator determined by the determination unit; The determination unit is specifically configured to: merge all nodes in a first hop face in the topology of the network into a same first virtual node to obtain a first updated topology of the network; determine a 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 take the reliability of the node to the first virtual node as the reliability of the node to the first hop face; merge all nodes in an (m-1)th hop face in the topology of the network into a same (m-1)th virtual node and merge all nodes in an mth hop face in the topology of the network into a same mth virtual node to obtain an mth updated topology of the network, m being an integer greater than 1 and less than or equal to X; determine a reliability between the (m-1)th virtual node and the mth virtual node based on a minimum path set algorithm and the mth updated topology of the network; and take the reliability between the (m-1)th virtual node and the mth virtual node as the reliability between the (m-1)th hop face and the mth hop face; determine the reliability of the node to the Xth hop face based on the reliability of the node to the first hop face and the reliability of each two adjacent hop faces in the X hop faces.

8. A network topology reliability evaluation apparatus, characterized by comprising: comprise: a processor and a communication interface; the communication interface is coupled with the processor, and the processor is configured to run computer programs or instructions to implement the network topology reliability evaluation method according to any one of claims 1 to 6.

9. A computer-readable storage medium having stored therein instructions, the computer-readable storage medium comprising: When a computer executes the instructions, the computer executes the network topology reliability evaluation method according to any one of claims 1 to 6.

10. A computer program product comprising instructions, characterized in that, When the computer executes the instructions, the computer executes the network topology reliability evaluation method according to any one of claims 1 to 6.

Images