Communication network post-disaster function recovery method and recovery system

Abstract

The invention provides a communication network post-disaster function recovery method and recovery system. The communication network post-disaster function recovery method comprises the following steps: simplifying a communication network architecture into a communication network topological graph; the communication network topological graph comprises an independent subgraph, logic nodes and lines, the independent subgraph comprises more than one base station node, the base station nodes are connected through the lines, and the base station nodes are connected with the logic nodes through the lines; abstracting a post-disaster network recovery problem into a multi-variation multi-source optimal solving problem based on a communication network topological graph; by solving a multi-variation multi-source optimization problem, obtaining an optimal reconstruction route of the communication network from a cost optimal angle and a time optimal angle; and recovering the functions of the post-disaster communication network in stages according to the optimal reconstruction route of the communication network. According to the method, technical support can be provided for post-disaster communication network recovery more efficiently and reliably.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a communication network post-disaster function recovery method and recovery system. Background Art

[0002] Extreme natural disasters such as earthquakes and floods often cause serious damage to communication infrastructure, which in turn affects the normal operation of the communication system. This not only causes inconvenience to public life, but also seriously affects economic and social development. Therefore, how to quickly restore communication network functions after a disaster has become an urgent problem to be solved.

[0003] At present, communication operators usually propose some recovery measures in their emergency plans, such as timely business unblocking through route adjustment and network scheduling, and giving priority to restoring the services of the communication support headquarters and important customers. However, the effective implementation of these measures faces certain challenges: route adjustment and network scheduling are based on the premise that there must be uninterrupted physical line connections between nodes, and there is no specific technical route for the implementation of priority service restoration. It can be seen that the current recovery strategies and technologies have obvious shortcomings in dealing with the problem of communication network recovery after extreme natural disasters. Therefore, it is particularly important to develop a communication network post-disaster function recovery method and recovery system to achieve more efficient and reliable communication network post-disaster recovery. Summary of the invention

[0004] The present invention provides a communication network post-disaster function recovery method and recovery system, so as to provide technical support for the formulation of a post-disaster communication network recovery plan and scientific disaster relief in a more efficient and reliable manner.

[0005] The present invention provides a method for restoring communication network functions after a disaster, which comprises the following steps:

[0006] Simplifying the communication network architecture into a communication network topology diagram; the communication network topology diagram includes an independent sub-graph, a logical node and a line, wherein the independent sub-graph includes more than one base station node, each of the base station nodes is connected through the line, and the base station node and the logical node are connected through the line;

[0007] Based on the communication network topology graph, the post-disaster network recovery problem is abstracted into solving the multi-variation multi-source optimal problem;

[0008] By solving the multi-variation multi-source optimization problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization.

[0009] The post-disaster communication network functions are restored in stages according to the optimal reconstruction route of the communication network.

[0010] According to the communication network post-disaster function recovery method provided by the present invention, the multiple variation multi-source optimal problem includes a multiple variation multi-source optimal problem obtained based on a time optimal reconstruction algorithm and a multiple variation multi-source optimal problem obtained based on a cost optimal reconstruction algorithm.

[0011] Furthermore, the multi-variation multi-source optimal problem obtained based on the time optimal reconstruction algorithm is expressed as:

[0012]

[0013] In the formula, r t-opt represents the optimal reconstruction route based on the time-optimal reconstruction algorithm, S t-opt represents the optimal node based on the time-optimal reconstruction algorithm, L t-opt represents the optimal route based on the time-optimal reconstruction algorithm; f t (N s ,N l ) represents the time objective function; N s Indicates the number of repair nodes, N l Indicates the number of repaired lines; T s represents the average node repair time, T l represents the average repair time of the line; S represents the node, r(S) represents the set of traversed path nodes, L represents the line, and r(L) represents the set of traversed path lines.

[0014] Furthermore, the multi-variation multi-source optimal problem obtained based on the cost optimal reconstruction algorithm is expressed as:

[0015]

[0016] In the formula, r p-opt represents the optimal reconstruction route based on the cost-optimal reconstruction algorithm, S p-opt represents the optimal node based on the cost-optimal reconstruction algorithm, L p-opt represents the optimal route based on the cost-optimal reconstruction algorithm; f p (N s ,N l ) represents the cost objective function; N s Indicates the number of repair nodes, N l Indicates the number of repaired lines; P s represents the average node repair cost, P l represents the average repair cost of the line; S represents the node, r(S) represents the set of traversed path nodes, L represents the line, and r(L) represents the set of traversed path lines.

[0017] Furthermore, the method of solving the multi-variation multi-source optimal problem to obtain the optimal reconstruction route of the communication network from the perspective of cost optimization and time optimization specifically includes:

[0018] Based on the functional level of the base station node, determine the node set a1 that needs to be restored in phase I;

[0019] Define the pre-disaster connectivity matrix Z b =X b ·Y b The matrix is ​​used to represent the pre-disaster communication network topology diagram, where X b represents the node state matrix before the disaster, Y b represents the line status matrix before the disaster;

