Method and device for generating double routing paths of communication network

Abstract

The invention discloses a method and a device for generating double routing paths of a communication network. The method comprises the steps that a graph structure network is constructed, nodes in the graph structure network are used for representing various types of communication nodes, edges in the graph structure network are used for representing connecting optical cables among the multiple communication nodes, edge weights of the graph structure network are used for representing static characteristics and dynamic characteristics of the optical cables, and the static characteristics and the dynamic characteristics of the optical cables are used for representing the communication nodes; the static characteristics comprise the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics comprise the optical cable occupancy rate; determining a starting point and an ending point of a routing path in the graph structure network, and generating a main routing path for connecting the starting point and the ending point and a secondary routing path for connecting the starting point and the ending point by taking an edge weight contained in the minimum routing path and the number of the first type of nodes contained in the minimum routing path as targets; and outputting the main routing path and the secondary routing path under the condition that both the main routing path and the secondary routing path meet preset constraint conditions.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method and device for generating dual routing paths in a communication network. Background Art

[0002] Currently, the automation rate of dual-routing path planning in carrier communication networks is low, often relying on traditional manual planning. To improve planning efficiency, various planning algorithms have been proposed, including the traditional Bhandari (dual-path) algorithm, heuristic algorithms (genetic algorithms, ant colony algorithms), and integer linear programming. The traditional Bhandari algorithm, based on graph theory, searches for physically isolated paths. It generates two edge-disjoint paths using reverse edges and a weighted penalty mechanism, strictly ensuring physical isolation. However, this method lacks dynamic network state awareness and only optimizes path length, leading to local optimal solutions in complex networks. Heuristic algorithms approach the optimal solution through iterative search, support multi-objective optimization, and are applicable to large-scale networks. However, they suffer from high time complexity, parameter sensitivity, and poor robustness. Integer linear programming models the dual-routing problem as a mathematical optimization problem, precisely solving for a constrained global optimal solution. This method achieves high solution quality and strictly satisfies all constraints, but it is also unsuitable for large networks and struggles with dynamic weight adjustment and real-time network state awareness. Summary of the Invention

[0003] The embodiments of the present application provide a method and apparatus for generating dual routing paths in a communication network, so as to at least solve the technical problem that in the related art, only the length of the routing path is considered when constructing the routing path, resulting in low accuracy of the constructed dual routing paths.

[0004] According to one aspect of an embodiment of the present application, a method for generating dual routing paths in a communication network is provided, comprising: constructing a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between the multiple communication nodes, and the edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cable, wherein the static characteristics include: the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics include: the optical cable occupancy rate; determining the starting point and end point of the routing path in the graph structure network, and generating a main routing path for connecting the starting point and the end point and a secondary routing path for connecting the starting point and the end point with the goal of minimizing the edge weights contained in the routing path and minimizing the number of first-class nodes contained in the routing path; and outputting the main routing path and the secondary routing path when both the main routing path and the secondary routing path satisfy preset constraints, wherein the preset constraints are used to constrain the length of the routing path, the number of the first-class nodes, and the idle rate of the optical cable.

[0005] Optionally, a main routing path and a secondary routing path connecting the starting point and the end point are generated respectively with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-type nodes contained in the routing path, including: traversing a first set of all paths from the starting point to the end point; selecting a path with the smallest sum of a first edge weight penalty item and a first node number penalty item from the first set as the main routing path, wherein the first edge weight penalty item is the sum of the edge weights of all edges in the routing path, and the first node number penalty item is the number of first-type nodes in the routing path, and the first-type nodes are station nodes; adjusting the edge weight of each edge according to the relationship between the edge in the routing path and the main routing path to obtain an adjusted edge weight; and generating the secondary routing path according to the adjusted edge weight.

[0006] Optionally, the edge weight of each edge is adjusted according to the relationship between the edge in the routing path and the main routing path to obtain the adjusted edge weight, including: constructing an auxiliary graph, wherein the auxiliary graph contains the graph structure network; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is the same as the direction of the main routing path, then the edge weight in the auxiliary graph is increased to obtain the adjusted edge weight; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is opposite to the direction of the main routing path, then the edge weight in the auxiliary graph is reduced to obtain the adjusted edge weight; when the edge in the auxiliary graph does not belong to the main routing path, the original edge weight remains unchanged.

[0007] Optionally, generating the secondary routing path based on the adjusted edge weight includes: traversing a second set of all paths from the starting point to the end point; selecting from the second set a path with the smallest sum of a second edge weight penalty item and a second node number penalty item as the secondary routing path, wherein the second edge weight penalty item is the sum of the adjusted edge weights of all edges in the routing path, and the second node number penalty item is the number of first-category nodes in the routing path.

[0008] Optionally, outputting the main routing path and the secondary routing path includes: respectively obtaining the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path; determining that the main routing path and the secondary routing path satisfy the first constraint in the preset constraint when both the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path are not greater than a preset number threshold; respectively obtaining the total length of the main routing path and the total length of the secondary routing path; determining that the main routing path and the secondary routing path satisfy the first constraint in the preset constraint when both the total length of the main routing path and the total length of the secondary routing path are not greater than a preset length threshold. The path satisfies the second constraint condition in the preset constraint conditions; the optical cable idle rate of all links in the main routing path and the optical cable idle rate of all links in the secondary routing path are obtained respectively; when the optical cable idle rate of all links in the main routing path and the secondary routing path is not less than the preset idle rate threshold, it is determined that the main routing path and the secondary routing path satisfy the third constraint condition in the preset constraint conditions; when the main routing path and the secondary routing path satisfy the first constraint condition, the second constraint condition and the third constraint condition, it is determined that the main routing path and the secondary routing path pass the verification, and the main routing path and the secondary routing path are output.

