A method, system and method of restoring data display for network connectivity restoration

Abstract

The embodiment of the present application relates to a kind of network connectivity reduction method, system and reduction data display method, the method comprises: extracting topological information from original topological data;The topological information includes all network node information, the connectivity and connection direction between different network nodes;Network node cross dictionary is constructed using the topological information;Parse the topological reduction instruction of user, match topological reduction mode, according to the network parameter of user preset, network node cross dictionary is inquired in cycle pruning;Determine all network nodes on topological reduction path, using the topological information extracted, obtain the network node topological data that needs to be restored. It can be according to network topology depth, also can be according to start and end network node to the complex network structure of arbitrary to carry out the network connectivity reduction of fast, greatly improve the use experience of user.

Description

Technical Field

[0001] This invention belongs to the field of communication technology, and specifically relates to a method, system, and method for restoring network connectivity and displaying the restored data. Background Technology

[0002] Network connectivity restoration, also known as network topology restoration, refers to the technique of logically connecting network element ports to network element ports according to their physical configuration information, or even connecting some or all network elements in a network. It is an essential function in communication networks for viewing transmission links of network objects, analyzing service quality, and locating network faults. Network connectivity restoration is widely used in the network management systems (NMS) of telecommunications operators, the element management systems (EMS) of equipment manufacturers, and the operation support systems (OSS) of third-party service outsourcing providers. Currently, there are two main types of technologies for implementing network connectivity restoration: one is for tree-structured networks, which utilizes network hierarchy division, establishes device codes corresponding to different levels, and searches and restores the network layer by layer according to the depth of the hierarchy; the other technology, given start and end nodes, paths, or detour nodes, searches, restores, and displays the paths between the start and end nodes.

[0003] For the first type of technology, an index model can be built according to the labeled device hierarchy by using hierarchical coding and device coding within the hierarchy. Then, the network topology can be restored by searching layer by layer by setting the entry device and the preset hierarchy depth. The basis for the implementation of this type of technology is a clear network hierarchy division. For complex networks that cannot be clearly divided into hierarchical levels logically, this technology has low efficiency, poor reliability, or even cannot restore the network structure.

[0004] For the second type of technique, the starting and ending nodes of the topology need to be determined first. Since each network node can be both the starting point and the ending point of one connected path, existing techniques either treat the network nodes as an undirected graph or a directed graph, and then use an iterative search algorithm to search for paths between the starting and ending nodes. In principle, this type of topology restoration technique is independent of network complexity; any single network or cross-domain network can restore the network topology for any starting and ending nodes. However, the biggest drawback of this type of technique is that it requires searching the entire network for nodes using a search cost function. When the number of network nodes is large and the connection paths are complex, the cost function needs to be calculated continuously, increasing computational complexity and reducing the efficiency of network topology restoration, making it unsuitable for network topology restoration scenarios with high real-time requirements. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method, system and data display method for network connectivity restoration. This allows for rapid network connectivity restoration of any complex network structure, based on both network topology depth and start / end network nodes, greatly improving the user experience.

[0006] To achieve the above objectives, the technical solution adopted by the present invention is as follows:

[0007] Technical Solution 1:

[0008] A method for restoring network connectivity includes:

[0009] Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes;

[0010] Construct a network node cross-dictionary using the aforementioned topology information;

[0011] Parse the user's topology restoration command, match the topology restoration mode, and perform a loop pruning query on the network node cross dictionary according to the user's preset network parameters;

[0012] Based on the results of the cyclic pruning query, all network nodes on the topology restoration path are determined, and the extracted topology information is used to obtain the topology data of the network nodes that need to be restored.

[0013] Furthermore, after obtaining the network node topology data that needs to be restored, it also includes:

[0014] The obtained network node topology data that needs to be restored is plotted and displayed to obtain a network restored topology diagram.

[0015] Furthermore, before constructing the network node cross-reference dictionary, the following steps are also included: numbering the network nodes. The network nodes in the constructed network node cross-reference dictionary, the network nodes in the user-preset network parameters, and all network nodes on the topology restoration path are represented by numbers.

[0016] When drawing a network topology diagram, the method also includes replacing the number with the corresponding network node name.

[0017] Furthermore, the original topology data records at least network nodes A and B for each network connection path, as well as the connection direction between network nodes A and B.

[0018] Furthermore, the network node cross-dictionary includes the network node and all connection nodes connected to the network node.

[0019] Furthermore, the topology restoration mode includes restoration mode one and restoration mode two; in restoration mode one, the user-preset parameters include the starting network node and the topology depth; in restoration mode two, the user-preset parameters include at least two network nodes, the starting node and the ending node.

[0020] Furthermore, in restoration mode two, user-preset parameters also include bypass nodes and / or path nodes.

[0021] Furthermore, if there are n path nodes, they are sorted in the order in which they appear, and the entire restoration process is divided into n+1 restoration processes. Then, after deduplicating the network nodes obtained from all restoration processes, a list of restored network nodes is obtained.

[0022] The restoration process is as follows: the first restoration process uses path node 1 as the end node and treats the process from the start node to path node 1 as an independent restoration process; the second restoration process uses path node 1 as the start node and path node 2 as the end node and treats the process from path node 1 to path node 2 as an independent restoration process; the i-th restoration process uses path node i-1 as the start node and path node i as the end node and treats the process from path node i-1 to path node i as an independent restoration process; and the (n+1)-th restoration process uses path node n as the start node and treats the process from path node n to the end node as an independent restoration process.

[0023] Furthermore, the cyclic pruning query includes a forward join pruning query mode and a reverse join pruning query mode.

[0024] Both the forward join pruning query pattern and the reverse join pruning query pattern include:

[0025] First, the network node cross dictionary is searched using the list of network nodes to be queried. The connected nodes of each network node in the list of network nodes to be queried are queried to obtain the set of connected nodes, denoted as set E.

[0026] Then, all network nodes in set E are deduplicated, and specific network nodes are pruned to obtain set E';

[0027] Finally, replace the network nodes in the list of network nodes to be queried with the network nodes in set E', and add the new network nodes found in this loop pruning query to the list of network nodes found in the cumulative query, thus completing the update of the list of network nodes to be queried and the list of network nodes found in the cumulative query.

[0028] Furthermore, the list of network nodes to be queried in the forward join pruning query pattern includes the initial network node of the initial input or the list of network nodes to be queried obtained by updating in the previous forward join pruning query pattern loop.

[0029] The specific network nodes in the forward join pruning query pattern include the network nodes in the cumulative list of network nodes retrieved in the previous forward join pruning query; when the current loop is the first forward join pruning query pattern, the cumulative list of network nodes retrieved in the previous forward join pruning query is empty.

[0030] Furthermore, the list of network nodes to be queried in the reverse join pruning query pattern includes the initial input termination network node or the list of network nodes to be queried obtained from the previous reverse join pruning query pattern loop.

[0031] The specific network nodes in the reverse join pruning query pattern include the network nodes in the cumulative network node list T2 retrieved in the previous reverse join pruning query; when the current loop is the first reverse join pruning query pattern, the cumulative network node list retrieved in the previous reverse join pruning query is empty.

[0032] Furthermore, when the user sets bypass nodes, the specific network nodes in the reverse connection pruning query mode and / or forward connection pruning query mode also include bypass nodes.

[0033] Furthermore, in the restore mode, when performing loop pruning queries using the forward join pruning query mode, the conditions for ending the forward loop include forward loop ending condition one and forward loop ending condition two. The forward loop ends when either of these conditions is met.

[0034] The first condition for ending the forward loop is that the number of iterations using the forward join pruning query pattern is equal to the topology depth set by the user.

[0035] The second condition for ending the positive loop is that the cumulative list of network nodes T2 contains all the network nodes in the current network.

[0036] Furthermore, in restoration mode two, when performing loop pruning queries using the forward join pruning query mode, the forward loop ends if the third condition for ending the forward loop is met; the third condition for ending the forward loop is: in the forward join pruning query, the user-set termination node appears in the list of network nodes accumulated in the last forward query.

[0037] Furthermore, in restoration mode two, when performing loop pruning queries using the reverse join pruning query mode, the reverse loop ends if the reverse loop termination condition is met; the reverse loop termination condition is: in the reverse join pruning query, the user-set starting node appears in the list of network nodes accumulated in the last reverse query.

[0038] Furthermore, when using the forward join pruning query mode for loop pruning queries, the forward loop is forcibly terminated when the number of forward loop iterations is equal to the number of network nodes in the entire network node cross dictionary.

[0039] When performing loop pruning queries using the reverse join pruning query mode, the reverse loop is forcibly terminated when the number of reverse loop iterations equals the number of network nodes in the entire network node cross dictionary.

[0040] Furthermore, in the restoration mode, all network nodes on the topology restoration path are determined. These network nodes are the list of network nodes accumulated during the last forward loop at the end of the forward loop.

[0041] Furthermore, in restoration mode two, determining all network nodes along the topology restoration path also includes:

[0042] 1) Obtain the last positive query network node list Td1 and the last positive cumulative network node list Td2, and find the network nodes that belong to the last positive cumulative network list Td2 but not to the last positive query node list Td1, and obtain the positive reference node list Td.

[0043] 2) Obtain the last reverse query network node list Tv1 and the last reverse cumulative network node list Tv2; find the network nodes that belong to the last reverse cumulative network list Tv2 but not to the last reverse query node list Tv1, and obtain the reverse reference node list Tv.

[0044] 3) Take the common nodes in the forward reference node list Td and the reverse reference node list Tv, that is, the path network nodes Ts on the topology restoration path;

[0045] 4) Add the user-defined start and end network nodes to the path node list Ts, which are all network nodes on the topology restoration path.

[0046] Furthermore, when performing iterative pruning queries using the forward join pruning query mode, the list of network nodes to be queried obtained from the last forward join pruning query update is the last forward join query list Td1; the cumulative list of network nodes queried obtained from the last forward join pruning query update is the forward cumulative list Td2.

