Network Channel Routing Verification Method and Device

Abstract

This application provides a network channel routing verification method and apparatus. The method constructs a directed graph based on the directed connection relationships of ports in the routing data, and uses graph algorithms to partition connected components and add audit rules based on data dimensions for verification. This allows for rapid and accurate detection of the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results. This helps vendors rectify data according to the business channel dimension and achieve rapid results.

Description

Technical Field

[0001] This application relates to the field of data processing, specifically to a method and apparatus for network channel routing verification. Background Technology

[0002] The channel hierarchical routing data currently reported by OMC vendors is not entirely reliable and generally has one or more of the following problems:

[0003] 1. Alternative paths are often not complete paths.

[0004] 2. Group numbers are unrelated to the topology layout.

[0005] 3. The direction may be incorrect.

[0006] 4. The route may be incomplete.

[0007] The above issues can affect the accuracy and integrity of channel concatenation and applications based on routing analysis, such as cutover collision detection results and alarm location.

[0008] To ensure the accuracy and completeness of channel interconnection and the accuracy of application results based on routing analysis, channel routing data must be audited before channel interconnection and application analysis. This is to prevent missing or redundant data from adversely affecting the channel interconnection reconstruction effect. After the audit is completed, a comprehensive audit report should be generated and promptly fed back to the OMC vendor so that both parties can collaborate to promote data rectification and optimization, thereby improving data quality.

[0009] The core of channel routing data verification lies in verifying two key dimensions: first, the actual connectivity of the route, that is, whether the source end to the destination end can be connected according to the routing data; second, the completeness of the routing structure, specifically including whether the structure of ports, cross-connects, topology, primary and backup protection is complete.

[0010] There are two existing methods for verifying channel routes:

[0011] 1. Channel routing audits are performed based on the segment group sequence field of the original reported routing segment data. However, the network management data has issues with missing data and inaccurate order, resulting in inaccurate audit results.

[0012] 2. Using the AZ ports of the route segment as key-value pairs can quickly detect whether the source and destination are connected, but it is highly dependent on the accuracy of the route segment direction and cannot handle loops.

[0013] The above methods can only detect route connectivity; they cannot detect redundant branch nodes or further categorize problems. They can only audit routes at the current level. They cannot audit routes from the perspective of business channels or aggregate audit results from all levels. Summary of the Invention

[0014] To address the problems in the existing technology, this application provides a network channel routing verification method and apparatus, which can quickly and accurately detect the connectivity and integrity of channel routes, and provide anomaly audit results at the business channel level, helping manufacturers to rectify data according to the business channel level and achieve rapid results.

[0015] To solve at least one of the above problems, this application provides the following technical solution:

[0016] In a first aspect, this application provides a network channel routing verification method, characterized in that the method includes:

[0017] 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;

[0018] 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.

[0019] 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.

[0020] 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.

[0021] Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0022] Furthermore, the steps of establishing the connection relationship between ports and the bearer relationship between channels include:

[0023] Based on the network's hierarchical routing data, directed connections are established between ports, and the attributes of the hierarchical routing data are assigned to the connection relationships, which are then incrementally synchronized to the graph database using the relationship type.

[0024] Based on the network's hierarchical routing data, directed bearer relationships are established between channels, and these relationships are incrementally synchronized to the graph database.

[0025] 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:

[0026] Check if the hierarchical routing data is empty;

[0027] 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.

[0028] If not empty, continue with the hierarchical routing connectivity audit operation.

[0029] 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:

[0030] Merge multiple ports in the source port group into one port; merge multiple ports in the destination port group into one port;

[0031] Remove cascading crossovers;

[0032] 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.

[0033] Furthermore, the step of auditing the connectivity of hierarchical routing for each channel based on the connectivity component characteristics in graph theory includes:

[0034] 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.

[0035] 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.

[0036] 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.

[0037] 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.

[0038] 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:

[0039] For channels with two sources and two destinations, detect whether their forward and reverse paths are separated;

[0040] For ODU, VC level, and specific network management channels, check whether all their routing segments have forward and reverse paths;

[0041] For ODU, VC level and specific network management channels, check whether all their routing segments have primary and backup paths;

[0042] For routes with cascading cross-channels, check whether all cascading cross-channels have forward and reverse paths.

[0043] Furthermore, 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:

[0044] Starting from the business channel and using the channel carrying relationship as the edge, search for the carrying path of the business channel;

[0045] Obtain all nodes traversed by the carrying path and extract the channel level;

[0046] Determine whether the extracted channel level covers the channel level in the service carrying model; if so, the channel level is complete.

