Network channel route checking method and device

Abstract

The embodiment of the invention provides a network channel routing checking method and device, and the method comprises the steps: constructing a directed graph according to a port directed connection relation in routing data, dividing a connected component through a graph algorithm, and carrying out the checking through an auditing rule of data dimensions, and rapidly and accurately detecting the connectivity and integrity of channel routing. In the checking process, the checking process does not depend on segment group sequence attributes in the routing data, and it is avoided that checking cannot be carried out due to the data quality of a shallow layer. And whether the channel bearing structure is complete or not can be checked according to the business channel dimension, all hierarchical channel routing abnormity auditing results can be quickly converged, and the business channels with abnormal converged auditing results can be secondarily checked, so that the accuracy and the reliability of the checking results are ensured, and manufacturers are helped to renovate data according to the business channel dimension and quickly take effects.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of data processing, in particular to a network routing verification method and device. BACKGROUND

[0002] The current OMC vendor reported channel hierarchical routing data is not completely reliable, and generally there will be one or several of the following problems: 1. The standby path is often not a complete path.

[0003] 2. The group number is not related to the topology arrangement.

[0004] 3. The direction may be incorrect.

[0005] 4. The route may not be complete.

[0006] The above problems will affect the accuracy and completeness of the channel concatenation and the application based on the routing analysis, such as the judgment result of the disconnection judgment, the alarm positioning, etc.

[0007] In order to ensure the accuracy and completeness of the channel concatenation and the accuracy of the application result based on the routing analysis, the routing data must be audited before the channel concatenation and application analysis, in order to prevent the missing data or redundant data from causing adverse effects on the channel concatenation restoration. After completing the audit, a comprehensive audit report needs to be generated and timely feedback to the OMC vendor, so as to promote the data rectification and optimization work of both parties, and thus improve the data quality.

[0008] The routing data verification is the core of verifying two key dimensions: one is the actual connectivity of the route, that is, whether the source end to the sink end can be concatenated according to the routing data; the other is the completeness of the routing structure, including whether the port, cross, topology, primary and backup protection and other structures are complete.

[0009] Two ways of checking routing in the prior art: 1. Based on the segment group sequence field order of the original reported routing segment data to perform routing audit, while the network management data has missing and inaccurate order problems, resulting in inaccurate audit results.

[0010] 2. The AZ port of the routing segment is used as a key-value pair, which can quickly detect whether the source end and the sink end are connected, but it highly depends on the accuracy of the routing segment direction, and cannot handle loops.

[0011] The above methods can only detect routing connectivity, but cannot find redundant branch nodes, and cannot further classify problems. Only the current level routing can be audited. It cannot be audited from the business channel dimension or aggregate all level routing audit results. SUMMARY

[0012] In view of the problems in the prior art, the application provides a network path routing verification method and device, which can quickly and accurately detect the connectivity and integrity of the path routing, and provide abnormal auditing results in the business path dimension, helping manufacturers to rectify data according to the business path dimension and quickly achieve results.

[0013] To solve at least one of the above problems, the application provides the following technical solutions: In a first aspect, the application provides a network path routing verification method, characterized in that the method comprises: Synchronizing port data and path data in the network to a graph database according to node types, and establishing connection relationships between ports and between paths, and bearing relationships between paths and paths; Obtaining hierarchical routing data of each path from the graph database, and auditing the connectivity of the hierarchical routing of each path based on the connected component characteristics in graph theory; if the connectivity of the hierarchical routing is normal, auditing the integrity of the hierarchical routing based on business characteristics, checking whether the routing meets the requirements of the business scenario; and recording abnormal result data of the auditing of the hierarchical routing of each path in the graph database; Obtaining path data of the business layer from the graph database, and auditing the path bearing structure of each business path according to the business bearing model and the path bearing relationship in the graph database, checking whether the path level in the bearing relationship is complete; and recording abnormal result data of the auditing of the business path in the graph database; Based on the path bearing relationship in the graph database, the abnormal result data of the hierarchical routing is aggregated to the path of the business layer; if the auditing result of the path bearing structure is normal and the aggregation result is empty, it is determined that the routing of the business path is normal; if the auditing result of the path bearing structure is normal and the aggregation result is not empty, the hierarchical routing data of the business path is audited again from two dimensions of the electrical layer routing and the optical layer routing, and if the result of the second auditing is normal, it is determined that the routing of the business path is normal; Output the auditing result of the hierarchical routing of each path and the routing data auditing result of the business path.

[0014] Further, the step of establishing the connection relationship between the ports and the bearing relationship between the paths comprises: According to the hierarchical routing data of the network, a directed connection relationship between the ports is established, and the properties of the hierarchical routing data are assigned to the connection relationship, and the relationship type is incrementally synchronized to the graph database; According to the hierarchical routing data of the network, a directed bearing relationship between the paths is established, and the relationship type is incrementally synchronized to the graph database.

[0015] Furthermore, prior to the step of auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory, the method further includes: Check if the hierarchical routing data is empty; If empty, the audit result for the hierarchical routing data is returned, indicating that the audit operation for the hierarchical routing data has been completed. If not empty, continue with the hierarchical routing connectivity audit operation.

[0016] Furthermore, the step of auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory also includes initializing the hierarchical routing data for each channel; the method for initializing the hierarchical routing data for each channel includes: Merge multiple ports in the source port group into one port; merge multiple ports in the destination port group into one port; Remove cascading crossovers; Remove the PTG protection structure according to the scenario, provided that removing the PTG does not change the shortest distance between each point in the graph and the source and destination endpoints.

[0017] Furthermore, the step of auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory includes: If the number of connected components in the hierarchical routing data is 1 and there are no breakpoints, then the audit result of the hierarchical routing data is normal. If the number of connected components in the hierarchical routing data is 1, but there are breakpoints, then the audit result of the hierarchical routing data being abnormal will be output. If the number of connected components in the hierarchical routing data is greater than 1, and there are multiple connected components with a number of nodes not equal to 1, then the audit result of hierarchical routing data abnormality will be output. If the number of connected components in the hierarchical routing data is greater than 1, and there is a connected component with 1 node, then the audit result of hierarchical routing data anomaly will be output.

[0018] Furthermore, the step of auditing the integrity of hierarchical routing based on business characteristics and checking whether the routing meets the requirements of the business scenario includes: For channels with two sources and two destinations, detect whether their forward and reverse paths are separated; For ODU, VC level, and specific network management channels, check whether all their routing segments have forward and reverse paths; For ODU, VC level and specific network management channels, check whether all their routing segments have primary and backup paths; For routes with cascading cross-channels, check whether all cascading cross-channels have forward and reverse paths.

[0019] Further, the step of auditing the channel carrying structure of each service channel according to the service carrying model and the channel carrying relationship in the graph database, checking whether the channel hierarchy in the carrying relationship is complete, comprises: Taking the service channel as the starting point and the channel carrying relationship as the edge, searching the carrying path of the service channel; Obtaining all the nodes passed by the carrying path and extracting the channel hierarchy; Judging whether the extracted channel hierarchy covers the channel hierarchy in the service carrying model; if yes, the channel hierarchy is complete.