[0009] Optionally, the method also includes: converting the first constraint, the second constraint and the third constraint into a first penalty item, a second penalty item and a third penalty item respectively; determining an objective function based on the first penalty item, the second penalty item and the third penalty item, wherein the first penalty coefficient corresponding to the first penalty item is greater than the second penalty coefficient corresponding to the second penalty item, and the second penalty coefficient is greater than the third penalty coefficient corresponding to the third penalty item; and outputting the main routing path and the secondary routing path by adjusting the parameters of the objective function until the preset constraints are met or the maximum number of iterations is reached.

[0010] Optionally, the edge weights of the graph structure network are determined in the following manner, including: determining the static weights of the edges based on the static features; determining the dynamic weights of the edges based on the dynamic features, and determining the edge weights based on the static weights and the dynamic weights.

[0011] According to another aspect of an embodiment of the present application, a dual routing path generation device for a communication network is also provided, including: a construction module for constructing a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between multiple communication nodes, and the edge weights of the graph structure network are used to represent the static and dynamic characteristics of the optical cable, wherein the static characteristics include: the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics include: the optical cable occupancy rate; a generation module for determining the starting point and end point of the routing path in the graph structure network, and generating a main routing path for connecting the starting point and the end point and a secondary routing path for connecting the starting point and the end point with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-class nodes contained in the routing path; an output module for outputting the main routing path and the secondary routing path when both the main routing path and the secondary routing path meet preset constraints, wherein the preset constraints are used to constrain the length of the routing path, the number of the first-class nodes and the idle rate of the optical cable.

[0012] According to another aspect of an embodiment of the present application, a computer device is also provided, including: a memory and a processor, wherein the memory is used to store program instructions; the processor is connected to the memory and is used to execute the above-mentioned dual routing path generation method for the communication network.

[0013] According to another aspect of the embodiments of the present application, a computer program product is provided, including computer instructions, which, when executed by a processor, implement the above-mentioned dual routing path generation method for the communication network.

[0014] In an embodiment of the present application, a graph structure network is constructed, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between multiple communication nodes, and the edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cable, wherein the static characteristics include: the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable; the starting point and the end point of the routing path are determined in the graph structure network, and with the goal of minimizing the edge weights contained in the routing path and minimizing the number of first-class nodes contained in the routing path, a main routing path for connecting the starting point and the end point and a main routing path for connecting the starting point are generated. and the secondary routing path of the end point; when both the main routing path and the secondary routing path meet the preset constraints, the main routing path and the secondary routing path are output, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes and the idle rate of the optical cable, and the main routing path and the secondary routing path are determined based on the static characteristics and dynamic characteristics of the optical cable of the communication network through the graph structure network, thereby achieving the purpose of determining the routing path through multi-dimensional characteristics, thereby achieving the technical effect of improving the construction of dual routing paths, and further solving the technical problem that the related technology only considers the length of the routing path when constructing the routing path, resulting in low accuracy of the constructed dual routing path. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0016] Figure 1 This is a hardware structure block diagram of a computer terminal for implementing a dual routing path generation method for a communication network according to an embodiment of the present application;

[0017] Figure 2 is a flow chart of a method for generating a dual routing path in a communication network according to an embodiment of the present application;

[0018] Figure 3 is a flowchart of another method for generating a dual routing path in a communication network according to an embodiment of the present application;

[0019] Figure 4 is a flowchart of another method for generating a dual routing path in a communication network according to an embodiment of the present application;

[0020] Figure 5 is a schematic diagram of an auxiliary diagram according to an embodiment of the present application;

[0021] Figure 6is a flow chart of an edge weight adjustment method according to an embodiment of the present application;

[0022] Figure 7 This is a structural diagram of a dual routing path generation device for a communication network according to an embodiment of the present application. DETAILED DESCRIPTION

[0023] In order to enable those skilled in the art to better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of this application.

[0024] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in a sequence other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0025] The information collected in the embodiments of the present application is information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with the relevant laws, regulations and standards of the relevant regions, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or reject the automated decision results; if the user chooses to reject, the expert decision-making process will be entered.

[0026] In order to solve the problems existing in the related art, the embodiment of the present application provides a dual routing path generation method for a communication network, which can be run on Figure 1 In the computer terminal shown, the computer terminal is explained below.

[0027] The embodiment of the method for generating a dual routing path of a communication network provided in the embodiment of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Figure 1 The hardware structure block diagram of a computer terminal for implementing a dual routing path generation method for a communication network is shown. Figure 1 As shown, the computer terminal 10 may include one or more (illustrated by 102a, 102b, ..., 102n in the figure) processors (the processor may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 104 for storing data, and a transmission module 106 for communication functions connected via a wired and / or wireless network. In addition, it may also include: a display, a keyboard, a cursor control device, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, and a BUS bus. It will be understood by those skilled in the art that Figure 1 The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 1 More or fewer components than shown, or with Figure 1 Different configurations shown.

[0028] It should be noted that the one or more processors and / or other data processing circuits described above may generally be referred to herein as "data processing circuitry." The data processing circuitry may be embodied in whole or in part as software, hardware, firmware, or any other combination thereof. Furthermore, the data processing circuitry may be a single, independent processing module, or may be incorporated in whole or in part into any of the other components of the computer terminal 10. As described in the embodiments of the present application, the data processing circuitry serves as a processor control (e.g., selection of a variable resistor terminal path connected to an interface).

[0029] The memory 104 can be used to store software programs and modules of application software, such as the program instructions / data storage device corresponding to the dual routing path generation method of the communication network in the embodiment of the present application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, realizing the dual routing path generation method of the communication network mentioned above. The memory 104 may include a high-speed random access memory and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the computer terminal 10 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0030] The transmission module 106 is configured to receive or transmit data via a network. A specific example of the aforementioned network may include a wireless network provided by the communications provider of the computer terminal 10. In one embodiment, the transmission module 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to enable communication with the Internet. In another embodiment, the transmission module 106 may be a radio frequency (RF) module, which is configured to communicate with the Internet wirelessly.