[0047] Furthermore, the step of aggregating the audit anomaly results data of hierarchical routing from top to bottom to the service layer channel based on the channel bearer relationship in the graph database includes:

[0048] Obtain the hierarchical channel IDs related to the service channels based on the channel carrying relationships in the graph database;

[0049] Query the audit results table for each layered route based on the layered channel ID;

[0050] 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.

[0051] Furthermore, the step of performing a secondary audit of the hierarchical routing data of the service channel from both electrical layer routing and optical layer routing dimensions includes:

[0052] 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;

[0053] 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.

[0054] 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.

[0055] 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.

[0056] Secondly, this application provides a network channel routing verification device, comprising:

[0057] 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.

[0058] 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.

[0059] 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.

[0060] 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.

[0061] 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.

[0062] Thirdly, this application provides an electronic device, including 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.

[0063] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the network channel routing verification method described above.

[0064] Fifthly, this application provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the steps of the network channel routing verification method described above.

[0065] As can be seen from the above technical solution, this application provides a network channel routing verification method and apparatus. This method constructs a directed graph based on the directed connection relationships of ports in the routing data, and uses graph algorithms to partition connected components and add audit rules based on data dimensions for verification, quickly and accurately detecting the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results, helping vendors to rectify data according to the business channel dimension and achieve rapid results. Attached Figure Description

[0066] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0067] Figure 1 This is one of the flowcharts illustrating the network channel routing verification method in this application embodiment;

[0068] Figure 2 This is the second flowchart illustrating the network channel routing verification method in this application embodiment;

[0069] Figure 3 This is a data synchronization diagram of the network channel routing verification method in this application embodiment;

[0070] Figure 4This is a schematic diagram of the hierarchical routing data audit sub-process of a single channel in the network channel routing verification method of this application embodiment;

[0071] Figure 5 This is a schematic diagram of the port merging operation in the data initialization process of the network channel routing verification method in this application embodiment;

[0072] Figure 6 This is a schematic diagram of the cascading cross-connection removal operation in the data initialization process of the network channel routing verification method in this application embodiment;

[0073] Figure 7 This is a schematic diagram of the PTG protection structure removal operation in the data initialization process of the network channel routing verification method in this application embodiment;

[0074] Figure 8 This is an example of a route graph with normal connectivity in the route connectivity check of the network channel route verification method in this application embodiment;

[0075] Figure 9 This is a sample route graph with breakpoints in the route connectivity check of the network channel route verification method in this application embodiment;

[0076] Figure 10 This is a second example of a route graph with breakpoints in the route connectivity check of the network channel route verification method in this application embodiment;

[0077] Figure 11 This is an example of a route graph with interruptions in the route connectivity check of the network channel route verification method in this application embodiment;

[0078] Figure 12 This is an example of a routing graph with a free point in the routing connectivity check of the network channel routing verification method in this application embodiment;

[0079] Figure 13 This is an example of a two-source, two-destination routing graph in the routing integrity check of the network channel routing verification method in this application embodiment;

[0080] Figure 14 This is a sample route diagram that satisfies audit rule 2 in the route integrity check of the network channel route verification method in this application embodiment;

[0081] Figure 15 This is a sample route diagram that satisfies audit rule 3 in the route integrity check of the network channel route verification method in this application embodiment;

[0082] Figure 16This is a sample route diagram that satisfies audit rule 4 in the route integrity check of the network channel route verification method in this application embodiment;

[0083] Figure 17 This is a schematic diagram of the abnormal results of the service layer channel aggregation hierarchical routing audit of the network channel routing verification method in the embodiments of this application;

[0084] Figure 18 This is a structural diagram of the network channel routing verification device in the embodiments of this application;

[0085] Figure 19 This is a schematic diagram of the structure of the electronic device in the embodiments of this application.

[0086] Figure label:

[0087] Electronic device 9600, central processing unit 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 storage unit 9144, antenna 9111, speaker 9131, microphone 9132. Detailed Implementation

[0088] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0089] The acquisition, storage, use, and processing of data in this application all comply with the relevant provisions of national laws and regulations.

[0090] Terminology Explanation:

[0091] Channel: refers to a service line. It is the path for transmitting information.

[0092] Channel routing: This typically refers to a single-layer route within a channel, composed of multiple route segments, representing the specific path information travels. Key attributes of route segment data include: A-end network element ID, A-end port ID, Z-end network element ID, Z-end port ID, segment number, group number, sequence number, primary / backup identifier (primary, backup), direction (forward, reverse), bidirectional (unidirectional, bidirectional), route segment type (cross-connect, topology, cascaded cross-connect, PTG), and sub-channel ID.