[0047] Furthermore, when using the reverse join pruning query mode for cyclic pruning queries, the list of network nodes to be queried obtained by the last reverse join pruning query is the last reverse query list of network nodes to be queried Tv1; the cumulative list of network nodes queried obtained by the last reverse join pruning query is the reverse cumulative list of network nodes Tv2.

[0048] Furthermore, the method of performing a cyclic pruning query on the cross-dictionary of network nodes based on user-preset network parameters also includes:

[0049] C101. Based on the parsed user topology restoration instruction, determine whether the reverse join pruning condition is met. If the result is yes, then perform the query using the reverse join pruning mode. If the result is no, then perform the query using the forward join pruning query mode.

[0050] The reverse connection pruning condition is that both reverse condition one and reverse condition two are satisfied simultaneously; reverse condition one is that the topology restoration mode is selected as restoration mode two; reverse condition two is that the forward connection pruning cycle has ended.

[0051] C102. Determine whether the loop pruning query meets the loop termination condition. If the result is yes, end the loop. If the result is no, return to step C101.

[0052] The entire loop terminates when neither the forward nor reverse loop needs to be executed.

[0053] Technical Solution Two:

[0054] A network connectivity restoration system includes a user control unit, a topology data conversion unit, a topology restoration search unit, and a data integration and display unit; wherein,

[0055] The user control unit is used to set the restoration mode and corresponding network parameters, and to control the interactive device or entry point for the topology restoration search unit to search for specific network nodes and display specific network connections.

[0056] The topology data conversion unit and the network node cross-dictionary are used to obtain the original topology data and extract the topology information from the original topology data to convert it into a network node cross-dictionary.

[0057] The topology restoration search unit is used to perform a cyclic pruning query on the network node cross dictionary in the topology data conversion unit according to the restoration mode and network parameters set by the user control unit, and to provide network connectivity restoration data that meets the user options in the user control unit.

[0058] The data integration and display unit is used to plot and display the restored data provided by the topology restoration search unit.

[0059] Furthermore, it also includes a business data storage module and a time interpolation data reconstruction unit; among which,

[0060] User control unit 1 is also used to provide three dynamically adjustable parameters: service restoration start and end time, and time restoration granularity.

[0061] The business data storage module is used to store business data that needs to be displayed during network connectivity restoration;

[0062] The time interpolation data reconstruction unit is used to receive the restored data provided by the topology restoration search unit and three parameters—the start and end times of service restoration and the time restoration granularity—provided by the user control unit. It is used to extract service data from the service data storage module that simultaneously satisfies both constraint one and constraint two, and to quantize the occurrence or end time of the extracted service data onto the time quantization scale T of the service restoration start and end times. Then, it statistically summarizes the service content with the same time scale and the same network node identifier. Constraint one is that the network node in the extracted service data belongs to the network node in the restored data; constraint two is that the service occurrence time is within the service restoration start and end time range.

[0063] Furthermore, the service data to be displayed in the network connectivity restoration should include at least the service occurrence or termination time and network node records.

[0064] Furthermore, the time quantization scale T is obtained by subtracting the start and end time points of the restoration using the time restoration granularity as the step size.

[0065] Technical Solution 3:

[0066] A method for displaying network connectivity restoration data includes:

[0067] It receives the restored data and three parameters provided by the user control unit: the start and end time of the service restoration, and the time restoration granularity.

[0068] Extract business data that simultaneously satisfies both constraint one and constraint two, and quantize the occurrence or end time of the extracted business data onto the time quantization scale T of the business restoration start and end time. Constraint one is: the network nodes in the extracted business data belong to the network nodes in the restored data; constraint two is: the business occurrence time is within the business restoration start and end time range; statistically summarize the business content with the same time scale and the same network node identifier, and then display it as a graph.

[0069] Technical Solution Four:

[0070] A method for displaying network connectivity restoration data includes: acquiring restoration data and setting topology depth parameters; extracting restoration data that meets the set topology depth from the restoration data and displaying it as a graph.

[0071] Technical Solution 5:

[0072] A method for displaying network connectivity restoration data includes: acquiring restoration data and setting start and end network nodes, and / or bypass nodes, and / or path nodes; extracting restoration data that meets the set conditions from the restoration data and displaying it as a graph.

[0073] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0074] 1. Meets the requirement for real-time reconstruction of complex network structures;

[0075] This invention enables rapid reconstruction of any complex network, with a simple design process and high query efficiency. It is described below from three specific perspectives:

[0076] ① From a processing flow perspective, this invention simplifies the restoration of network connectivity to the restoration of network nodes, and then uses the topology information of the nodes themselves to display the network connectivity. The topology restoration process is relatively simple and can avoid complex data processing procedures.

[0077] ② From a technical perspective, this invention constructs a network node cross-dictionary and uses a bidirectional pruning query method to determine the network nodes that need to be restored and displayed. The computational complexity is very low, meeting the requirements for real-time restoration. Moreover, the cross-dictionary does not restrict the numbering order of network nodes and does not require pre-determining the hierarchical relationship of nodes, which is very beneficial for numbering nodes in complex networks.

[0078] ③ In terms of technical coverage, this invention not only supports topology restoration based on a given starting point and depth, but also supports topology restoration for complex situations such as given starting and ending network nodes, bypass nodes, or necessary nodes. The same technology supports multiple restoration scenarios.

[0079] 2. Meet the needs for correlation analysis of business data

[0080] Because this invention can quickly restore and respond to any complex network without modifying the restoration process, users only need to determine the restoration mode, starting node and topology depth, or starting and ending nodes and constraint nodes to quickly obtain network restoration nodes that meet the user's constraints. These restoration results can be used to filter the business data of all nodes, and combined with the occurrence time of the business, specific business correlation analysis can be performed.

[0081] 3. Meet the requirements for displaying topology and business data in association on small devices.

[0082] This invention enables rapid reconstruction of complex networks and correlation filtering of business data with low computational complexity. It not only supports topology reconstruction and display on various network management systems, but also enables real-time network topology reconstruction on small mobile terminal devices such as mobile phones. This allows front-line operation and maintenance engineers to quickly grasp the network structure and use business data to analyze and locate specific business problems. Attached Figure Description

[0083] Figure 1 This is a system structure diagram of an embodiment of network connectivity restoration provided by the present invention;

[0084] Figure 2 This is a system structure diagram of another embodiment of network connectivity restoration provided by the present invention;

[0085] Figure 3 This is a flowchart of an embodiment of the network connectivity restoration method provided by the present invention;

[0086] Figure 4 This is a schematic diagram of the network structure in one embodiment of the present invention;

[0087] Figure 5 This is a schematic diagram of network topology reconstruction in one embodiment of the present invention;

[0088] Figure 6 This is a schematic diagram of network node numbering provided in one embodiment of the present invention;

[0089] Figure 7 This is a process for determining topology restoration nodes in one embodiment of the present invention;

[0090] Figure 8 This is a schematic diagram of network topology reconstruction provided in one embodiment of the present invention;

[0091] Figure 9 This is a schematic diagram of network topology reconstruction provided in one embodiment of the present invention;

[0092] Figure 10 This is a schematic diagram of the display interface for restoring network connectivity in one embodiment of the present invention. Detailed Implementation

[0093] The technical solution of the present invention will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0094] In the description of this invention, it should be noted that the terms "center," "upper," "lower," "left," "right," "vertical," "horizontal," "inner," and "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are used only for the convenience of describing the invention and for simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on the invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0095] In the description of this invention, it should be noted that, unless otherwise explicitly specified and limited, the terms "installation," "connection," and "linking" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art can understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0096] The present invention will now be described in further detail.

[0097] Example 1

[0098] Using the restoration mode one, a specific network node is selected, and restoration is performed according to the preset topology connection depth method. Figure 4 The network structure shown is used as an example for illustration;

[0099] like Figure 3 An embodiment of a method for restoring network connectivity is shown, comprising:

[0100] Step S101: Extract topology information from the original topology data; the topology information includes information on all network nodes, connectivity between different network nodes, and / or connection directions; the storage format of the topology information is shown in Table 1, where 0 represents undirected, 1 represents the direction from network node A to network node B, 2 represents the direction from network node B to network node A, and 3 represents bidirectional. Table 1 is only an illustrative representation of the extracted topology information and does not imply that the invention can only construct the topology information table in this form.

[0101] Table 1. Topological information extracted from the original topological data.

[0102]

[0103]

[0104] Step S102: Assign positive integer numbers to all network nodes extracted in step S101, and construct a network node cross dictionary using the numbers and the topology information extracted in step S101.

[0105] The network node cross-dictionary is represented as: network node to be queried: network node 1, network node 2, network node 3, ..., network node n connected to the network node to be queried; for example, assuming that the network nodes connected to network node A are A1, A2, A3, A4, then this connection relationship is recorded in the network node cross-dictionary as A: A1, A2, A3, A4. By querying network node A, the network nodes A1, A2, A3, A4 connected to it can be obtained from this dictionary.

[0106] The order in which network nodes are numbered is not required in this invention; they can be numbered from left to right, from top to bottom, or even randomly. Table 2 provides an example. Figure 4 The diagram shows the mapping relationship between network node names and numbers.

[0107] Table 2 Network Node Number Mapping Relationship

[0108] SAW1 1 SAC6 6 BBA3 3 SAC1 2 SAC5 9 BBA11 11 SAW5 5 SAW2 13 SAC12 12 SAW3 15 SAC3 8 BBA1 4 BBA7 7 BBA2 10 BBA4 14

[0109] Therefore, in this embodiment, the corresponding network node cross-dictionary ND can be constructed as follows:

[0110] ND = {1:2, 5, 15;} 2:1, 7; 3:9; 4:8; 5: 1, 6, 9, 13; 6:5, 8; 7:2; 8:4, 6; 9: 3, 5, 10; 10:9, 14; 11:13; 12:13; 13: 5, 11, 12; 14:10;