[0031] The display may be, for example, a touch screen liquid crystal display (LCD) that enables a user to interact with a user interface of the computer terminal 10 .

[0032] It should be noted that, in some optional embodiments, the above Figure 1 The computer terminal shown may include hardware elements (including circuits), software elements (including computer code stored on a computer-readable medium), or a combination of hardware elements and software elements. Figure 1 This is merely one example of a particular embodiment and is intended to illustrate the types of components that may be present in the computer terminal described above.

[0033] In the above operating environment, an embodiment of the present application provides an embodiment of a method for generating a dual routing path of a communication network. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0034] Figure 2 is a flow chart of a method for generating a dual routing path in a communication network according to an embodiment of the present application. Figure 2 As shown, the method includes the following steps:

[0035] Step S202: constructing a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between multiple communication nodes, and the edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cables, wherein the static characteristics include: the length of the optical cable and the core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable;

[0036] In step S202, the various types of communication nodes include: a central office, an optical cross-connect box, and a user terminal device.

[0037] Step S204, determining a starting point and an end point of a routing path in the graph structure network, and generating a primary routing path connecting the starting point and the end point and a secondary routing path connecting the starting point and the end point with the goal of minimizing the edge weights included in the routing path and minimizing the number of first-type nodes included in the routing path;

[0038] In step S204, the first type of node represents a station node, which is a key node or facility for centralized processing and exchange of communication signals, including but not limited to telephone exchanges, data exchange centers, network convergence points, base stations, or any other places with centralized communication equipment and functions.

[0039] Step S206: Output the main routing path and the secondary routing path if both the main routing path and the secondary routing path satisfy preset constraints, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes, and the idle rate of the optical cable.

[0040] Through the above steps S202 to S206, a graph structure network is constructed, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent the connecting optical cables between the multiple communication nodes, and the edge weights of the graph structure network are used to represent the static characteristics and dynamic characteristics of the optical cable, wherein the static characteristics include: the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable; the starting point and the end point of the routing path are determined in the graph structure network, and with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-class nodes contained in the routing path, a main routing path for connecting the starting point and the end point and a main routing path for connecting the starting point and the end point are generated. The secondary routing paths of the starting point and the end point; if both the primary routing path and the secondary routing path satisfy preset constraints, the primary routing path and the secondary routing path are output, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes, and the idle rate of the optical cable. The primary routing path and the secondary routing path are determined based on the static and dynamic characteristics of the optical cables of the communication network through a graph structure network, thereby achieving the purpose of determining the routing path through multi-dimensional characteristics, thereby achieving the technical effect of improving the construction of dual routing paths, and further solving the technical problem that the related technology only considers the length of the routing path when constructing the routing path, resulting in low accuracy of the constructed dual routing path. The following is a detailed description.

[0041] like Figure 3 As shown in FIG, the process of outputting a dual routing path includes:

[0042] Step 1: Input data. Specifically, establish a communication network model: Model the stations and equipment of the operator's communication network as nodes. The node set can be expressed as V = {v1, v2, ..., v n}, where v n represents the nth node, node type (1 = office station, 2 = optical cross-connect box, 3 = user terminal equipment). The connecting optical cable is modeled as an edge, and the edge set can be expressed as E = {e ij =(v i ,v j )}, where e ij Represents the i-th node v i and the jth node v j The edge attribute consists of three parts: the length of the optical cable: l ij ∈R + ; Total number of optical cable cores: c ij ∈N + ; Fiber core occupancy: u ij ∈N (N is a natural number set), R + Indicates the set of optical cable lengths, N + Indicates the core occupancy set.

[0043] The optical cable occupancy rate can be expressed as Among them, u ij (t) represents the core occupancy at time t, c ij ∈N + represents the total number of fiber cores, ρ ij (t) represents the optical cable occupancy rate at time t.

[0044] Step 2: Data preprocessing. Specifically, the communication network model is converted into a graph structure network, which can be represented as a graph structure network G = (V, E, W), where W represents the edge weight matrix, which integrates static features and dynamic features.

[0045] In some embodiments of the present application, a main routing path and a secondary routing path connecting the starting point and the end point are generated respectively with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-type nodes contained in the routing path, including: traversing a first set of all paths from the starting point to the end point; selecting a path with the smallest sum of a first edge weight penalty item and a first node number penalty item from the first set as the main routing path, wherein the first edge weight penalty item is the sum of the edge weights of all edges in the routing path, and the first node number penalty item is the number of first-type nodes in the routing path, and the first-type nodes are station nodes; adjusting the edge weight of each edge according to the relationship between the edge in the routing path and the main routing path to obtain the adjusted edge weight; generating the secondary routing path according to the adjusted edge weight.