[0093] Channel hierarchy:

[0094] Customer information layer: This layer carries the actual user services, such as Ethernet and IP.

[0095] Virtual Container (VC) layer: including VC-12, VC-3, VC-4, etc., used to adapt and multiplex client signals.

[0096] Optical Path Data Unit (ODUk): such as ODUk (k = 0, 1, 2, 3, 4), is used to encapsulate and process service signals of different rates and formats, providing functions such as multiplexing, cross-connection and protection.

[0097] Regenerator section (RS): Responsible for regenerating and amplifying the optical signal between two regenerator repeaters.

[0098] Multiplexing section (MS): Used to handle related functions after multiple channels are multiplexed together, such as monitoring and maintenance.

[0099] Optical Channel Layer (OCH): Directly carries customer service signals and is a transparent transmission channel in the optical network.

[0100] Optical Multiplexing Section Layer (OMS): Responsible for the multiplexing and transmission of multiple optical channels.

[0101] Optical Transport Section (OTS): Primarily handles the transmission of optical signals over physical media (such as optical fibers).

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

[0103] Connected component: A connected component is a fundamental concept in graph theory, used to describe the connectivity properties of a graph. A connected component is the largest subgraph in which there is a path between any two nodes.

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

[0105] Cascading cross-connect: A cascading cross-connect is a cross-connection that exists in a specific layout, either as a regular cross-connect or as a VC12 routing segment.

[0106] In view of the problems existing in the prior art, this application provides a network channel route verification method and apparatus. This method constructs a directed graph based on the directed connection relationships of ports in the routing data, and uses graph algorithms to partition connected components and add audit rules based on data dimensions for verification, quickly and accurately detecting the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding the inability to perform verification due to shallow data quality. Furthermore, it can quickly aggregate all hierarchical channel route anomaly audit results according to the business channel dimension, helping vendors to rectify data according to the business channel dimension and achieve rapid results.

[0107] To quickly and accurately detect the connectivity and integrity of network channel routes and provide anomaly audit results at the business channel level, helping vendors to rectify data according to the business channel dimension and achieve rapid results, this application provides an embodiment of a network channel route verification method. For details, see... Figure 1 and Figure 2 The network channel routing verification method includes the following:

[0108] Step S101: Synchronize the port data and channel data in the network to the graph database by node type, and establish the connection relationship between ports and the bearer relationship between channels.

[0109] refer to Figure 3 As shown, in this embodiment, the specific steps for synchronizing data to the database include:

[0110] 1. Port Entry: Incrementally synchronize port data from the network to the graph database by node type.

[0111] 2. Input Channel: Incrementally synchronize channel data from the network to the graph database by node type.

[0112] 3. Input channel hierarchical routing: Based on the channel hierarchical routing data in the network, establish directed connections between ports, and assign the hierarchical routing data to the connection relationships, and incrementally synchronize them to the graph database according to the relationship type.

[0113] 4. Input Channel Bearer Relationships: Based on the channel routing data in the network, establish directed bearer relationships between channels and incrementally synchronize them to the graph database according to the relationship type.

[0114] The network channel routing verification method provided in this embodiment uses a graph database to retrieve hierarchical routing and channel bearer relationship data, treating channels as node objects. When saving routing data to the graph database, it simultaneously maintains the connection relationships between ports and the bearer relationships between channels. With this relationship data, the query efficiency is very fast when looking up the bearer relationships from the top-level channel to any lower-level channel, and when aggregating hierarchical routes.

[0115] 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 connectivity 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; record the audit abnormal results of the hierarchical routing of each channel into the graph database.

[0116] refer to Figure 4 As shown, the main steps of hierarchical routing data auditing in this embodiment are as follows:

[0117] 1. Batch retrieve channel and channel hierarchical routing data from the graph database.

[0118] 2. The sub-process of "Hierarchical Routing Data Audit of a Single Channel" is executed concurrently by multiple threads.

[0119] 3. Enter the hierarchical routing audit results into the graph library.

[0120] Optionally, the specific steps of the sub-process "Hierarchical Routing Data Audit for a Single Channel" are as follows:

[0121] I. Input channels and channel hierarchical routing data.

[0122] 2. Check if the hierarchical routing data is empty. If it is empty, the sub-process returns the audit result (routing data is empty), and the sub-process completes execution. If it is not empty, continue execution.

[0123] This embodiment serves as a preliminary verification of the routing data, using the empty condition to ensure that the path itself exists.

[0124] III. Auditing route connectivity and the integrity of route topology based on graph theory connectivity components:

[0125] 1. Data initialization processing:

[0126] a. Combine multiple ports in the source port group into one. Combine multiple ports in the destination port group into one port (see reference). Figure 5 As shown in the diagram; Legend: 1. Circles represent ports, and the numbers inside the circles are used to distinguish different ports. Blue ports represent source and destination ports. Port 0 and Port 1 are source ports. Port 10 is a destination port. 2. Rounded rectangles represent network elements. 3. Line segment colors: blue indicates primary, green indicates backup.

[0127] b. Remove cascading crossovers (see reference) Figure 6 (As shown).

[0128] c. Remove the PTG protection structure according to the scenario, provided that removing the PTG does not cause changes to the shortest distances between points in the graph and the source and sink endpoints (see reference). Figure 7 As shown in the figure, the PTG between port 8 and port 9 is not removed because removing it would affect the connectivity of the graph (the shortest distance between port 9 and port 10 would change).

[0129] This embodiment reduces routing complexity by performing data initialization processing on the routing data before using the connectivity component to determine routing connectivity.

[0130] 2. Construct an adjacency list based on the routing data, and use a graph search algorithm to partition the connected components.

[0131] 3. Determine route connectivity based on connected components and the adjacency list. Note: The data used to construct the adjacency list here is the original channel routing data before initialization (before port merging, cascading cross-connects, and PTG removal). The route connectivity determination result can be one of four cases: normal, breakpoint, segment, or free-floating. Examples are provided below using a routing graph sample; the graph does not include elements.

[0132] a. Normal: The number of connected components is equal to 1, and there are no breakpoints. Output routing is normal (see reference). Figure 8 (As shown).

[0133] b. Breakpoint: The number of connected components is equal to 1, but a breakpoint exists. Output routing exception type; breakpoint (see reference). Figure 9 and Figure 10 As shown; Figure 9 Port 11 is the breakpoint; Figure 10 The break point is between midpoint 5 and endpoint 7.

[0134] c. The number of connected components is greater than 1, and there are multiple connected components with a number of segments not equal to 1. Output routing exception type; segmentation (see reference). Figure 11 As shown in the diagram; Legend: 1. The part enclosed in red is connected component 1. 2. The part enclosed in blue is connected component 2. 3. The number of connected components in the routing graph is 2.

[0135] d. The number of connected components is greater than 1, and there exists a connected component with only 1 node. Output routing error type: Free-floating point (see reference). Figure 12 As shown in the diagram; Legend: 1. The part enclosed in red is connected component 1. 2. The parts enclosed in blue are connected components 2 and 3. 3. The number of connected components in the routing graph is 3. Among them, connected components 2 and 3 each have 1 node.

[0136] 4. Check if the routing connectivity is normal. If it is normal, continue execution. If it is abnormal, output the routing abnormality type (detached, breakpoint, segmentation). The sub-process returns the audit result and the sub-process is completed.

[0137] 5. When the channel routing passes the connectivity test and the audit result is normal, different integrity audit rules can be selected according to the characteristics of different network management scenarios and different channel levels to judge the missing routes (integrity of routing business structure) and thus determine whether the channel routing is complete.

[0138] a. Audit Rule 1: For channels with two sources and two destinations, check whether the forward and reverse paths are separated. (Source 1 to Destination 1 is the forward path, Source 2 to Destination 2 is the reverse path) (Reference) Figure 13 As shown in the diagram; Legend: 1. Source 1 is port 1, Destination 1 is port 10. 2. Source 2 is port 0, Destination 2 is port 11).

[0139] b. Audit Rule 2: For ODU, VC level, and specific network management channels, check whether all their routing segments have forward and reverse paths (refer to...). Figure 14 As shown in the diagram; Legend: 1. Blue lines are for primary use. 2. Green lines are for backup. This specific network management system refers to the Network Management System (NMS) responsible for managing and monitoring specific network layer channels such as the ODU layer and VC layer.

[0140] c. Audit Rule 3: For ODU, VC level, and specific network management channels, check whether all their routing segments have primary and backup paths (refer to...). Figure 15 As shown in the diagram; Legend: 1. Blue lines are for primary use. 2. Green lines are for backup.

[0141] d. Audit Rule 4: For routes with cascading crossovers, check whether all cascading crossover route segments have forward and reverse paths (see reference). Figure 16 As shown in the diagram; Legend: 1. Blue lines are for primary use. 2. Green lines are for backup. 3. Orange lines represent cascading intersections.

[0142] The above audit rules only require auditing based on pure data dimensions; graph algorithm pathfinding is not needed because the channel routing has already passed connectivity tests. Furthermore, additional audit rules can be added and combined according to business needs.

[0143] 6. Enter the data with abnormal channel hierarchical routing data audit results into the image library.

