Route planning method, device, equipment, storage medium and program product

Abstract

Embodiments of the present disclosure provide a routing planning method and device, equipment, storage medium and program product, which belong to the field of infrastructure. The method comprises: for each node in an initial path, identifying at least one minimum ring corresponding to the node according to the node topology relationship of a global topology graph; determining a first minimum ring and a second minimum ring based on the minimum rings corresponding to the nodes in the initial path; combining the target minimum ring and the second minimum ring corresponding to each intermediate node to obtain a subgraph; performing shortest path calculation on the subgraph to obtain a primary route between a first target node and a second target node in a transmission network, and obtaining a backup route corresponding to the primary route based on the primary route and the subgraph. The present disclosure determines the primary route in the simplified subgraph, and separates the primary and backup routes according to the separation principle, ensures that the primary and backup routes are physically separated as much as possible in the network topology and prevents the generation of redundant paths, and improves the efficiency and consistency of routing planning.

Description

Technical Field

[0001] This disclosure pertains to the field of infrastructure and particularly relates to a routing planning method, apparatus, device, storage medium, and program product. Background Technology

[0002] Currently, automatic routing planning for transmission services relies on the shortest path algorithm used by the equipment manufacturer's network management system to calculate primary and backup routes. This requires manual review to check for logically identical routes and unreasonable paths, or repeated iterative calculations by manually setting constraints. This results in problems such as high logically identical route rate, easy path detours across levels, low automation, reliance on manufacturer algorithms, and a lack of unified planning capabilities. Summary of the Invention

[0003] This disclosure provides a routing planning method, apparatus, device, storage medium, and program product that can separate primary and backup routes and rationally plan paths.

[0004] In a first aspect, embodiments of this disclosure provide a route planning method, the method comprising: For each node in the initial path, at least one minimum cycle corresponding to the node is identified according to the node topology relationship in the global topology graph. The minimum cycle is a closed loop with the fewest edges formed by the node and its neighboring nodes. The initial path is the shortest path between the first target node and the second target node in the global topology graph. The nodes in the global topology graph are used to represent network element devices in the transmission network, and the edges in the global topology graph are used to represent the connection relationship between network element devices. Based on the minimum cycle corresponding to each node in the initial path, determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node; wherein, the intermediate node is the node in the initial path other than the first target node and the second target node; The target minimum cycle is combined with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein, the target minimum cycle is selected from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; The shortest path between the first target node and the second target node is calculated on the subgraph to obtain the primary route between the first target node and the second target node in the transmission network. Based on the primary route and the subgraph, the backup route corresponding to the primary route is obtained.

[0005] In one feasible implementation, for each node in the initial path, identifying at least one minimum cycle corresponding to the node according to the node topology relationships in the global topology graph includes: Traverse the global topology graph and define nodes whose number of neighbor nodes is less than or equal to a preset node threshold as chain nodes; If the first-order neighbor nodes of the source node corresponding to the chain node are all chain nodes or the first-order neighbor nodes are all root nodes, the source node is defined as a link node. Based on the node topology relationship between the nodes and the edges associated with the nodes, identify at least one minimum cycle corresponding to each node in the initial path.

[0006] In one feasible implementation, obtaining the backup route corresponding to the primary route based on the primary route and the subgraph includes: Based on the link information of the global topology graph, link points are selected from multiple nodes of the primary route; where a link point is a node in the global topology graph that can form a closed loop with its neighboring nodes. In the subgraph, delete the edges associated with the nodes of the primary route to obtain the first subgraph; Calculate the shortest path between the target nodes in the first subgraph to obtain the backup route corresponding to the primary route.

[0007] In one feasible implementation, before combining the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain the subgraph, the method further includes: Based on the node topology relationships in the global topology graph, identify the minimum cycle corresponding to each node in the global topology graph; Calculate the betweenness centrality of each node in the global topology graph; In the minimum cycle corresponding to each node in the global topology graph, the cycle property of the minimum cycle containing the node with the maximum betweenness centrality is defined as the core cycle. Set the ring level for the smallest ring that intersects the core ring and has no defined ring properties; Based on the ring hierarchy of the first minimum ring, select the target minimum ring from multiple first minimum rings.

[0008] In one feasible implementation, selecting a target minimum ring from a plurality of first minimum rings based on the ring hierarchy of the first minimum ring includes: Based on the ring hierarchy of the first minimum ring, select the target minimum ring from the first minimum ring that contains the first target node and the second target node; If there is no first minimum ring containing the first target node and the second target node, select the target minimum ring from the first minimum ring containing either the first target node or the second target node according to the ring hierarchy of the first minimum ring.

[0009] In one feasible implementation, the method further includes, prior to calculating the shortest path between the first and second target nodes in the subgraph: If there is no path connecting the first target node and the second target node in the subgraph, expand at least one minimum cycle corresponding to each node in the initial path based on the minimum cycle corresponding to each node in the global topology graph. Return to the execution steps based on the minimum cycle corresponding to each node in the initial path, determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node.

[0010] Secondly, embodiments of this disclosure provide a route planning apparatus, the apparatus comprising: The identification module is used to identify at least one minimum cycle corresponding to each node in the initial path according to the node topology relationship of the global topology graph. The minimum cycle is a closed loop with the fewest edges formed by the node and its neighboring nodes. The initial path is the shortest path between the first target node and the second target node in the global topology graph. The nodes of the global topology graph are used to represent network element devices in the transmission network, and the edges of the global topology graph are used to represent the connection relationship between network element devices. The classification module is used to determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node, based on the minimum cycle corresponding to each node in the initial path; wherein, the intermediate nodes are the nodes in the initial path other than the first target node and the second target node. The combination module is used to combine the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein, the target minimum cycle is selected from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; The generation module is used to calculate the shortest path between the first target node and the second target node in the subgraph, obtain the primary route between the first target node and the second target node in the transmission network, and obtain the backup route corresponding to the primary route based on the primary route and the subgraph.

[0011] Thirdly, this disclosure provides a routing planning device, which includes a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement any of the routing planning methods in the above embodiments.

[0012] Fourthly, this disclosure provides a computer storage medium storing computer program instructions, which, when executed by a processor, implement any of the routing planning methods described in the above embodiments.

[0013] Fifthly, this disclosure provides a computer program product, including a computer program that, when executed by a processor, implements any of the routing planning methods described in the above embodiments.

[0014] The routing planning method, apparatus, device, storage medium, and program product disclosed herein can separate primary and backup routes and rationally plan paths. First, by retaining the minimum cycle of each node on the shortest path between the first and second target nodes, the global topology graph formed by network elements in the transmission network is simplified, converging the calculation scope from the global to a local subgraph, significantly reducing memory usage and CPU computation time, and achieving fast response. Simultaneously, the subgraph contains rich bypass information, providing a basis for the physical separation of primary and backup routes in the network topology. Second, the primary route is determined in the simplified subgraph, and based on the principle of primary and backup route separation, the backup route corresponding to the primary route is determined using the primary route and the subgraph. This ensures that the primary and backup routes are physically separated as much as possible in the network topology and prevents the generation of redundant paths. Compared to the method of independently calculating primary and backup routes and forcing path separation through constraints, this disclosure can effectively avoid the generation of logically identical routes, improving the efficiency and consistency of routing planning. Attached Figure Description