[0046] like Figure 4 As shown in the figure, the starting point and the end point are received, and a path is found from the starting point a to the end point b so that the sum of the weights of all edges on the path and the penalty term of the number of stations on the path are minimized. The main routing path generation can be expressed as:

[0047]

[0048] Where P(a,b) represents the set of all possible paths from the starting point a to the end point b. represents the sum of the edge weights of all edges on path P, where It refers to the weight of edge e at time t. 局站 (P) represents the penalty term for the number of stations on path P (the first weighted penalty term), and λ is a positive real number used to control the priority of the number of stations. The fewer the number of stations, the lower the optical attenuation of the path, which is more in line with practical engineering applications. By introducing the penalty coefficient λ, it is ensured that the number of stations is minimized in the path selection process. N 局站 (P) represents the number of stations on path P.

[0049] like Figure 4 As shown, the generation process of the secondary routing path is assisted by the auxiliary graph, and the specific process is as follows: adjusting the edge weight of each edge according to the relationship between the edge in the routing path and the main routing path to obtain the adjusted edge weight, including: constructing an auxiliary graph, wherein the auxiliary graph contains the graph structure network; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is the same as that of the main routing path, then the edge weight in the auxiliary graph is increased to obtain the adjusted edge weight; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is opposite to that of the main routing path, then the edge weight in the auxiliary graph is reduced to obtain the adjusted edge weight; if the edge in the auxiliary graph does not belong to the main routing path, the original edge weight remains unchanged.

[0050] The process of generating the secondary routing path according to the adjusted edge weight is as follows: traversing a second set of all paths from the starting point to the end point; selecting a path with the smallest sum of the second edge weight penalty item and the second node number penalty item from the second set as the secondary routing path, wherein the second edge weight penalty item is the sum of the adjusted edge weights of all edges in the routing path, and the second node number penalty item is the number of first-category nodes in the routing path.

[0051] Specifically, the auxiliary graph is constructed first, and a reverse penalty is imposed on the edge of the main routing path P1, so that the secondary routing path P2 avoids the edge of P1 as much as possible, thereby achieving physical isolation of the two paths. For example: if the edge e ijIf the edge belongs to the main routing path P1 and is a forward edge (in the same direction), its weight increases by M, so that the edge is avoided as much as possible in the secondary routing path selection; if the edge e ij If it belongs to the main routing path P1 and is a reverse edge, its weight is reduced by M, making it more likely to be selected in the secondary routing path selection; if edge e ij The weight of the path that does not belong to the main routing path P1 remains unchanged. The specific formula can be expressed as:

[0052]

[0053] Among them, W ij Represents edge e ij The original weight of ∈P1 is determined by parameters such as cable length and fiber core occupancy. ij Represents edge e ij New weights in the auxiliary graph (adjusted edge weights). M = 10 max(W ij ) represents the penalty coefficient, which is used to ensure that the secondary routing path P2 avoids the primary routing path, max(W ij ) represents the maximum original weight. A forward edge indicates an edge in the same direction as the primary routing path P1, and a reverse edge indicates an edge in the opposite direction of the primary routing path P1. By applying a reverse penalty, the secondary routing path P2 is physically isolated from the primary routing path P1 as much as possible, avoiding the risk of co-routing.

[0054] The solution for the secondary routing path P2 explicitly includes the objective function, which is to minimize the sum of the path weight and the penalty term for the number of stations, and generate a secondary routing path that is physically isolated from the primary routing path and has the best engineering performance. It can be specifically expressed as:

[0055]

[0056] Where, Represents the new weights (adjusted edge weights) W′ of all edges on path P ij sum. N 局站 (P) represents the number of stations on path P.

[0057] The auxiliary graph constructed is as follows Figure 5 As shown, three different shape blocks represent different node types (for example: N1, N2, N5, etc.), and the bold red one represents the main routing path, highlighting the weight adjustment effect.

[0058] In some embodiments of the present application, before outputting the main routing path and the secondary routing path, it is necessary to determine whether the preset constraints are met. Specifically, the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path are respectively obtained; if the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path are both not greater than the preset number threshold, it is determined that the main routing path and the secondary routing path meet the first constraint in the preset constraints; the total length of the main routing path and the total length of the secondary routing path are respectively obtained; if the total length of the main routing path and the total length of the secondary routing path are both not greater than the preset length threshold, it is determined that The main routing path and the secondary routing path satisfy the second constraint condition in the preset constraint conditions; the optical cable idle rate of all links in the main routing path and the optical cable idle rate of all links in the secondary routing path are obtained respectively; when the optical cable idle rate of all links in the main routing path and the secondary routing path is not less than a preset idle rate threshold, it is determined that the main routing path and the secondary routing path satisfy the third constraint condition in the preset constraint conditions; when the main routing path and the secondary routing path satisfy the first constraint condition, the second constraint condition and the third constraint condition, it is determined that the main routing path and the secondary routing path pass the verification, and the main routing path and the secondary routing path are output.

[0059] The constraints include three parts. The first is the number of transfer nodes. To meet the actual engineering application scenario, the transfer node type is the number of stations N. 局站 The less the better, that is, N 局站 ≤N max (Preset quantity threshold) is minimized first. Then the total path length and the optical cable idle rate are considered. The total path length L 总 ≤L max (preset length threshold), optical cable idle rate 1-ρ ij (t)≥η min (Preset idle rate threshold).