[0144] This embodiment creates a linked list for each node to store other nodes directly connected to that node. During construction, each edge in the routing network, i.e., 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 exists a group of nodes where every two nodes are reachable by a path, and these nodes are not connected to other nodes in the graph, then this group of nodes is a connected component. If all nodes in a graph can be reached from each other by some path, then the graph is connected. If there are multiple such components, the graph is not connected. The process of determining route connectivity based on the adjacency list essentially involves finding all connected components and checking whether two nodes are within the same connected component.

[0145] Optionally, in this embodiment, the method of constructing an adjacency list based on routing data and using a graph search algorithm to partition connected components includes:

[0146] Method 1:

[0147] For each node, set a flag to indicate whether it has been visited.

[0148] Starting from any unvisited node in the graph, perform a Depth-First Search (DFS) traversal. Each time a node is visited, recursively visit its adjacent nodes and mark them as visited.

[0149] Each time a new DFS is started from an unvisited node, it means a new connected component has been found. By traversing the DFS, all nodes reachable from this starting node are marked and treated as the same connected component.

[0150] 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, it means that they are not in the same connected component and are not connected.

[0151] Method 2:

[0152] Set each node to an unvisited state.

[0153] Starting from any unvisited node, use a queue to manage the nodes to be visited, and put the source node into the queue.

[0154] Following the order of nodes in the queue, visit each node adjacent to the current node one by one and add these nodes to the queue.

[0155] If the queue is empty at the start of each BFS traversal, it means that a new connected component has been found.

[0156] For any two nodes, if they are in the same connected component, then there is a path between them, and they are connected; otherwise, they are not connected.

[0157] The network channel route verification method provided in this embodiment breaks down the channel hierarchical route auditing process into two steps. Step one uses graph theory connectivity components to detect the connectivity and structural integrity of routes. Using graph search, the route structure can be reconstructed based on port connections, regardless of the segment order, solving the problem of inaccurate route verification caused by low-quality route data. Step two: Assuming the route connectivity verification passes, the integrity of routes is audited purely from a data perspective based on the route service characteristics. This is highly efficient, with simple verification rules and rich verification details. Furthermore, breaking it down into two steps eliminates the need to process different verification data attributes during the graph algorithm route search process, reducing processing difficulty and improving efficiency.

[0158] Furthermore, this embodiment employs a graph algorithm to divide the route into connected components when detecting the connectivity and structural integrity of the route. The connectivity of the route is judged based on the connected components, which is simple, easy to understand, and highly efficient. The complexity of the route is reduced by performing data initialization processing on the route data, thereby improving the computational efficiency of the graph connected components.

[0159] Step S103: Obtain the 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; record the audit anomaly results of the business channels into the graph database.

[0160] refer to Figure 17 As shown in this embodiment, the specific steps for auditing the service layer routing data are as follows:

[0161] The specific steps for auditing business layer routing data are as follows:

[0162] Retrieve business layer channel data from the graph database. Based on the business bearer model and the channel bearer relationship in the graph database, assess the channel bearer structure of each business channel and verify the completeness of the channel levels in the bearer relationship. Incomplete structures are marked as missing in the audit results of that business channel, and the missing channel levels are indicated. The step of assessing the completeness of the channel bearer structure of the business layer channel based on the channel bearer relationship in the graph database includes: using the business channel as the starting point and the channel bearer relationship as the edge, searching for the bearer path of the business channel; analyzing all nodes (i.e., channels) traversed by the bearer path and extracting the channel levels; and combining the business bearer model to determine whether all channel levels contained in the bearer path are covered. If so, the channel bearer result is complete. Commonly, the channel levels carried under the ETH / EOO business bearer model should include FDFR, ETH, ODU, OTU, OCH, OMS, and OTS; and the channel levels carried under the OTN / DWDM business bearer model should include Client, ODU, OTU, OCH, OMS, and OTS; etc. The channel levels included in these business models can be configured and adjusted according to actual needs.

[0163] Step S104: Based on the channel bearer relationship in the graph database, aggregate the audit anomaly results of the hierarchical routing to the service layer channel; if the audit result of the channel bearer structure is normal and the aggregation result is empty, then 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, then perform a second audit on the hierarchical routing data of the service channel from the two dimensions of electrical layer routing and optical layer routing. If the result of the second audit is normal, then the routing of the service channel is determined to be normal.