[0015] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the accompanying drawings used in the embodiments of this disclosure will be briefly introduced below. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 This is a flowchart illustrating a routing planning method provided in an embodiment of this disclosure; Figure 2 This is a schematic diagram of a process for determining the connection attributes of a node according to an embodiment of this disclosure; Figure 3 This is a schematic diagram of a path planning and scheduling method based on traditional manual implementation, provided by an embodiment of this disclosure. Figure 4 This is a schematic diagram of path planning and scheduling implemented based on the path planning method of this disclosure, provided in an embodiment of this disclosure; Figure 5 This is a schematic diagram of the structure of a routing planning device provided in an embodiment of this disclosure; Figure 6 This is a schematic diagram of the structure of a routing planning device provided in an embodiment of this disclosure. Detailed Implementation

[0017] The features and exemplary embodiments of various aspects of this disclosure will now be described in detail. To make the objectives, technical solutions, and advantages of this disclosure clearer, the following detailed description, in conjunction with the accompanying drawings and specific embodiments, will provide a further detailed description. It should be understood that the specific embodiments described herein are intended only to explain this disclosure and not to limit it. For those skilled in the art, this disclosure can be implemented without some of these specific details. The following description of the embodiments is merely to provide a better understanding of this disclosure by illustrating examples.

[0018] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising..." does not exclude the presence of additional identical elements in the process, method, article, or apparatus that includes said element.

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

[0020] In the embodiments of this application, certain software, components, models and other existing solutions in the industry may be mentioned. These should be regarded as exemplary and are only intended to illustrate the feasibility of implementing the technical solution of this application. However, they do not mean that the applicant has used or necessarily used the solution.

[0021] With the rapid development of 5G (5G) technology and computing networks, the volume of transmission traffic has increased significantly. To cope with this rapid growth, the activation method for transmission services has shifted from traditional service distribution via network management to distribution through a Super Controller (SC). By deploying the SC, configuration commands are sent to the device manufacturer's network management system (Device Controller, DC). The device manufacturer's DC then automatically calculates the transmission services using its respective routing planning methods. For example, after receiving a service request, the SC distributes the routing calculation task to each manufacturer's DC. Each manufacturer uses a shortest path algorithm (such as Dijkstra's algorithm) to calculate the primary and backup routes, and returns the results to the SC interface for manual review. During manual review, if logical co-routes or unreasonable routing paths are found between the primary and backup routes, constraints on necessary or avoidance nodes must be manually set to recalculate the routes. After identifying services without logical co-routes, the service activation operation is performed, and the service is distributed to the device.

[0022] While this existing technology has achieved a certain degree of automation in route calculation, it suffers from the following technical drawbacks. Firstly, the route planning results exhibit a high rate of logically identical routes. Because both primary and backup routes are calculated independently using the shortest path algorithm without considering the separation between paths, logically identical routes occur, meaning that primary and backup routes frequently intersect and share the same network element or link. Under the current scheme, the logically identical route rate is as high as approximately 60%, severely impacting service reliability and preventing truly fully automated activation; manual intervention for route adjustment is still required. Secondly, unreasonable route paths lead to detours between network layers. The shortest path algorithm only uses hop count or simple weights as optimization targets, without considering the hierarchical structure of the transmission network (such as access layer, aggregation layer, and core layer). The calculated routes may include unreasonable paths that detour from the access layer to the aggregation layer and then back to the access layer before re-entering the aggregation layer, violating the normal flow principle of network traffic and increasing transmission latency and failure risk. Thirdly, the algorithm is highly dependent on other algorithms and lacks unified planning capabilities. The different routing algorithms used by different data centers (DCs) lead to inconsistent routing planning results in cross-vendor networks, increasing operational complexity. Furthermore, enterprises themselves lack control over the core routing planning logic, making it difficult to optimize and adjust for their own network characteristics, thus limiting their technological autonomy. Fourthly, there is a strong reliance on manual intervention. Manually determining route consistency and setting constraints, followed by iterative calculations, not only prolongs service activation time but also results in low efficiency and poor consistency in routing planning due to reliance on the experience of operations personnel, hindering large-scale automated deployment.

[0023] To address the problems of existing technologies, embodiments of this disclosure provide a routing planning method, apparatus, device, storage medium, and program product. This disclosure ensures that primary and backup routes are separated as much as possible in the network topology by dynamically constructing subgraphs of the global topology, eliminating common edges, and prioritizing ring paths, significantly reducing the logical co-routes rate. Based on node betweenness centrality, core rings are identified, ring levels are iteratively divided, and edge weights are dynamically calculated by combining ring levels and node betweenness centrality to guide routes to prioritize higher-level ring paths, avoiding detours between network levels. Through steps such as node-based initial screening, topology tracing, and cyclic verification, network element nodes are automatically classified into rings, chains, or roots, and multiple logical connections are simplified to form a simplified topology graph, laying the foundation for ring identification and route calculation.

[0024] This routing planning method can be applied to scenarios involving path planning for network elements in a transmission network. The executing entity of this routing planning method can be any electronic device connected to or communicating with the transmission network. For example, it can be a transmission SC super controller. In a transmission network management environment, the SC acts as a centralized controller, interacting with the DCs of various equipment manufacturers.

[0025] The routing planning method provided in the embodiments of this disclosure will be introduced first.

[0026] Figure 1 A flowchart illustrating a routing planning method provided in one embodiment of this disclosure is shown. Figure 1 As shown, the method may include the following steps: S110. For each node in the initial path, identify at least one minimum cycle corresponding to the node according to the node topology relationship of the global topology graph; wherein, the minimum cycle is a closed loop with the fewest edges formed by the node and its adjacent nodes, the initial path is the shortest path between the first target node and the second target node in the global topology graph, the nodes of the global topology graph are used to represent network element devices in the transmission network, and the edges of the global topology graph are used to represent the connection relationship between network element devices. S120. Based on the minimum cycle corresponding to each node in the initial path, determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node; wherein, the intermediate node is the node in the initial path other than the first target node and the second target node. S130. Combine the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein, the target minimum cycle is obtained by filtering from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; S140. Calculate the shortest path between the first target node and the second target node in the subgraph to obtain the primary route between the first target node and the second target node in the transmission network, and obtain the backup route corresponding to the primary route based on the primary route and the subgraph.

[0027] Here, the first target node can be the starting node, and the second target node can be the ending node.