[0060] In some other embodiments of the present application, the first constraint, the second constraint, and the third constraint are respectively converted into a first penalty item, a second penalty item, and a third penalty item; an objective function is determined based on the first penalty item, the second penalty item, and the third penalty item, wherein the first penalty coefficient corresponding to the first penalty item is greater than the second penalty coefficient corresponding to the second penalty item, and the second penalty coefficient is greater than the third penalty coefficient corresponding to the third penalty item; the main routing path and the secondary routing path are output by adjusting the parameters of the objective function until the preset constraint is met or the maximum number of iterations is reached.

[0061] Specifically, the preset constraints are converted into penalty terms and a relaxed objective function is constructed. The relaxed objective function is shown as follows:

[0062]

[0063] Where, It represents minimizing the sum of the edge weights of the path and introducing the station number penalty term λN 局站 (P k )。 μ1max(N 局站 -N max ,0)(the first penalty term) means to impose a penalty on the path that violates the number of transit nodes constraint, μ2max(LL max ,0)(the second penalty term) means to impose a penalty on the path that violates the total path length constraint, μ3max(η min -η,0) (the third penalty term) indicates the penalty imposed on the path that violates the cable idle rate constraint. μ1, μ2, and μ3 represent the penalty coefficients for the number of transfer nodes, the total path length, and the cable idle rate, respectively. The priority order is: μ1>μ2>μ3

[0064] In actual application scenarios, the parameters can be adjusted to gradually optimize the relaxation objective function until all constraints are met. For example, the first step is to adjust the number of transfer nodes. If N 局站 ≥N max ,but:

[0065] λ←λ·2

[0066] Where λ is a positive real number representing the penalty coefficient for the number of stations. The above formula indicates that increasing λ by 2 times its value will guide the algorithm to choose paths with fewer stations.

[0067] The second is the total path length constraint adjustment. If L>L max ,but:

[0068] α←α·1.1

[0069] Where α represents the fiber core capacity influence coefficient. The above adjustment is used to increase the length weight and guide the algorithm to choose a shorter path.

[0070] Finally, the cable idle rate constraint adjustment is performed. If η≤η min ,but:

[0071] β←β·1.2

[0072] Where β represents the fiber occupancy penalty coefficient. The above adjustment is used to increase the occupancy penalty and guide the algorithm to select paths with higher idle rates.

[0073] As for physical isolation, the smaller the edge communication between paths P1 and P2, the higher the physical isolation, which can be expressed as:

[0074]

[0075] Where η represents the isolation degree, and η ≥ 0.8, E(P1) represents the edge set included in the primary routing path, and E(P2) represents the secondary routing path.

[0076] If all of the above conditions are met, the path (P1, P2) and key parameters are output. If any of the above constraints are not met, a feedback loop is triggered to adjust the GNN parameters and constraint penalty coefficients. First, incremental adjustments are made, with priority being given to the constraint penalty coefficients λ, μ1, μ2, μ3 and the auxiliary graph parameter M. If convergence still does not occur, the GNN dynamic correction coefficient γ and static weights α, β are adjusted. Based on the adjusted parameters, a new path pair (P1, P2) is regenerated. Termination occurs when all constraints are met or the maximum number of iterations is reached.

[0077] In some embodiments of the present application, the edge weights of the graph structure network are determined in the following manner, including: determining the static weights of the edges based on the static features; determining the dynamic weights of the edges based on the dynamic features, and determining the edge weights based on the static weights and the dynamic weights.

[0078] like Figure 6 As shown, the first is the static weight, which is composed of the physical length of the route and the fiber core capacity and can be expressed as:

[0079]

[0080] Where α represents the influence coefficient of the fiber core capacity. The larger the capacity, the smaller the weight. ij Indicates the total number of fiber cores. The static weight combines the physical length and fiber core capacity to reflect the static characteristics of the link.

[0081] The second is the dynamic weight, which is composed of the real-time occupancy rate of the optical cable and can be expressed as:

[0082]

[0083] Where β represents the occupancy penalty coefficient. The higher the optical cable occupancy, the greater the weight. Dynamic weighting can dynamically adjust the link weight based on real-time occupancy and physical distance, reflecting the real-time status of the communication network.

[0084] Finally, there is the comprehensive weight, which combines the static topology and dynamic occupancy and can be expressed as:

[0085]

[0086] Each element corresponds to the edge e ij The comprehensive weight (edge ​​weight) ensures that path planning takes into account both physical characteristics and dynamic network changes, providing a unified weight input for subsequent path generation algorithms.

[0087] In actual application scenarios, the communication network is dynamically perceived and weights are updated. The specific steps are as follows: a dynamic network topology model is constructed through a graph structure network to perceive the node and link status in real time.

[0088] Among them, node features are generated by node embedding, and dynamic edge weight calculation adjusts the connection strength between nodes to enhance the graph expression ability. The initial node features can be expressed as:

[0089]

[0090] Among them, Type(v i ) represents the node type, 1 = office station, 2 = optical cross-connect box, 3 = user terminal equipment. ∑ρ ij (t) represents the average occupancy of neighbor links.

[0091] Then, neighborhood aggregation and status update are performed, and through multi-layer message passing, the dynamic embedding representation of nodes is learned to capture the potential correlation between the number of stations and the idle rate. i Receiving neighbor messages and aggregating them can be expressed as:

[0092]

[0093] in, Represents the aggregated neighbor messages, MEAN is the aggregation function, which is used to average the feature vectors of neighbor nodes, Θ (l) Represents the trainable parameter matrix for feature transformation, N(i) represents the node v i The set of neighbor nodes.

[0094] By stacking multiple layers, the global topology and local dynamic information are gradually integrated, and the state update can be expressed as:

[0095]