[0020] Further, the step of converging the abnormal result data of the hierarchical routing from top to bottom to the service layer channel based on the channel carrying relationship in the graph database, comprises: Obtaining the hierarchical channel ID related to the service channel according to the channel carrying relationship in the graph database; Querying the auditing result table of each hierarchical routing according to the hierarchical channel ID; Summarizing the abnormal result of each hierarchical routing to the service layer channel as the auditing result of the service layer channel.

[0021] Further, the step of performing secondary auditing on the hierarchical routing data of the service channel from two dimensions of the electrical layer routing and the optical layer routing, comprises: Taking the service channel as the starting point and the channel carrying relationship as the edge, searching the carrying path of the service channel using a graph search algorithm; when a channel hierarchy is OCH hierarchy, the search is terminated and the current path is returned; After removing the duplicate processing of all channel IDs in the searched path, a set is formed, and the hierarchical routing data of each channel is queried according to the set of de-duplicated channel IDs, and the hierarchical routing data of each channel is converged to obtain service electrical layer routing data; the connectivity and integrity of the hierarchical routing of each channel in the service electrical layer routing data are audited; Based on the service electrical layer routing data, the OCH channel ID in the routing is extracted; after the hierarchical routing of each OCH channel is converged, the service optical layer routing data is obtained; the connectivity and integrity of the hierarchical routing of each channel in the service optical layer routing data are audited; The auditing result data of the service electrical layer routing data and the service optical layer routing data is converged to the service channel as the result of the routing data auditing of the service channel.

[0022] In a second aspect, the application provides a network channel routing verification device, comprising: A data transfer module is configured to synchronize port data and channel data in a network to a graph database in a node type, and establish a connection relationship between ports and a carrying relationship between channels. The first detection module is configured to acquire the hierarchical routing data of each channel from the graph database, and to audit the connectivity of the hierarchical routing of each channel based on the connected component property in graph theory; if the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on the service property to check whether the routing meets the requirements of the service scenario; and the abnormal result data of the audit of the hierarchical routing of each channel is recorded in the graph database. The second detection module is configured to acquire the channel data of the service layer from the graph database, and to audit the channel bearing structure of each service channel according to the channel bearing relationship between the service bearing model and the graph database to check whether the channel hierarchy in the bearing relationship is complete; and the abnormal result data of the audit of the service channel is recorded in the graph database. The third detection module is configured to aggregate the abnormal result data of the audit of the hierarchical routing to the channel of the service layer based on the channel bearing relationship in the graph database; if the audit result of the channel bearing structure is normal and the aggregation result is empty, it is determined that the routing of the service channel is normal; if the audit result of the channel bearing structure is normal and the aggregation result is not empty, the hierarchical routing data of the service channel is audited again from the two dimensions of the electrical layer routing and the optical layer routing, and if the result of the second audit is normal, it is determined that the routing of the service channel is normal. The result output module is configured to output the audit result of the hierarchical routing of each channel and the routing data audit result of the service channel.

[0023] In a third aspect, the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the network channel routing verification method.

[0024] In a fourth aspect, the present application provides a computer readable storage medium, which stores a computer program, wherein the computer program is executed by a processor to implement the steps of the network channel routing verification method.

[0025] In a fifth aspect, the present application provides a computer program product, comprising computer programs / instructions, wherein the computer programs / instructions are executed by a processor to implement the steps of the network channel routing verification method.

[0026] According to the technical solution, the application provides a network path routing verification method and device. The method constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph algorithm to divide a connected component, and verifies the data dimension according to a verification rule, so that the connectivity and integrity of the network path routing can be quickly and accurately detected. In the verification process, the segment group sequence attribute in the routing data is not relied on, so that the data quality at a shallow level does not affect the verification. According to the business channel dimension, whether the channel bearing structure is complete can be verified, all layered network path routing abnormal verification results can be quickly aggregated, and the business channel with the aggregated verification result is abnormal is subjected to secondary verification, so that the accuracy and reliability of the verification result are ensured, and the data is rectified according to the business channel dimension to quickly achieve the effect. BRIEF DESCRIPTION OF DRAWINGS

[0027] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the drawings needed to be used in the embodiments or the prior art description will be briefly introduced. Obviously, the drawings in the following description are some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative labor.

[0028] Figure 1 One of the flowcharts of the network path routing verification method in the embodiments of the application; Figure 2 The second flowchart of the network path routing verification method in the embodiments of the application; Figure 3 The data synchronization schematic diagram of the network path routing verification method in the embodiments of the application; Figure 4 The single-channel layered routing data verification sub-flow process flowchart of the network path routing verification method in the embodiments of the application; Figure 5 The port merging operation schematic diagram in the data initialization processing of the network path routing verification method in the embodiments of the application; Figure 6 The remove cascade cross operation schematic diagram in the data initialization processing of the network path routing verification method in the embodiments of the application; Figure 7 The remove PTG protection structure operation schematic diagram in the data initialization processing of the network path routing verification method in the embodiments of the application; Figure 8 The routing connectivity check in the network path routing verification method in the embodiments of the application; Figure 9 The routing connectivity check in the network path routing verification method in the embodiments of the application; Figure 10 Example 2 of a route pattern with a broken route in the route connectivity check of the network access route verification method in the embodiments of the present application; Figure 11 Example of a route pattern with a disconnected route in the route connectivity check of the network access route verification method in the embodiments of the present application; Figure 12 Example of a route pattern with an isolated point in the route connectivity check of the network access route verification method in the embodiments of the present application; Figure 13 Example of a two-source two-destination route pattern in the route integrity check of the network access route verification method in the embodiments of the present application; Figure 14 Example of a route pattern meeting audit rule 2 in the route integrity check of the network access route verification method in the embodiments of the present application; Figure 15 Example of a route pattern meeting audit rule 3 in the route integrity check of the network access route verification method in the embodiments of the present application; Figure 16 Example of a route pattern meeting audit rule 4 in the route integrity check of the network access route verification method in the embodiments of the present application; Figure 17 Schematic diagram of abnormal results of service layer channel aggregation hierarchical route audit of the network access route verification method in the embodiments of the present application; Figure 18 Structural diagram of the network access route verification device in the embodiments of the present application; Figure 19 Structural schematic diagram of the electronic device in the embodiments of the present application.

[0029] Reference numerals: Electronic device 9600, central processor 9100, memory 9140, communication module 9110, input unit 9120, audio processor 9130, display 9160, power supply 9170, buffer memory 9141, application / function storage unit 9142, data storage unit 9143, driver program storage unit 9144, antenna 9111, speaker 9131, microphone 9132. DETAILED DESCRIPTION

[0030] To make the purposes, technical solutions, and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some but not all of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0031] The acquisition, storage, use, processing, and the like of data in the technical solutions of the present application comply with relevant provisions of national laws and regulations.

[0032] Term explanation: Channel: refers to a service line. It is a path for transmitting information.

[0033] Channel route: usually refers to a single-layer route of a certain layer channel, is composed of multiple route segments, and is a specific route for information transmission. The key attributes of route segment data are: A-end network element ID, A-end port ID, Z-end network element ID, Z-end port ID, segment number, group number, sequence number, master / standby identifier (master, standby), direction (forward, reverse), whether bidirectional (unidirectional, bidirectional), route segment type (cross, topology, cascaded cross, PTG), and sub-channel ID.