[0124] 15:1}

[0125] Step S103: Parse the user's topology restoration command, match the topology restoration mode, and perform a cyclic pruning query on the network node cross dictionary according to the user's preset network parameters;

[0126] In this invention, the cyclic pruning query includes a forward join pruning query mode and a reverse join pruning query mode.

[0127] The specific operations of the forward join pruning query mode and the reverse join pruning query mode are the same, both including the following steps:

[0128] First, the network node cross dictionary is searched using the list of network nodes to be queried. The connected nodes of each network node in the list of network nodes to be queried are queried to obtain the set of connected nodes, denoted as set E. The network node list T1 includes the initial input starting network node or the positive network node list T1 updated in the previous positive connection pruning query mode loop.

[0129] Then, deduplication and pruning are performed on all network nodes in set E to remove specific network nodes, resulting in set E';

[0130] Finally, replace the network nodes in the list of network nodes to be queried with the network nodes in set E', and add the new network nodes obtained by the pruning query in this loop to the cumulative list of network nodes T2, thus completing the update of the list of network nodes to be queried T1 and the cumulative list of network nodes T2.

[0131] The difference between the forward join pruning query mode and the reverse join pruning query mode lies only in the following: In the forward join pruning query mode, the list of network nodes to be queried includes either the initial input starting network node or the list T1 updated in the previous forward join pruning query mode loop; while in the reverse join pruning query mode, the list includes either the initial input ending network node or the list T1 updated in the previous reverse join pruning query mode loop. Specific network nodes in the forward join pruning query mode include those in the cumulative list T2 of network nodes retrieved after the previous forward query update; while specific network nodes in the reverse join pruning query mode include not only those in the cumulative list T2 of network nodes retrieved after the previous reverse query update, but also bypass nodes if the user has set bypass nodes.

[0132] In this invention, although the loop pruning query includes both forward join pruning query and reverse join pruning query modes, the specific loop pruning query process depends on the restoration mode selected by the user. Therefore, in this step, it is necessary to first determine the query mode used in the loop pruning query process. The specific determination method is as follows:

[0133] C101. Based on the parsed user topology restoration instruction, determine whether the reverse join pruning condition is met. If the result is yes, then use the reverse join pruning query mode to perform the query. If the result is no, then use the forward join pruning mode to perform the query.

[0134] The reverse connection pruning condition is that both reverse condition one and reverse condition two are satisfied simultaneously; the reverse condition one is that the topology restoration mode is selected as restoration mode two; the reverse condition two is that the forward connection pruning loop process has ended.

[0135] C102. Determine whether the loop pruning query meets the termination condition. If the result is yes, end the loop. If the result is no, return to step C101.

[0136] In the return mode, when using the forward join pruning query mode for loop pruning query, the conditions for ending the forward loop include forward loop ending condition one and forward loop ending condition two. If either of the forward loop ending conditions is met, the forward loop ends and is no longer executed.

[0137] The first condition for ending the forward loop is that the number of iterations using the forward join pruning query pattern is equal to the topology depth set by the user.

[0138] The second condition for ending the positive loop is that the cumulative list of network nodes T2 contains all the network nodes in the current network.

[0139] When performing a loop pruning query using the forward join pruning query mode, the forward loop is forcibly terminated when the number of forward loop iterations equals the number of network nodes in the entire network node cross-dictionary; when performing a loop pruning query using the reverse join pruning query mode, the reverse loop is forcibly terminated when the number of reverse loop iterations equals the number of network nodes in the entire network node cross-dictionary.

[0140] The entire loop terminates when neither the forward nor reverse loop is executed.

[0141] Therefore, in this embodiment, the specific operation of performing a cyclic pruning query on the cross-dictionary of network nodes according to the user-preset network parameters is as follows:

[0142] In this embodiment, step C101 is executed first to determine whether the reverse loop pruning condition is met. Since the user-set restoration mode is restoration mode one, the reverse join pruning condition is not met, and only the forward join pruning query mode can be used for loop pruning query.

[0143] In this embodiment, it is assumed that the user specifies the network node number to be restored as 9, and the topology restoration depth is 2. Let the number of iterations be L, and the specific process of the forward join pruning query mode loop pruning query will be illustrated in detail with an example:

[0144] When performing the first forward loop, L=1, the list of network nodes to be queried T1 is the starting node 9 of the initial input. Since this query is the first forward join pruning query, the list of network nodes queried before this forward join pruning query is empty. Therefore, T1=[9], T2=[].

[0145] In this forward query, firstly, the network nodes are searched in the network node cross dictionary ND for all connected nodes of the network node to be searched in T1. The network nodes connected to node number 9 are 3, 5, and 10, denoted as 9:3, 5, 10. Then, since T2 = [], the network node found is not in T2. ​​Therefore, the pruning in this loop cannot remove any network nodes.

[0146] Finally, the list of network nodes to be queried is updated to T1 = [3, 5, 10], and the list of network nodes queried in total is updated to T2 = [3, 5, 9, 10]; the first forward join pruning mode query is completed;

[0147] Then, step C102 is executed to determine whether the conditions for ending the forward join pruning mode loop pruning query are met. Since L is less than the set topology restoration depth 2 at this time, the first condition for ending the forward loop is not met; and since the cumulative list of network nodes T2 does not contain all network nodes, the second condition for ending the forward loop is not met. Therefore, the next loop begins.

[0148] Execute step C101 again, and the result is that the forward join pruning query mode is used for loop pruning query.

[0149] When performing the second forward loop, L=2. The list of network nodes to be queried, T1, is the list of network nodes to be queried updated after the previous forward join pruning mode query. The cumulative list of network nodes queried after the previous forward query, T2, is the cumulative list of network nodes queried after the first forward join pruning mode query. That is, in this query, T1=[3,5,10], T2=[3,5,9,10];

[0150] In this forward query, we first search for the connected nodes of all network nodes in T1 in the network node cross-dictionary ND, and get: 3:9; 5:1, 6, 9, 13; 10:9, 14; then, we remove duplicates from all the nodes found, and get the node list [1,6,9,13,14]. We then prune and remove all network nodes that belong to T2 = [3,5,9,10]. Therefore, the remaining network nodes after pruning are numbered [1,6,13,14].

[0151] Finally, the network node list T1 is updated to T1 = [1, 6, 13, 14], and the cumulative network node list T2 is updated to T2 = [1, 3, 5, 6, 9, 10, 13, 14].

[0152] Then, step C102 is executed again to determine whether the condition for ending the forward join pruning mode loop pruning query is met. Since L is equal to the topology restoration depth of 2 at this time, the first condition for ending the forward loop is met. Therefore, the forward loop ends. Since the condition for ending the reverse join pruning query is not met in this embodiment, the reverse join pruning query does not need to be executed from beginning to end in this embodiment. Therefore, neither the forward loop nor the reverse loop is executed at this time, the loop ending condition is met, and the loop ends.

[0153] Step S104: Determine all network nodes on the topology restoration path based on the cyclic pruning query results, and use the extracted topology information to obtain the topology data of the network nodes to be restored.

[0154] After the loop is complete, all network nodes on the topology restoration path need to be determined;

[0155] Since the topology restoration mode in this embodiment is restoration mode one, in this embodiment, all network nodes on the topology restoration path are the network node list T2 that was last cumulatively queried at the end of the forward loop. Therefore, in this embodiment, the set of all network nodes on the topology restoration path is [1,3,5,6,9,10,13,14].

[0156] Step S105: The obtained network node topology data to be restored is plotted and displayed, and the numbers are replaced with the corresponding network node names after plotting, resulting in the following: Figure 5 The network topology diagram shown is a reconstruction diagram.

[0157] Example 2

[0158] The topology restoration is performed using the method of selecting the start and end network nodes and performing shortest path restoration in Restoration Mode 2. Figure 6 The network structure shown is used as an example for illustration;

[0159] like Figure 3 A method for restoring network connectivity is shown, comprising:

[0160] Step S101: Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes;

[0161] Step S102: Assign positive integer numbers to all network nodes extracted in step S101, and construct a network node cross-dictionary using the numbers and the topology information extracted in step S101; in this embodiment, the constructed cross-dictionary ND is:

[0162] ND = {1:2,5,9;} 2: 1, 5, 6, 7, 15; 3: 9, 11, 14; 4: 7, 10, 15; 5: 1, 2, 7, 8, 13; 6:2, 9; 7: 2, 4, 5, 14, 15; 8: 5, 11, 12; 9: 1, 3, 6, 12; 10: 4, 13, 14; 11:3, 8, 13; 12:8, 9; 13: 5, 10, 11; 14: 3, 7, 10;

[0176] 15:2,4,7}

[0177] Step S103: Parse the user's topology restoration command, match the topology restoration mode, perform a cyclic pruning query on the network node cross dictionary according to the user's preset network parameters, and determine all network nodes on the topology restoration path.

[0178] In this invention, the cyclic pruning query includes a forward join pruning query mode and a reverse join pruning query mode.

[0179] The specific operations of the forward join pruning query mode and the reverse join pruning query mode are the same, both including the following steps:

[0180] First, the network node cross dictionary is searched using the list of network nodes to be queried. The connected nodes of each network node in the list of network nodes to be queried are queried to obtain the set of connected nodes, denoted as set E. The network node list T1 includes the initial input starting network node or the positive network node list T1 updated in the previous positive connection pruning query mode loop.

[0181] Then, deduplication and pruning are performed on all network nodes in set E to remove specific network nodes, resulting in set E';

[0182] Finally, replace the network nodes in the list of network nodes to be queried with the network nodes in set E', and add the new network nodes obtained by the pruning query in this loop to the cumulative list of network nodes T2, thus completing the update of the list of network nodes to be queried T1 and the cumulative list of network nodes T2.