[0096] Among them, ReLU represents the activation function, which enhances the nonlinear expression ability. is a trainable weight matrix, || represents a vector concatenation operation, which preserves the joint features of its own state and neighbor information.

[0097] Node embedding based on GNN output Dynamically modify edge weights to enhance sensitivity to the number of stations and idle rates. By fusing the embeddings of the two end nodes using a multi-layer perceptron (MLP), the edge weights are dynamically adjusted. The edge weight modification can be expressed as:

[0098]

[0099] Where γ represents the dynamic correction coefficient; represents the node embedding after L layers of GNN; the correction term reflects the impact of station distribution on the path through the inner product of node embedding.

[0100] Table 1 shows the comparison results of the dual-routing path generation method for the communication network proposed in this application and the traditional method. As shown in Table 1, in terms of computational complexity, the traditional algorithm requires multiple full-graph traversals, while the method of the present invention converts path search into matrix operations through GNN, and the complexity is reduced from polynomial to near-linear.

[0101] In terms of computational accuracy, the proposed method uses dynamic edge weight constraints to automatically avoid high-occupancy links on secondary paths. Through multi-parameter adjustment, it offers high flexibility in practical applications, maintaining a path isolation rate above 95%. Traditional algorithms, however, are unable to achieve this due to memory limitations, resulting in a heuristic algorithm with a path isolation rate of 82.3%, and this rate fluctuates due to randomness.

[0102] In terms of computing time, traditional single-threaded CPUs cannot complete calculations due to memory overflow, and multi-linear CPUs only reduce the time by 10%. However, this paper uses GPU acceleration to reduce the computing time from hours to seconds, meeting the real-time requirements of existing network applications and realizing intelligent planning of dual-route separation paths in operator communication networks.

[0103] Table 1

[0104]

[0105] The dual-routing path generation method for the communication network proposed in the embodiment of the present application deeply integrates the graph neural network with the Bhandari algorithm, breaking through the drawback that dynamic response and path isolation in traditional routing planning cannot be coordinated and optimized. Through GNN real-time perception of the dynamic change characteristics of network resource topology, the Bhandari algorithm is driven to generate dual paths that meet the physical isolation requirements, effectively avoiding the same-pipe risk caused by topology lag in the traditional static weight model, and realizing the automatic generation and security of dual-routing paths. The model can dynamically access network data of millions of nodes and output the optimal dual-routing separation path combination that meets the constraints of business isolation, resource load balancing, physical risk avoidance, etc. in seconds. Compared with the existing technology, its significant advantages are: dynamic perception modeling based on GNN, which can clearly distinguish different node types and provide structural priors for sensitivity modeling. The weight adjustment based on node embedding directly strengthens the sensitivity to key constraints (number of stations, idle rate), so that the path planning algorithm superimposes dynamic corrections on the basis of static weights and adapts to changes in network status. Based on the primary-secondary path reverse edge penalty mechanism, the primary path optimizes the number of stations and path length, while the secondary path dynamically adjusts edge weights to generate physically isolated paths, effectively avoiding the risks of sharing the same pipe or cable. Through the Lagrangian relaxation method and iterative adjustment strategy, various parameter constraint issues in dual-path planning are effectively resolved. With the number of transfer nodes as a rigid constraint and the path length and fiber core idle rate as elastic optimization targets, engineering-friendly decision-making under multi-objective conflicts is achieved, providing reliable theoretical support and practical tools for dual-route separation path planning. Through dual-path output and verification, through strict constraint condition checks and feedback loop mechanisms, convergence to a feasible solution within 3-5 iterations is achieved, balancing computational efficiency and constraint satisfaction, ensuring that the two generated paths meet engineering requirements and network reliability standards. This mechanism effectively solves the problems of rigid constraint processing and lack of isolation verification in traditional methods, providing a reliable solution for intelligent dual-route planning in operator communication networks.

[0106] Figure 7 A dual routing path generation device for a communication network is shown, the device comprising:

[0107] A construction module 70 is configured to construct a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between the multiple communication nodes, and the edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cables, wherein the static characteristics include: the length of the optical cable and the core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable;

[0108] a generating module 72 for determining a starting point and an end point of a routing path in the graph structure network, and generating a primary routing path connecting the starting point and the end point and a secondary routing path connecting the starting point and the end point with the goal of minimizing the edge weights included in the routing path and minimizing the number of first-type nodes included in the routing path;

[0109] The output module 74 is used to output the main routing path and the secondary routing path when both the main routing path and the secondary routing path meet preset constraints, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes, and the idle rate of the optical cable.

[0110] The dual routing path generation device of the above-mentioned communication network constructs a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent the connecting optical cables between multiple communication nodes, and the edge weights of the graph structure network are used to represent the static characteristics and dynamic characteristics of the optical cable, wherein the static characteristics include: the length of the optical cable and the fiber core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable; determine the starting point and the end point of the routing path in the graph structure network, and generate a main routing path for connecting the starting point and the end point and a main routing path for connecting the starting point and the end point with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-class nodes contained in the routing path. The secondary routing paths of the starting point and the end point; when both the main routing path and the secondary routing path meet the preset constraints, the main routing path and the secondary routing path are output, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes and the idle rate of the optical cable. The main routing path and the secondary routing path are determined based on the static characteristics and dynamic characteristics of the optical cable of the communication network through the graph structure network, thereby achieving the purpose of determining the routing path through multi-dimensional characteristics, thereby achieving the technical effect of improving the construction of dual routing paths, and further solving the technical problem that the related technology only considers the length of the routing path when constructing the routing path, resulting in low accuracy of the constructed dual routing path.