[0020] Define the post-disaster connectivity matrix Z a =X a ·Y a The matrix is ​​used to represent the post-disaster communication network topology, where X a represents the node state matrix after the disaster, Y a represents the post-disaster line status matrix;

[0021] Define the set of damaged nodes after the disaster as S d , the damaged line set is L d , the set of damaged nodes and damaged lines after the disaster is R d For: R d ={S d ; L d};

[0022] Using the Warshall algorithm, based on the post-disaster connectivity matrix Z a Solve to obtain the connectivity status of each base station node and the logical node;

[0023] Define the set of lost nodes as S b , where the set of lost nodes S b Greater than or equal to the set of damaged nodes after the disaster S d , S b ≥S d ;

[0024] According to the node set a1 that needs to be restored in phase I, the lost node set S b and the pre-disaster line state matrix Y b , based on the time optimal reconstruction algorithm, the optimal reconstruction route of each subgraph node in stage I is solved, and based on the cost optimal reconstruction algorithm, the optimal reconstruction path of each subgraph node in stage I is solved;

[0025] In the optimal time or optimal cost scenario, the damaged nodes and damaged lines are restored according to the optimal reconstruction route in phase I to restore the communication function of the nodes in phase I and update the post-disaster connectivity matrix Za ;

[0026] Determine the node set a2 that needs to be restored in phase II, and based on the node set a2 that needs to be restored in phase II and the lost node set S b and the pre-disaster line state matrix Y b , based on the time optimal reconstruction algorithm, the optimal reconstruction route of each subgraph node in phase II is solved, and based on the cost optimal reconstruction algorithm, the optimal reconstruction path of each subgraph node in phase II is solved; until the communication network is fully restored after the disaster;

[0027] The reconstructed routes of each independent subgraph are merged to solve the set of reconstructed routes for phased recovery of the entire regional network.

[0028] Furthermore, the specific process of using the Warshall algorithm to solve the connectivity status of each base station node and the logical node based on the post-disaster connectivity matrix is ​​as follows:

[0029] Create a post-disaster connectivity matrix Z a The corresponding initial matrix Z is Z a =Z, assuming its order is n;

[0030] Set k to 1 and enter a loop. For each i, if Z[i,k] is 1, traverse j=1 to n and update Z[i,j] to the logical "or" value of Z[i,j] and Z[k,j], Z[i,j]∨Z[k,j];

[0031] After each loop, add 1 to k; if k is less than or equal to n, continue looping; otherwise, the algorithm ends;

[0032] By continuously updating the matrix Z, the final matrix Z' after the algorithm is executed, as well as the first row elements of the final matrix Z' and the connectivity relationship of the representative nodes are obtained; the connectivity relationship between all nodes and logical nodes is obtained, and the first row of the matrix Z', the corresponding column elements = 0, constitute the lost node set S b ;

[0033] Finally, the connectivity status between the priority recovery node and the logical node is obtained; wherein the connectivity status is represented by 0 and 1, 0 represents disconnection, and 1 represents connectivity.

[0034] Furthermore, the node set a1 that needs to be restored according to stage I and the lost node set S b and the pre-disaster line state matrix Y b The process of solving the optimal reconstruction route of each subgraph node in stage I based on the time optimal reconstruction algorithm and the optimal reconstruction path of each subgraph node in stage I based on the cost optimal reconstruction algorithm is as follows:

[0035] According to the node set a1 that needs to be restored in phase I and the lost node set S b Get the set of lost nodes A1 in the nodes that need to be restored in phase I, A1 = S b ∩a1;

[0036] According to the pre-disaster line state matrix Y b , use the brute force search algorithm to solve stage I to restore the complete connected path set R between the i-th node and the logical node i (m), R i (m) = {S i (m); L i (m)}, where S i (m) represents the set of nodes passed by the mth path of the i-th node, L i (m) represents the set of lines in the mth path of the i-th node, and finally obtains the complete connected path of all nodes in the lost node set A1 in the node that needs to be restored in stage I;

[0037] In phase I, the set of paths between node 1 and the logical node in the lost node set A1 that needs to be restored is: {R1(1)...R m (1)}, the set of paths between node j and the logical node is {R1(j)…R k (j)}; each node path set is respectively connected to the set of damaged nodes and damaged lines after the disaster R d Take the intersection to get the set of damaged nodes and damaged lines in each node path in stage I, where the set of damaged nodes and damaged lines in the node 1 path {R1′(1)...R m ′(1)} is: {R1′(1)...R m ′(1)}={R1(1)...R m (1)}∩R d , the set of damaged nodes and damaged lines in the path of node j {R1′(j)...R k ′(j)} is: {R1′(j)...R k ′(j)}={R1(j)…R k (j)}∩R d ;

[0038] In {R1′(1)...R m ′(1)};...;{R1′(i)…R n ′(i)};...{R1′(j)...R k ′(j)} Take the traversal union between each set path, obtain each set after taking the traversal union between each set path, and according to each set after taking the traversal union between each set path, obtain the stage I recovery node traversal path set r;

[0039] Among them, the sets after traversing and unioning between the set paths are:

[0040] r1=R1′(1)∪...R1′(i)∪...R1′(j);...;r mgngk =R m ′(1)∪...R n ′(i)∪...R k ′(j);