[0028] Here, the topological relationship of the first minimum ring can be the inter-ring topological relationship between minimum rings, or the topological relationship of the first minimum ring in the entire global topological graph.

[0029] Thus, this application first simplifies the global topology graph formed by network elements in the transmission network by retaining the minimum cycle of each node on the shortest path between the first and second target nodes. This reduces the calculation scope from the global to the local subgraph, significantly reducing memory usage and CPU processing time, and achieving fast response. Simultaneously, the subgraph contains rich bypass information, providing a basis for the physical separation of primary and backup routes in the network topology. Secondly, the primary route is determined in the simplified subgraph, and based on the principle of primary and backup route separation, the backup route corresponding to the primary route is determined using the primary route and the subgraph. This ensures that the primary and backup routes are physically separated as much as possible in the network topology and prevents the generation of redundant paths. Compared to the method of independently calculating primary and backup routes and forcing path separation through constraints, this disclosure effectively avoids the generation of logically identical routes, improving the efficiency and consistency of route planning.

[0030] The above steps are explained in detail below: Regarding S110, this disclosure establishes and updates a global topology map using resource data from the transmission network. Here, the global topology map can be an initial global topology map generated based on the resource data, or a simplified global topology map obtained by simplifying the initial global topology map through a deduplication operation.

[0031] In a specific example, the SC super controller reads resource data such as topology and ports from the northbound interface of the Slicing Packet Network (SPN) / Packet Transport Network (PTN) and imports it into the graph database. The SC calls the graph database's Application Programming Interface (API) to parse the topology data provided by the northbound interface in XML or JSON format into nodes and edges. Only logical topology relationships (such as connections between network elements) are retained, ignoring physical link details (such as ports and time slots), forming an initial global topology graph.

[0032] Furthermore, to reduce topological complexity and facilitate subsequent path calculations, the initial global topology graph needs to be simplified. After importing the topology data of the initial global topology graph into the graph database, SC executes a Cypher query statement through the graph database to simplify the multiple logical connections between network elements in the graph database memory, generating a simplified global topology graph G with unique connections.

[0033] For example, using the Cypher statement to query all network element pairs, if there are multiple directly connected logical topologies between network element a and network element b, then only one edge is retained.

[0034] After establishing the global topology map, it can be updated according to the above process when a business routing planning request is triggered or within a period.

[0035] This disclosure also enables the automatic calculation of node connection attributes. Through steps such as initial screening based on node degree, topology tracing, and cyclic verification, network element nodes are automatically classified into rings, chains, or roots, and multiple logical connections are simplified to form a simplified topology graph, laying the foundation for ring identification and route calculation, thereby improving the accuracy and efficiency of route planning.

[0036] In one optional implementation, for each node in the initial path, identifying at least one minimum cycle corresponding to the node according to the node topology relationships in the global topology graph includes: Traverse the global topology graph and define nodes whose number of neighbor nodes is less than or equal to a preset node threshold as chain nodes; If the first-order neighbor nodes of the source node corresponding to the chain node are all chain nodes or the first-order neighbor nodes are all root nodes, the source node is defined as a link node. Based on the node topology relationship between the nodes and the edges associated with the nodes, identify at least one minimum cycle corresponding to each node in the initial path.

[0037] Here, the number of neighboring nodes can be determined by the node degree. The preset node threshold can be 1. It should be noted that although isolated nodes with a node degree of 0 have no connection relationship and do not satisfy the closed property of a ring structure, this application defines them as chain nodes, which belongs to a special scenario of chains.

[0038] Meanwhile, chain nodes, link nodes, and root nodes are used to represent the connection attributes of a node. For example, the connection attribute of a chain node is "chain." When a node's connection attribute is "chain," it means that the node can form a link with other nodes in the global topology graph, but cannot form a closed loop. Conversely, when a node's connection attribute is "loop," it means that the node can form a closed loop with other nodes in the global topology graph. A root node is a special case of a link node. A root node is a special node located in a ring structure and from which a chain originates; essentially, it is an extension of the ring, and its connection attribute can be marked as "ring" and "root."

[0039] In a specific example, after simplifying the global topology graph, SC calls the Cypher query engine of the graph database and, based on the topology reasoning of the graph database, determines the connection attribute of each network element node in the global topology graph, that is, whether the node belongs to a ring, chain or root.

[0040] Figure 2 A schematic diagram illustrating the process of determining the connection attributes of a node according to an embodiment of this disclosure is shown. Figure 2 As shown, it includes steps S112 to S115. The process involves initial assignment, degree-based screening, topological tracing and subdivision, and cyclic verification and locking. The specific steps are as follows.

[0041] S112 assigns initial connection attribute values, defining all nodes as loop nodes. By default, the connection attribute field value of all nodes in the global topology graph is set to loop. That is, it is initially assumed that all nodes belong to a loop structure, and subsequent adjustments are made by gradually eliminating loops.

[0042] S113, Initial screening and modification based on node degree. A Cypher query is called to calculate the degree of all nodes in the global topology graph, i.e., the number of edges connected to that node. Then, the connection attribute of the node is modified according to its degree. If the node degree is ≤1, its connection attribute is changed to a chain; otherwise, it remains a link.

[0043] S114, attribute subdivision based on topology tracing. Starting with nodes already identified as chain nodes or leaf nodes in the topology as source nodes, trace upwards, selecting source nodes to be judged from nodes currently connected as cycles or roots, and correcting the connection attributes of each source node. This mainly involves the following two types of judgment scenarios.

[0044] When the degree of the source node to be judged is 2, it can be determined that the source node is an intermediate node of the chain by using the node degree feature. If at least one of the two first-order neighbors of the node has a chain connection attribute, the connection attribute of the source node is changed from cycle to chain; otherwise, the cycle is maintained.

[0045] When the degree of the source node to be judged is greater than 2, the node topology is relatively complex. The source node may be a branch point of a ring with chains, a tree structure node, or a ring intersection node. In this case, if the connection attribute of all first-order neighbors is a ring or root, the connection attribute of the source node is set to ring; if the connection attributes of first-order neighbors include both chains and rings / roots, the connection attribute of the source node is defined as root; if the number of rings / roots among the connection attributes of first-order neighbors is ≤1, that is, the majority of neighbors are chains, the connection attribute of the source node is changed to chain.

[0046] Simultaneously, loop verification and loop termination determination are performed. In complex tree structures, a middle branch node may initially be determined as the root due to its neighbor being a cycle. As subsequent edge branch nodes are gradually determined as chains, the connection attributes of the middle branch node's neighbors will be updated. This needs to be corrected through loop propagation until the attribute distribution stabilizes. Therefore, the judgment logic for attribute subdivision needs to be verified. Each loop selects a source node from the nodes whose current connection attribute is a cycle or root. After each loop, the number of nodes with cycle, chain, and root attributes in the global topology graph is counted. When the number of nodes with all three connection attributes is completely consistent after two consecutive loops, the loop is exited, and S115 is performed to lock the connection attribute of the node.