[0183] The difference between the forward join pruning query mode and the reverse join pruning query mode lies only in the following: In the forward join pruning query mode, the list of network nodes to be queried includes either the initial input starting network node or the list T1 updated in the previous forward join pruning query mode loop; while in the reverse join pruning query mode, the list of network nodes to be queried includes either the initial input starting network node or the list T1 updated in the previous forward join pruning query mode loop. Specific network nodes in the forward join pruning query mode include those in the cumulative list T2 of network nodes retrieved after the previous forward query update; while specific network nodes in the reverse join pruning query mode include not only those in the cumulative list T2 of network nodes retrieved after the previous reverse query update, but also bypass nodes if the user has set bypass nodes.

[0184] In this invention, although the loop pruning query includes both forward join pruning query and reverse join pruning query modes, the specific loop pruning query process depends on the restoration mode selected by the user. Therefore, in this step, it is necessary to first determine the query mode used in the loop pruning query process. The specific determination method is as follows:

[0185] C101. Based on the parsed user topology restoration instruction, determine whether the reverse join pruning condition is met. If the result is yes, then use the reverse join pruning query mode to perform the query. If the result is no, then use the forward join pruning mode to perform the query.

[0186] The reverse connection pruning condition is that both reverse condition one and reverse condition two are satisfied simultaneously; the reverse condition one is that the topology restoration mode is selected as restoration mode two; the reverse condition two is that the forward connection pruning loop process has ended.

[0187] C102. Determine whether the loop pruning query meets the loop termination condition. If the result is yes, end the loop; if the result is no, return to step C101.

[0188] In restoration mode two, when performing loop pruning queries using the forward join pruning query mode, if the third condition for the end of the forward loop is met, the forward loop ends and is no longer executed. The third condition for the forward loop is: in the forward join pruning query of restoration mode two, the user-set termination node appears in the cumulative query list T2 updated in the last forward join pruning query.

[0189] When performing a loop pruning query using the reverse join pruning query mode, the reverse loop ends and is no longer executed if the reverse loop termination condition is met. The reverse loop termination condition is: in the reverse join pruning query of restoration mode two, the user-set starting node appears in the cumulative query list T2 updated in the last reverse join pruning query.

[0190] The entire loop terminates when neither the forward nor reverse loop is executed.

[0191] Therefore, in this embodiment, the specific operation of performing a cyclic pruning query on the cross-dictionary of network nodes according to the user-preset network parameters is as follows:

[0192] In this embodiment, step C101 is executed first to determine whether the reverse loop pruning condition is met. Since the forward join pruning query has not yet started at this time, the reverse join pruning query condition is not met, and the forward join pruning query mode can only be used for loop pruning query.

[0193] In this embodiment, the user-set restoration mode is restoration mode two. Assume the user-specified starting number of the network node to be restored is 10, and the ending number is 2. Let the number of iterations be L. The specific process of the forward join pruning query mode's iterative pruning query is illustrated in detail with an example:

[0194] When performing the first query, L=1, and the list of network nodes to be queried, T1, is the starting node 10 of the initial input. Since this query is the first forward connection pruning query, the list of network nodes queried cumulatively after the last forward query update, T2, is empty. Therefore, T1=

[10] , T2=[].

[0195] During this forward query, firstly, search for all connected nodes of network nodes in T1 in the network node cross-dictionary ND. The network nodes connected to network node number 10 are: 4, 13, and 14, denoted as 10:4, 13, and 14. Then, since T2 = [], the queried network nodes are not in T2. ​​Therefore, this loop pruning cannot remove any network nodes.

[0196] Finally, the list of network nodes to be queried, T1, is updated to T1 = [4, 13, 14], and the list of network nodes queried in total, T2, is updated to T2 = [4, 10, 13, 14]; the first forward join pruning mode query is complete;

[0197] Then, step C102 is executed to determine whether the condition for ending the forward join pruning mode loop pruning query is met. Since the user-set termination network node number 2 does not appear in the cumulative query list T2 updated in the last reverse join pruning query, no forward join pruning query end marker is generated. Therefore, the forward loop end condition is not met, and the next loop is entered.

[0198] Execute step C101 again to determine whether the reverse loop pruning condition is met. Since the forward join pruning mode query has not ended at this time, the reverse join pruning query condition is not met. Therefore, the forward join pruning query mode is still used for loop pruning query.

[0199] When performing the second query, L=2. The list of network nodes to be queried, T1, is the list of network nodes to be queried updated after the previous forward join pruning mode query. The cumulative list of network nodes queried after the previous forward query, T2, is the cumulative list of network nodes queried after the previous forward join pruning mode query. That is, in this query, T1=[4,13,14], T2=[4,10,13,14];

[0200] During this forward query, firstly, the network node cross-reference dictionary ND searches for all connected nodes corresponding to network nodes in T1. This yields: 4: 7, 10, 15; 13: 5, 10, 11; 14: 3, 7, 10. All retrieved network elements are [7, 10, 15, 5, 10, 11, 3, 7, 10]. After deduplication, pruning removes all network nodes belonging to T2 = [4, 10, 13, 14]. Therefore, the remaining network nodes after pruning are numbered as follows:

[0201] [3,5,7,11,15].

[0202] Finally, the list of network nodes to be queried is updated to T1 = [3,5,7,11,15], and the list of network nodes queried in total, T2, is updated to T2 = [3,4,5,7,10,11,13,14,15]; the second forward join pruning mode query is complete;

[0203] Then, step C102 is executed again to determine whether the condition for the end of the forward join pruning mode loop pruning query is met. Since the user-set termination network node number 2 does not appear in the list of network nodes to be queried T2 updated in the last reverse join pruning query, no forward join pruning query end marker is generated. Therefore, the condition for the end of the forward loop is not met, and the next loop is entered.

[0204] Execute step C101 again to determine whether the reverse loop pruning condition is met. At this time, since the forward join pruning mode query has not ended, the reverse join pruning query condition is not met. Therefore, the forward join pruning query mode is still used for loop pruning query.

[0205] When performing the third query, L = 3, T1 = [3, 5, 7, 11, 15], T2 = [3, 4, 5, 7, 10, 11, 13, 14, 15].

[0206] During this forward query, firstly, search for the connected nodes corresponding to all network nodes in T1 in the network node cross-dictionary ND. The results are: 3: 9, 11, 14; 5: 1, 2, 7, 8, 13; 7: 2, 4, 5, 14, 15; 11: 3, 8, 13; 15: 2, 4, 7. All network elements found are [9, 11, 14, 1, 2, 7, 8, 13, 2, 4, 5, 14, 15, 3, 8, 13, 2, 4, 7]. After deduplication, prune and remove all network nodes belonging to T2 = [3, 4, 5, 7, 10, 11, 13, 14, 15]. Therefore, the remaining network nodes after pruning are numbered [9, 1, 2, 8].

[0207] Finally, the list of network nodes to be queried, T1, is updated to T1 = [1,2,8,9], and the list of network nodes queried in total, T2, is updated to T2 = [1,2,3,4,5,7,8,9,10,11,13,14,15]; the third forward join pruning pattern query is complete;

[0208] Then, step C102 is executed again to determine whether the condition for ending the forward join pruning loop query is met. Since the user-set termination network node number 2 appears in the network node list T2 updated in the last reverse join pruning query, the forward join pruning query end marker is generated, and the forward loop ends. At this time, the network node list T1 obtained at the end of the current loop and the cumulative network node list T2 are saved as the last forward query network node list Td1 and the forward cumulative network node list Td2, respectively. Note that the reverse loop pruning query has not yet started at this time, so the loop end condition is not met, and the next loop needs to be entered.

[0209] Execute step C101 again to determine whether the reverse loop pruning condition is met. Since the reverse condition one is that the topology restoration mode is selected as restoration mode two, and the reverse condition two is that the forward join pruning loop process has ended, the result is yes. Therefore, this loop will perform a reverse join pruning query.

[0210] Before entering this reverse loop, the list of network nodes to be queried T1 and the cumulative list of queried network nodes T2 need to be initialized;

[0211] In this query, L=4, but since it is the first time to perform the reverse join pruning loop, the network node list T1 to be queried is the initial input termination node 2. Since this query is the first reverse join pruning query, the cumulative network node list T2 after the last reverse query update is empty, that is, the initialized T1=[2], T2=[].

[0212] During this reverse loop, firstly, search for all connected nodes of network nodes in T1 in the network node cross-dictionary ND. The network nodes connected to network node number 2 are: 1, 5, 6, 7, 15, which can be abbreviated as 2: 1, 5, 6, 7, 15. Then, since T2 = [], the queried network nodes are not in T2. ​​Therefore, no network nodes are pruned in this loop.

[0213] Finally, the list of network nodes to be queried T1 is updated to T1 = [1,5,6,7,15], and the list of network nodes queried in total T2 is updated to T2 = [1,2,5,6,7,15]; this reverse query is complete;

[0214] Then, step C102 is executed again. Since the forward loop has ended, the condition for the forward loop not to execute has been met. At this point, it is only necessary to check whether the condition for the reverse loop to end is met. Since the termination network node number 10 of the reverse join pruning query does not appear in the network node list T2 updated in the last reverse join pruning query, the condition for the reverse loop to end is not met. Therefore, the next loop begins.

[0215] Execute step C101 again to determine whether the reverse loop pruning condition is met. At this time, the forward join pruning query has ended and the reverse join pruning query condition is met. Therefore, the reverse join pruning query is still performed.

[0216] In this query, L=5, the list of network nodes to be queried T1 is the list of network nodes to be queried T1 after the last reverse join pruning mode query, and the cumulative list of network nodes queried T2 after the last reverse query update is the cumulative list of network nodes queried T2 after the last reverse join pruning mode query update; that is, T1=[1,5,6,7,15], T2=[1,2,5,6,7,15];