[0041] Among them, r1 represents the first set after traversing the union of each set path, r mgngk Indicates the last set after traversing the union between each set path; m represents the number of paths between node 1 and the logical node, n represents the number of paths between node i and the logical node, and k represents the number of paths between node j and the logical node;

[0042] The set of node traversal paths in phase I is: r = {r1, r2, L, r mgngk};

[0043] The optimal reconstruction route of each subgraph node in stage I is solved based on the time optimal reconstruction algorithm, and the optimal reconstruction route of each subgraph node in stage I is solved based on the cost optimal reconstruction algorithm.

[0044] The present invention also provides a communication network post-disaster function recovery system, which includes a simplification module, an abstraction module, a solution module and a recovery module; the simplification module is used to simplify the communication network architecture into a communication network topology diagram; the abstraction module is used to abstract the post-disaster network recovery problem into a solution to a multiple variation multi-source optimal problem based on the communication network topology diagram; the solution module is used to obtain the optimal reconstruction route of the communication network from the perspective of cost optimization and time optimization by solving the multiple variation multi-source optimal problem; the recovery module is used to restore the post-disaster communication network function in stages according to the optimal reconstruction route of the communication network.

[0045] The present invention also provides a computer program product, which includes a computer program. The computer program can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute any of the above-mentioned communication network post-disaster functional recovery methods.

[0046] The present invention also provides a storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements any of the above-mentioned methods for restoring the function of a communication network after a disaster.

[0047] A method for recovering the function of a communication network after a disaster provided by the present invention simplifies the communication network architecture into a communication network topology graph, and abstracts the post-disaster network recovery problem into solving a multiple variation multi-source optimal problem based on the communication network topology graph. By solving the multiple variation multi-source optimal problem, the optimal reconstruction route of the communication network is obtained from the perspectives of cost optimality and time optimality, respectively. The post-disaster communication network function is restored in stages according to the optimal reconstruction route of the communication network. The optimal reconstruction route of the post-disaster network can be given from the two perspectives of "time optimality" and "cost optimality", thereby realizing phased recovery of the communication network, and providing technical support and promotion suggestions for enhancing network disaster tolerance and anti-destruction resilience. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0049] Figure 1 It is a flow chart of the communication network post-disaster function recovery method provided by the present invention;

[0050] Figure 2 It is a process diagram of simplifying the communication network architecture into a communication network topology diagram in the communication network post-disaster function recovery method provided by the present invention;

[0051] Figure 3 It is a pre-disaster communication network topology diagram in the communication network post-disaster function recovery method provided by the present invention;

[0052] Figure 4 It is a communication network topology diagram after a certain pre-disaster communication network topology diagram suffers from a disaster in the communication network post-disaster function recovery method provided by the present invention;

[0053] Figure 5 It is the communication network topology map after the post-disaster communication network topology map is repaired in stage I in the communication network post-disaster function recovery method provided by the present invention. DETAILED DESCRIPTION

[0054] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0055] In the prior art, the specific challenges faced by communication operators in the effective implementation of the recovery measures proposed in their emergency plans include the following different aspects. First, the first aspect is the limitations of route adjustment and network scheduling: the premise of route adjustment and network scheduling is that there must be uninterrupted physical line connections between nodes. If all physical lines between a node and the core network node are destroyed, it is impossible to restore communication through traditional route adjustment or network scheduling. Then, the second aspect is the difficulty in implementing priority service restoration: although the emergency plan mentions the principle of restoring services according to the degree of importance, it does not provide a specific technical route to achieve this. In particular, for the restoration of base station nodes, it is not enough to repair the base station itself, but it is also necessary to ensure that there is at least one intact physical path between the base station node and the core network node. However, existing theories often ignore this key factor. Finally, the third aspect is the challenge of complex network restoration: the base station nodes that need to be restored first are actually composed of a series of interconnected nodes. From the perspective of graph theory, this is a complex "multi-variation multi-source optimal" problem. Although existing strategies attempt to determine the restoration order based on the importance of nodes, they do not explore the essence of this problem in depth, making it difficult to effectively implement in actual operations. Therefore, existing recovery strategies and technologies have obvious deficiencies in dealing with communication network recovery after extreme natural disasters, especially in ensuring the physical path between base station nodes and core network nodes and selecting the optimal recovery path under complex network structures.

[0056] Combine the following Figure 1 The present invention describes a communication network post-disaster function recovery method.

[0057] like Figure 1 As shown, the communication network post-disaster function recovery method provided by the present invention includes the following steps:

[0058] S1. Simplify the communication network architecture into a communication network topology diagram, such as Figure 2 As shown;

[0059] Among them, the communication network architecture includes a base station access layer, a convergence layer, and a core layer. The base station access layer includes base stations, which are used to communicate directly with end-user devices such as mobile phones and tablets. The convergence layer is located above the base station access layer and is used to converge data from multiple base stations and forward it to the core network. The convergence layer may include devices such as routers and switches. The core layer is at the top layer of the communication network and is used to process data from the convergence layer and provide connections to other networks (such as the Internet, other operator networks, etc.). The core layer is also used to implement functions such as routing selection, packet forwarding, and quality of service assurance.