[0047] In another specific example, after determining the connectivity attributes of each node, SC executes a loop detection algorithm based on the degenerate global topology graph G to identify all non-repeating minimum loops in network G, and then determines the corresponding minimum loop for each node in the initial path based on the identification results.

[0048] First, nodes on the chain are temporarily removed to simplify calculations. After degeneracy, all nodes with the connection attribute of "chain" and their associated edges are deleted, while nodes with the attributes of "cycle" and "root" and their node topological relationships are retained.

[0049] Next, calculate the unique cycles, i.e., cycles with the minimum number of hops / edges and distinct node orders. Iterate through the neighboring nodes, and for each direct neighbor (first-order neighbor) u of each node v in the global topology graph G, try to find the shortest path from u back to v without passing through v. Alternatively, remove edges directly connecting v to u from the degenerate topology G and then find the shortest path. If such a shortest path exists, count v→u→...→v as a cycle.

[0050] Finally, record the minimum cycle. Represent the cycle according to a unified structure to obtain the minimum cycle. Record the node sequence and length of the minimum cycle. Here, the length is the shortest path length + 1, which is the number of edges on the cycle.

[0051] More specifically, the node sequence of the minimum cycle is recorded as a dictionary data structure. First, the node sequence of the cycle is converted into a standard form, ensuring that multiple cycles with different starting points or directions are uniformly represented as a single minimum cycle. The standardized minimum cycle is stored in a set, and duplicates are automatically removed using the uniqueness of the set. Then, the above results are organized and output in dictionary format, such as {"cycle":["A","B","C"],"length":3,"MinCycleID":H0001}. Here, cycle represents the node of the minimum cycle, length represents the length of the minimum cycle, and MinCycleID represents the ID of the minimum cycle.

[0052] For example, to address the issue that rings A→B→C→A and A→C→B→A have different sequences, and rings A→B→C→A and B→C→A→B, although their sequences and starting points differ, belong to the same minimal ring, this disclosure uses the smallest node ID of each ring as the starting point, then compares the clockwise and counterclockwise lexicographical orders, and uses the direction corresponding to the smaller lexicographical order as the standard direction. When the node with the smallest ID in the ring is A, rings A→B→C→A, B→C→A→B, and A→C→B→A are standardized into the minimal ring A→B→C.

[0053] Finally, the shortest path between the first and second target nodes is calculated to obtain the initial path. The weighted shortest path can be calculated using Dijkstra's algorithm. Then, the set of minimum cycles G0 associated with the shortest path is calculated. All network elements on the shortest path are listed, and all minimum cycles associated with these elements are found, forming a mesh subgraph G0. Additionally, G0 can contain minimum cycles and chains associated with the shortest path.

[0054] Thus, this disclosure pre-emptively removes chain nodes, narrowing the cycle search range from the entire graph to the core subgraph of the cycle. This avoids redundant traversal on a large number of invalid nodes, reduces computational complexity, and prevents chain nodes from misjudging cycle points (for example, a long chain attached to a cycle might be misjudged as multiple small cycles). Furthermore, by using an adjustable parameter such as a preset node threshold, the method of this disclosure can adapt to topological graphs of different densities. For graphs with multi-level nested cycles or complex interconnection structures, it can still effectively strip away outer chains and focus on the accurate identification of inner cycles.

[0055] In section S120, the minimum rings are filtered and classified according to the type of each node on the initial path. The minimum rings corresponding to the first and second target nodes are designated as the first minimum rings, while the minimum rings corresponding to each intermediate node are designated as the second minimum rings. Then, the topology of the second minimum rings is optimized based on the first minimum rings to obtain the optimal subgraph, laying the foundation for generating mutually separate and rationally routed primary and backup routes.

[0056] Regarding S130, this disclosure sets the ring hierarchy for the minimum ring based on the topological complexity of the minimum ring in order to achieve the screening of the target minimum ring.

[0057] In an alternative implementation, before combining the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain a subgraph, the method further includes: Based on the node topology relationships in the global topology graph, identify the minimum cycle corresponding to each node in the global topology graph; Calculate the betweenness centrality of each node in the global topology graph; In the minimum cycle corresponding to each node in the global topology graph, the cycle property of the minimum cycle containing the node with the maximum betweenness centrality is defined as the core cycle. Set the ring level for the smallest ring that intersects the core ring and has no defined ring properties; Based on the ring hierarchy of the first minimum ring, select the target minimum ring from multiple first minimum rings.

[0058] Here, the betweenness centrality of a node can be the ratio of all initial paths to the initial paths passing through that node.

[0059] For example, let the global topology graph be G=(V,E), where V is the set of nodes and E is the set of edges. Node v The median centrality of V As defined in equation (1), the graph database can be used to calculate the total number of nodes. .

[0060] (1) in, The number of shortest paths between the first target node s and the second target node t; (v) represents the number of shortest paths passing through v.

[0061] Here, the ring hierarchy is used to characterize the topological complexity of the minimum ring in the global topology graph. It can also characterize the degree of association between the minimum ring and the core ring.

[0062] It should be noted that when the topology graph has a relatively compact or simple structure, all the smallest cycles in the global topology graph will intersect with the core cycle. However, when there are smallest cycles that do not intersect with the core cycle, the composition of the core cycle can be updated iteratively, gradually setting the level of all smallest cycles.

[0063] In a specific example, after identifying the minimum cycle, SC calls the betweenness centrality algorithm and hierarchical partitioning logic of the graph database to identify the core cycle (ROOT cycle) based on betweenness centrality, iteratively partitions the cycle hierarchy, and calculates the edge weights.

[0064] First, find the node with the highest intermediary centrality. , contain The smallest cycle is defined as the core cycle, denoted by the set. .

[0065] Next, the set of minimum cycles is initialized, and hierarchical iterative partitioning begins. The current set of classified cycles, A = Let B = C\A be the set of unclassified cycles, where C is the set of all minimal cycles, and B is the difference between set C and set A. Define the core cycle level index k = 0, and iterate according to the following rule: find all cycles that share a common node with a cycle in A. This part of the ring is divided into ring levels. And move it from B to A; then let k = k + 1, and repeat the iteration until B = .

[0066] For example, the elements in sets A and B can be in the form of sets. In a certain iteration, set A = {1,2},{3,4},{5}} and set B = {{1,6},{6,7},{3},{2,5,8}}. Then, the larger union of set A is calculated. ={1,2,3,4,5}; simultaneously check whether each element c in set B satisfies... .for ={1,6},{1,6}∩{1,2,3,4,5}={1}= Therefore, it is retained. ;for ={6,7}:{6,7}∩ = Therefore, it is excluded; for ={3}:{3}∩ ={3}≠ Therefore, it is retained; for ={2,5,8}:{2,5,8}∩ ={2,5}≠ Therefore, it is retained. Ultimately, the set corresponding to all rings in A that share a common node and whose ring properties are not defined is {{1,6},{3},{2,5,8}}.