[0111] The generation module 72 includes: a generation submodule, which is used to generate a main routing path and a secondary routing path connecting the starting point and the end point respectively with the goal of minimizing the edge weight contained in the routing path and minimizing the number of first-type nodes contained in the routing path, including: traversing a first set of all paths from the starting point to the end point; selecting a path with the smallest sum of a first edge weight penalty item and a first node number penalty item from the first set as the main routing path, wherein the first edge weight penalty item is the sum of the edge weights of all edges in the routing path, and the first node number penalty item is the number of first-type nodes in the routing path, and the first-type nodes are station nodes; adjusting the edge weight of each edge according to the relationship between the edge in the routing path and the main routing path to obtain the adjusted edge weight; generating the secondary routing path according to the adjusted edge weight.

[0112] The generation submodule includes: a weight unit, which is used to adjust the edge weight of each edge according to the relationship between the edge in the routing path and the main routing path to obtain the adjusted edge weight, including: constructing an auxiliary graph, wherein the auxiliary graph contains the graph structure network; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is the same as that of the main routing path, then the edge weight in the auxiliary graph is increased to obtain the adjusted edge weight; if the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is opposite to that of the main routing path, then the edge weight in the auxiliary graph is reduced to obtain the adjusted edge weight; if the edge in the auxiliary graph does not belong to the main routing path, the original edge weight remains unchanged.

[0113] The weight unit includes: a path subunit, which is used to generate the secondary routing path according to the adjusted edge weight, including: traversing a second set of all paths from the starting point to the end point; selecting a path with the smallest sum of a second edge weight penalty item and a second node number penalty item from the second set to determine as the secondary routing path, wherein the second edge weight penalty item is the sum of the adjusted edge weights of all edges in the routing path, and the second node number penalty item is the number of first-category nodes in the routing path.

[0114] The output module 74 includes an output submodule for outputting the main routing path and the secondary routing path, including: respectively obtaining the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path; if the number of first-class nodes in the main routing path and the number of first-class nodes in the secondary routing path are both not greater than a preset number threshold, determining that the main routing path and the secondary routing path meet the first constraint condition in the preset constraint condition; respectively obtaining the total length of the main routing path and the total length of the secondary routing path; if the total length of the main routing path and the total length of the secondary routing path are both not greater than a preset length threshold, determining that the main routing path meets the first constraint condition in the preset constraint condition. The method comprises the steps of: determining the primary routing path and the secondary routing path to satisfy the second constraint condition among the preset constraint conditions; obtaining the optical cable idle rates of all links in the primary routing path and the optical cable idle rates of all links in the secondary routing path respectively; determining that the primary routing path and the secondary routing path satisfy the third constraint condition among the preset constraint conditions when the optical cable idle rates of all links in the primary routing path and the secondary routing path are not less than a preset idle rate threshold; and determining that the primary routing path and the secondary routing path pass verification when the primary routing path and the secondary routing path satisfy the first constraint condition, the second constraint condition, and the third constraint condition, and outputting the primary routing path and the secondary routing path.

[0115] The output module 74 also includes: a penalty submodule, which is used to convert the first constraint condition, the second constraint condition and the third constraint condition into a first penalty item, a second penalty item and a third penalty item respectively; determine the objective function based on the first penalty item, the second penalty item and the third penalty item, wherein the first penalty coefficient corresponding to the first penalty item is greater than the second penalty coefficient corresponding to the second penalty item, and the second penalty coefficient is greater than the third penalty coefficient corresponding to the third penalty item; and output the main routing path and the secondary routing path by adjusting the parameters of the objective function until the preset constraint condition is met or the maximum number of iterations is reached.

[0116] The dual routing path generation device of the above-mentioned communication network also includes: an edge weight submodule, which is used to determine the edge weight of the graph structure network in the following manner, including: determining the static weight of the edge according to the static characteristics; determining the dynamic weight of the edge according to the dynamic characteristics, and determining the edge weight according to the static weight and the dynamic weight.

[0117] It should be noted that Figure 7 The dual routing path generation device of the communication network shown is used to perform Figure 2The dual routing path generation method of the communication network shown in the figure, therefore, the relevant explanations in the above-mentioned dual routing path generation method of the communication network are also applicable to the dual routing path generation device of the communication network, and will not be repeated here.

[0118] An embodiment of the present application also provides a computer device, including: a memory and a processor, wherein the memory is used to store program instructions; the processor is connected to the memory and is used to execute the dual routing path generation method of the above-mentioned communication network.

[0119] An embodiment of the present application further provides a computer program product, comprising computer instructions, which, when executed by a processor, implement the steps of the method for generating a dual routing path of a communication network in the present application.

[0120] The serial numbers of the above embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0121] In the above embodiments of the present application, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.

[0122] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only exemplary. For example, the division of the units can be a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0123] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0124] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0125] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0126] The above is only a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for generating a dual routing path in a communication network, characterized in that: include: Constructing a graph structure network, wherein nodes in the graph structure network are used to represent multiple types of communication nodes, edges in the graph structure network are used to represent connecting optical cables between multiple communication nodes, and edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cables, wherein the static characteristics include: cable length and cable core capacity, and the dynamic characteristics include: cable occupancy rate; Determining a starting point and an end point of a routing path in the graph structure network, and generating a primary routing path connecting the starting point and the end point and a secondary routing path connecting the starting point and the end point with the goal of minimizing the edge weights included in the routing path and minimizing the number of first-type nodes included in the routing path; When both the main routing path and the secondary routing path satisfy preset constraints, the main routing path and the secondary routing path are output, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes, and the idle rate of the optical cable.