[0060] According to previous disaster surveys, since disasters have a greater impact on the base station access layer and almost no impact on the core layer and aggregation layer, the impact of disasters on the aggregation layer and core layer can be ignored, and the aggregation layer and core layer in the communication network architecture can be simplified into logical nodes. Since the access layers of each base station are independent of each other and are independent access layers, the effects of each disaster on the access layer of each base station do not affect each other, so the base station access layer can be abstracted as an independent subgraph.

[0061] The simplified communication network topology diagram includes independent sub-graphs, logical nodes and lines, wherein the independent sub-graph includes more than one base station node, each base station node is connected through a line, and the base station node is connected to the logical node through a line.

[0062] S2. Based on the communication network topology graph, the post-disaster network recovery problem is abstracted into solving a multi-variation and multi-source optimal problem.

[0063] Among them, in the multiple variation and multi-source optimal problem, multiple variations are mainly reflected in: in the communication network recovery problem, there are multiple changing factors, such as different degrees of damage to physical lines, the time and resources required for repair, the dynamic changes in network traffic, and how many rounds of recovery strategies are ultimately needed after the network disaster, etc. These factors all change with time and space.

[0064] As a specific implementation method, for the recovery strategy, if the decision maker decides that a three-round recovery strategy is needed, that is, the decision maker believes that the priority of the nodes is divided into three levels, the recovery process of the nodes with priority level 1 is the first round of recovery, the recovery process of the nodes with priority level 2 is the second round of recovery, and the nodes with priority level 3 are the third round of recovery; the first round of recovery (i.e., priority recovery) is a single calculation, and the second round of recovery is a double calculation. Here, it is mentioned that only two calculations are performed in the three rounds of recovery because the nodes and lines for the third round of recovery do not need to be calculated. After the disaster occurs, the damaged nodes and lines directly remove the nodes that have been repaired in the first and second rounds, and the remaining ones are the nodes and lines that need to be restored in the third round.

[0065] Multi-source means that there are multiple data sources, including the status of multiple base station nodes, the status of aggregation nodes, and the operation of core nodes. In addition, multi-source means that the nodes that need to be restored first are a set, and there are multiple nodes in this set. These nodes need to be restored at the same time. Each node is a "source" to be solved. Multi-source optimization is to meet the optimal nodes in this set. Each data source may provide key information about network recovery, such as which nodes or lines are damaged, repair priority, etc. The optimal problem is reflected in: Under the premise of minimizing the recovery time or minimizing the recovery cost, the optimal reconstruction route of each base station node is obtained.

[0066] By abstracting the communication network post-disaster recovery problem into a multiple variation and multi-source optimal problem, we can analyze and solve the problem more systematically and scientifically, thereby improving the efficiency and quality of communication network post-disaster recovery.

[0067] S3. By solving the multi-variation multi-source optimization problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization.

[0068] S4. Restore the post-disaster communication network functions in stages according to the optimal reconstruction route of the communication network.

[0069] In the above step S2, the multi-variation multi-source optimal problem obtained based on the time optimal reconstruction algorithm is:

[0070]

[0071] The optimal problem of multiple mutations and multiple sources based on the cost optimal reconstruction algorithm is:

[0072]

[0073] In formula (1) and formula (2), r t-opt represents the optimal reconstruction route based on the time-optimal reconstruction algorithm, S t-opt represents the optimal node based on the time-optimal reconstruction algorithm, L t-opt represents the optimal route based on the time-optimal reconstruction algorithm; r p-opt represents the optimal reconstruction route based on the cost-optimal reconstruction algorithm, S p-opt represents the optimal node based on the cost-optimal reconstruction algorithm, L p-opt represents the optimal route based on the cost-optimal reconstruction algorithm; f t (N s ,N l ) represents the time objective function, f p (N s ,N l ) represents the cost objective function; N s Indicates the number of repair nodes, N l Indicates the number of repaired lines; P s represents the average node repair cost, P l represents the average line repair cost; T s represents the average node repair time, T l represents the average repair time of the line; S represents the node, r(S) represents the set of traversed path nodes, L represents the line, and r(L) represents the set of traversed path lines.

[0074] In the above step S3, by solving the multi-variation multi-source optimal problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization, which specifically includes the following steps:

[0075] S31. Based on the functional level of the base station node, determine the node set a1 that needs to be restored in phase I.

[0076] S32. Define the pre-disaster connectivity matrix Z b =X b ·Y b The matrix is ​​used to represent the pre-disaster communication network topology diagram, where X b represents the node state matrix before the disaster, Y b Represents the line status matrix before the disaster.

[0077] Define the post-disaster connectivity matrix Z a =X a ·Y a The matrix is ​​used to represent the post-disaster communication network topology, where X a represents the node state matrix after the disaster, Y a Represents the post-disaster line status matrix.

[0078] Define the set of damaged nodes after the disaster as S d , the damaged line set is L d , the set of damaged nodes and damaged lines after the disaster is R d For: R d ={S d ; L d}.