[0067] In addition, Table 1 shows a correspondence table between ring levels and indices provided in one embodiment of this disclosure. As shown in the table below, with the increase of the level index, the correlation between the ring level of the smallest ring and the core ring in the initial iteration becomes weaker and weaker. In order to quantify the ring level, this disclosure also establishes a ring weight mapping function as shown in Equation (2). : (2) in, Represents the ring weights, used to quantify the ring hierarchy; This indicates a hierarchical index.

[0068] Table 1. Correspondence between ring levels and indexes Then, by determining edge weights based on ring weights, when determining primary and backup routes, routes on the ring can be selected as much as possible during route calculation based on edge weights. For an edge e=(u,v)∈E, find the highest-level smallest ring that simultaneously contains u and v, and let its level be 1. If such a cycle exists, then the edge weights... For equation (3): (3) If there is no common cycle, the edge is a cross-cycle connection, and the edge weight is assigned as in equation (4): (4).

[0069] Thus, this disclosure selects the core ring most relevant to the initial path based on the betweenness centrality of nodes. Then, it represents the minimum rings hierarchically according to the relationships between other minimum rings and the core ring. Based on this hierarchical representation, it filters out edge rings far from the core ring, significantly reducing the combinatorial search space and minimizing the randomness of subsequent subgraph combinations. This facilitates the generation of hierarchical, nestable subgraph structures, making visualization and hierarchical path calculation easier. Furthermore, when nodes fail or new links are added in the global topology, only the betweenness centrality and ring hierarchy of the affected region need to be recalculated locally, eliminating the need for global reconstruction and facilitating incremental updates.

[0070] After determining the ring level of the first minimum ring, it is necessary to select the target minimum ring from the first minimum rings corresponding to the first target node and the second target node respectively, in order to avoid turning the first target node or the second target node into an island, which would cause the primary and backup routing calculations to fail.

[0071] In one optional implementation, selecting a target minimum ring from a plurality of first minimum rings based on the ring hierarchy of the first minimum ring includes: Based on the ring hierarchy of the first minimum ring, select the target minimum ring from the first minimum ring that contains the first target node and the second target node; If there is no first minimum ring containing the first target node and the second target node, select the target minimum ring from the first minimum ring containing either the first target node or the second target node according to the ring hierarchy of the first minimum ring.

[0072] Here, the ring level of the first minimum ring is used to characterize the topological complexity of the first minimum ring in the global topology graph.

[0073] In a specific example, the minimum cycles containing the first and second target nodes are selected to prevent them from existing in multiple minimum cycles simultaneously, thus avoiding the possibility of the first or second target node becoming an isolated node when removing common edges from the minimum cycles later. Specifically, all minimum cycles in G0 are filtered to identify those involving either the first or second target node, forming the first minimum cycle set Z. For each first minimum cycle in Z, the edge weights and cycle weights of that cycle are calculated. Z is then categorized into three sets: Z1 (containing only the first target node), Z2 (containing only the second target node), and Z3 (containing both). The first minimum cycles involved in Z are then removed from GO, resulting in a topology G1 that contains only the second minimum cycle and no first minimum cycle.

[0074] It should be noted that when there are two or more second target nodes, the first minimum ring in Z2 needs to contain all the second target nodes or a single second target node. The first minimum ring in Z3, which has both source and destination nodes, needs to contain all the second target nodes and the first target node, or contain a certain second target node and the first target node.

[0075] Then, the target minimum cycle and the second minimum cycle are combined, and the target minimum cycle is used to complete G1.

[0076] First, determine whether set Z3 is empty. If it is not empty, that is, there exists a first minimum cycle containing the first target node and the second target node, then select the target minimum cycle from low to high according to the cycle weight (i.e., the cycle weight value) and put it into G1. The other minimum cycles in Z1 and Z2 do not need to be considered.

[0077] When Z3 is empty, first select the first minimum ring from Z1 according to the ring weight from low to high and put it into G1. Then select the first minimum ring from Z2 according to the ring weight from low to high and put it into G1. At this time, G1 contains the first target node and the second target node, and the first target node and the second target node only involve one first minimum ring.

[0078] It should be noted that if, after performing steps S130 and S140 on the target minimum rings selected from Z1 and Z2, a complete primary and backup route still cannot be obtained, then the first minimum ring with the lowest unselected ring weight in Z1 and Z2 is selected as the target minimum ring and simultaneously placed into G1, repeating S130 and S140. In other words, when placing the target minimum ring for the second time, the first target minimum ring must be removed and cannot be added back in. Furthermore, since Z3 itself contains both the first and second target nodes, separate and complete primary and backup routes will be obtained.

[0079] After combining the target minimum cycle and the second minimum cycle, common edges in G1 need to be removed. Specifically, the common edges in G1 are calculated; if an edge belongs to both the A minimum cycle and the B minimum cycle, it is removed, forming subgraph G2. When there are two or more second target nodes, the adjacent edges between two adjacent second target nodes can be deleted before removing the common edges in G1, and then the common edge removal can be performed.

[0080] Thus, when a minimum cycle exists that includes both the first and second target nodes, it means there are at least two physically or logically separate paths between them, satisfying the requirements of primary / backup route separation and ensuring route connectivity. However, these conditions are difficult to achieve in tree-like or sparse networks. Therefore, a minimum cycle containing one of the first or second target nodes is selected to avoid route calculation failure due to a lack of solutions. Furthermore, selecting the minimum cycle based on its hierarchy ensures the rationality of the minimum cycle selection, and utilizing key cycles in the network makes subsequent subgraph combinations more globally meaningful.

[0081] Involving S140, after obtaining subgraph G2, path calculation begins based on the principle of separating primary and backup routes.

[0082] In one optional implementation, obtaining the backup route corresponding to the primary route based on the primary route and the subgraph includes: Based on the link information of the global topology graph, link points are selected from multiple nodes of the primary route; where a link point is a node in the global topology graph that can form a closed loop with its neighboring nodes. In the subgraph, delete the edges associated with the nodes of the primary route to obtain the first subgraph; Calculate the shortest path between the target nodes in the first subgraph to obtain the backup route corresponding to the primary route.

[0083] Here, the node switching information of the global topology graph can include the connection attribute information of each node in the global topology graph, that is, whether the connection attribute of the node is a cycle, a chain or a root.

[0084] In a specific example, a primary route is calculated for G2, and a backup route is calculated for G3. The DJ algorithm is used to calculate the shortest path from the first destination node to the second destination node in G2, which is recorded as the primary route. Then, edges on cycles in G2 are removed, leaving only the edges on chains to form G3. The DJ algorithm is used to calculate the shortest path from the first destination node to the second destination node in G3, which is recorded as the backup route. At this point, the primary and backup routes are as separate as possible except for the chains. Simultaneously, identical chains traversed in both routes are output as unavoidable segments of the same route. When there are two or more second destination nodes, another second destination node can be selected as the destination node for the backup route, while the other steps remain unchanged.