[0217] During this reverse loop, firstly, search for the connected nodes corresponding to all network nodes in T1 in the network node cross-dictionary ND. The results are: 1: 2, 5, 9; 5: 1, 2, 7, 8, 13; 6: 2, 9; 7: 2, 4, 5, 14, 15; 15: 2, 4, 7. All network elements found are [2, 5, 9, 1, 2, 7, 8, 13, 2, 9, 2, 4, 5, 14, 15, 2, 4, 7]. After deduplication, prune and remove all network nodes belonging to T2 = [1, 2, 5, 6, 7, 15]. Therefore, the remaining network nodes after pruning are numbered [4, 8, 9, 13, 14].

[0218] Finally, the list of network nodes to be queried T1 is updated to T1 = [4,8,9,13,14], and the list of network nodes queried in total T2 is updated to T2 = [1,2,4,5,6,7,8,9,13,14,15]; this reverse query is complete;

[0219] Then, step C102 is executed again. Since the terminating network node number 10 of the reverse join pruning query does not appear in the network node list T2 updated in the last reverse join pruning query, the reverse loop termination condition is not met. Therefore, the next loop begins.

[0220] Execute step C101 again to determine whether the reverse loop pruning condition is met. At this time, the forward join pruning query has ended and the reverse join pruning query condition is met. Therefore, the reverse join pruning query is still performed.

[0221] In this query, L = 6, T1 = [4, 8, 9, 13, 14], T2 = [1, 2, 4, 5, 6, 7, 8, 9, 13, 14, 15];

[0222] During this reverse loop, firstly, search the network node cross-reference dictionary ND for all connected nodes corresponding to network nodes in T1. The results are: 4: 7, 10, 15; 8: 5, 11, 12; 9: 1, 3, 6, 12; 13: 5, 10, 11; 14: 3, 7, 10. All network elements retrieved are...

[0223] [7,10,15,5,11,12,1,3,6,12,5,10,11,3,7,10] After deduplication, pruning removes all network nodes belonging to T2=[1,2,4,5,6,7,8,9,13,14,15]. Therefore, the remaining network nodes after pruning are numbered [3,10,11,12].

[0224] Finally, the list of network nodes to be queried T1 is updated to T1 = [3, 10, 11, 12], and the list of nodes queried in total T2 is updated to T2 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]; this reverse query is complete;

[0225] Then, step C102 is executed again. Since the termination network node number 10 of the reverse join pruning query appears in the list of network nodes to be queried T2, the reverse loop termination condition is met, the reverse loop ends, and the list of network nodes to be queried T1 obtained from the end of the current loop and the list of network nodes obtained from the reverse cumulative query T2 are saved as the reverse forward list of network nodes to be queried Tv1 and the reverse cumulative list of network nodes Tv2, respectively.

[0226] At this point, neither the forward loop nor the reverse loop will be executed, the loop termination condition is met, and the loop ends.

[0227] Step S104: Determine all network nodes on the topology restoration path based on the cyclic pruning query results, and use the extracted topology information to obtain the topology data of the network nodes to be restored.

[0228] After the loop ends, based on the results of the loop pruning query, it is necessary to determine all network nodes on the topology restoration path.

[0229] Since the topology restoration mode in this embodiment is restoration mode two, in this embodiment, as Figure 7 As shown, the method for determining all network nodes on the topology restoration path is as follows:

[0230] 1) Obtain the last positive query network node list Td1 and the last positive cumulative network node list Td2, and find the network nodes that belong to the last positive cumulative network list Td2 but not to the last positive query node list Td1, and obtain the positive reference node list Td.

[0231] When the forward loop ends, the list of network nodes to be queried T1 obtained by the last forward join pruning query update is the last forward query list of network nodes Td1; the cumulative list of network nodes queried T2 obtained by the last forward join pruning query update is the forward cumulative list of network nodes Td2; therefore, in this embodiment, Td1 = [1,2,8,9], Td2 = [1,2,3,4,5,7,8,9,10,11,13,14,15]; then, Td = Td2 - Td1 = [3,4,5,7,10,11,13,14,15].

[0232] 2) Obtain the last reverse query network node list Tv1 and the last reverse cumulative network node list Tv2; find the network nodes that belong to the last reverse cumulative network list Tv2 but not to the last reverse query node list Tv1, and obtain the reverse reference node list Tv.

[0233] When the reverse loop ends, the list of network nodes to be queried is updated by the last reverse join pruning query.

[0234] T1 is the last reverse query list of network nodes Tv1; T2 is the cumulative query list of network nodes obtained from the last reverse join pruning query update, which is the last reverse cumulative network node list Tv2; therefore, in this embodiment, Tv1 = [3, 10, 11, 12],

[0235] Tv2=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]; then Tv=

[0236] Tv2-Tv1=[1,2,4,5,6,7,8,9,13,14,15].

[0237] 3) Take the common nodes in the forward reference node list Td and the reverse reference node list Tv, that is, the path network nodes on the topology restoration path. Let the set of path network nodes on the topology restoration path be set Ts, then Ts = Td ∩ Tv = [4, 5, 7, 13, 14, 15].

[0238] 4) Add the user-defined start and end network nodes to the path node list Ts to obtain all network nodes on the topology restoration path. Therefore, the set of all network nodes on the topology restoration path obtained in this example is [2,4,5,7,10,13,14,15].

[0239] Step S105: Display the obtained network node topology data to be restored in a graph, such as... Figure 8 As shown, after the numbering is completed, replace it with the corresponding network node name to obtain the network topology diagram.

[0240] Example 3

[0241] The topology restoration is performed using the selected start, end, and bypass nodes in Restoration Mode 2.

[0242] The specific steps in this embodiment are the same as in embodiment 2. The only difference is that in the pruning stage of embodiment 2, it is also necessary to remove the bypass nodes. The following is an example illustrating this embodiment.

[0243] like Figure 3 A method for restoring network connectivity is shown, comprising:

[0244] Step S101: Same as in Example 2;

[0245] Step S102: Same as in Example 2

[0246] Step S103: Parse the user's topology restoration command, match the topology restoration mode, and perform a cyclic pruning query on the network node cross dictionary according to the user's preset network parameters.

[0247] In this step, it is necessary to perform a cyclic pruning query on the network node cross-reference dictionary based on the user-preset network parameters, that is, to determine the query mode used in the cyclic pruning query process. The specific determination method is as follows:

[0248] First, execute step C101 to determine whether the reverse loop pruning condition is met. Since the forward join pruning query has not yet started at this time, the reverse join pruning query condition is not met, so the forward join pruning query mode can only be used for loop pruning query.

[0249] In this embodiment, the user-set restoration mode is restoration mode two. Assume the user-specified starting and ending network node numbers to be restored are 10 and 2, and the bypass node number is 7. Let the number of iterations be L. The specific process of the forward connection pruning query mode's iterative pruning query is illustrated in detail with an example:

[0250] When performing the first query, L=1, and the list of network nodes to be queried, T1, is the initial input starting node 10. Since this query is the first forward join pruning query, the cumulative list of network nodes queried after the previous forward query update, T2, is empty. Therefore, T1=

[10] , T2=[].

[0251] During this forward query, firstly, search for all connected nodes of network nodes in T1 in the network node cross-dictionary ND. The network nodes connected to network node number 10 are: 4, 13, and 14, denoted as 10:4, 13, and 14. Then, since T2 = [], the queried network nodes are not in T2, and the bypass nodes are not among the queried connected network nodes. Therefore, this loop deduplication and pruning cannot remove any network nodes.

[0252] Finally, the list of network nodes to be queried, T1, is updated to T1 = [4, 13, 14], and the list of network nodes queried in total, T2, is updated to T2 = [4, 10, 13, 14]; the first forward join pruning mode query is completed.

[0253] Then, step C102 is executed. Since the user-set termination network node number 2 does not appear in the cumulative query list T2 updated in the last reverse join pruning query, no forward join pruning query end marker is generated. Therefore, the forward loop end condition is not met, and the next loop is entered.

[0254] Execute step C101 again. Since the forward join pruning query has not ended at this time, the reverse join pruning query condition is not met. Therefore, the forward join pruning query mode is still used for loop pruning query.

[0255] When performing the second query, L = 2, T1 = [4, 13, 14], T2 = [4, 10, 13, 14];

[0256] During this forward query, firstly, search for the connected nodes corresponding to all network nodes in T1 in the network node cross-dictionary ND. The results are: 4: 7, 10, 15; 13: 5, 10, 11; 14: 3, 7, 10. The total number of network elements found is [7, 10, 15, 5, 10, 11, 3, 7, 10]. After deduplication, pruning is performed to remove all network nodes belonging to T2 = [4, 10, 13, 14] and the bypass node number 7. Therefore, the remaining network node numbers after pruning are [3, 5, 11, 15].

[0257] Finally, the list of network nodes to be queried is updated to T1 = [3,5,11,15], and the list of network nodes queried in total, T2, is updated to T2 = [3,4,5,10,11,13,14,15]; the second forward join pruning mode query is complete;

[0258] Then, step C102 is executed again. Since the user-set termination network node number 2 does not appear in the list of network nodes to be queried T2 updated in the last reverse join pruning query, no forward join pruning query end marker is generated. Therefore, the forward loop end condition is not met, and the next loop is entered.

[0259] Execute step C101 again. Since the forward join pruning query has not ended at this time, the reverse join pruning query condition is not met. Therefore, the forward join pruning query mode is still used for loop pruning query.

[0260] When performing the third query, L = 3, T1 = [3, 5, 11, 15], T2 = [3, 4, 5, 10, 11, 13, 14, 15].

[0261] During this forward query, firstly, the network nodes are searched in the network node cross-reference dictionary ND for all connected nodes corresponding to network nodes in T1. This yields: 3: 9, 11, 14; 5: 1, 2, 7, 8, 13; 11: 3, 8, 13; 15: 2, 4, 7. All the network elements found are [9, 11, 14, 1, 2, 7, 8, 13, 3, 8, 13, 2, 4, 7]. After deduplication and pruning, all network nodes belonging to T2 = [3, 4, 5, 10, 11, 13, 14, 15] are removed, leaving network nodes numbered [9, 1, 2, 7, 8]. Furthermore, the bypass node number 7 is removed, so the final remaining network nodes are [9, 1, 2, 8].