[0079] S33, using the Warshall algorithm, based on the post-disaster connectivity matrix Z a Solve to obtain the connectivity status of each base station node and the logical node; define the set of lost nodes as S b , it can be foreseen that the set of lost nodes S b Greater than or equal to the set of damaged nodes after the disaster S d , that is, S b ≥S d ; Because a damaged node will definitely lose connection, but a lost node is not necessarily damaged. There may be a situation where the node itself is intact but loses connection due to line damage.

[0080] Specifically, the Warshall algorithm is used based on the post-disaster connectivity matrix Z a The process of solving the connectivity status of each base station node and the logical node is:

[0081] Create a post-disaster connectivity matrix Z a The corresponding initial matrix Z is Z a =Z, assuming its order is n.

[0082] Set k to 1 and enter a loop. For each i, if Z[i,k] is 1, traverse j=1 to n and update Z[i,j] to the logical "or" value of Z[i,j] and Z[k,j], that is, Z[i,j]∨Z[k,j], where k represents the column, k=1 represents the first column, i represents the i-th row, j represents the j-th column, and Z[i,j] represents the element in the i-th row and j-th column of the matrix Z.

[0083] After each loop, add 1 to k. If k is less than or equal to n, continue looping; otherwise, the algorithm ends.

[0084] By continuously updating the matrix Z, we can obtain the final matrix Z' after the algorithm is executed, as well as the first row elements of the final matrix Z' and the connectivity relationships of the nodes. For example, the element Z'(1,3) in the matrix Z' represents the connectivity status between node 3 and the logical node (node ​​1). If Z'(1,3) = 1, it means that node 3 and node 1 are connected; if Z'(1,3) = 0, it means that node 3 and node 1 are not connected, indicating that node 3 is disconnected. Similarly, the connectivity relationship between all nodes and logical nodes can be obtained. The first row of the matrix Z', the corresponding column elements = 0, constitute the disconnected node set S. b .

[0085] Finally, the connectivity status of the priority recovery node and the logical node is obtained. Among them, the matrix elements calculated by the Warshall algorithm have only two cases: 0 or 1. The connectivity status is represented by 0 and 1, 0 means disconnected, and 1 means connected.

[0086] S34: The node set a1 and the lost node set S that need to be restored according to phase I b Get the set of lost nodes A1 in the nodes that need to be restored in phase I, A1 = S b ∩a1.

[0087] S35, according to the pre-disaster line state matrix Y b , use the brute force search algorithm to solve stage I to restore the complete connected path set R between the i-th node and the logical node i (m), R i (m) = {S i (m); L i (m)}, where S i (m) represents the set of nodes passed by the mth path of the i-th node, L i (m) represents the set of lines passed through the mth path of the i-th node, and finally a complete connected path of all nodes in the lost node set A1 in the node that needs to be restored in stage I is obtained.

[0088] It should be noted that the brute force search algorithm is a traversal search algorithm, which starts from a node that needs to be restored first and ends at a logical node, and searches the pre-disaster line state matrix Y b The elements that represent physical connections are visited once and only once, and finally all traversal paths between the node and the logical node are obtained by traversal, and then all paths between all priority recovery nodes and logical nodes are obtained.

[0089] S36, Phase I: The set of paths between node 1 and the logical node in the lost node set A1 in the node to be restored is: {R1(1)...R m (1)}, the set of paths between node j and the logical node is {R1(j)...R k (j)}; each node path set is respectively connected to the set of damaged nodes and damaged lines after the disaster R d Take the intersection to get the set of damaged nodes and damaged lines in each node path in stage I, where the set of damaged nodes and damaged lines in the node 1 path {R1′(1)...R m ′(1)} is: {R1′(1)...R m ′(1)}={R1(1)...R m (1)}∩R d , the set of damaged nodes and damaged lines in the path of node j {R1′(j)...R k ′(j)} is: {R1′(j)...R k ′(j)}={R1(j)…R k (j)}∩R d .

[0090] S37, in {R1′(1)...R m ′(1)};...;{R1′(i)...R n ′(i)};...{R1′(j)…R k ′(j)} Take the traversal union between each set path to obtain each set after the traversal union between each set path, and according to each set after the traversal union between each set path, obtain the stage I recovery node traversal path set r.

[0091] Among them, the sets after traversing and unioning between the set paths are:

[0092] r1=R1′(1)∪...R1′(i)∪...R1′(j);...;r mgng k=R m ′(1)∪...R n ′(i)∪...R k ′(j);

[0093] Among them, r1 represents the first set after traversing the union of each set path, r mgngk It represents the last set after traversing the union of each set path; m represents the number of paths between node 1 and the logical node, n represents the number of paths between node i and the logical node, and k represents the number of paths between node j and the logical node.

[0094] The set of node traversal paths in phase I is: r = {r1, r2, L, r mgngk}.

[0095] S38. Solve the optimal reconstruction route of each subgraph node in stage I based on the time optimal reconstruction algorithm, and solve the optimal reconstruction route of each subgraph node in stage I based on the cost optimal reconstruction algorithm.