[0085] Thus, by simplifying the subgraph using the primary route, it is ensured that the backup route and the primary route no longer share edges at node nodes. Compared to establishing and implementing node disjoint constraints using algorithms, this disclosure achieves effective and reliable route separation in a lighter weight. Furthermore, deleting only edges without deleting nodes allows node nodes to still serve as transit nodes for backup routes, reducing the number of unsolvable cases caused by completely removing node nodes and improving the success rate of backup route generation. Moreover, since the subgraph already contains the core ring and the smallest rings at the surrounding levels, after deleting the edges associated with node nodes, the backup route remains within the effective structure of the subgraph and will not deviate into acyclic chain regions, ensuring the structural reliability of the backup path.

[0086] Furthermore, this disclosure also proposes a fault-tolerance mechanism.

[0087] In an alternative implementation, before calculating the shortest path between the first target node and the second target node in the subgraph, the method further includes: If there is no path connecting the first target node and the second target node in the subgraph, expand at least one minimum cycle corresponding to each node in the initial path based on the minimum cycle corresponding to each node in the global topology graph. Return to the execution steps based on the minimum cycle corresponding to each node in the initial path, determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node.

[0088] Here, the path connecting the first target node and the second target node can be determined by calculating the shortest path between the first target node and the second target node in the subgraph.

[0089] In a specific example, if all the first minimum rings are traversed when filtering the target minimum ring, and the primary / backup separation route still cannot be calculated based on the corresponding subgraph, then the search scope for the primary / backup route needs to be expanded, and G0 needs to be expanded. List all the minimum rings involved by all network elements in G0, remove duplicates, and use this as a new G0, repeating steps S120-S140. Continue until the primary and backup routes are analyzed. If no results are found, feedback should be provided: no complete primary / backup route could be found in the topology G0. The number of expansion attempts can be set to 3 by default, and the number is adjustable. G0 can be exported as an attachment.

[0090] Thus, considering that the subgraph constructed initially may have insufficient ring coverage, resulting in no connected paths between target nodes, the ring resources are dynamically increased by expanding the capacity, making the originally unsolvable topology conditions solvable and improving the success rate of the algorithm in generating routes under complex topologies.

[0091] The technical effectiveness of this disclosure will be verified below with a specific example.

[0092] In a complete example, the determination of primary and backup routes can be carried out in four stages: data preparation, topology preprocessing, transmission network structure analysis, and route calculation. In the data preparation stage, the topology data of the transmission network is read from the SPN / PTN northbound interface and imported into a graph database to construct the topology structure, obtaining an initial global topology graph. In the topology preprocessing stage, the logical topology is first simplified by removing duplicate edges, resulting in a simplified global topology graph. Then, the connectivity attributes of the nodes in the simplified global topology graph are calculated. In the transmission network structure analysis stage, the smallest cycles in the simplified global topology graph are first identified, then the betweenness centrality of each node is calculated to determine the core cycle. The core cycle is then used to partition the smallest cycles into ring levels, determining the ring weights and edge weights. In the route calculation stage, the shortest path between target nodes is first calculated, constructing a topology graph G0; then, the set of smallest cycles Z with the shortest path to the target nodes is selected, and topology graphs G1, G2, and G3 are constructed based on Z; next, the primary route is calculated, and then the backup route corresponding to the primary route is calculated.

[0093] Figure 3 This illustration shows a schematic diagram of a path planning and scheduling method based on traditional manual implementation, according to an embodiment of this disclosure. Figure 3As shown, when the separation strategy displays "no strategy," it indicates that the primary and backup routes are calculated using DC, and the calculation results are displayed on the topology display interface. In this case, traditional routing methods require manual segment-by-segment planning and verification of routes. According to the topology display interface, with network element 36-18 as the first target node and network element 37-1225 as the second target node, the primary and backup routes between them have been calculated. However, it can be seen that the primary and backup routes are not explicitly separated, and there are points where the primary and backup routes intersect. That is, the primary and backup routes intersect at network elements 36-59 and 36-23. Since network elements 36-59 and 36-23 are both located on two different rings, there is a possibility of path confusion after the intersection. Therefore, there is a risk of path overlap, and manual verification and adjustment are time-consuming, resulting in an average overall scheduling time of 8 hours. It should be noted that no co-routes occurred on network element 37-464 because network element 37-464 is located on a ring and extends a chain from the ring.

[0094] Figure 4 A schematic diagram of path planning and scheduling implemented based on the path planning method of this disclosure is shown in one embodiment. For example... Figure 4 As shown, the separation strategy displays an intelligent strategy, indicating that the path planning method of this disclosure embodiment is used. This method can automatically identify the network topology and generate primary and backup routes in real time on the topology display interface, marking them with different colors. According to the topology display interface, with network element 36-18 as the first target node and network element 37-1225 as the second target node, the generated primary and backup routes do not share the same route, achieving physical isolation between primary and backup routes. Planning can be completed without manual intervention, reducing scheduling time to minutes and significantly improving service response speed and customer experience. Therefore, this disclosure significantly optimizes circuit scheduling efficiency through automated route planning and path separation mechanisms.

[0095] In summary, this disclosure achieves automatic planning of transmission service routes based on graph databases and knowledge graphs. By introducing graph databases to store and infer network topology, automatically identifying connection attributes, dividing ring levels, dynamically calculating weights, and intelligently calculating primary and backup routes based on path separation principles, it fundamentally solves the limitations of existing shortest path algorithms in transmission network routing planning. Specifically, when calculating primary and backup routes, subgraphs (such as G0, G1, and G2) are dynamically constructed. By eliminating common edges (i.e., edges that belong to multiple minimum rings simultaneously), prioritizing ring paths, and employing route separation algorithms (such as eliminating ring edges after calculating the primary path before calculating the backup path), it ensures that primary and backup routes are separated as much as possible in the network topology, significantly reducing the logical co-routing rate. The logical co-routing rate of primary and backup routes is reduced from approximately 60% in existing technologies to less than 10%, greatly reducing the risks of path intersections and sharing critical network elements or links, thereby improving service redundancy and fault recovery capabilities. Based on node betweenness centrality, the core ring (ROOT ring) is identified, and ring layers (such as core ring, aggregation ring, and access ring) are iteratively divided. Differentiated weights are assigned to the smallest rings at different layers (lower weights for higher-level rings and higher weights for lower-level rings). In edge weight calculation, the weights are dynamically adjusted by combining ring layer and node centrality, so that the routing algorithm prioritizes higher-level ring paths, naturally following the principle of network traffic flow from the core to the access layer. This avoids cross-layer detours and solves the problem of shortest path algorithms ignoring the hierarchical structure of the network. The routing path conforms to the hierarchical structure of the transmission network (such as core layer, aggregation layer, and access layer), avoiding the unreasonable paths that detour from the access layer to the aggregation layer and then back to the access layer in existing technologies, thereby reducing transmission latency and failure risk.