[0034] Channel level: Customer information layer: carries actual user services, such as Ethernet, IP, and the like.

[0035] Virtual container (VC) layer: including VC-12, VC-3, VC-4, and the like, used for adapting and multiplexing customer signals.

[0036] Optical channel data unit (ODUk): such as ODUk (k = 0, 1, 2, 3, 4), used for encapsulating and processing service signals of different rates and formats, and providing functions such as multiplexing, cross-connection, and protection.

[0037] Regeneration section (RS): responsible for regenerating and amplifying optical signals between two regenerative repeaters.

[0038] Multiplexing section (MS): used for processing related functions of multiple channels multiplexed together, such as monitoring and maintenance.

[0039] Optical channel layer (OCH): directly carries customer service signals and is a transparent transmission channel in an optical network.

[0040] Optical multiplexing section layer (OMS): responsible for multiplexing and transmitting multiple optical channels.

[0041] Optical transmission section layer (OTS): mainly processes the transmission of optical signals on a physical medium (such as an optical fiber).

[0042] Adjacency list: An adjacency list is an efficient way to represent graph structures, especially suitable for sparse graphs. It describes the connection of a graph by maintaining a list of adjacent nodes for each node.

[0043] Connected component: A connected component is a fundamental concept in graph theory that describes the connectivity properties of a graph. It refers to the largest subgraph of a graph in which any two nodes are connected by a path.

[0044] PTG protection: PTG protection is a path trace protection mechanism in optical transport networks, mainly used to ensure end-to-end monitorability and fast protection switching of service paths.

[0045] Cascade cross: Cascade cross is a cross connection of ordinary cross or VC12 routing segment in this specific layout.

[0046] In view of the problems in the prior art, the present application provides a network path routing verification method and device, which constructs a directed graph according to the port directed connection relationship in the routing data, uses graph algorithm to divide connected components and verify the data dimension audit rules, and quickly and accurately detects the connectivity and integrity of the path routing. In the verification process, it does not depend on the segment group sequence attribute in the routing data, avoiding the shallow data quality leading to the failure of verification. And it can quickly converge all hierarchical path routing abnormal audit results according to the business channel dimension, helping manufacturers to rectify data according to the business channel dimension, and quickly achieve results.

[0047] In order to quickly and accurately detect the connectivity and integrity of the path routing, and provide abnormal audit results of the business channel dimension, help manufacturers to rectify data according to the business channel dimension, and quickly achieve results, the present application provides an embodiment of a network path routing verification method. Specifically, refer to Figure 1 and Figure 2 , the network path routing verification method comprises the following contents: Step S101: Synchronize the port data and channel data in the network to the graph database as node types, and establish the connection relationship between the ports and the ports, and the bearing relationship between the channels and the channels.

[0048] Referring to Figure 3 , in this embodiment, the specific steps of synchronizing data to the database include: 1. Enter the port: synchronize the port data in the network to the graph database as node type, incrementally.

[0049] 2. Enter the channel: synchronize the channel data in the network to the graph database as node type, incrementally.

[0050] 3. Record the hierarchical routing of the channel: according to the hierarchical routing data of the channel in the network, establish the directional connection relationship between the ports and the ports, and assign the hierarchical routing data to the connection relationship, and incrementally synchronize to the graph database in the relationship type.

[0051] 4. Record the channel carrying relationship: according to the channel routing data in the network, establish the directional carrying relationship between the channels and the channels, and incrementally synchronize to the graph database in the relationship type.

[0052] The network channel routing verification method provided by the embodiment uses a graph database to access hierarchical routing and channel carrying relationship data, treats channels as node objects, and maintains the connection relationship between ports and ports and the carrying relationship between channels and channels when saving routing data to the graph database. With these relationship data, the query efficiency is very fast when finding the carrying relationship from the top channel to the bottom channel of any level and aggregating hierarchical routing.

[0053] Step S102: Obtain the hierarchical routing data of each channel from the graph database, and audit the connectivity of the hierarchical routing of each channel based on the connected component characteristics in graph theory; if the connectivity of the hierarchical routing is normal, audit the integrity of the hierarchical routing based on the business characteristics, and check whether the routing meets the requirements of the business scenario; and record the abnormal result data of the audit of the hierarchical routing of each channel in the graph database.

[0054] Reference Figure 4 In the embodiment, the main steps of the hierarchical routing data audit are as follows: 1. Batch obtain the channel and channel hierarchical routing data from the graph database.

[0055] 2. Multi-thread concurrent execution of the "single channel hierarchical routing data audit" sub-process processing.

[0056] 3. Record the hierarchical routing audit result to the graph database.

[0057] Optionally, the specific steps of the "single channel hierarchical routing data audit" sub-process are as follows: I. Input the channel and channel hierarchical routing data.

[0058] II. Judge the hierarchical routing data. If it is empty, the sub-process returns the audit result (the routing data is empty), and the sub-process is executed. If it is not empty, continue to execute.

[0059] The embodiment ensures the existence of the path itself by judging the empty as a preliminary verification of the routing data.

[0060] III. Audit the connectivity of the routing and the integrity on the routing topology based on the connected component of graph theory: 1. Data initialization processing: a. Merge multiple ports in source port group into one. Merge multiple ports in destination port group into one port (refer to Figure 5 ; legend: 1, circle represents port, number in circle is used to distinguish different ports. Blue port represents source and destination port. Port 0, port 1 is source port. Port 10 is destination port. 2, rounded rectangle represents network element. 3, color of line segment: blue represents primary, green represents backup).

[0061] b. Remove cascading cross (refer to Figure 6 ).

[0062] c. Remove PTG protection structure according to scenario, provided that removing PTG will not cause the shortest distance between each point in the graph and the source and destination point to change (refer to Figure 7 ; PTG between port 8 and port 9 in the graph is not removed because it will affect the connectivity of the graph (the shortest distance between port 9 and port 10 changes)).

[0063] This embodiment reduces the complexity of routing by performing data initialization processing on routing data before using connected components to determine routing connectivity.

[0064] 2. Construct adjacency list according to routing data, and use graph search algorithm to divide connected components.

[0065] 3. Determine the connectivity of the routing according to the connected components and the adjacency list. Note: The data used to construct the adjacency list here is the original routing data before initialization processing (without port merging, without removing cascading cross and PTG). There are four cases for the connectivity determination result of the routing: normal, breakpoint, segment, and isolated point. The following examples are illustrated in combination with routing graph examples, and the legend does not include graph elements.

[0066] a. Normal: the number of connected components is equal to 1, and there is no breakpoint. The output routing is normal (refer to Figure 8 ).

[0067] b. Breakpoint: the number of connected components is equal to 1, but there is a breakpoint. The output routing exception type is breakpoint (refer to Figure 9 and Figure 10 ; port 11 in Figure 9 is a breakpoint;the breakpoint between endpoint 5 and endpoint 7). Figure 10