[0096] S39, in the optimal time or optimal cost scenario, restore the damaged nodes and damaged lines according to the optimal reconstructed route to restore the communication function of the node in phase I, and then update the post-disaster connectivity matrix Z a .

[0097] S310. Determine the node set a2 that needs to be restored in phase II, and repeat steps S34-S38 until the communication network is fully restored after the disaster.

[0098] S311, merging the reconstructed routes of each independent subgraph, and solving the set of reconstructed routes for restoring the entire regional network in stages.

[0099] The communication network post-disaster function recovery method provided by the present invention is based on the communication network topology diagram and the damage of nodes and lines after the disaster, and proposes a communication network post-disaster function recovery routing reconstruction algorithm. It can provide the optimal post-disaster network reconstruction route from the two perspectives of "optimal time" and "optimal cost", thereby realizing the communication network recovery in stages, and can provide technical support and promotion suggestions for enhancing network disaster tolerance and anti-destruction resilience.

[0100] The post-disaster functional recovery method for a communication network provided by the present invention combines the "ring network" characteristics of my country's communication system networking, defines the concepts of "independent subgraph" and "logical node" in the mobile communication network topology diagram based on graph theory, abstracts the logical nodes of the communication network topology diagram, splits the subgraphs, and optimizes them separately, and finally merges the calculation results, which can reduce the computational complexity of the reconstruction algorithm and greatly improve the convergence speed of the algorithm.

[0101] The communication network post-disaster function recovery method provided by the present invention is described below through a specific embodiment.

[0102] Figure 3The topology of a communication network before a disaster is shown. In the topology, there are 21 nodes S, numbered S1 to S21, and 23 lines L, numbered L1 to L23. Suppose the communication network corresponding to the topology of the communication network is damaged by a disaster. Figure 4 As shown in the post-disaster communication network topology diagram, in this topology diagram, the nodes damaged after the disaster are S5, S8 and S11~S17, and the lines damaged after the disaster are L1, L3, L4, L6, L7, L9, L10, L14, L15, L18, L19 and L20.

[0103] Assume that the node set a1 that needs to be restored first in phase I is:

[0104] a1={S3, S7, S10, S14, S15, S18}.

[0105] According to the post-disaster communication network topology, the Warshall algorithm is used to calculate the set of all lost nodes x; the intersection of the set of all lost nodes x and the set of nodes a1 that need to be restored first in phase I is taken to obtain the set of lost nodes A1 among the nodes that need to be restored first in phase I:

[0106] A1=a1∩x={S3, S7, S10, S14, S15}.

[0107] Define the average node repair time as 2 hours and the average line repair time as 3 hours. According to the optimal recovery time algorithm, steps S35-S311 are used to obtain the final reconstruction route of the lost node in the priority recovery phase I. The reconstruction route includes the optimal reconstruction node Sopt, the optimal reconstruction line Lopt and the optimal reconstruction time Topt. The parameters are:

[0108] Sopt1={S5,S11,S12,S14,S15},

[0109] Lopt1={L1,L3,L6},

[0110] Topt1=19h.

[0111] That is, repairing 5 nodes and 3 lines can restore the functions of the nodes that need to be restored in phase I within the optimal time, such as Figure 5 As shown in the figure, after updating the topology map, a new communication network topology map is obtained, and the communication network topology map is used as the topology map for node function recovery in phase II. In the topology map, the nodes damaged after the disaster are S8, S13, S16 and S17, and the lines damaged after the disaster are L4, L7, L9, L10, L14, L18, L19 and L20. The same algorithm as phase I is used to obtain the final reconstructed route of the lost node in phase II, and the node functions that need to be restored in phase II are restored according to the reconstructed route.

[0112] like Figure 5 As shown, based on the communication network post-disaster function recovery method provided by the present invention, the present invention also provides a communication network post-disaster function recovery system, which includes a simplification module, an abstraction module, a solution module and a recovery module. Among them, the simplification module is used to simplify the communication network architecture into a communication network topology diagram; the abstraction module is used to abstract the post-disaster network recovery problem into solving the multi-variation multi-source optimal problem based on the communication network topology diagram; the solution module is used to solve the multi-variation multi-source optimal problem and obtain the optimal reconstruction route of the communication network from the perspective of cost optimization and time optimization respectively; the recovery module is used to restore the post-disaster communication network function in stages according to the optimal reconstruction route of the communication network.

[0113] It should be noted that the communication network post-disaster function recovery system and the communication network post-disaster function recovery method embodiment provided in the above embodiments belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0114] On the other hand, the present invention further provides a computer program product, the computer program product comprising a computer program, the computer program can be stored on a non-transitory computer-readable storage medium, when the computer program is executed by a processor, the computer can execute the communication network post-disaster function recovery method provided by the above methods, the method comprising:

[0115] Simplify the communication network architecture into a communication network topology diagram;

[0116] Based on the communication network topology graph, the post-disaster network recovery problem is abstracted into solving the multi-variation multi-source optimal problem;

[0117] By solving the multi-variation multi-source optimization problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization.

[0118] The post-disaster communication network functions are restored in stages according to the optimal reconstruction route of the communication network.