2. The method according to claim 1, characterized in that Generating a primary routing path and a secondary routing path connecting the starting point and the end point respectively with the goal of minimizing the edge weights included in the routing path and minimizing the number of first-type nodes included in the routing path, including: traversing a first set of all paths from the starting point to the end point; Selecting a path with the smallest sum of a first edge weight penalty term and a first node quantity penalty term from the first set as the main routing path, wherein the first edge weight penalty term is the sum of the edge weights of all edges in the routing path, and the first node quantity penalty term is the number of first-type nodes in the routing path, where the first-type nodes are station nodes; Adjusting the edge weight of each edge in the routing path according to the relationship between the edge and the main routing path to obtain an adjusted edge weight; The secondary routing path is generated according to the adjusted edge weights.

3. The method according to claim 2, characterized in that Adjusting the edge weight of each edge in the routing path according to the relationship between the edge and the main routing path to obtain the adjusted edge weight includes: Constructing an auxiliary graph, wherein the auxiliary graph includes the graph structure network; If the edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is the same as the direction of the main routing path, then increase the edge weight in the auxiliary graph to obtain the adjusted edge weight; If an edge in the auxiliary graph belongs to the main routing path and the direction of the edge in the auxiliary graph is opposite to that of the main routing path, reducing the edge weight in the auxiliary graph to obtain the adjusted edge weight; In the case where an edge in the auxiliary graph does not belong to the main routing path, the original edge weight remains unchanged.

4. The method according to claim 3, characterized in that Generating the secondary routing path according to the adjusted edge weights includes: traversing a second set of all paths from the starting point to the end point; A path with the smallest sum of the second edge weight penalty item and the second node number penalty item is selected from the second set and determined as the secondary routing path, wherein the second edge weight penalty item is the sum of the adjusted edge weights of all edges in the routing path, and the second node number penalty item is the number of first-category nodes in the routing path.

5. The method according to claim 1, wherein Outputting the primary routing path and the secondary routing path includes: respectively obtaining the number of first-category nodes in the primary routing path and the number of first-category nodes in the secondary routing path; When the number of first-category nodes in the primary routing path and the number of first-category nodes in the secondary routing path are both not greater than a preset number threshold, determining that the primary routing path and the secondary routing path satisfy a first constraint condition among the preset constraint conditions; respectively obtaining the total length of the primary routing path and the total length of the secondary routing path; When the total length of the primary routing path and the total length of the secondary routing path are both not greater than a preset length threshold, determining that the primary routing path and the secondary routing path satisfy a second constraint condition among the preset constraint conditions; Respectively obtaining the optical cable idle rates of all links in the primary routing path and the optical cable idle rates of all links in the secondary routing path; When the optical cable idle rates of all links in the primary routing path and the secondary routing path are not less than a preset idle rate threshold, determining that the primary routing path and the secondary routing path satisfy a third constraint condition in the preset constraint conditions; If the primary routing path and the secondary routing path satisfy the first constraint condition, the second constraint condition, and the third constraint condition, it is determined that the primary routing path and the secondary routing path pass verification, and the primary routing path and the secondary routing path are output.

6. The method according to claim 5, characterized in that The method further comprises: Converting the first constraint condition, the second constraint condition, and the third constraint condition into a first penalty term, a second penalty term, and a third penalty term, respectively; Determining an objective function according to the first penalty term, the second penalty term, and the third penalty term, wherein a first penalty coefficient corresponding to the first penalty term is greater than a second penalty coefficient corresponding to the second penalty term, and the second penalty coefficient is greater than a third penalty coefficient corresponding to the third penalty term; The primary routing path and the secondary routing path are output by adjusting the parameters of the objective function until the preset constraint condition is satisfied or the maximum number of iterations is reached.

7. The method according to claim 1, characterized in that The edge weights of the graph structure network are determined by the following methods, including: Determining a static weight of an edge according to the static feature; The dynamic weight of the edge is determined according to the dynamic feature, and the edge weight is determined according to the static weight and the dynamic weight.

8. A dual routing path generation device for a communication network, characterized in that: include: A construction module is used to construct a graph structure network, wherein the nodes in the graph structure network are used to represent multiple types of communication nodes, the edges in the graph structure network are used to represent connecting optical cables between multiple communication nodes, and the edge weights of the graph structure network are used to represent static and dynamic characteristics of the optical cables, wherein the static characteristics include: the length of the optical cable and the core capacity of the optical cable, and the dynamic characteristics include: the occupancy rate of the optical cable; a generation module, configured to determine a starting point and an end point of a routing path in the graph structure network, and generate a primary routing path connecting the starting point and the end point and a secondary routing path connecting the starting point and the end point with the goal of minimizing the edge weights included in the routing path and minimizing the number of first-type nodes included in the routing path; An output module is used to output the main routing path and the secondary routing path when both the main routing path and the secondary routing path meet preset constraints, wherein the preset constraints are used to constrain the length of the routing path, the number of the first type of nodes, and the idle rate of the optical cable.

9. A computer device, characterized in that: include: A memory and a processor, wherein the memory is used to store program instructions; The processor is connected to the memory and is used to execute the dual routing path generation method for a communication network according to any one of claims 1 to 7.

10. A computer program product comprising computer instructions, characterized in that When the computer instructions are executed by a processor, the dual routing path generation method for a communication network according to any one of claims 1 to 7 is implemented.

Images