[0096] By using graph databases (such as Neo4j) to store network topology data, and using the Cypher query language to automatically perform steps such as topology degeneracy, connectivity attribute calculation, minimum cycle identification, weight calculation, and path separation, an end-to-end automated process is formed. There is no need for manual judgment of logical routes or setting of constraints, which reduces the service activation time from hours to minutes and improves the efficiency and consistency of route planning.

[0097] This solution employs a connection attribute classification method based on node degree initial screening, topology tracing, and cyclic verification, along with degenerate multiple logical connection topology preprocessing, to form a unified routing planning foundation, replacing traditional relational databases or vendor-specific algorithms. Leveraging the openness and scalability of graph databases, this solution provides a platform-based planning tool, enabling enterprises to flexibly customize algorithm parameters (such as weight functions and separation rules), eliminating dependence on vendor-specific algorithms. It achieves consistency in routing planning results across vendor networks, reduces operational complexity, and allows enterprises to independently adjust and optimize routing algorithms, enhancing technological autonomy.

[0098] Furthermore, this disclosure also considers route calculation optimization for complex business scenarios with one source and two destinations. For scenarios with one source and two or more destinations, it optimizes the logic of minimum cycle selection, common edge removal, and backup route calculation. In the minimum cycle selection stage, the definitions of Z2 and Z3 sets are expanded to consider multiple destination nodes simultaneously; before common edge removal, edges between adjacent destination nodes are deleted first; and during backup path calculation, destination nodes are dynamically selected. These optimization measures ensure the effectiveness of path separation under complex topologies and supplement the applicable boundaries of the core method. It can efficiently handle complex scenarios such as one source and two destinations, ensure the separation of primary and backup routes in the case of multiple destinations, and improve the practicality and coverage of the method. In summary, this disclosure fundamentally solves the limitations of existing shortest path algorithms in transmission service routing planning through a series of innovative technical means, bringing significant technical advantages in terms of reliability, efficiency, automation, and technical autonomy.

[0099] At the technical level, this disclosure achieves unified routing planning capabilities across different vendors' networks, ensuring compatibility with mainstream equipment from various brands. It avoids inconsistencies in planning caused by differences in vendor algorithms, thereby improving the standardization and controllability of network operation and maintenance. This disclosure is applicable to intelligent operation and maintenance scenarios for transmission networks, aligns with operators' development direction of promoting self-intelligent networks, and has the potential for nationwide application. Its automation and standardization value is particularly prominent in provinces with high traffic volumes and complex network structures.

[0100] Figure 5 This is a schematic diagram of the structure of a routing planning device provided in an embodiment of this disclosure. Figure 5 As shown, the route planning device 200 may include an identification module 210, a classification module 220, a combination module 230, and a generation module 240.

[0101] The identification module 210 is used to identify at least one minimum cycle corresponding to each node in the initial path according to the node topology relationship of the global topology graph; wherein, the minimum cycle is a closed loop with the fewest edges formed by the node and its adjacent nodes, the initial path is the shortest path between the first target node and the second target node in the global topology graph, the nodes of the global topology graph are used to represent network element devices in the transmission network, and the edges of the global topology graph are used to represent the connection relationship between network element devices. The classification module 220 is used to determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node, based on the minimum cycle corresponding to each node in the initial path; wherein, the intermediate nodes are the nodes in the initial path other than the first target node and the second target node. The combination module 230 is used to combine the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein, the target minimum cycle is selected from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; The generation module 240 is used to calculate the shortest path between the first target node and the second target node in the subgraph, obtain the primary route between the first target node and the second target node in the transmission network, and obtain the backup route corresponding to the primary route based on the primary route and the subgraph.

[0102] Optionally, the identification module 210 is also used for: Traverse the global topology graph and define nodes whose number of neighbor nodes is less than or equal to a preset node threshold as chain nodes; If the first-order neighbor nodes of the source node corresponding to the chain node are all chain nodes or the first-order neighbor nodes are all root nodes, the source node is defined as a link node. Based on the node topology relationship between the nodes and the edges associated with the nodes, identify at least one minimum cycle corresponding to each node in the initial path.

[0103] Optionally, the generation module 240 is also used for: Based on the link information of the global topology graph, link points are selected from multiple nodes of the primary route; where a link point is a node in the global topology graph that can form a closed loop with its neighboring nodes. In the subgraph, delete the edges associated with the nodes of the primary route to obtain the first subgraph; Calculate the shortest path between the target nodes in the first subgraph to obtain the backup route corresponding to the primary route.

[0104] Optionally, before combining the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain the subgraph, the combination module 230 is also used for: Based on the node topology relationships in the global topology graph, identify the minimum cycle corresponding to each node in the global topology graph; Calculate the betweenness centrality of each node in the global topology graph; In the minimum cycle corresponding to each node in the global topology graph, the cycle property of the minimum cycle containing the node with the maximum betweenness centrality is defined as the core cycle. Set the ring level for the smallest ring that intersects the core ring and has no defined ring properties; Based on the ring hierarchy of the first minimum ring, select the target minimum ring from multiple first minimum rings.

[0105] Optionally, the combination module 230 is also used for: Based on the ring hierarchy of the first minimum ring, select the target minimum ring from the first minimum ring that contains the first target node and the second target node; If there is no first minimum ring containing the first target node and the second target node, select the target minimum ring from the first minimum ring containing either the first target node or the second target node according to the ring hierarchy of the first minimum ring.

[0106] Optionally, before calculating the shortest path between the first target node and the second target node in the subgraph, the generation module 240 is further configured to: If there is no path connecting the first target node and the second target node in the subgraph, expand at least one minimum cycle corresponding to each node in the initial path based on the minimum cycle corresponding to each node in the global topology graph. Return to the execution steps based on the minimum cycle corresponding to each node in the initial path, determine the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node.

[0107] Figure 6 A schematic diagram of the hardware structure of the routing planning device provided in an embodiment of this disclosure is shown.

[0108] The routing planning device may include a processor 301 and a memory 302 storing computer program instructions.

[0109] Specifically, the processor 301 may include a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this disclosure.

[0110] Memory 302 may include mass storage for data or instructions. For example, and not limitingly, memory 302 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. In one instance, memory 302 may include removable or non-removable (or fixed) media, or memory 302 may be non-volatile solid-state memory. Memory 302 may be internal or external to the integrated gateway disaster recovery device.

[0111] In one instance, memory 302 may be read-only memory (ROM). In one instance, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM), or flash memory, or a combination of two or more of these.

[0112] Memory 302 may include read-only memory (ROM), random access memory (RAM), disk storage media device, optical storage media device, flash memory device, electrical, optical, or other physical / tangible memory storage device. Therefore, generally, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to one aspect of this disclosure.