[0262] Finally, the list of network nodes to be queried, T1, is updated to T1 = [1,2,8,9], and the list of network nodes queried in total, T2, is updated to T2 = [1,2,3,4,5,8,9,10,11,13,14,15]; the third forward join pruning pattern query is complete;

[0263] Then, step C102 is executed again. Since the user-set termination network node number 2 appears in the network node list T2 updated in the last reverse join pruning query, the forward join pruning query end marker is generated, and the forward loop ends. At this point, the network node list T1 to be queried obtained at the end of the current loop and the cumulative network node list T2 are saved as the last forward query network node list Td1 and the forward cumulative network node list Td2, respectively. Note that the reverse loop pruning query has not yet started at this time, so the loop end condition is not met, and the next loop needs to be entered.

[0264] Execute step C101 again. Since the reverse condition one is that the topology restoration mode is selected as restoration mode two, and the reverse condition two is that the forward join pruning loop process has ended, the judgment result is yes. Therefore, this loop will perform a reverse join pruning query.

[0265] Before entering this reverse loop, the list of network nodes to be queried T1 and the cumulative list of queried network nodes T2 need to be initialized;

[0266] In this query, L=4, but since it is the first time to perform the reverse join pruning loop, the network node list T1 to be queried is the initial input termination node 2. Since this query is the first reverse join pruning query, the cumulative network node list T2 after the last reverse query update is empty, that is, the initialized T1=[2], T2=[].

[0267] When performing this reverse loop, firstly, search for all connected nodes of network nodes in T1 in the network node cross-dictionary ND. The network nodes connected to network node number 2 are: 1, 5, 6, 7, 15, which can be abbreviated as 2: 1, 5, 6, 7, 15. Then, since T2 = [], the network nodes found are not in T2, but the bypass node 7 needs to be pruned. Therefore, the remaining node list obtained by pruning in this loop is [1, 5, 6, 15].

[0268] Finally, the list of network nodes to be queried T1 is updated to T1 = [1,5,6,15], and the list of network nodes queried in total T2 is updated to T2 = [[1,2,5,6,15]; this reverse query is complete;

[0269] Then, step C102 is executed again. Since the terminating network node number 10 of the reverse join pruning query does not appear in the network node list T2 updated in the last reverse join pruning query, the reverse loop termination condition is not met. Therefore, the next loop begins.

[0270] Execute step C101 again. At this time, the forward join pruning query has ended and the reverse join pruning query condition is met. Therefore, the reverse join pruning query is still performed.

[0271] In this query, L = 5, T1 = [1, 5, 6, 15], T2 = [1, 2, 5, 6, 15];

[0272] During this reverse loop, firstly, search the network node cross-reference dictionary ND for all connected nodes corresponding to network nodes in T1. The results are: 1: 2, 5, 9; 5: 1, 2, 7, 8, 13; 6: 2, 9; 15: 2, 4, 7. All network elements found are [2, 5, 9, 1, 2, 7, 8, 13, 2, 9, 2, 4, 7]. After deduplication, prune away all network nodes belonging to T2 = [1, 2, 5, 6, 15]. The remaining network nodes are numbered [4, 7, 8, 9, 13]. Furthermore, prune away the bypass node number 7, so the final remaining network nodes are numbered [4, 8, 9, 13].

[0273] Finally, the list of network nodes to be queried T1 is updated to T1 = [4,8,9,13], and the list of network nodes queried in total T2 is updated to T2 = [1,2,4,5,6,8,9,13,15]; this reverse query is complete;

[0274] Then, step C102 is executed again. Since the terminating network node number 10 of the reverse join pruning query does not appear in the network node list T2 updated in the last reverse join pruning query, the reverse loop termination condition is not met. Therefore, the next loop begins.

[0275] Execute step C101 again to determine whether the reverse loop pruning condition is met. At this time, the forward join pruning query has ended and the reverse join pruning query condition is met. Therefore, the reverse join pruning query is still performed.

[0276] In this query, L = 6, T1 = [4, 8, 9, 13], T2 = [1, 2, 4, 5, 6, 8, 9, 13, 15].

[0277] During this reverse loop, firstly, search the network node cross-reference dictionary ND for all connected nodes corresponding to network nodes in T1. The results are: 4: 7, 10, 15; 8: 5, 11, 12; 9: 1, 3, 6, 12; 13: 5, 10, 11. All network elements found are [7, 10, 15, 5, 11, 12, 1, 3, 6, 12, 5, 10, 11]. After deduplication, prune away all network nodes belonging to T2 = [1, 2, 4, 5, 6, 8, 9, 13, 15]. The remaining network nodes are numbered [3, 7, 10, 11, 12]. Furthermore, prune away the bypass node number 7. Therefore, the final remaining network nodes are numbered [3, 10, 11, 12].

[0278] Finally, the list of network nodes to be queried T1 is updated to T1 = [3, 10, 11, 12], and the list of network nodes queried in total T2 is updated to T2 = [1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15]; this reverse query is complete;

[0279] Then, step C102 is executed again. Since the termination network node number 10 of the reverse join pruning query appears in the list of network nodes to be queried T2, the reverse loop termination condition is met, the reverse loop ends, and the list of network nodes to be queried T1 obtained at the end of the current loop and the list of network nodes obtained in the last reverse cumulative query T2 are saved as the reverse forward query list Tv1 and the reverse cumulative network node list Tv2, respectively.

[0280] At this point, neither the forward loop nor the reverse loop will be executed, the loop termination condition is met, and the loop ends.

[0281] Step S104: Determine all network nodes on the topology restoration path based on the cyclic pruning query results, and use the extracted topology information to obtain the topology data of the network nodes to be restored.

[0282] After the loop ends, the next step is to determine all network nodes on the topology restoration path based on the results of the loop pruning query.

[0283] Since the topology restoration mode in this embodiment is restoration mode two, in this embodiment, as Figure 7 As shown, the method for determining all network nodes on the topology restoration path is as follows:

[0284] 1) Obtain the last positive query network node list Td1 and the last positive cumulative network node list Td2, and find the network nodes that belong to the last positive cumulative network list Td2 but not to the last positive query network node list Td1, and obtain the positive reference node list Td.

[0285] When the forward loop ends, the list of network nodes to be queried T1 obtained by the last forward join pruning query update is the last forward query list of network nodes Td1; the cumulative list of network nodes queried T2 obtained by the last forward join pruning query update is the forward cumulative list of network nodes Td2; therefore, in this embodiment, Td1 = [1,2,8,9], Td2 = [1,2,3,4,5,8,9,10,11,13,14,15]; then, Td = Td2 - Td1 = [3,4,5,10,11,13,14,15].

[0286] 2) Obtain the last reverse query network node list Tv1 and the last reverse cumulative network node list Tv2; find the network nodes that belong to the last reverse cumulative network list Tv2 but not to the last reverse query network node list Tv1, and obtain the reverse reference node list Tv.

[0287] When the reverse loop ends, the list of network nodes to be queried is updated by the last reverse join pruning query.

[0288] T1 is the last reverse query list of network nodes Tv1; T2 is the cumulative query list of network nodes obtained from the last reverse join pruning query update, which is the last reverse cumulative network node list Tv2; therefore, in this embodiment, Tv1 = [3, 10, 11, 12],

[0289] Tv2=[1,2,3,4,5,6,8,9,10,11,12,13,15]; then Tv=

[0290] Tv2-Tv1=[1,2,4,5,6,8,9,13,15].

[0291] 3) Take the common nodes in the forward reference node list Td and the reverse reference node list Tv, that is, the path network nodes on the topology restoration path. Let the set of path network nodes on the topology restoration path be set Ts, then Ts = Td ∩ Tv = [4, 5, 13, 15].

[0292] 4) Add the user-defined start and end network nodes to the path node list Ts to obtain all network nodes on the topology restoration path. Therefore, the set of all network nodes on the topology restoration path obtained in this example is [2,4,5,10,13,15].

[0293] Step S105: Display the obtained network node topology data to be restored in a graph, such as... Figure 9 As shown, after the numbering is completed, replace it with the corresponding network node name to obtain the network topology diagram.

[0294] Example 4

[0295] In this embodiment, it is readily understood by those skilled in the art that, for the implementation scenario where the user selects a starting node A, an ending node C, a transit node B, and a bypass node D, it is only necessary to implement the two scenarios of constraining the bypass node D from the starting node A to the transit node B and constraining the bypass node D from the transit node B to the ending node C respectively according to Embodiment 3 provided by the present invention, and finally deduplicating and merging the resulting restored nodes.

[0296] Example 5

[0297] For multiple sequentially passing nodes, such as the embodiment where the node passes through node B, node C, node D and then terminates at node E while detouring around node F, it is necessary to implement the following different scenarios according to Embodiment 3: constraining node F from starting node A to passing node B, constraining node F from passing node B to passing node C, constraining node F from passing node C to passing node D, and constraining node F from passing node D to termination at node E. Finally, the resulting network nodes are deduplicated and merged.

[0298] To implement the network connectivity restoration method described in Examples 1-5, Figure 1 This invention also provides an embodiment of a network connectivity restoration system, including a user control unit 1, a topology data conversion unit 2, a topology restoration search unit 3, and a data integration and display unit 4; wherein,