[0119] In another aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, the computer program being executed by a processor to provide a method for restoring communication network functions after a disaster provided by the above methods, the method comprising:

[0120] Simplify the communication network architecture into a communication network topology diagram;

[0121] Based on the communication network topology graph, the post-disaster network recovery problem is abstracted into solving the multi-variation multi-source optimal problem;

[0122] By solving the multi-variation multi-source optimization problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization.

[0123] The post-disaster communication network functions are restored in stages according to the optimal reconstruction route of the communication network.

[0124] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0125] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0126] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for restoring communication network functions after a disaster. It is characterized in that The following steps are involved: Simplifying the communication network architecture into a communication network topology diagram; the communication network topology diagram includes an independent sub-graph, a logical node and a line, wherein the independent sub-graph includes more than one base station node, each of the base station nodes is connected through the line, and the base station node and the logical node are connected through the line; Based on the communication network topology graph, the post-disaster network recovery problem is abstracted into solving the multi-variation multi-source optimal problem; By solving the multi-variation multi-source optimization problem, the optimal reconstruction route of the communication network is obtained from the perspective of cost optimization and time optimization. The post-disaster communication network functions are restored in stages according to the optimal reconstruction route of the communication network.

2. The method for restoring communication network functions after a disaster according to claim 1, It is characterized in that The multiple variation multi-source optimal problem includes a multiple variation multi-source optimal problem obtained based on a time optimal reconstruction algorithm and a multiple variation multi-source optimal problem obtained based on a cost optimal reconstruction algorithm.

3. The method for restoring communication network functions after a disaster according to claim 2, It is characterized in that The multi-variation multi-source optimal problem obtained based on the time optimal reconstruction algorithm is expressed as: In the formula, r t-opt represents the optimal reconstruction route based on the time-optimal reconstruction algorithm, S t-opt represents the optimal node based on the time-optimal reconstruction algorithm, L t-opt represents the optimal route based on the time-optimal reconstruction algorithm; f t (N s ,N l ) represents the time objective function; N s Indicates the number of repair nodes, N l Indicates the number of repaired lines; T s represents the average node repair time, T l It represents the mean repair time of the line; S represents a node, r(S) represents the set of traversed path nodes, L represents a line, and r(L) represents the set of traversed path lines.

4. The method for restoring communication network functions after a disaster according to claim 2, It is characterized in that The multi-variation multi-source optimal problem obtained based on the cost optimal reconstruction algorithm is expressed as: In the formula, r p-opt represents the optimal reconstruction route based on the cost-optimal reconstruction algorithm, S p-opt represents the optimal node based on the cost-optimal reconstruction algorithm, L p-opt represents the optimal route based on the cost-optimal reconstruction algorithm; f p (N s ,N l ) represents the cost objective function; N s Indicates the number of repair nodes, N l Indicates the number of repaired lines; P s represents the average node repair cost, P l represents the average repair cost of the line; S represents the node, r(S) represents the set of traversed path nodes, L represents the line, and r(L) represents the set of traversed path lines.

5. The method for restoring communication network functions after a disaster according to claim 2, It is characterized in that The method solves the multi-variation multi-source optimal problem to obtain the optimal reconstruction route of the communication network from the perspective of cost optimization and time optimization, specifically including: Based on the functional level of the base station node, determine the node set a1 that needs to be restored in phase I; Define the pre-disaster connectivity matrix Z b =X b ·Y b The matrix is ​​used to represent the pre-disaster communication network topology, where X b represents the node state matrix before the disaster, Y b represents the line status matrix before the disaster; Define the post-disaster connectivity matrix Z a =X a ·Y a The matrix is ​​used to represent the post-disaster communication network topology, where X a represents the node state matrix after the disaster, Y a represents the post-disaster line status matrix; Define the set of damaged nodes after the disaster as S d , the damaged line set is L d , the set of damaged nodes and damaged lines after the disaster is R d For: R d ={S d ; L d }; Using the Warshall algorithm, based on the post-disaster connectivity matrix Z a Solve to obtain the connectivity status of each base station node and the logical node; Define the set of lost nodes as S b , where the set of lost nodes S b Greater than or equal to the set of damaged nodes after the disaster S d , S b ≥S d ; According to the node set a1 that needs to be restored in phase I, the lost node set S b and the pre-disaster line state matrix Y b , based on the time optimal reconstruction algorithm, the optimal reconstruction route of each subgraph node in stage I is solved, and based on the cost optimal reconstruction algorithm, the optimal reconstruction path of each subgraph node in stage I is solved; In the optimal time or optimal cost scenario, the damaged nodes and damaged lines are restored according to the optimal reconstruction route in phase I to restore the communication function of the nodes in phase I and update the post-disaster connectivity matrix Z a ; Determine the node set a2 that needs to be restored in phase II, and based on the node set a2 that needs to be restored in phase II and the lost node set S b and the pre-disaster line state matrix Y b , based on the time optimal reconstruction algorithm, the optimal reconstruction route of each subgraph node in phase II is solved, and based on the cost optimal reconstruction algorithm, the optimal reconstruction path of each subgraph node in phase II is solved; until the communication network is fully restored after the disaster; The reconstructed routes of each independent subgraph are merged to solve the set of reconstructed routes for phased recovery of the entire regional network.