[0164] Optionally, in this embodiment, based on the channel bearer relationship in the graph database, data with abnormal results from the second step of the hierarchical routing data audit are quickly aggregated from top to bottom as the result of the service layer channel routing data audit. If the aggregation result is empty and the verification result of the channel bearer structure in the second step is normal, it indicates that the routing of the service channel is normal. If there is data aggregated to the hierarchical routing data verification result as abnormal, then the routing data of the service channel needs to be verified a second time. The routing data of the service channel is re-verified according to the two dimensions of service electrical layer routing and optical layer routing, using the "Hierarchical Routing Audit Method and Rules". If the verification result of the second verification is normal, then the routing of the service channel is normal. If the verification result is abnormal, the final verification result of the service channel will also include abnormal items of the hierarchical channel.

[0165] The step of quickly aggregating hierarchical routing audit results to the business layer channel based on the channel bearer relationship in the graph database includes:

[0166] 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.

[0167] The step of performing a secondary verification of the routing data for a service channel with abnormal aggregation results includes:

[0168] 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.

[0169] 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.

[0170] 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.

[0171] 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.

[0172] 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.

[0173] Step S105: Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0174] In this embodiment, the hierarchical routing audit results and the business layer routing audit results are aggregated and output. The output methods include, but are not limited to, front-end page table display, exporting audit report files, and audit result statistics.

[0175] Abnormal routing audit results are generally divided into:

[0176] Route does not exist: This means that the route data does not exist.

[0177] Breakpoint: There is only one connected component, but a breakpoint exists.

[0178] Segmentation: The number of connected components is greater than 1, and there are multiple connected components with a number of nodes greater than 1.

[0179] Free node: Except for one connected component containing both source and destination nodes, the number of nodes in the other connected components is 1.

[0180] Missing routes: Output detailed information about missing routes between two nodes according to the rules.

[0181] The network channel routing verification method provided in this embodiment uses a graph database to store channels and channel routing data. Channels are entered as nodes into the graph database. Based on the channel routing information, directed connections between ports and the carrying relationships between channels are constructed, and this data is stored in the graph database. During hierarchical routing data auditing, channel and routing data are retrieved in batches from the graph database, and the "Hierarchical Routing Data Audit Sub-process" is processed concurrently using multiple threads. The audit results of the "Hierarchical Routing Data Audit Sub-process" are stored in the graph database. During business layer routing data auditing, based on the channel carrying relationships in the graph database, hierarchical routing data audit anomaly results are quickly aggregated from top to bottom as business layer channel routing data audit results. Finally, the hierarchical routing data audit results and business layer channel routing data audit results are output together as a report. The hierarchical routing data audit uses graph theory connectivity components to determine the connectivity of routes and the integrity of the topology. When the channel routing passes the connectivity test and the audit result is normal, different integrity audit rules are selected based on the characteristics of the business scenario to determine whether the channel routing is complete in the business network structure.

[0182] The network channel routing verification method provided in this embodiment constructs a directed graph based on the directed connection relationships of ports in the routing data. It uses graph algorithms to partition connected components and adds audit rules based on data dimensions for verification, quickly and accurately detecting the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with anomalies in the aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results. This helps vendors rectify data according to the business channel dimension, achieving rapid results.

[0183] To quickly and accurately detect the connectivity and integrity of network channel routes and provide anomaly audit results at the business channel level, helping vendors to rectify data according to the business channel dimension and achieve rapid results, this application provides an embodiment of a network channel route verification device for implementing all or part of the aforementioned network channel route verification method. See [link to embodiment]. Figure 18 The network channel routing verification device specifically includes the following components:

[0184] The data transfer module 100 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 bearer relationship between channels.

[0185] The first detection module 200 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.

[0186] The second detection module 300 retrieves channel data of the business layer from the graph database, and audits the channel bearing structure of each business channel according to the business bearing model and the channel bearing relationship in the graph database, checking whether the channel hierarchy in the bearing relationship is complete; and records the audit anomaly results of the business channels into the graph database.

[0187] The third detection module 400 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.

[0188] The result output module 500 is used to output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0189] As described above, the network channel routing verification device provided in this application constructs a directed graph based on the directed connection relationships of ports in the routing data. It uses graph algorithms to partition connected components and adds audit rules based on data dimensions for verification, enabling rapid and accurate detection of the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results, helping vendors to rectify data according to the business channel dimension and achieve rapid results.

[0190] From a hardware perspective, in order to quickly and accurately detect the connectivity and integrity of network channel routes and provide anomaly audit results at the business channel level, helping manufacturers to rectify data according to the business channel level and achieve rapid results, this application provides an embodiment of an electronic device for implementing all or part of the network channel route verification method. The electronic device specifically includes the following components:

[0191] The system comprises a processor, memory, a communications interface, and a bus; wherein the processor, memory, and communications interface communicate with each other via the bus; the communications interface is used to realize information transmission between the network channel routing verification device and core business systems, user terminals, and related databases and other related devices; the logic controller can be a desktop computer, tablet computer, or mobile terminal, etc., and this embodiment is not limited to these. In this embodiment, the logic controller can be implemented with reference to the embodiments of the network channel routing verification method and the network channel routing verification device in the embodiments, the contents of which are incorporated herein, and repeated details will not be described again.

[0192] It is understood that the user terminal may include smartphones, tablet computers, network set-top boxes, portable computers, desktop computers, personal digital assistants (PDAs), in-vehicle devices, smart wearable devices, etc. Among these, the smart wearable devices may include smart glasses, smartwatches, smart bracelets, etc.

[0193] In practical applications, the network channel routing verification method can be partially executed on the electronic device side as described above, or all operations can be completed in the client device. The choice can be made based on the processing power of the client device and the limitations of the user's usage scenario. This application does not impose any limitations on this. If all operations are completed in the client device, the client device may further include a processor.

[0194] The aforementioned client device may have a communication module (i.e., a communication unit) that can communicate with a remote server to achieve data transmission with the server. The server may include a server on the task scheduling center side; in other implementation scenarios, it may also include a server on an intermediate platform, such as a server on a third-party server platform that has a communication link with the task scheduling center server. The server may include a single computer device, a server cluster consisting of multiple servers, or a distributed server structure.

[0195] Figure 19 This is a schematic block diagram illustrating the system configuration of the electronic device 9600 according to an embodiment of this application. Figure 19 As shown, the electronic device 9600 may include a central processing unit 9100 and a memory 9140; the memory 9140 is coupled to the central processing unit 9100. It is worth noting that... Figure 19 This is an example; other types of structures can also be used to supplement or replace this structure to achieve telecommunications functions or other functions.

[0196] In one embodiment, the network channel routing verification method function can be integrated into the central processing unit 9100. The central processing unit 9100 can be configured to perform the following control:

[0197] Step S101: Synchronize the port data and channel data in the network to the graph database by node type, and establish the connection relationship between ports and the bearer relationship between channels;

[0198] 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 connectivity 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; record the audit abnormal results of the hierarchical routing of each channel into the graph database.

[0199] Step S103: 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; enter the audit anomaly results data of the business channels into the graph database;

[0200] Step S104: Based on the channel bearer relationship in the graph database, aggregate the audit anomaly results of the hierarchical routing to the service layer channel; if the audit result of the channel bearer structure is normal and the aggregation result is empty, then 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, then perform a second audit on the hierarchical routing data of the service channel from the two dimensions of electrical layer routing and optical layer routing; if the result of the second audit is normal, then the routing of the service channel is determined to be normal.

[0201] Step S105: Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0202] As described above, the electronic device provided in this application constructs a directed graph based on the directed connection relationships of ports in the routing data. It uses graph algorithms to partition connected components and adds audit rules based on data dimensions for verification, enabling rapid and accurate detection of the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results, helping manufacturers to rectify data according to the business channel dimension and achieve rapid results.

[0203] In another embodiment, the network channel routing verification device can be configured separately from the central processing unit 9100. For example, the network channel routing verification device can be configured as a chip connected to the central processing unit 9100, and the network channel routing verification method function can be implemented through the control of the central processing unit.

[0204] like Figure 19 As shown, the electronic device 9600 may further include: a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It is worth noting that the electronic device 9600 does not necessarily need to include these components. Figure 19 All components shown; in addition, the electronic device 9600 may also include Figure 19 For components not shown, please refer to existing technologies.

[0205] like Figure 19As shown, the central processing unit 9100, sometimes also referred to as a controller or operating control, may include a microprocessor or other processor device and / or logic device, which receives inputs and controls the operation of various components of the electronic device 9600.

[0206] The memory 9140 may be, for example, one or more of a cache, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices. It may store the aforementioned failure-related information, and also store a program for executing that information. The central processing unit 9100 may execute the program stored in the memory 9140 to perform information storage or processing, etc.

[0207] Input unit 9120 provides input to central processing unit 9100. Input unit 9120 may be, for example, a keypad or touch input device. Power supply 9170 provides power to electronic device 9600. Display 9160 displays images and text. Display may be, for example, an LCD display, but is not limited thereto.

[0208] The memory 9140 can be a solid-state memory, such as a read-only memory (ROM), random access memory (RAM), a SIM card, etc. It can also be a memory that retains information even when power is off, can be selectively erased, and contains more data; examples of this type of memory are sometimes referred to as EPROMs. 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 may include an application / function storage unit 9142 for storing application programs and function programs or processes for executing the operation of the electronic device 9600 via the central processing unit 9100.