[0299] User control unit 1 is used to set the restoration mode and corresponding network parameters, and to control the interactive device or entry point for the topology restoration search unit to search for specific network nodes and display specific network connections. In this unit, the user can set the topology mode to be restored and the corresponding network parameters. This invention supports two restoration modes: Restoration Mode 1: Restores network connectivity for user-selected network nodes and a preset topology connection depth. In this mode, the topology connection depth controls the maximum number of nodes allowed on a single path connecting the selected network node to surrounding nodes. Restoration Mode 2: Restores network connectivity for user-selected start and end network nodes. In this mode, the user can also add bypass network nodes or necessary network nodes, or omit constraints on other network nodes.

[0300] Topology data conversion unit 2, the network node cross-dictionary, is used to acquire the original topology data and extract the topology information from the original topology data to convert it into a network node cross-dictionary; this prepares for the subsequent topology restoration search unit. The method for acquiring the original topology data can be by reading the original topology data stored in the network management system, or by importing the topology data through an external interface. Those skilled in the art should fully understand that the form of acquiring the original data is not limited in this invention, but there is a basic requirement for the acquired original topology data: the original topology data must at least record network nodes A and B for each network connection path that a computer can identify, as well as the connection direction between network nodes A and B, wherein each network node is allowed to include one or more ports providing network connections.

[0301] Topology restoration search unit 3 is used to perform a cyclic pruning query on the network node cross-dictionary in the topology data conversion unit according to the restoration mode and network parameters set by the user control unit, and provide network connectivity restoration data that satisfies the user options in the user control unit; when the cyclic search termination condition is met, topology restoration search unit 3 provides network connectivity restoration data that satisfies the user options in the user control unit 1. The information that can be obtained from the restoration data includes at least: network node identifiers, whether there is a connection relationship between network nodes, and the connection direction between network nodes that have a connection relationship. Among them, the connection direction includes: undirected, unidirectional, and bidirectional.

[0302] The data integration and display unit 4 is used to plot and display the restored data provided by the topology restoration search unit. Display unit 4 has dynamic refresh capability; when the system triggers a dynamic refresh command, it will plot and display the latest data.

[0303] Figure 2 An embodiment of a network connectivity restoration system according to the present invention is shown, the system further comprising a service data storage module 5 and a time interpolation data reconstruction unit 6; wherein,

[0304] User control unit 1, compared to Figure 1 It is also used to provide three dynamically adjustable parameters: the start and end time of business restoration, and the granularity of time restoration. The other three components and... Figure 1 The agreement is consistent and will not be elaborated upon here.

[0305] The business data storage module 5 is used to store business data that needs to be displayed in network connectivity restoration. The business data referred to in this module may include: network alarm data, network performance indicator data, network maintenance work order data, user perception data, log data, etc. The specific data stored is determined by the user applying this system. This storage module does not limit the type of data, but there is a basic requirement for the stored data: the stored data must at least contain the occurrence or end time of the business activity and network node records that can be recognized by the computer. It should be understood that the business data storage module 5 does not restrict the form in which business data is obtained. It can store raw data read from the network management system through a standardized interface, data obtained through hardware or software probes, or raw or secondary processed data imported from external storage media or the system.

[0306] The time interpolation data reconstruction unit 6 is used to complete the following data processing flow: receiving the restored data provided by the topology restoration search unit and three parameters—the start and end times of service restoration and the time restoration granularity—provided by the user control unit; extracting service data that simultaneously satisfies both constraint one and constraint two from the service data storage module, and quantizing the occurrence or end time of the extracted service data onto the time quantization scale T of the service restoration start and end times; then statistically summarizing the service content with the same time scale and the same network node identifier; constraint one is: the network node in the extracted service data belongs to the network node in the restored data; constraint two is: the service occurrence time is within the service restoration start and end time range. Here, the time quantization scale T is obtained by subtracting the restoration start and end time points with the time restoration granularity as the step size.

[0307] Furthermore, the present invention also provides an embodiment of a method for displaying network connectivity restoration data, comprising:

[0308] It receives the restored data and three parameters provided by the user control unit: the start and end time of the service restoration, and the time restoration granularity.

[0309] Extract business data that simultaneously satisfies both constraint one and constraint two, and quantize the occurrence or end time of the extracted business data onto the time quantization scale T of the business restoration start and end time. Constraint one is: the network nodes in the extracted business data belong to the network nodes in the restored data; constraint two is: the business occurrence time is within the business restoration start and end time range; statistically summarize the business content with the same time scale and the same network node identifier, and then display it as a graph.

[0310] The present invention also provides an embodiment of a method for displaying network connectivity restoration data, comprising: acquiring restoration data and a set topology depth parameter; extracting restoration data that meets the set topology depth from the restoration data for plotting and displaying.

[0311] The present invention also provides an embodiment of a method for displaying network connectivity restoration data, comprising: acquiring restoration data and setting start and end network nodes, and / or bypass nodes, and / or path nodes; extracting restoration data that meets the settings from the restoration data for plot display.

[0312] according to Figure 2 The system architecture diagram shown illustrates network connectivity restoration. This invention will significantly improve the user experience for business data analysis. The data types for business analysis can include: network alarm data, network performance indicator data, network maintenance work order data, user-perceived data, log data, etc. The specific data analyzed is determined by the user applying this system.

[0313] The restored data quickly obtained by the user through the topology restoration search unit 3, combined with the three parameters of service restoration start and end time and time restoration granularity provided by the user control unit 1, can extract service data from the service data storage module 5 that simultaneously meets the following conditions: 1) the network nodes in the service data belong to the network nodes in the restored data, and 2) the service occurrence time is within the service restoration start and end time range. Through the data processing of the time interpolation data reconstruction unit 6, the occurrence or end time of the extracted service data is quantized onto the time quantization scale T of the service restoration start and end time, and the service content with the same time scale and the same network node identifier is statistically summarized.

[0314] Figure 10An embodiment of the present invention provides a feature display interface combining business data after network topology reconstruction, comprising: display area 1 (7), display area 2 (8), and user settings area (9). The user settings area 9 can also be separated from the display areas into two different sub-interfaces to adapt to different display devices, such as display on small terminals like mobile phones. It is worth noting that the above figure is only a schematic diagram; those skilled in the art can easily derive various modified interfaces from the figure without creative effort. For example, a topology map with geographical information can be drawn in display area 1, or a dot-line diagram can be drawn in display area 2, or sliders 10 and 11 can be transformed into knobs, zoom in / out buttons, etc. In the user settings area, the user needs to set: the starting node of the network topology reconstruction, the type of business data, the start time of the business data, and the end time of the business data.

[0315] In the topology restoration flowchart provided by this invention, users can change the time granularity by adjusting the sliding position of slider 1 on the interface, thereby achieving statistical summarization of business data in different time intervals. Furthermore, users can also change the topology restoration depth by adjusting the sliding position of slider 11 on the interface, enabling real-time restoration of network node topology and real-time filtering of business data, significantly improving the user experience for locating faults and analyzing service quality. This simple idea and method of quickly and dynamically updating business data between different network nodes by adjusting the topology depth and time granularity falls within the scope of protection of this invention.

[0316] The embodiments described above are merely preferred embodiments of the present invention, and not an exhaustive list of all possible implementations of the present invention. Any obvious modifications made by those skilled in the art without departing from the principles and spirit of the present invention should be considered to be included within the scope of protection of the claims of the present invention.

Claims

1. A method for restoring network connectivity, characterized in that, include: Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes; Construct a network node cross-dictionary using the aforementioned topology information; Parse the user's topology restoration command, match the topology restoration mode, and perform a loop pruning query on the network node cross dictionary according to the user's preset network parameters; Based on the results of the cyclic pruning query, all network nodes on the topology restoration path are determined, and the extracted topology information is used to obtain the topology data of the network nodes that need to be restored.

2. The method for restoring network connectivity according to claim 1, characterized in that, After obtaining the network node topology data that needs to be restored, it also includes, The obtained network node topology data that needs to be restored is plotted and displayed to obtain a network restored topology diagram.

3. The method for restoring network connectivity according to claim 2, characterized in that, Before constructing the network node cross-reference dictionary, the following steps are also included: numbering the network nodes. The network nodes in the constructed network node cross-reference dictionary, the network nodes in the user-preset network parameters, and all network nodes on the topology restoration path are represented by numbers. When drawing a network topology diagram, the method also includes replacing the number with the corresponding network node name.

4. The method for restoring network connectivity according to claim 1, characterized in that, The original topology data records at least network nodes A and B for each network connection path, as well as the connection direction between network nodes A and B.

5. The method for restoring network connectivity according to claim 1, characterized in that, The network node cross-dictionary includes the network node and all the connection nodes connected to the network node.

6. The method for restoring network connectivity according to claim 1, characterized in that, The topology restoration mode includes restoration mode one and restoration mode two; in restoration mode one, the user-preset parameters include the starting network node and the topology depth; in restoration mode two, the user-preset parameters include at least two network nodes, the starting node and the ending node.

7. The method for restoring network connectivity according to claim 6, characterized in that, In restoration mode 2, user-preset parameters also include bypass nodes and / or path nodes.

8. The method for restoring network connectivity according to claim 6, characterized in that, If there are n path nodes, sort them in the order they appear, and break the entire restoration process into n+1 restoration processes. Then, after removing duplicates from all the network nodes obtained from the restoration processes, we get the restored network node list. The restoration process is as follows: the first restoration process uses path node 1 as the end node and treats the process from the start node to path node 1 as an independent restoration process; the second restoration process uses path node 1 as the start node and path node 2 as the end node and treats the process from path node 1 to path node 2 as an independent restoration process; the i-th restoration process uses path node i-1 as the start node and path node i as the end node and treats the process from path node i-1 to path node i as an independent restoration process; and the (n+1)-th restoration process uses path node n as the start node and treats the process from path node n to the end node as an independent restoration process.