6. The method for restoring communication network functions after a disaster according to claim 5, It is characterized in that The specific process of using the Warshall algorithm to solve the connectivity status of each base station node and the logical node based on the post-disaster connectivity matrix is ​​as follows: Create a post-disaster connectivity matrix Z a The corresponding initial matrix Z is Z a =Z, assuming its order is n; Set k to 1 and enter a loop. For each i, if Z[i,k] is 1, traverse j=1 to n and update Z[i,j] to the logical "or" value of Z[i,j] and Z[k,j], Z[i,j]∨Z[k,j]; After each loop, add 1 to k; if k is less than or equal to n, continue the loop; Otherwise, the algorithm ends; By continuously updating the matrix Z, the final matrix Z' after the algorithm is executed, as well as the first row elements of the final matrix Z' and the connectivity relationship of the representative nodes are obtained; Get the connectivity relationship between all nodes and logical nodes. The first row of the matrix Z', the corresponding column elements = 0, constitute the lost node set S b ; Finally, the connectivity status between the priority recovery node and the logical node is obtained; wherein the connectivity status is represented by 0 and 1, 0 represents disconnection, and 1 represents connectivity.

7. The method for restoring communication network functions after a disaster according to claim 5, It is characterized in that The node set a1 that needs to be restored according to stage I and the lost node set S b and the pre-disaster line state matrix Y b The process of solving the optimal reconstruction route of each subgraph node in phase I based on the time optimal reconstruction algorithm and the optimal reconstruction path of each subgraph node in phase I based on the cost optimal reconstruction algorithm is as follows: According to the node set a1 that needs to be restored in phase I and the lost node set S b Get the set of lost nodes A1 in the nodes that need to be restored in phase I, A1 = S b ∩a1; According to the pre-disaster line state matrix Y b , use the brute force search algorithm to solve stage I to restore the complete connected path set R between the i-th node and the logical node i (m), R i (m) = {S i (m); L i (m)}, where S i (m) represents the set of nodes passed by the mth path of the i-th node, L i (m) represents the set of lines in the mth path of the i-th node, and finally obtains the complete connected path of all nodes in the lost node set A1 in the node that needs to be restored in stage I; In phase I, the set of paths between node 1 and the logical node in the lost node set A1 that needs to be restored is: 1 (1)...R m (1)}, the path set between node j and the logical node is {R 1 (j)...R k (j)}; each node path set is respectively connected to the damaged nodes and damaged lines set R after the disaster d Take the intersection to get the set of damaged nodes and damaged lines in each node path in stage I, where the set of damaged nodes and damaged lines in the node 1 path {R 1 ′(1)...R m ′(1)} is: {R 1 ′(1)...R m ′(1)}={R 1 (1)...R m (1)}∩R d , the set of damaged nodes and damaged lines in the path of node j {R 1 ′(j)...R k ′(j)} is: {R 1 ′(j)...R k ′(j)}={R 1 (j)...R k (j)}∩R d ; In {R 1 ′(1)...R m ′(1)};...;{R 1 ′(i)...R n ′(i)};...{R 1 ′(j)...R k ′(j)} Take the traversal union between each set path, obtain each set after taking the traversal union between each set path, and according to each set after taking the traversal union between each set path, obtain the stage I recovery node traversal path set r; Among them, the sets after traversing and unioning between the set paths are: r 1 =R 1 ′(1)∪...R 1 ′(i)∪...R 1 ′(j);...;r mgngk =R m ′(1)∪...R n ′(i)∪...R k ′(j); Among them, r 1 It means the first set after traversing the union of each set path, r mgngk Indicates the last set after traversing the union between each set path; m represents the number of paths between node 1 and the logical node, n represents the number of paths between node i and the logical node, and k represents the number of paths between node j and the logical node; The set of path r for restoring nodes in phase I is: r = {r 1 ,r 2 ,L,r mgngk }; The optimal reconstruction route of each subgraph node in stage I is solved based on the time optimal reconstruction algorithm, and the optimal reconstruction route of each subgraph node in stage I is solved based on the cost optimal reconstruction algorithm.

8. A communication network post-disaster function recovery system, It is characterized in that It includes a simplification module, an abstraction module, a solution module and a recovery module; the simplification module is used to simplify the communication network architecture into a communication network topology diagram; the abstraction module is used to abstract the post-disaster network recovery problem into a solution to a multiple variation and multi-source optimal problem based on the communication network topology diagram; the solution module is used to obtain the optimal reconstruction route of the communication network from the perspective of cost optimization and time optimization by solving the multiple variation and multi-source optimal problem; the recovery module is used to restore the post-disaster communication network function in stages according to the optimal reconstruction route of the communication network.

9. A computer program product, It is characterized in that The computer program product includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the communication network post-disaster functional recovery method as described in any one of claims 1-7.

10. A storage medium, It is characterized in that A computer program is stored thereon, and when the computer program is executed by a processor, the method for post-disaster functional recovery of a communication network as described in any one of claims 1-7 is implemented.

Images