[0068] c. The number of connected components is greater than 1, and there are multiple segment nodes with a number of connected components not equal to 1. The output routing exception type is segment (refer to Figure 11Figure 1 shows the routing graph of the network. The legend explains that the part enclosed by the red box is connected component 1. The part enclosed by the blue box is connected component 2. The number of connected components in the routing graph is 2.

[0069] d. The number of connected components is greater than 1, and there is a connected component with 1 node. Output the routing exception type; free point (reference Figure 12 Figure 2 shows the routing graph of the network. The legend explains that the part enclosed by the red box is connected component 1. The part enclosed by the blue box is connected component 2 and connected component 3. The number of connected components in the routing graph is 3. The number of nodes in connected components 2 and 3 is 1.

[0070] Four, whether the connectivity of the routing is normal, if normal, continue to execute, if abnormal, output the routing exception type (free, breakpoint, segment), return the audit result, and the sub-process is executed.

[0071] Five, when the routing passes the connectivity test, the audit result is normal, different integrity audit rules can be selected according to different network management scenarios and different channel levels to judge the routing loss (routing business structure integrity) to determine whether the routing is complete.

[0072] a. Audit rule 1: For two-source and two-destination channels, detect whether the forward and reverse paths are separated. (Source 1 to destination 1 is the forward path, and source 2 to destination 2 is the reverse path) (reference Figure 13 Figure 3 shows the routing graph of the network. The legend explains that source 1 is port 1 and destination 1 is port 10. Source 2 is port 0 and destination 2 is port 11.

[0073] b. Audit rule 2: For ODU, VC level and specific network management channels, detect whether all routing segments have forward and reverse paths (reference Figure 14 Figure 4 shows the routing graph of the network. The legend explains that the blue line segment is the primary path, and the green line segment is the backup path. The specific network management refers to the network management system (NMS) responsible for managing and monitoring specific network levels such as ODU and VC levels.

[0074] c. Audit rule 3: For ODU, VC level and specific network management channels, detect whether all routing segments have primary and backup paths (reference Figure 15 Figure 5 shows the routing graph of the network. The legend explains that the blue line segment is the primary path, and the green line segment is the backup path.

[0075] d. Audit rule 4: For channels with cascading cross routing, detect whether all cascading cross routing segments have forward and reverse paths (reference Figure 16 Figure 6 shows the routing graph of the network. The legend explains that the blue line segment is the primary path, the green line segment is the backup path, and the orange line segment is the cascading cross.

[0076] The judgment of the above auditing rules only needs to be based on pure data dimension auditing, and does not need to be judged by graph algorithm search, because the passable connectivity test has been passed through the passable route. In addition, the above auditing rules can be added according to the business scene demand, and can be used in combination.

[0077] Six, the channel layered routing data auditing result is abnormal data entry into the graph library.

[0078] In this embodiment, a linked list is created for each node to store other nodes directly connected to the node. When constructing, each edge in the routing network, that is, the connection between nodes, is traversed, and the adjacency list of the corresponding node is updated to form a complete graph structure. In a graph, if there is a group of nodes, each two nodes in the group are path-reachable, and these nodes have no connection relationship with other nodes in the graph, then the group of nodes is a connected component. If all nodes in the graph can reach each other through some paths, the graph is connected. If there are multiple such components, the graph is not connected. The process of judging routing connectivity based on the adjacency list is essentially to find all connected components and check whether two nodes are in the same connected component.

[0079] Optionally, in this embodiment, the method for constructing an adjacency list according to routing data and dividing connected components using a graph search algorithm includes: Method 1: For each node, a flag is set to indicate whether it has been visited.

[0080] DFS traversal is performed from any unvisited node in the graph. Each time a node is visited, the adjacent nodes of the node are recursively visited and marked as visited.

[0081] Each time a new DFS is started from an unvisited node, it means that a new connected component is found. Through the traversal of DFS, all nodes that can be reached from the starting node are marked as the same connected component.

[0082] For any two nodes, if they belong to the same connected component, it means that there is a path between the two nodes, that is, they are connected; otherwise, they are not in the same connected component and are not connected.

[0083] Method 2: Each node is set to an unvisited state.

[0084] From any unvisited node, a queue is used to manage the nodes to be visited, and the source node is put into the queue.

[0085] Access the nodes adjacent to the current node in the order of the nodes in the queue one by one, and add these nodes to the queue.

[0086] When the BFS traversal starts each time, if the queue is empty, it indicates that a new connected component is found.

[0087] For any two nodes, if they are in the same connected component, it indicates that there is a path between the two nodes, and the nodes are connected; otherwise, the nodes are not connected.

[0088] The network routing verification method provided in the embodiment splits the hierarchical routing auditing process into two steps. In step one, the connectivity and structural integrity of the routing are detected using the graph theory connected component. Using the graph search method, the routing structure can be connected and restored according to the port connection relationship, and the problem that the routing verification is not accurate due to the low quality of the routing data is solved. In step two, under the premise that the routing connectivity verification is passed, the completeness of the routing is audited according to the routing service characteristics in the pure data dimension. The efficiency is extremely high, the implementation difficulty of the verification rule is low, and the verification details are rich. In addition, the two-step processing has the advantages that the graph algorithm search process does not need to be performed according to different verification data attributes, which reduces the processing difficulty and improves the efficiency.

[0089] Moreover, when the connectivity and structural integrity of the routing are detected, the graph algorithm is used to divide the connected component, the connectivity of the routing is judged based on the connected component, which is simple, easy to understand and high in processing efficiency. The routing complexity is reduced by performing the data initialization processing operation on the routing data, and the calculation efficiency of the graph connected component is improved.

[0090] Step S103: Obtain the channel data of the service layer from the graph database, and audit the channel bearing structure of each service channel according to the channel bearing relationship between the service bearing model and the channel in the graph database, check whether the channel level in the bearing relationship is complete, and record the abnormal result data of the service channel in the graph database.

[0091] Reference Figure 17 In the embodiment, the specific steps of the service layer routing data auditing are as follows: The specific steps of the service layer routing data auditing are as follows: The business layer channel data is obtained from the graph database. According to the channel bearing relationship in the business bearing model and the graph database, the channel bearing structure of each business channel is judged, and whether the channel level in the bearing relationship is complete is verified. If not, the audit result of the business channel will be marked as missing channel bearing structure, and the missing channel level will be marked. The step of judging the completeness of the channel bearing structure of the business layer channel based on the channel bearing relationship in the graph database includes: taking the business channel as the starting point and the channel bearing relationship as the edge, searching the bearing path of the business channel. Analyzing all the nodes (i.e. channels) passed by the bearing path, and extracting the channel level. Combined with the business bearing model, it is judged whether the channel level contained in the bearing path is covered. If so, the channel bearing result is complete. Commonly, the channel level under the ETH / EOO business bearing model should include FDFR, ETH, ODU, OTU, OCH, OMS, OTS; commonly, the channel level under the OTN / DWDM business bearing model should include Client, ODU, OTU, OCH, OMS, OTS; and so on. The channel level contained in these business models can be configured and adjusted according to actual conditions.

[0092] Step S104: Based on the channel bearing relationship in the graph database, the audit abnormal result data of the hierarchical routing is converged to the business layer channel; if the audit result of the channel bearing structure is normal and the convergence result is empty, it is determined that the routing of the business channel is normal; if the audit result of the channel bearing structure is normal and the convergence result is not empty, the hierarchical routing data of the business channel is secondarily audited from the two dimensions of electrical layer routing and optical layer routing, and if the secondary audit result is normal, it is determined that the routing of the business channel is normal.

[0093] Optionally, in the embodiment, based on the channel bearing relationship in the graph database, the hierarchical routing data audit result of the second step is converged to the business layer routing data audit result. If the convergence result is empty and the audit result of the channel bearing structure of the second step is normal, it indicates that the routing of the business channel is normal. If there is data converged to the hierarchical routing data audit result, secondary verification of the routing data of the business channel is needed. The routing data of the business channel is multiplexed according to the business electrical layer routing and optical layer routing two dimensions, and the hierarchical routing audit method and rule is used to perform secondary verification on the two types of routing data. If the secondary verification result is normal, the routing of the business channel is normal. If the verification result is abnormal, the final verification result of the business channel will also include the abnormal item of the hierarchical channel.

[0094] The step of quickly converging the hierarchical routing audit result to the business layer channel based on the channel bearing relationship in the graph database includes: Using the business channel ID, query the channel carrying relationship in the graph library to obtain the relevant layered channel ID. Based on the layered channel ID, query the layered routing audit result table and save the layered routing audit exception results as a reference for the audit results of the business layer channels.

[0095] The step of performing a secondary verification of the routing data for a service channel with abnormal aggregation results includes: Starting with the service channel and using channel carrying relationships as edges, a graph search algorithm is used to search for the carrying path of that service channel. The search terminates when a channel at the OCH level is encountered, and the current path (excluding OCH channels) is returned. All channel IDs in the searched path are deduplicated and grouped into a set. Based on this deduplicated set of channel IDs, hierarchical routing data is queried and aggregated to obtain the service electrical layer routing. Based on this service electrical layer routing data, the "Hierarchical Routing Audit Methods and Rules" are reused to perform a secondary verification of the routing data.

[0096] The OCH channel IDs recorded in the service electrical layer routing data are extracted. Then, hierarchical routing aggregation is performed on each OCH channel, converging to the TPL level. For these converged optical layer routes, the "Hierarchical Routing Audit Method and Rules" are reused for secondary verification. Simultaneously, the verification results are aggregated into the service channel as the result of the service channel routing data audit.

[0097] Depend on Figure 17 It can be seen that the audit results of the business channels should include audit anomalies in channel A1, channel B1, channel B2, and channel B3.

[0098] Optionally, based on the channel carrying relationship in the graph database, the steps of aggregating audit anomaly results data from top to bottom to the business layer channel include: using the business channel ID, querying the graph database channel carrying relationship to obtain the relevant layered channel ID, querying the layered routing audit result table according to the layered channel ID, and saving the layered routing audit anomaly results as a reference for the audit results of the business layer channel.

[0099] The network channel routing verification method provided in this embodiment innovatively uses a graph database to manage channel bearer relationships and store the results of hierarchical audit anomalies. It can also verify the integrity of the channel bearer structure according to the business channel dimension. Leveraging the efficient association characteristics of the graph database, it can quickly aggregate hierarchical routing audit results in real time, ensuring high data freshness. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the results. For business channels with empty aggregated results and normal bearer structures, a secondary verification is unnecessary, reducing workload and improving verification efficiency.

[0100] Step S105: output the audit result of each channel layered routing and the routing data audit result of the service channel.

[0101] In this embodiment, the layered routing audit result and the service layer routing audit result are converged and output. The output methods include, but are not limited to, front page table display, audit report file export, audit result statistics, etc.

[0102] The abnormal routing audit result is generally divided into: Routing does not exist: that is, the routing data does not exist.

[0103] Breakpoint: there is only one connected component, but there is a breakpoint.

[0104] Segment: the number of connected components is greater than 1, and there are multiple connected component nodes, all of which are greater than 1.

[0105] Free point: except for a connected component containing the source and sink ends, the number of nodes contained in the remaining connected components is 1.

[0106] Routing loss: output the detailed information of the missing routing between two nodes according to the rules.

[0107] The network channel routing verification method provided in this embodiment uses a graph database to store channel and routing data. The channel is entered into the graph database as a node, and according to the routing information, the directed connection between ports and the bearing relationship between channels are constructed, and the data is stored in the graph database. When performing layered routing data audit, the channel and routing data are batched from the graph database, and the multi-thread concurrent processing of the "layered routing data audit sub-process" is performed, and the "layered routing data audit sub-process" audit result is stored in the graph database. When performing service layer routing data audit, based on the channel bearing relationship in the graph database, the layered routing data audit abnormal result is quickly converged from top to bottom as the service layer routing data audit result. Finally, the layered routing data audit result and the service layer routing data audit result are output together into a report. Among them, the layered routing data audit uses graph theory connected components to judge the connectivity of the routing and the completeness on the topological structure. When the channel routing passes the connectivity test, the audit result is normal, then different completeness audit rules are selected according to the service scene characteristics to judge the routing loss, and whether the channel routing is complete on the service networking structure is judged.

[0108] The network path routing verification method provided by the embodiment can construct a directed graph according to the port directed connection relationship in the routing data, use a graph algorithm to divide a connected component and verify the data dimension auditing rule, and quickly and accurately detect the connectivity and integrity of the path routing. In the verification process, the segment group sequence attribute in the routing data is not relied on, and the verification cannot be performed due to the shallow data quality. In addition, whether the path carrying structure of the business channel dimension is complete can be verified, all layered path routing abnormality verification results can be quickly aggregated, the business channel with the aggregated verification result being abnormal can be subjected to secondary verification, the accuracy and reliability of the verification result can be ensured, and the data can be rectified according to the business channel dimension to quickly achieve the effect.

[0109] In order to quickly and accurately detect the connectivity and integrity of the path routing, provide the abnormality verification result of the business channel dimension, help the manufacturer rectify the data according to the business channel dimension, and quickly achieve the effect, the present application provides an embodiment of a network path routing verification device for implementing all or part of the content of the network path routing verification method, as shown in Figure 18 The network path routing verification device specifically includes the following content: The data transfer module 100 is configured to synchronize the port data and the channel data in the network to the graph database in the node type, establish the connection relationship between the ports and the connection relationship between the channels, and establish the carrying relationship between the channels and the channels. The first detection module 200 is configured to obtain the layered routing data of each channel from the graph database, and perform auditing on the connectivity of the layered routing of each channel based on the connected component characteristics in the graph theory. If the connectivity of the layered routing is normal, the integrity of the layered routing is audited based on the business characteristics, and whether the routing meets the requirements of the business scenario is checked. The abnormality verification result data of the layered routing of each channel is recorded in the graph database. The second detection module 300 obtains the channel data of the business layer from the graph database, and performs auditing on the channel carrying structure of each business channel according to the business carrying model and the channel carrying relationship in the graph database, and checks whether the channel level in the carrying relationship is complete. The abnormality verification result data of the business channel is recorded in the graph database. The third detection module 400 is configured to aggregate the abnormality verification result data of the layered routing to the business layer channel based on the channel carrying relationship in the graph database. If the abnormality verification result of the channel carrying structure is normal and the aggregation result is empty, it is determined that the routing of the business channel is normal. If the abnormality verification result of the channel carrying structure is normal and the aggregation result is not empty, the layered routing data of the business channel is subjected to secondary auditing from the electrical layer routing and the optical layer routing, and if the secondary auditing result is normal, it is determined that the routing of the business channel is normal. The result output module 500 is configured to output the abnormality verification result of the layered routing of each channel and the routing data auditing result of the business channel.

[0110] From the above description, the network path routing verification device provided by the embodiments of the present application can construct a directed graph according to the port directed connection relationship in the routing data, use a graph algorithm to divide a connected component, and verify the data dimension using a review rule, so as to quickly and accurately detect the connectivity and integrity of the path routing. In the verification process, the segment group sequence attribute in the routing data is not relied on, so as to avoid that the data quality at a shallow level causes the verification to be unable to be performed. In addition, whether the channel carrying structure of a business channel is complete can be verified according to the business channel dimension, all layered path routing abnormal review results can be quickly aggregated, and a secondary verification can be performed on a business channel with an aggregated review result being abnormal, so as to ensure the accuracy and reliability of the verification result, help manufacturers rectify data according to the business channel dimension, and quickly achieve results.

[0111] From the hardware level, in order to quickly and accurately detect the connectivity and integrity of the path routing, provide an abnormal review result of the business channel dimension, help manufacturers rectify data according to the business channel dimension, and quickly achieve results, the present application provides an embodiment of an electronic device for implementing all or part of the contents of the network path routing verification method, and the electronic device specifically includes the following contents: A processor, a memory, a communications interface, and a bus; wherein the processor, the memory, and the communications interface complete mutual communication through the bus; the communications interface is used for realizing information transmission between the network path routing verification device and a core business system, a user terminal, and related databases and related devices; the logic controller can be a desktop computer, a tablet computer, a mobile terminal, and the like, and the embodiments are not limited thereto. In the embodiments, the logic controller can be implemented by referring to the embodiments of the network path routing verification method and the embodiments of the network path routing verification device, the contents of which are incorporated herein, and repeated descriptions are not repeated.

[0112] It can be understood that the user terminal can include a smart phone, a tablet electronic device, a network set-top box, a portable computer, a desktop computer, a personal digital assistant (PDA), a vehicle-mounted device, a smart wearable device, and the like. The smart wearable device can include smart glasses, a smart watch, a smart bracelet, and the like.

[0113] In actual applications, part of the network path routing verification method can be executed on the electronic device as described above, or all operations can be completed in the client device. Specifically, the selection can be made according to the processing capability of the client device and the limitation of the user use scenario, and the present application is not limited thereto. If all operations are completed in the client device, the client device can further include a processor.

[0114] The client device described above can have a communication module (i.e., a communication unit) that can be communicatively connected to a remote server to achieve data transmission with the server. The server can include a server of a task scheduling center side, and in other implementation scenarios, can also include a server of an intermediate platform, such as a server of a third-party server platform that is communicatively linked to the server of the task scheduling center. The server can include a single computer device, or can include a server cluster composed of multiple servers, or a server structure of a distributed device.

[0115] Figure 19 A schematic block diagram of a system configuration of an electronic device 9600 according to an embodiment of the present application is shown in FIG. 9. As shown in the figure, the electronic device 9600 can include a central processor 9100 and a memory 9140; the memory 9140 is coupled to the central processor 9100. It is worth noting that the structure shown in the figure is exemplary; other types of structures can also be used to supplement or replace the structure to achieve telecommunication functions or other functions. Figure 19 Figure 19 The structure shown in the figure is exemplary; other types of structures can also be used to supplement or replace the structure to achieve telecommunication functions or other functions.

[0116] In an embodiment, the network path routing verification method function can be integrated into the central processor 9100. The central processor 9100 can be configured to perform the following controls: Step S101: Synchronize the port data and channel data in the network to the graph database in the node type, and establish the connection relationship between the ports and the connection relationship between the channels; Step S102: Obtain the hierarchical routing data of each channel from the graph database, and based on the connected component characteristics in graph theory, audit the connectivity of the hierarchical routing of each channel; if the connectivity of the hierarchical routing is normal, based on the service characteristics, audit the integrity of the hierarchical routing, check whether the routing meets the requirements of the service scenario; record the abnormal result data of the audit of the hierarchical routing of each channel in the graph database; Step S103: Obtain the channel data of the service layer from the graph database, and according to the channel bearing relationship in the graph database, audit the channel bearing structure of each service channel, check whether the channel level in the bearing relationship is complete; record the abnormal result data of the audit of the service channel in the graph database; Step S104: Based on the channel bearing relationship in the graph database, aggregate the abnormal result data of the hierarchical routing to the channel of the service layer; if the audit result of the channel bearing structure is normal and the aggregation result is empty, it is determined that the routing of the service channel is normal; if the audit result of the channel bearing structure is normal and the aggregation result is not empty, the hierarchical routing data of the service channel is audited again from two dimensions of the electrical layer routing and the optical layer routing, and if the result of the secondary audit is normal, it is determined that the routing of the service channel is normal;​ Step S105: output the audit result of each channel layered routing and the routing data audit result of the service channel.

[0117] From the above description, the electronic device provided by the embodiment of the application can construct a directed graph according to the port directed connection relationship in the routing data, use a graph algorithm to divide a connected component and check the audit rule with the data dimension, and quickly and accurately detect the connectivity and integrity of the routing. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the data quality at a shallow level is avoided to cause the checking to be unable to be performed. In addition, the checking can be performed according to the service channel dimension, the channel carrying structure of the service channel is checked to be complete or not, all layered routing abnormal audit results are quickly aggregated, the service channel with the aggregated audit result being abnormal is secondarily checked, the accuracy and reliability of the checking result are ensured, and the data is rectified according to the service channel dimension to quickly achieve the effect.

[0118] In another embodiment, the network routing checking device can be configured separately from the central processor 9100, for example, the network routing checking device can be configured as a chip connected with the central processor 9100, and the network routing checking method function is realized through the control of the central processor.

[0119] As shown in FIG. 9, the electronic device 9600 can further include a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It should be noted that the electronic device 9600 does not necessarily include all the components shown in FIG. 9; in addition, the electronic device 9600 can include components not shown in FIG. 9, which can be referred to the prior art. Figure 19 Figure 19 As shown in FIG. 9, the electronic device 9600 can further include a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It should be noted that the electronic device 9600 does not necessarily include all the components shown in FIG. 9; in addition, the electronic device 9600 can include components not shown in FIG. 9, which can be referred to the prior art. Figure 19

[0120] As shown in FIG. 9, the electronic device 9600 can further include a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It should be noted that the electronic device 9600 does not necessarily include all the components shown in FIG. 9; in addition, the electronic device 9600 can include components not shown in FIG. 9, which can be referred to the prior art. Figure 19 As shown in FIG. 9, the central processor 9100, also known as a controller or an operation control, can include a microprocessor or other processor device and / or a logic device, which receives input and controls the operation of each component of the electronic device 9600.

[0121] The memory 9140, for example, can be one or more of a buffer, a flash memory, a hard drive, a removable media, a volatile memory, a non-volatile memory, or other suitable device. The information related to the failure described above can be stored, and in addition, a program for executing the information can be stored. The central processor 9100 can execute the program stored in the memory 9140 to achieve information storage or processing, etc.

[0122] ​​The input unit 9120 provides input to the central processing unit 9100. The input unit 9120 is, for example, a key or a touch input device. The power supply 9170 is for supplying power to the electronic device 9600. The display 9160 is for displaying display objects such as images and characters. The display is, for example, an LCD display, but is not limited thereto.

[0123] The memory 9140 can be a solid-state memory such as a read only memory (ROM), a random access memory (RAM), a SIM card, and the like. It can also be a memory that retains information even when power is off, can be selectively erased, and is provided with more data, an example of which is sometimes referred to as an EPROM or the like. The memory 9140 can also be some other type of device. The memory 9140 includes a buffer memory 9141 (sometimes referred to as a buffer). The memory 9140 can include an application / function storage section 9142 for storing application programs and function programs or a flow for executing the operation of the electronic device 9600 by the central processing unit 9100.

[0124] The memory 9140 can also include a data storage section 9143 for storing data such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. A driver storage section 9144 of the memory 9140 can include various drivers of the electronic device for a communication function and / or for executing other functions of the electronic device such as a messaging application, an address book application, and the like.

[0125] The communication module 9110 is a transmitter / receiver that transmits and receives signals via an antenna 9111. The communication module 9110 (transmitter / receiver) is coupled to the central processing unit 9100 to provide input signals and receive output signals, which can be the same as in the case of a conventional mobile communication terminal.

[0126] Based on different communication technologies, a plurality of communication modules 9110 such as a cellular network module, a Bluetooth module, and / or a wireless local area network module can be provided in the same electronic device. The communication module 9110 (transmitter / receiver) is also coupled to a speaker 9131 and a microphone 9132 via an audio processor 9130 to provide audio output via the speaker 9131 and receive audio input from the microphone 9132, thereby implementing a general telecommunication function. The audio processor 9130 can include any suitable buffer, decoder, amplifier, and the like. In addition, the audio processor 9130 is also coupled to the central processing unit 9100, thereby enabling recording on a local device through the microphone 9132 and enabling playing of a sound stored on the local device through the speaker 9131.

[0127] The embodiments of the present application also provide a computer readable storage medium capable of implementing all steps of the network path routing verification method in which the execution subject in the above embodiments is a server or a client, wherein the computer readable storage medium stores a computer program, and the computer program is executed by a processor to implement all steps of the network path routing verification method in which the execution subject is a server or a client, for example, the processor executes the computer program to implement the following steps: Step S101: synchronizing port data and channel data in a network to a graph database according to node types, and establishing connection relationships between ports and between channels; Step S102: obtaining hierarchical routing data of each channel from the graph database, and auditing connectivity of hierarchical routing of each channel based on connectivity component characteristics in graph theory; if the connectivity of hierarchical routing is normal, auditing integrity of the hierarchical routing based on service characteristics, checking whether the routing meets requirements of a service scenario; and recording abnormal result data of the auditing of hierarchical routing of each channel in the graph database; Step S103: obtaining channel data of a service layer from the graph database, and auditing channel carrying structure of each service channel according to a service carrying model and channel carrying relationships in the graph database, checking whether channel levels in the carrying relationship are complete; and recording abnormal result data of the auditing of the service channel in the graph database; Step S104: based on channel carrying relationships in the graph database, converging the abnormal result data of the auditing of hierarchical routing to a service layer channel; if the auditing result of the channel carrying structure is normal and the convergence result is empty, determining that routing of the service channel is normal; if the auditing result of the channel carrying structure is normal and the convergence result is not empty, performing secondary auditing of hierarchical routing data of the service channel from two dimensions of electrical layer routing and optical layer routing, and if the secondary auditing result is normal, determining that routing of the service channel is normal; Step S105: outputting the auditing result of hierarchical routing of each channel and the routing data auditing result of the service channel.

[0128] From the above description, the computer readable storage medium provided by the embodiments of the present application constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph algorithm to divide a connected component and checks the data dimension audit rule, and quickly and accurately detects the connectivity and integrity of the routing. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality. Moreover, whether the channel carrying structure of a business channel is complete can be checked according to the business channel dimension, all layered routing abnormality checking results are quickly aggregated, the secondary checking is performed on the business channel with the aggregated checking result being abnormal, the accuracy and reliability of the checking result are ensured, and the data is rectified according to the business channel dimension to quickly achieve the effect.

[0129] The embodiments of the present application also provide a computer program product capable of implementing all steps of the network routing checking method in which the execution subject in the above embodiments is a server or a client. The computer program / instruction is executed by a processor to implement the steps of the network routing checking method, for example, the computer program / instruction implements the following steps: Step S101: synchronizing the port data and the channel data in the network to the graph database according to the node type, and establishing the connection relationship between the ports and the carrying relationship between the channels; Step S102: obtaining the layered routing data of each channel from the graph database, and checking the connectivity of the layered routing of each channel based on the connected component characteristics in graph theory; if the connectivity of the layered routing is normal, checking the integrity of the layered routing based on the business characteristics, checking whether the routing meets the requirements of the business scenario; and recording the abnormal result data of the layered routing of each channel in the graph database; Step S103: obtaining the channel data of the business layer from the graph database, and checking the channel carrying structure of each business channel according to the business carrying model and the channel carrying relationship in the graph database, checking whether the channel level in the carrying relationship is complete; and recording the abnormal result data of the business channel in the graph database; Step S104: based on the channel carrying relationship in the graph database, aggregating the abnormal result data of the layered routing to the channel of the business layer; if the checking result of the channel carrying structure is normal and the aggregation result is empty, determining that the routing of the business channel is normal; if the checking result of the channel carrying structure is normal and the aggregation result is not empty, performing secondary checking on the layered routing data of the business channel from the electrical layer routing and the optical layer routing two dimensions, and if the secondary checking result is normal, determining that the routing of the business channel is normal; Step S105: outputting the checking result of the layered routing of each channel and the routing data checking result of the business channel.

[0130] From the above description, the computer program product provided by the embodiment of the present application constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph algorithm to divide a connected component and checks the data dimension audit rule, and quickly and accurately detects the connectivity and integrity of a routing path. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality. In addition, whether the channel carrying structure of a business channel is complete can be checked according to the business channel dimension, all layered routing abnormality checking results are quickly aggregated, the secondary checking is performed on the business channel with the aggregated checking result being abnormal, the accuracy and reliability of the checking result are ensured, and the data is rectified according to the business channel dimension to quickly achieve the effect.

[0131] Those skilled in the art will understand that the embodiments of the present application can be provided as a method, device, or computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. In addition, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0132] The present application is described with reference to flowcharts and / or block diagrams of the method, device (apparatus), and computer program product according to the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device implemented in the flowcharts and / or block diagrams. Figure 1 one or more flows and / or blocks Figure 1 an apparatus that performs the functions specified in the flow(s) or block(s) and / or combination of flows and / or blocks in the flowcharts and / or block diagrams.

[0133] These computer program instructions can also be stored in a computer-readable memory that can direct the computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including instruction apparatus, which implements the flowcharts and / or block diagrams. Figure 1 one or more flows and / or blocks Figure 1 an apparatus that performs the functions specified in the flow(s) or block(s) and / or combination of flows and / or blocks in the flowcharts and / or block diagrams.

[0134] These computer program instructions can also be loaded into a computer or other programmable data processing devices, so that a series of operational steps are generated to realize the computer-implemented processes, and the instructions executed on the computer or other programmable devices provide a process for implementing the functions specified in the flowchart Figure 1 one flow or multiple flows and / or the functions specified in the block Figure 1 one flow or multiple flows and / or the functions specified in the block

[0135] The principles and implementation manners of the present application are described in the specific embodiments. The above description of the embodiments is only used to help understand the method and core idea of the present application; meanwhile, for those skilled in the art, according to the idea of the present application, the specific implementation manners and application ranges can be changed, and the above description of the present application should not be understood as a limitation.

Claims

1. A method for verifying network channel routes, characterized in that, The method includes: Synchronize port and channel data in the network to the graph database by node type, and establish connection relationships between ports and bearer relationships between channels; Retrieve hierarchical routing data for each channel from the graph database, and audit the connectivity of the hierarchical routes for each channel based on the connectivity component characteristics in graph theory; if the connectivity of the hierarchical routes is normal, audit the integrity of the hierarchical routes based on business characteristics to check whether the routes meet the requirements of the business scenario; record the audit anomaly results of the hierarchical routes for each channel into the graph database. The system retrieves channel data from the graph database for the business layer, and audits the channel carrying structure of each business channel based on the business carrying model and the channel carrying relationship in the graph database, checking whether the channel hierarchy in the carrying relationship is complete; and records the audit anomaly results of the business channels into the graph database. Based on the channel bearer relationship in the graph database, the audit anomaly results of the hierarchical routing are aggregated to the service layer channel. If the audit result of the channel bearer structure is normal and the aggregation result is empty, the routing of the service channel is determined to be normal. If the audit result of the channel bearer structure is normal and the aggregation result is not empty, the hierarchical routing data of the service channel is audited a second time from the two dimensions of electrical layer routing and optical layer routing. If the result of the second audit is normal, the routing of the service channel is determined to be normal. Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

2. The network channel routing verification method according to claim 1, characterized in that, The step of auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory also includes initializing the hierarchical routing data for each channel. The method for initializing the hierarchical routing data for each channel includes: Merge multiple ports in the source port group into one port; merge multiple ports in the destination port group into one port; Remove cascading crossovers; Remove the PTG protection structure according to the scenario, provided that removing the PTG does not change the shortest distance between each point in the graph and the source and destination endpoints.

3. The network channel routing verification method according to claim 1, characterized in that, The steps for auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory include: If the number of connected components in the hierarchical routing data is 1 and there are no breakpoints, then the audit result of the hierarchical routing data is normal. If the number of connected components in the hierarchical routing data is 1, but there are breakpoints, then the audit result of the hierarchical routing data being abnormal will be output. If the number of connected components in the hierarchical routing data is greater than 1, and there are multiple connected components with a number of nodes not equal to 1, then the audit result of hierarchical routing data abnormality will be output. If the number of connected components in the hierarchical routing data is greater than 1, and there is a connected component with 1 node, then the audit result of hierarchical routing data anomaly will be output.

4. The network channel routing verification method according to claim 1, characterized in that, The steps for auditing the integrity of hierarchical routing based on business characteristics and checking whether the routing meets the requirements of the business scenario include: For channels with two sources and two destinations, detect whether their forward and reverse paths are separated; For ODU, VC level, and specific network management channels, check whether all their routing segments have forward and reverse paths; For ODU, VC level and specific network management channels, check whether all their routing segments have primary and backup paths; For routes with cascading cross-channels, check whether all cascading cross-channels have forward and reverse paths.

5. The network channel routing verification method according to claim 1, characterized in that, The step of auditing the channel bearer structure of each service channel based on the service bearer model and the channel bearer relationship in the graph database, and checking whether the channel hierarchy in the bearer relationship is complete, includes: Starting from the business channel and using the channel carrying relationship as the edge, search for the carrying path of the business channel; Obtain all nodes traversed by the carrying path and extract the channel level; Determine whether the extracted channel level covers the channel level in the service carrying model; if so, the channel level is complete.

6. The network channel routing verification method according to claim 1, characterized in that, The step of aggregating the audit anomaly results data of hierarchical routing from top to bottom to the business layer channel based on the channel bearer relationship in the graph database includes: Obtain the hierarchical channel IDs related to the service channels based on the channel carrying relationships in the graph database; Query the audit results table for each layered route based on the layered channel ID; The audit anomaly results of each layer of routing are aggregated and sent to the business layer channel as the audit results of the business layer channel.

7. The network channel routing verification method according to claim 1, characterized in that, The steps for secondary auditing of the hierarchical routing data of the service channel from both electrical layer routing and optical layer routing dimensions include: Starting with the business channel and using the channel carrying relationships as edges, a graph search algorithm is used to search for the carrying path of the business channel; when the channel level is OCH level during the search process, the search is terminated and the current path is returned; After deduplicating all channel IDs in the searched path, a set is formed. Based on the deduplicated channel ID set, the hierarchical routing data of each channel is queried. The hierarchical routing data of each channel is aggregated to obtain the service electrical layer routing data. The connectivity and completeness of the hierarchical routing of each channel in the service electrical layer routing data are audited. Based on the service electrical layer routing data, the OCH channel ID is extracted from the routing; the service optical layer routing data is obtained by performing hierarchical routing aggregation on each OCH channel; the connectivity and integrity of the hierarchical routing of each channel in the service optical layer routing data are audited. The audit results of the service electrical layer routing data and the service optical layer routing data are aggregated into the service channel and used as the audit result of the routing data of the service channel.

8. A network channel routing verification device, characterized in that, The device includes: The data transfer module is used to synchronize port data and channel data in the network to the graph database by node type, and to establish the connection relationship between ports and the carrying relationship between channels. The first detection module is used to obtain the hierarchical routing data of each channel from the graph database, and audit the connectivity of the hierarchical routing of each channel based on the connectivity component characteristics in graph theory; if the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on the business characteristics to check whether the routing meets the requirements of the business scenario; and the audit abnormal results of the hierarchical routing of each channel are entered into the graph database. The second detection module is used to obtain channel data of the business layer from the graph database, and audit the channel bearing structure of each business channel according to the business bearing model and the channel bearing relationship in the graph database, and check whether the channel hierarchy in the bearing relationship is complete; and enter the audit abnormal results data of the business channel into the graph database. The third detection module is used to aggregate the audit anomaly results of the hierarchical routing to the service layer channel based on the channel bearer relationship in the graph database. If the audit result of the channel bearer structure is normal and the aggregation result is empty, the routing of the service channel is determined to be normal. If the audit result of the channel bearer structure is normal and the aggregation result is not empty, the hierarchical routing data of the service channel is audited a second time from the two dimensions of electrical layer routing and optical layer routing. If the result of the second audit is normal, the routing of the service channel is determined to be normal. The results output module is used to output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the steps of the network channel routing verification method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the steps of the network channel routing verification method according to any one of claims 1 to 7.

Images