9. The method for restoring network connectivity according to claim 6, characterized in that, The cyclic pruning query includes a forward join pruning query mode and a reverse join pruning query mode. Both the forward join pruning query pattern and the reverse join pruning query pattern include: First, the network node cross dictionary is searched using the list of network nodes to be queried. The connected nodes of each network node in the list of network nodes to be queried are queried to obtain the set of connected nodes, denoted as set E. Then, all network nodes in set E are deduplicated, and specific network nodes are pruned to obtain set E'; Finally, replace the network nodes in the list of network nodes to be queried with the network nodes in set E', and add the new network nodes found in this loop pruning query to the list of network nodes found in the cumulative query, thus completing the update of the list of network nodes to be queried and the list of network nodes found in the cumulative query.

10. The method for restoring network connectivity according to claim 9, characterized in that, The list of network nodes to be queried in the forward join pruning query pattern includes the initial network node from the initial input or the list of network nodes to be queried obtained from the previous forward join pruning query pattern loop. The specific network nodes in the forward join pruning query pattern include the network nodes in the cumulative list of network nodes retrieved in the previous forward join pruning query; when the current loop is the first forward join pruning query pattern, the cumulative list of network nodes retrieved in the previous forward join pruning query is empty.

11. The method for restoring network connectivity according to claim 9, characterized in that, The list of network nodes to be queried in the reverse join pruning query pattern includes the initial input termination network node or the list of network nodes to be queried obtained from the previous reverse join pruning query pattern loop. The specific network nodes in the reverse join pruning query pattern include the network nodes in the cumulative network node list T2 retrieved in the previous reverse join pruning query; when the current loop is the first reverse join pruning query pattern, the cumulative network node list retrieved in the previous reverse join pruning query is empty.

12. The method for restoring network connectivity according to claim 9, characterized in that, When the user sets bypass nodes, the specific network nodes in the reverse connection pruning query mode and / or forward connection pruning query mode also include bypass nodes.

13. The method for restoring network connectivity according to claim 9, characterized in that, In the restored mode, when performing loop pruning query using the forward join pruning query mode, the conditions for ending the forward loop include forward loop ending condition one and forward loop ending condition two. The forward loop ends when either of these conditions is met. The first condition for ending the forward loop is that the number of iterations using the forward join pruning query pattern is equal to the topology depth set by the user. The second condition for ending the positive loop is that the cumulative list of network nodes T2 contains all the network nodes in the current network.

14. The method for restoring network connectivity according to claim 9, characterized in that, In restoration mode 2, when performing loop pruning queries using the forward join pruning query mode, the forward loop ends if the third condition for ending the forward loop is met. The third condition for ending the forward loop is: in the forward join pruning query, the user-set termination node appears in the list of network nodes accumulated in the last forward query.

15. The method for restoring network connectivity according to claim 9, characterized in that, In restoration mode 2, when performing loop pruning queries using the reverse join pruning query mode, the reverse loop ends if the reverse loop termination condition is met. The reverse loop termination condition is: in the reverse join pruning query, the user-set starting node appears in the list of network nodes accumulated in the last reverse query.

16. The method for restoring network connectivity according to claim 9, characterized in that, When performing loop pruning queries using the forward join pruning query mode, the forward loop is forcibly terminated when the number of forward loop iterations equals the number of network nodes in the entire network node cross dictionary. When performing loop pruning queries using the reverse join pruning query mode, the reverse loop is forcibly terminated when the number of reverse loop iterations equals the number of network nodes in the entire network node cross dictionary.

17. The method for restoring network connectivity according to claim 9, characterized in that, In the restoration mode, all network nodes on the topology restoration path are determined. All network nodes on the topology restoration path are the list of network nodes queried in the last forward loop at the end of the forward loop.

18. The method for restoring network connectivity according to claim 9, characterized in that, In restoration mode two, determining all network nodes on the topology restoration path also includes: 1) Obtain the last positive query network node list Td1 and the last positive cumulative network node list Td2, and find the network nodes that belong to the last positive cumulative network list Td2 but not to the last positive query node list Td1, and obtain the positive reference node list Td. 2) Obtain the last reverse query network node list Tv1 and the last reverse cumulative network node list Tv2; find the network nodes that belong to the last reverse cumulative network list Tv2 but not to the last reverse query node list Tv1, and obtain the reverse reference node list Tv; 3) Take the common nodes from the forward reference node list Td and the reverse reference node list Tv, i.e., the path network nodes Ts on the topology restoration path; 4) Add the user-defined start and end network nodes to the path node list Ts, which are all network nodes on the topology restoration path.

19. A method for restoring network connectivity according to claim 18, characterized in that, When performing iterative pruning queries using the forward join pruning query pattern, the list of network nodes to be queried obtained from the last forward join pruning query update is the last forward query list Td1; the cumulative list of network nodes queried obtained from the last forward join pruning query update is the forward cumulative list Td2.

20. A method for restoring network connectivity according to claim 18, characterized in that, When performing a cyclic pruning query using the reverse join pruning query mode, the list of network nodes to be queried obtained by the last reverse join pruning query is the last reverse query list Tv1; the cumulative list of network nodes queried obtained by the last reverse join pruning query is the reverse cumulative list Tv2.

21. The method for restoring network connectivity according to claim 6, characterized in that, Based on user-preset network parameters, the network node cross-reference dictionary is pruned and iterated, and the process also includes: C101. Based on the parsed user topology restoration instruction, determine whether the reverse join pruning condition is met. If the result is yes, then perform the query using the reverse join pruning mode. If the result is no, then perform the query using the forward join pruning query mode. The reverse connection pruning condition is that both reverse condition one and reverse condition two are satisfied simultaneously; the reverse condition one is that the topology restoration mode is selected as restoration mode two; the reverse condition two is that the forward connection pruning loop process has ended. C102. Determine whether the loop pruning query meets the loop termination condition. If the result is yes, end the loop. If the result is no, return to step C101. The entire loop terminates when neither the forward nor reverse loop needs to be executed.

22. A system for restoring network connectivity, characterized in that, It includes a user control unit, a topology data conversion unit, a topology restoration and search unit, and a comprehensive data display unit; among which, The user control unit is used to set the restoration mode and corresponding network parameters, and to control the interactive device or entry point for the topology restoration search unit to search for specific network nodes and display specific network connections. The topology data conversion unit is used to acquire raw topology data and extract topology information from the raw topology data to convert it into a network node cross-dictionary. The topology restoration search unit is used to perform a cyclic pruning query on the network node cross dictionary in the topology data conversion unit according to the restoration mode and network parameters set by the user control unit, and to provide network connectivity restoration data that meets the user options in the user control unit. The data integration and display unit is used to plot and display the restored data provided by the topology restoration search unit.

23. The system for restoring network connectivity according to claim 22, characterized in that, It also includes a business data storage module and a time interpolation data reconstruction unit; among which, User control unit 1 is also used to provide three dynamically adjustable parameters: service restoration start and end time, and time restoration granularity. The business data storage module is used to store business data that needs to be displayed during network connectivity restoration; The time interpolation data reconstruction unit is used to receive the restored data provided by the topology restoration search unit and three parameters—the start and end times of service restoration and the time restoration granularity—provided by the user control unit. It is used to extract service data from the service data storage module that simultaneously satisfies both constraint one and constraint two, and to quantize the occurrence or end time of the extracted service data onto the time quantization scale T of the service restoration start and end times. Then, it statistically summarizes the service content with the same time scale and the same network node identifier. Constraint one is that the network node in the extracted service data belongs to the network node in the restored data; constraint two is that the service occurrence time is within the service restoration start and end time range.

24. The system for restoring network connectivity according to claim 23, characterized in that, The service data that needs to be displayed in the network connectivity restoration should include at least the service occurrence or end time and network node records.

25. The system for restoring network connectivity according to claim 23, characterized in that, The time quantization scale T is obtained by subtracting the start and end time points of the time restoration using the time restoration granularity as the step size.

26. A method for displaying network connectivity restoration data, characterized in that, include: It receives the restored data and three parameters provided by the user control unit: the start and end time of the service restoration, and the time restoration granularity. Extract business data that simultaneously satisfies both constraint one and constraint two, and quantize the occurrence or end time of the extracted business data onto the time quantization scale T of the business restoration start and end time; constraint one is: the network nodes in the extracted business data belong to the network nodes in the restored data; constraint two is: the business occurrence time is within the business restoration start and end time range; statistically summarize the business content with the same time scale and the same network node identifier, and then display it as a graph; The restored data is determined in the following way: Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes; Construct a network node cross-dictionary using the aforementioned topology information; Parse the user's topology restoration command, match the topology restoration mode, and perform a loop pruning query on the network node cross dictionary according to the user's preset network parameters; Based on the results of the cyclic pruning query, all network nodes on the topology restoration path are determined, and the extracted topology information is used to obtain the topology data of the network nodes that need to be restored.

27. A method for displaying network connectivity restoration data, characterized in that, include: Retrieve the restored data and the set topology depth parameters; Extract restored data that meets the set topology depth from the restored data and display it as a plot; The restored data is determined in the following way: Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes; Construct a network node cross-dictionary using the aforementioned topology information; Parse the user's topology restoration command, match the topology restoration mode, and perform a loop pruning query on the network node cross dictionary according to the user's preset network parameters; Based on the results of the cyclic pruning query, all network nodes on the topology restoration path are determined, and the extracted topology information is used to obtain the topology data of the network nodes that need to be restored.

28. A method for displaying network connectivity restoration data, characterized in that, include: Acquire the restored data and the set start and end network nodes, and / or bypass nodes, and / or path nodes; Extract restored data that meets the set conditions from the restored data and display it in a graph; The restored data is determined in the following way: Extract topology information from the original topology data; the topology information includes information on all network nodes, the connectivity and connection direction between different network nodes; Construct a network node cross-dictionary using the aforementioned topology information; Parse the user's topology restoration command, match the topology restoration mode, and perform a loop pruning query on the network node cross dictionary according to the user's preset network parameters; Based on the results of the cyclic pruning query, all network nodes on the topology restoration path are determined, and the extracted topology information is used to obtain the topology data of the network nodes that need to be restored.

Images