[0209] The memory 9140 may also include a data storage unit 9143 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage unit 9144 of the memory 9140 may include various drivers for the electronic device for communication functions and / or for performing other functions of the electronic device (such as messaging applications, address book applications, etc.).

[0210] The communication module 9110 is a transmitter / receiver that sends and receives signals via the 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 is the same as in a conventional mobile communication terminal.

[0211] Based on different communication technologies, multiple communication modules 9110 can be configured in the same electronic device, such as cellular network modules, Bluetooth modules, and / or wireless LAN modules. 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 realizing typical telecommunications functions. The audio processor 9130 may include any suitable buffer, decoder, amplifier, etc. Additionally, the audio processor 9130 is coupled to a central processing unit 9100, enabling on-device recording via the microphone 9132 and on-device playback of stored audio via the speaker 9131.

[0212] Embodiments of this application also provide a computer-readable storage medium capable of implementing all steps of the network channel routing verification method with the execution subject being a server or client in the above embodiments. The computer-readable storage medium stores a computer program that, when executed by a processor, implements all steps of the network channel routing verification method with the execution subject being a server or client in the above embodiments. For example, when the processor executes the computer program, it implements the following steps:

[0213] Step S101: Synchronize the port data and channel data in the network to the graph database by node type, and establish the connection relationship between ports and the bearer relationship between channels;

[0214] 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 connectivity 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; record the audit abnormal results of the hierarchical routing of each channel into the graph database.

[0215] Step S103: 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; enter the audit anomaly results data of the business channels into the graph database;

[0216] Step S104: Based on the channel bearer relationship in the graph database, aggregate the audit anomaly results of the hierarchical routing to the service layer channel; if the audit result of the channel bearer structure is normal and the aggregation result is empty, then 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, then perform a second audit on the hierarchical routing data of the service channel from the two dimensions of electrical layer routing and optical layer routing; if the result of the second audit is normal, then the routing of the service channel is determined to be normal.

[0217] Step S105: Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0218] As described above, the computer-readable storage medium provided in this application constructs a directed graph based on the directed connection relationships of ports in the routing data. It uses graph algorithms to partition connected components and adds audit rules based on data dimensions for verification, enabling rapid and accurate detection of the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results, helping vendors to rectify data according to the business channel dimension and achieve rapid results.

[0219] Embodiments of this application also provide a computer program product capable of implementing all steps of the network channel routing verification method with the execution subject being a server or client in the above embodiments. When this computer program / instruction is executed by a processor, it implements the steps of the network channel routing verification method. For example, the computer program / instruction implements the following steps:

[0220] Step S101: Synchronize the port data and channel data in the network to the graph database by node type, and establish the connection relationship between ports and the bearer relationship between channels;

[0221] 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 connectivity 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; record the audit abnormal results of the hierarchical routing of each channel into the graph database.

[0222] Step S103: 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; enter the audit anomaly results data of the business channels into the graph database;

[0223] Step S104: Based on the channel bearer relationship in the graph database, aggregate the audit anomaly results of the hierarchical routing to the service layer channel; if the audit result of the channel bearer structure is normal and the aggregation result is empty, then 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, then perform a second audit on the hierarchical routing data of the service channel from the two dimensions of electrical layer routing and optical layer routing; if the result of the second audit is normal, then the routing of the service channel is determined to be normal.

[0224] Step S105: Output the audit results of hierarchical routing for each channel and the audit results of routing data for the service channel.

[0225] As described above, the computer program product provided in this application constructs a directed graph based on the directed connection relationships of ports in the routing data. It uses graph algorithms to partition connected components and adds audit rules based on data dimensions for verification, enabling rapid and accurate detection of the connectivity and integrity of channel routes. During the verification process, it does not rely on the segment group order attribute in the routing data, avoiding shallow data quality issues that could prevent verification. Furthermore, it can verify the integrity of the channel carrying structure according to the business channel dimension, quickly aggregating all hierarchical channel routing anomaly audit results. For business channels with abnormal aggregated audit results, a secondary verification is performed to ensure the accuracy and reliability of the verification results, helping vendors to rectify data according to the business channel dimension and achieve rapid results.

[0226] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, apparatus, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied 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.

[0227] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (devices), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations 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, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0228] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0229] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0230] Specific embodiments have been used to illustrate the principles and implementation methods of this invention. The descriptions of the embodiments above are only for the purpose of helping to understand the method and core ideas of this invention. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this invention. Therefore, the content of this specification should not be construed as a limitation of this invention.

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