[0113] The processor 301 reads and executes computer program instructions stored in the memory 302 to achieve... Figures 1 to 4 The routing planning method in the illustrated embodiment.

[0114] In one example, the routing planning device may also include a communication interface 303 and a bus 304. For example, Figure 6 As shown, the processor 301, memory 302, and communication interface 303 are connected through bus 304 and complete communication with each other.

[0115] The communication interface 303 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of this disclosure.

[0116] Bus 304 includes hardware, software, or both, that couples components of a device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 304 may include one or more buses. Although specific buses are described and illustrated in embodiments of this disclosure, this disclosure contemplates any suitable bus or interconnect.

[0117] Furthermore, in conjunction with the routing planning methods in the above embodiments, this disclosure can provide a computer storage medium for implementation. The computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the routing planning methods in the above embodiments.

[0118] This application also provides a computer program product, including a computer program that, when executed by a processor, implements any of the routing planning methods described in the above embodiments.

[0119] It should be clarified that this disclosure is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this disclosure is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this disclosure.

[0120] The functional blocks shown in the above-described block diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this disclosure are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, read-only memory (ROM), flash memory, erasable read-only memory (EROM), floppy disks, compact disc read-only memory (CD-ROM), optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0121] It should also be noted that the exemplary embodiments mentioned in this disclosure describe methods or systems based on a series of steps or apparatus. However, this disclosure is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0122] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in 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, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0123] The above description is merely a specific embodiment of this disclosure. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this disclosure is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this disclosure, and these modifications or substitutions should all be covered within the protection scope of this disclosure.

Claims

1. A route planning method, characterized in that, The method includes: For each node in the initial path, at least one minimum cycle corresponding to the node is identified according to the node topology relationship in the global topology graph; wherein, the minimum cycle is a closed loop with the fewest edges formed by the node and its neighboring nodes, the initial path is the shortest path between the first target node and the second target node in the global topology graph, the nodes of the global topology graph are used to represent network element devices in the transmission network, and the edges of the global topology graph are used to represent the connection relationship between network element devices; Based on the minimum cycle corresponding to each node in the initial path, a first minimum cycle corresponding to the first target node and the second target node, and a second minimum cycle corresponding to each intermediate node are determined; wherein, the intermediate node is a node in the initial path other than the first target node and the second target node; The target minimum cycle is combined with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein the target minimum cycle is obtained by filtering from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; The shortest path between the first target node and the second target node is calculated on the subgraph to obtain the primary route between the first target node and the second target node in the transmission network, and the backup route corresponding to the primary route is obtained based on the primary route and the subgraph.

2. The routing planning method according to claim 1, characterized in that, The step of identifying at least one minimum cycle corresponding to each node in the initial path according to the node topology relationship of the global topology graph includes: Traverse the global topology graph and define nodes whose number of neighbor nodes is less than or equal to a preset node threshold as chain nodes; If all first-order neighbor nodes of the source node corresponding to the chain node are chain nodes or all first-order neighbor nodes are root nodes, the source node is defined as a link node. Based on the node topology relationship between the link points and the edges associated with them, at least one minimum cycle corresponding to each link point in the initial path is identified.

3. The routing planning method according to claim 1, characterized in that, The step of obtaining the backup route corresponding to the primary route based on the primary route and the subgraph includes: Based on the link information of the global topology graph, link points are selected from multiple nodes of the primary route; wherein, the link point is a node in the global topology graph that can form a closed loop with the node's neighboring nodes. In the subgraph, the edges associated with the nodes of the primary route are deleted to obtain the first subgraph; The shortest path between the target nodes is calculated for the first subgraph to obtain the backup route corresponding to the primary route.

4. The routing planning method according to claim 1, characterized in that, Before combining the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain the subgraph, the method further includes: Based on the node topology relationships in the global topology graph, identify the minimum cycle corresponding to each node in the global topology graph; Perform betweenness centrality calculation on each node in the global topology graph; In the minimum cycle corresponding to each node in the global topology graph, the cycle property of the minimum cycle containing the node with the maximum betweenness centrality is defined as the core cycle. Set the ring level for the smallest ring that intersects the core ring and has no defined ring properties; Based on the ring hierarchy of the first minimum ring, the target minimum ring is selected from a plurality of first minimum rings.

5. The routing planning method according to claim 4, characterized in that, The step of selecting the target minimum ring from multiple first minimum rings based on the ring hierarchy of the first minimum ring includes: Based on the ring hierarchy of the first minimum ring, select the target minimum ring from the first minimum ring that contains the first target node and the second target node; If there is no first minimum ring containing both the first target node and the second target node, the target minimum ring is selected from the first minimum ring containing either the first target node or the second target node according to the ring level of the first minimum ring.

6. The routing planning method according to claim 1, characterized in that, Before calculating the shortest path between the first target node and the second target node in the subgraph, the method further includes: If there is no path connecting the first target node and the second target node in the subgraph, expand at least one minimum cycle corresponding to each node in the initial path based on the minimum cycle corresponding to each node in the global topology graph; Return to the step of determining the first minimum cycle corresponding to the first target node and the second target node, and the second minimum cycle corresponding to each intermediate node, based on the minimum cycle corresponding to each node in the initial path.

7. A route planning device, characterized in that, The device includes: The identification module is used to identify at least one minimum cycle corresponding to each node in the initial path according to the node topology relationship of the global topology graph; wherein, the minimum cycle is a closed loop with the fewest edges formed by the node and its neighboring nodes, the initial path is the shortest path between the first target node and the second target node in the global topology graph, the nodes of the global topology graph are used to represent network element devices in the transmission network, and the edges of the global topology graph are used to represent the connection relationship between network element devices; The classification module is used to determine, based on the minimum cycle corresponding to each node in the initial path, a first minimum cycle corresponding to the first target node and the second target node, and a second minimum cycle corresponding to each intermediate node; wherein, the intermediate nodes are nodes in the initial path other than the first target node and the second target node; The combination module is used to combine the target minimum cycle with the second minimum cycle corresponding to each intermediate node to obtain a subgraph; wherein, the target minimum cycle is obtained by filtering from the first minimum cycles corresponding to the first target node and the second target node respectively based on the topological relationship of the first minimum cycle; The generation module is used to calculate the shortest path between the first target node and the second target node in the subgraph, obtain the primary route between the first target node and the second target node in the transmission network, and obtain the backup route corresponding to the primary route based on the primary route and the subgraph.

8. A routing planning device, characterized in that, The device includes: a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement the routing planning method as described in any one of claims 1-6.

9. A computer storage medium, characterized in that, The computer storage medium stores computer program instructions, which, when executed by a processor, implement the routing planning method as described in any one of claims 1-6.

10. A computer program product, characterized in that, It includes a computer program that, when executed by a processor, implements the routing planning method as described in any one of claims 1-6.

Images