Transmission network route generation method, device, equipment, medium and program product

Abstract

The invention provides a transmission network route generation method and device, equipment, a medium and a program product, and relates to the technical field of communication engineering, and the method comprises the steps: determining resource objects of a plurality of hierarchies, and distributing a corresponding unique identifier for each resource object; according to the unique identifier, establishing a hierarchical topological association relationship between the hierarchical resource objects to obtain a hierarchical resource model; adding corresponding attribute information to each resource object through a hierarchical resource model; determining a corresponding macroscopic routing direction according to the attribute information and the hierarchical resource model; determining a candidate routing scheme set according to the macroscopic routing direction and the hierarchical topology association relationship; screening the candidate routing scheme set according to the plurality of target dimensions to obtain a screened optimal routing scheme or a sorted candidate scheme list; wherein the target dimension comprises time delay, the number of nodes and routing preference; the method provided by the invention is used for realizing the technical effect of improving the generation efficiency and flexibility of the transmission network route.

Description

Technical Field

[0001] This application relates to the field of communication engineering technology, and in particular to a method, apparatus, device, medium and program product for generating transmission network routes. Background Technology

[0002] In the field of communication network construction and operation and maintenance, the design of service routing schemes is a core part of pre-sales service and network planning. Customers typically need to customize transmission paths based on business requirements (such as start and end nodes, latency requirements, and necessary traversal of submarine and terrestrial cables) to ensure the efficiency, stability, and cost-effectiveness of services. The hierarchical structure of existing network resources (such as equipment, optical cables, and central offices) is complex, and the resource status (such as idle, occupied, and faulty) changes dynamically, which poses multiple challenges to the generation of routing schemes.

[0003] In existing technologies, transmission network route generation methods are mainly divided into two categories: one is the route generation method based on node traversal, which treats network nodes as independent units and uses optimal traversal algorithms (such as depth-first search and breadth-first search) to connect the topology and build paths; the other is the combination and deduction method based on historical paths, which analyzes historical routing schemes, extracts path features and performs matching and combination to deduce new routing schemes.

[0004] However, existing node traversal methods have a simple hierarchical structure, lack macro-level constraints, and ignore practical limitations such as physical distance and resource status; historical path deduction methods are difficult to adapt to new resources, easily leading to path concentration, and have insufficient multi-objective optimization capabilities. These factors ultimately result in the technical problems of low efficiency and poor flexibility in generating transmission network routes in existing technologies. Summary of the Invention

[0005] The transmission network route generation method, apparatus, device, medium, and program products provided in this application are intended to improve the efficiency and flexibility of transmission network route generation.

[0006] In a first aspect, this application provides a method for generating transmission network routes, including:

[0007] Identify resource objects at multiple levels and assign a unique identifier to each resource object; wherein, the resource object includes at least one of the following: city, station, equipment, board, port, circuit, and optical cable.

[0008] Based on the unique identifier, establish the hierarchical topological relationships between resource objects at each level to obtain a hierarchical resource model;

[0009] By using a hierarchical resource model, corresponding attribute information is added to each resource object, including geographic coordinates, resource status, and latency value.

[0010] Based on attribute information and the hierarchical resource model, determine the corresponding macro-routing direction;

[0011] Based on the macro-routing direction and hierarchical topology relationships, a set of candidate routing schemes is determined;

[0012] The candidate routing scheme set is filtered based on multiple objective dimensions to obtain the optimal routing scheme or a sorted list of candidate schemes; the objective dimensions include latency, number of nodes, and routing preference.

[0013] In one possible implementation, a hierarchical topological association relationship between resource objects at each level is established based on a unique identifier to obtain a hierarchical resource model, including:

[0014] Based on the unique identifier, and following the preset hierarchical mapping logic, the hierarchical topological relationship between resource objects at each level is constructed using foreign key association to obtain a hierarchical resource model; wherein, the hierarchical mapping logic is the hierarchical mapping logic of "city-station-equipment-board-port-optical cable".

[0015] In one possible implementation, the attribute information includes geographic coordinates, resource status, latency value, and region information; the resource status includes idle status, occupied status, and fault status.

[0016] In one possible implementation, the corresponding macro-routing direction is determined based on attribute information and a hierarchical resource model, including:

[0017] Based on the information of the region, determine the macroscopic routing direction between the starting node and the ending node.

[0018] In one possible implementation, after determining the corresponding macroscopic routing direction, the method further includes:

[0019] Based on geographical coordinates, calculate the node distance between the starting node and each potential adjacent node in the macro-routing direction;

[0020] Compare the distance of each node with the preset threshold of the starting node;

[0021] If the distance between nodes is less than the preset threshold of the starting node, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and the effective neighboring node ranges are summarized to obtain the summarized effective neighboring node set.

[0022] The route search range corresponding to the starting node is determined by taking the starting node as the core and the set of effective adjacent nodes as the extension range.

[0023] In one possible implementation, a set of candidate routing schemes is determined based on macroscopic routing directions and hierarchical topological relationships, including:

[0024] Based on the macro-routing direction and hierarchical topology, a preset priority search strategy is used to traverse resource objects and connect nodes; the priority search strategy includes either a depth-first search strategy or a breadth-first search strategy.

[0025] After the node connection is determined, each connected resource object is used as the first processing object. The legality is verified according to the preset connection rules and constraints to obtain the connection path that meets the connection rules and constraints. The connection rules are that resources in the same city or station are directly logically connected, while those in different cities are connected through optical fiber resources. The constraints are that an upper limit is set on the number of nodes passing through the same area.

[0026] After the resource traversal is completed, each traversal path is used as a second processing object. It is determined whether each second processing object has reached the terminal node and whether the resource status of all resource objects on the traversal path is idle.

[0027] If so, the second processing object will be determined as a valid routing scheme;

[0028] Each valid routing scheme and each concatenated path is aggregated to determine the set of candidate routing schemes.

[0029] In one possible implementation, the candidate routing scheme set is filtered based on multiple objective dimensions to obtain the filtered optimal routing scheme or a ranked list of candidate schemes, including:

[0030] Based on the candidate routing scheme set, the total path delay in each valid routing scheme in the candidate routing scheme set is determined, and the total path delay in each valid routing scheme in the candidate routing scheme set is evaluated and ranked according to the preset first evaluation criteria to obtain the corresponding first ranking result; wherein, the total path delay is the sum of the optical cable propagation delay and the equipment processing delay;

[0031] Based on the number of nodes in the target dimension, determine the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set; and evaluate and rank the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set according to the preset second evaluation criteria to obtain the corresponding second ranking result.

[0032] Based on the routing preferences in the target dimension, obtain the preset submarine and terrestrial cable preference table;

[0033] Obtain the submarine and terrestrial cable segments traversed by each valid routing scheme in the candidate routing scheme set;

[0034] The submarine and terrestrial cable segments are matched and verified with the submarine and terrestrial cable preference table. Based on the degree of matching, the routing preference priority of each valid routing scheme is determined, and each routing preference level is determined as the corresponding third ranking result.

[0035] Based on the first, second, and third sorting results, a comprehensive screening is performed according to the preset target dimension priority to obtain the optimal routing scheme after screening.

[0036] If no optimal routing solution is required, the first, second, and third sorting results are combined and sorted to generate and output a sorted list of candidate solutions.

[0037] In one possible implementation, the hierarchical resource model is stored and managed using a relational database or a graph database.

[0038] Secondly, this application provides a transmission network route generation apparatus, comprising:

[0039] The definition module is used to define resource objects at multiple levels and assign a unique identifier to each resource object; wherein, the resource object includes at least one of the following: city, station, equipment, board, port, circuit, and optical cable;

[0040] A module is established to create hierarchical topological relationships between resource objects at different levels based on unique identifiers, in order to obtain a hierarchical resource model.

[0041] The add module is used to add corresponding attribute information to each resource object through the hierarchical resource model. The attribute information includes geographic coordinates, resource status and latency value.

[0042] The first processing module is used to determine the corresponding macro-routing direction based on attribute information and the hierarchical resource model;

[0043] The second processing module is used to determine the set of candidate routing schemes based on the macro-routing direction and hierarchical topology relationships;

[0044] The filtering module is used to filter the candidate routing scheme set according to multiple target dimensions to obtain the optimal routing scheme or the sorted candidate scheme list; among which, the target dimensions include latency, number of nodes and routing preference.

[0045] In one possible implementation, the setup module is also used for:

[0046] Based on the unique identifier, and following the preset hierarchical mapping logic, the hierarchical topological relationship between resource objects at each level is constructed using foreign key association to obtain a hierarchical resource model; wherein, the hierarchical mapping logic is the hierarchical mapping logic of "city-station-equipment-board-port-optical cable".

[0047] In one possible implementation, the adding module is also used for attribute information, which includes geographic coordinates, resource status, latency value, and region information; the resource status includes idle status, occupied status, and fault status.

[0048] In one possible implementation, the first processing module is further configured to:

[0049] Based on the information of the region, determine the macroscopic routing direction between the starting node and the ending node.

[0050] In one possible implementation, the first processing module is further configured to:

[0051] Based on geographical coordinates, calculate the node distance between the starting node and each potential adjacent node in the macro-routing direction;

[0052] Compare the distance of each node with the preset threshold of the starting node;

[0053] If the distance between nodes is less than the preset threshold of the starting node, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and the effective neighboring node ranges are summarized to obtain the summarized effective neighboring node set.

[0054] The route search range corresponding to the starting node is determined by taking the starting node as the core and the set of effective adjacent nodes as the extension range.

[0055] In one possible implementation, the second processing module is further configured to:

[0056] Based on the macro-routing direction and hierarchical topology, a preset priority search strategy is used to traverse resource objects and connect nodes; the priority search strategy includes either a depth-first search strategy or a breadth-first search strategy.

[0057] After the node connection is determined, each connected resource object is used as the first processing object. The legality is verified according to the preset connection rules and constraints to obtain the connection path that meets the connection rules and constraints. The connection rules are that resources in the same city or station are directly logically connected, while those in different cities are connected through optical fiber resources. The constraints are that an upper limit is set on the number of nodes passing through the same area.

[0058] After the resource traversal is completed, each traversal path is used as a second processing object. It is determined whether each second processing object has reached the terminal node and whether the resource status of all resource objects on the traversal path is idle.

[0059] If so, the second processing object will be determined as a valid routing scheme;

[0060] Each valid routing scheme and each concatenated path is aggregated to determine the set of candidate routing schemes.

[0061] In one possible implementation, the filtering module is also used for:

[0062] Based on the candidate routing scheme set, the total path delay in each valid routing scheme in the candidate routing scheme set is determined, and the total path delay in each valid routing scheme in the candidate routing scheme set is evaluated and ranked according to the preset first evaluation criteria to obtain the corresponding first ranking result; wherein, the total path delay is the sum of the optical cable propagation delay and the equipment processing delay;

[0063] Based on the number of nodes in the target dimension, determine the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set; and evaluate and rank the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set according to the preset second evaluation criteria to obtain the corresponding second ranking result.

[0064] Based on the routing preferences in the target dimension, obtain the preset submarine and terrestrial cable preference table;

[0065] Obtain the submarine and terrestrial cable segments traversed by each valid routing scheme in the candidate routing scheme set;

[0066] The submarine and terrestrial cable segments are matched and verified with the submarine and terrestrial cable preference table. Based on the degree of matching, the routing preference priority of each valid routing scheme is determined, and each routing preference level is determined as the corresponding third ranking result.

[0067] Based on the first, second, and third sorting results, a comprehensive screening is performed according to the preset target dimension priority to obtain the optimal routing scheme after screening.

[0068] If no optimal routing solution is required, the first, second, and third sorting results are combined and sorted to generate and output a sorted list of candidate solutions.

[0069] In one possible implementation, the module is also used to establish a hierarchical resource model, which is stored and managed through a relational database or a graph database.

[0070] Thirdly, this application provides a transmission network route generation device, including: a memory and a processor;

[0071] The memory stores instructions that the computer executes;

[0072] The processor executes computer execution instructions stored in memory, causing the processor to perform the first aspect and / or various possible implementations of the first aspect as described above.

[0073] Fourthly, this application provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the first aspect and / or various possible embodiments of the first aspect.

[0074] Fifthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the first aspect and / or various possible implementations of the first aspect.

[0075] This application provides a method, apparatus, device, medium, and program product for generating routes in a transmission network. By identifying multi-level resource objects and assigning unique identifiers, it lays the foundation for accurate resource management and rapid location, thereby improving the efficiency of subsequent operations. It establishes hierarchical topological relationships to form a layered resource model, clearly presenting the resource structure and facilitating an understanding of the overall layout. Adding attribute information enriches resource characteristics, providing a basis for determining routing directions. Determining macro-level routing directions narrows the scope, improving generation efficiency. Identifying a set of candidate routing schemes provides multiple choices. Filtering by multiple target dimensions quickly yields the optimal or ranked scheme, enhancing the flexibility of route generation. Thus, it achieves the technical effect of improving the generation efficiency and flexibility of transmission network routes. Attached Figure Description

[0076] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0077] Figure 1 This application provides a schematic diagram of an application data processing system architecture.

[0078] Figure 2 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 1 ;

[0079] Figure 3 The hierarchical topology diagram provided in the embodiments of this application;

[0080] Figure 4 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 2 ;

[0081] Figure 5 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 3 ;

[0082] Figure 6 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 4 ;

[0083] Figure 7 This is a schematic diagram of the structure of the transmission network route generation device provided in the embodiments of this application;

[0084] Figure 8 This is a schematic diagram of the structure of the transmission network route generation device provided in an embodiment of this application.

[0085] The accompanying drawings have illustrated specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to specific embodiments. Detailed Implementation

[0086] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0087] Because existing node traversal methods have a simple hierarchical structure, lack macro-level constraints, and ignore practical limitations such as physical distance and resource status; historical path deduction methods are difficult to adapt to new resources, easily leading to path concentration, and have insufficient multi-objective optimization capabilities. These factors ultimately result in the technical problems of low efficiency and poor flexibility in generating transmission network routes in existing technologies.

[0088] To address the aforementioned issues, this application provides a method, apparatus, device, medium, and program product for generating routes in a transmission network. By identifying multi-level resource objects and assigning unique identifiers, it lays the foundation for accurate resource management and rapid location, thereby improving the efficiency of subsequent operations. It establishes hierarchical topological relationships to form a layered resource model, clearly presenting the resource structure and facilitating an understanding of the overall layout. Adding attribute information enriches resource characteristics, providing a basis for determining routing directions. Determining macro-level routing directions narrows the scope, improving generation efficiency. Identifying a set of candidate routing schemes provides multiple choices. Filtering by multiple target dimensions quickly yields the optimal or ranked scheme, enhancing the flexibility of route generation. Thus, it achieves the technical effect of improving the generation efficiency and flexibility of transmission network routes.

[0089] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will now be described with reference to the accompanying drawings.

[0090] Figure 1 This is a schematic diagram of an application data processing system architecture provided in an embodiment of this application. The application data processing system is a computer device. Figure 1 As shown, the above architecture includes at least one of a data acquisition device 101, a processing device 102, and a display device 103.

[0091] It is understood that the structures illustrated in the embodiments of this application do not constitute a specific limitation on the architecture of the application data processing system. In other feasible embodiments of this application, the above architecture may include more or fewer components than illustrated, or combine some components, or split some components, or arrange different components, which can be determined according to the actual application scenario and is not limited here. Figure 1 The components shown can be implemented in hardware, software, or a combination of both.

[0092] In the specific implementation process, the data acquisition device 101 may include an input / output interface or a communication interface, and the data acquisition device 101 can be connected to the processing device through the input / output interface or the communication interface.

[0093] The processing device 102 can first identify multi-level resource objects and assign unique identifiers, thereby establishing hierarchical topological relationships to form a hierarchical resource model. Then, it can add attribute information to the resource objects using the model, determine the macro-routing direction based on the attributes and the model, and then determine the candidate routing scheme set. Finally, it can filter by multiple target dimensions to obtain the optimal routing scheme or a sorted list of candidate schemes, thereby improving the efficiency and flexibility of route generation.

[0094] The display device 103 can also be a touch screen or the screen of a terminal device, used to receive user commands while displaying the above-mentioned content, so as to realize interaction with the user.

[0095] It should be understood that the aforementioned processing device can be implemented by a processor reading instructions from memory and executing those instructions, or it can be implemented by a chip circuit.

[0096] Furthermore, the network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0097] Figure 2 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 1 ,like Figure 2 As shown, the transmission network route generation method provided in this embodiment includes:

[0098] S201. Identify resource objects at multiple levels and assign a unique identifier to each resource object.

[0099] In this embodiment, the resource object includes at least one of the following: city, station, equipment, board, port, circuit, and optical cable.

[0100] Multiple levels of resource objects are identified, including cities, stations, equipment, boards, ports, circuits, and optical cables. Each resource object is assigned a unique identifier to accurately identify and distinguish different resource objects, facilitating subsequent operations.

[0101] S202. Based on the unique identifier, establish the hierarchical topological relationship between resource objects at each level to obtain the hierarchical resource model.

[0102] In one possible implementation, a hierarchical topological relationship between resource objects at each level is established based on a unique identifier to obtain a hierarchical resource model. This includes: constructing a hierarchical topological relationship between resource objects at each level using a foreign key association method based on a unique identifier and according to a preset hierarchical mapping logic to obtain a hierarchical resource model.

[0103] In this embodiment, the hierarchical mapping logic is a hierarchical mapping logic of "city-station-equipment-board-port-optical cable".

[0104] In one possible implementation, the hierarchical resource model is stored and managed using a relational database or a graph database.

[0105] Figure 3 The hierarchical topology diagram provided for the embodiments of this application is as follows: Figure 3 As shown, based on the unique identifier, and following the preset hierarchical mapping logic of "city-station-equipment-board-port-optical cable", the hierarchical topological relationship between resource objects at each level is constructed using foreign key association, forming a hierarchical resource model. It can also be stored and managed through relational or graph databases.

[0106] S203. Through the hierarchical resource model, add corresponding attribute information to each resource object.

[0107] In this embodiment, the attribute information includes geographic coordinates, resource status, and latency value.

[0108] In one possible implementation, the attribute information includes geographic coordinates, resource status, latency value, and region information; the resource status includes idle status, occupied status, and fault status.

[0109] By leveraging a hierarchical resource model, attribute information is added to each resource object, including geographic coordinates, resource status (idle, occupied, faulty), latency value, and region information, thus enriching resource characteristics.

[0110] S204. Determine the corresponding macro-routing direction based on attribute information and hierarchical resource model.

[0111] By combining attribute information and hierarchical resource models, and considering factors such as continental attributes and distances of the starting and ending nodes, the corresponding macroscopic routing direction is determined, thus narrowing the search space and avoiding invalid traversals.

[0112] S205. Determine the set of candidate routing schemes based on the macro-routing direction and hierarchical topology association.

[0113] Based on the macro-routing direction and the established hierarchical topology relationships, starting from the starting node, traverse according to the hierarchical relationship to generate all feasible routing concatenation schemes and store them in the candidate routing scheme set.

[0114] S206. Based on multiple target dimensions, filter the candidate routing scheme set to obtain the optimal routing scheme or the sorted candidate scheme list.

[0115] In this embodiment, the target dimensions include latency, number of nodes, and routing preference.

[0116] Based on multiple target dimensions such as latency, number of nodes, and routing preferences, the candidate routing scheme set is filtered. The optimal routing scheme can be output according to preset priority, or a sorted list of candidate schemes can be presented.

[0117] This application provides a method for generating routes in a transmission network. By identifying multi-level resource objects and assigning unique identifiers, it lays the foundation for accurate resource management and rapid location, thereby improving the efficiency of subsequent operations. It establishes hierarchical topological relationships to form a layered resource model, clearly presenting the resource structure and facilitating an understanding of the overall layout. Adding attribute information enriches resource characteristics, providing a basis for determining routing directions. Determining macro-level routing directions narrows the scope and improves generation efficiency. Identifying a set of candidate routing schemes provides multiple choices. Filtering by multiple target dimensions quickly yields the optimal or ranked scheme, enhancing the flexibility of route generation. Thus, it achieves the technical effect of improving the generation efficiency and flexibility of transmission network routes.

[0118] Figure 4 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 2 ,like Figure 4 As shown, this embodiment, based on the above embodiment, provides supplementary explanations of the process for determining the macroscopic routing direction, i.e., the subsequent processes, including:

[0119] S401. Determine the macroscopic routing direction between the starting node and the ending node based on the area information.

[0120] Based on the region information contained in the resource object, the regions where the start node and the end node are located are determined, thereby determining the macro-routing direction between them. For example, if the start point is in region A and the end point is in region B, the direct path "region A-region B" is searched first.

[0121] S402. Based on the geographical coordinates, calculate the node distance between the starting node and each potential adjacent node in the macro-routing direction.

[0122] By using the geographic coordinates of resource objects and distance calculation methods, the distance between the starting node and each potential adjacent node in the macro-routing direction is calculated, providing data support for subsequent selection of effective nodes.

[0123] S403. Compare the distance of each node with the preset threshold of the starting node.

[0124] The calculated distance to each node is compared with the pre-set threshold for the starting node to determine whether the node distance meets the requirements, thereby filtering out nodes that meet the conditions.

[0125] S404. If the distance between nodes is less than the preset threshold of the starting node, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and the effective neighboring node ranges are summarized to obtain the summarized effective neighboring node set.

[0126] When the distance between nodes is less than a preset threshold, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and then these effective neighboring node ranges are summarized to form a summarized effective neighboring node set.

[0127] S405. Using the starting node as the core and the set of effective adjacent nodes as the extension range, determine the route search range corresponding to the starting node.

[0128] By using the starting node as the center and the set of effective adjacent nodes as the extension range, the route search range corresponding to the starting node is clearly defined, avoiding invalid traversal and improving search efficiency.

[0129] The transmission network route generation method provided in this application can significantly reduce the search space and avoid invalid path searches by determining the macro-routing direction based on the information of the region to which it belongs; calculate the distance between the starting node and potential neighboring nodes to provide a basis for screening effective nodes; compare the node distance with a preset threshold to initially screen possible effective nodes; determine the effective neighboring node set to further clarify the effective node range; and determine the route search range to effectively reduce unnecessary traversal and improve the efficiency and accuracy of route generation.

[0130] Figure 5 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 3 ,like Figure 5 As shown, this embodiment, based on the above embodiments, provides a detailed explanation of the process for determining the candidate routing scheme set, including:

[0131] S501. Based on the macro-routing direction and hierarchical topology, a preset priority search strategy is used to traverse resource objects and connect nodes.

[0132] In this embodiment, the priority search strategy includes either a depth-first search strategy or a breadth-first search strategy.

[0133] Based on the determined macro-routing direction and the hierarchical topological relationships between resource objects at each level, starting from the starting node, the resource objects are traversed using either a depth-first search strategy or a breadth-first search strategy. At the same time, the traversed nodes are connected in a certain order to prepare for generating a feasible routing scheme.

[0134] S502. After determining that the nodes are connected, each resource object connected is used as the first processing object. Legality is verified according to the preset connection rules and constraints to obtain the connection path that meets the connection rules and constraints.

[0135] In this embodiment, the connection rule is that resources in the same city or station are directly logically connected, while those in different cities are connected through optical fiber resources. The constraint is to set an upper limit on the number of nodes passing through the same area.

[0136] After the nodes are connected, each resource object connected is the first processing object. According to the connection rules of direct logical connection for resources in the same city or station, and connection through optical cable for resources in different cities or stations, as well as the constraint of the upper limit of the number of nodes in the same area, the connection path is validated to ensure that the path meets the requirements.

[0137] S503. After the resource traversal is completed, each traversal path is used as a second processing object. It is determined whether each second processing object has reached the termination node and whether the resource status of all resource objects on the traversal path is idle.

[0138] After resource traversal is completed, each traversed path is treated as the second processing object. It is checked whether the path has reached the terminal node and whether the resource status of all resource objects on the path is idle. This is used to determine whether the path meets the conditions to become a valid routing scheme.

[0139] S504. If so, the second processing object is determined as a valid routing scheme.

[0140] If the second processing object meets the conditions of reaching the termination node and all resources being idle, it is determined as a valid routing scheme, ensuring that the generated scheme is feasible.

[0141] S505. Summarize each valid routing scheme and each concatenated path to determine the candidate routing scheme set.

[0142] Each valid routing scheme and each qualified concatenation path are aggregated to form a candidate routing scheme set, providing a rich selection for subsequent selection of the optimal scheme.

[0143] The transmission network route generation method provided in this application adopts a priority search strategy for resource traversal and node concatenation, which can explore resources in an orderly manner and lay the foundation for generating a solution; it performs legality verification to ensure that the concatenated paths comply with rules and constraints, thereby improving the rationality of the solution; it determines whether the traversed paths meet the conditions of reaching the destination and resource availability, and selects feasible paths; it determines effective routing solutions to ensure that the solutions are usable; and it summarizes and forms a candidate routing solution set to provide sufficient samples for selecting the optimal solution, thereby improving the accuracy and comprehensiveness of solution selection.

[0144] Figure 6 A flowchart illustrating the transmission network route generation method provided in this application embodiment. Figure 4 ,like Figure 6 As shown, this embodiment, based on the above embodiments, provides a detailed explanation of the specific process for obtaining the filtered optimal routing scheme or the sorted candidate scheme list, including:

[0145] S601. Based on the candidate routing scheme set, determine the total path delay in each valid routing scheme in the candidate routing scheme set, and evaluate and rank the total path delay in each valid routing scheme in the candidate routing scheme set according to the preset first evaluation criterion to obtain the corresponding first ranking result.

[0146] In this embodiment, the total path delay is the sum of the optical cable propagation delay and the device processing delay.

[0147] For each valid routing scheme in the candidate routing scheme set, its total path delay is calculated. This delay is the sum of the fiber optic propagation delay and the device processing delay. The fiber optic propagation delay is determined by the fiber optic cable length and signal propagation speed, while the device processing delay depends on the device performance. Then, based on a preset first evaluation criterion (e.g., lower delay means higher priority), the total path delays of all valid routing schemes are sorted to obtain a first ranking result, providing a delay dimension reference for subsequent selection.

[0148] S602. Based on the number of nodes in the target dimension, determine the total number of devices or station nodes for each valid routing scheme in the candidate routing scheme set; and evaluate and rank the total number of devices or station nodes for each valid routing scheme in the candidate routing scheme set according to the preset second evaluation criteria to obtain the corresponding second ranking result.

[0149] Based on the number of nodes in the target dimension, determine the total number of device or station nodes involved in each valid routing scheme within the candidate routing scheme set. For example, if a scheme passes through different device nodes in multiple cities, determine the number of these nodes. Then, according to a preset second evaluation criterion, such as lower priority for fewer nodes, evaluate and rank the total number of nodes for each valid routing scheme to obtain a second ranking result, determining the merits of the schemes from the perspective of the number of nodes.

[0150] S603. Obtain the preset submarine and terrestrial cable preference table based on the routing preferences in the target dimension.

[0151] Based on the routing preferences in the target dimension, a pre-defined submarine and terrestrial cable preference table is obtained. This table records in detail the degree of preference for submarine and terrestrial cables under different circumstances. For example, some services prefer to use submarine cables for transmission, while some scenarios prioritize terrestrial cables, providing a basis for determining the preferences of subsequent routing schemes.

[0152] S604. Obtain the submarine and terrestrial cable segments traversed by each valid routing scheme in the candidate routing scheme set.

[0153] Obtain the submarine and terrestrial cable segments traversed by each valid routing scheme in the candidate routing scheme set. This requires combining geographical information and network topology to determine whether each scheme traverses a submarine or terrestrial cable during transmission, as well as the specific segment locations, in order to match it with the preference table.

[0154] S605. Match and verify the submarine and terrestrial cable segments with the submarine and terrestrial cable preference table to determine the routing preference priority of each valid routing scheme based on the degree of matching, and determine each routing preference level as the corresponding third sorting result.

[0155] The submarine-terrestrial cable segments of each valid routing scheme are matched and verified against the submarine-terrestrial cable preference table. If the submarine-terrestrial cable segments traversed by the scheme match the high-preference segments in the preference table, the routing preference priority of the scheme is high; otherwise, it is low. This determines the routing preference priority of each valid routing scheme, which serves as the third ranking result, determining the scheme from the perspective of routing preference.

[0156] S606. Based on the first sorting result, the second sorting result, and the third sorting result, perform comprehensive filtering according to the preset target dimension priority to obtain the optimal routing scheme after filtering.

[0157] Based on preset priority dimensions, such as latency being the highest priority, followed by the number of nodes, and finally routing preference, the first, second, and third sorting results are comprehensively filtered. The solution with the shortest latency, fewest nodes, and conforms to routing preferences is prioritized to obtain the optimal routing solution, thus meeting the stringent routing requirements of the business.

[0158] S607. If no optimal routing scheme is required, sort and summarize the first, second, and third sorting results to generate and output a sorted list of candidate schemes.

[0159] If the business does not need to determine a single optimal routing solution, but requires multiple candidate solutions for reference, then the first, second, and third ranking results are sorted and summarized. Following certain display rules, such as combining ranking results based on latency, number of nodes, and routing preferences, a ranked list of candidate solutions is generated and output, providing the business with more choices.

[0160] The transmission network route generation method provided in this application provides a basis for scheme selection from a delay perspective by calculating and sorting the total path delay, ensuring that the scheme with the best delay is selected; it determines and sorts the total number of nodes, determining the scheme from the dimension of node quantity, reducing the complexity and cost caused by too many nodes; it obtains a submarine and terrestrial cable preference table, providing a basis for determining route preferences; it clarifies the submarine and terrestrial cable segments traversed by the scheme, facilitating matching with the preference table; it determines the priority of route preferences to meet the service's needs for specific routes; it comprehensively sorts the results to select the optimal scheme, improving the accuracy and rationality of scheme selection; and it generates a sorted candidate scheme list, providing more flexible choices for services.

[0161] Figure 7 This is a schematic diagram of the transmission network route generation apparatus provided in an embodiment of this application. The apparatus in this embodiment can be in the form of software and / or hardware. Figure 7 As shown, the transmission network route generation device 700 provided in this application embodiment includes: a definition module 701, an establishment module 702, an addition module 703, a first processing module 704, a second processing module 705, and a filtering module 706.

[0162] The definition module 701 is used to define resource objects at multiple levels and assign a corresponding unique identifier to each resource object; wherein, the resource object includes at least one of the following: city, station, equipment, board, port, circuit, and optical cable;

[0163] Module 702 is established to establish hierarchical topological relationships between resource objects at each level based on unique identifiers, so as to obtain a hierarchical resource model.

[0164] Add module 703 to add corresponding attribute information to each resource object through a hierarchical resource model. The attribute information includes geographic coordinates, resource status, and latency value.

[0165] The first processing module 704 is used to determine the corresponding macro-routing direction based on attribute information and the hierarchical resource model;

[0166] The second processing module 705 is used to determine a set of candidate routing schemes based on the macro-routing direction and hierarchical topology association.

[0167] The filtering module 706 is used to filter the candidate routing scheme set according to multiple target dimensions to obtain the optimal routing scheme or the sorted candidate scheme list; wherein, the target dimensions include latency, number of nodes and routing preference.

[0168] In one possible implementation, the establishment module 702 is further configured to:

[0169] Based on the unique identifier, and following the preset hierarchical mapping logic, the hierarchical topological relationship between resource objects at each level is constructed using foreign key association to obtain a hierarchical resource model; wherein, the hierarchical mapping logic is the hierarchical mapping logic of "city-station-equipment-board-port-optical cable".

[0170] In one possible implementation, the adding module 703 is also used for attribute information, which includes geographic coordinates, resource status, latency value and region information; the resource status includes idle status, occupied status and fault status.

[0171] In one possible implementation, the first processing module 704 is further configured to:

[0172] Based on the information of the region, determine the macroscopic routing direction between the starting node and the ending node.

[0173] In one possible implementation, the first processing module 704 is further configured to:

[0174] Based on geographical coordinates, calculate the node distance between the starting node and each potential adjacent node in the macro-routing direction;

[0175] Compare the distance of each node with the preset threshold of the starting node;

[0176] If the distance between nodes is less than the preset threshold of the starting node, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and the effective neighboring node ranges are summarized to obtain the summarized effective neighboring node set.

[0177] The route search range corresponding to the starting node is determined by taking the starting node as the core and the set of effective adjacent nodes as the extension range.

[0178] In one possible implementation, the second processing module 705 is further configured to:

[0179] Based on the macro-routing direction and hierarchical topology, a preset priority search strategy is used to traverse resource objects and connect nodes; the priority search strategy includes either a depth-first search strategy or a breadth-first search strategy.

[0180] After the node connection is determined, each connected resource object is used as the first processing object. The legality is verified according to the preset connection rules and constraints to obtain the connection path that meets the connection rules and constraints. The connection rules are that resources in the same city or station are directly logically connected, while those in different cities are connected through optical fiber resources. The constraints are that an upper limit is set on the number of nodes passing through the same area.

[0181] After the resource traversal is completed, each traversal path is used as a second processing object. It is determined whether each second processing object has reached the terminal node and whether the resource status of all resource objects on the traversal path is idle.

[0182] If so, the second processing object will be determined as a valid routing scheme;

[0183] Each valid routing scheme and each concatenated path is aggregated to determine the set of candidate routing schemes.

[0184] In one possible implementation, the filtering module 706 is further configured to:

[0185] Based on the candidate routing scheme set, the total path delay in each valid routing scheme in the candidate routing scheme set is determined, and the total path delay in each valid routing scheme in the candidate routing scheme set is evaluated and ranked according to the preset first evaluation criteria to obtain the corresponding first ranking result; wherein, the total path delay is the sum of the optical cable propagation delay and the equipment processing delay;

[0186] Based on the number of nodes in the target dimension, determine the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set; and evaluate and rank the total number of devices or central station nodes for each valid routing scheme in the candidate routing scheme set according to the preset second evaluation criteria to obtain the corresponding second ranking result.

[0187] Based on the routing preferences in the target dimension, obtain the preset submarine and terrestrial cable preference table;

[0188] Obtain the submarine and terrestrial cable segments traversed by each valid routing scheme in the candidate routing scheme set;

[0189] The submarine and terrestrial cable segments are matched and verified with the submarine and terrestrial cable preference table. Based on the degree of matching, the routing preference priority of each valid routing scheme is determined, and each routing preference level is determined as the corresponding third ranking result.

[0190] Based on the first, second, and third sorting results, a comprehensive screening is performed according to the preset target dimension priority to obtain the optimal routing scheme after screening.

[0191] If no optimal routing solution is required, the first, second, and third sorting results are combined and sorted to generate and output a sorted list of candidate solutions.

[0192] In one possible implementation, module 702 is also used to establish a hierarchical resource model, which is stored and managed through a relational database or a graph database.

[0193] The transmission network route generation device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail here.

[0194] Figure 8 This is a schematic diagram of the structure of a transmission network route generation device provided in an embodiment of this application. Figure 8 As shown, the transmission network route generation device 800 provided in this embodiment includes at least one processor 801 and a memory 802. Optionally, the device 800 further includes a communication component 803. The processor 801, memory 802, and communication component 803 are connected via a bus.

[0195] In a specific implementation, at least one processor 801 executes computer execution instructions stored in memory 802, causing at least one processor 801 to perform the above-described method.

[0196] The specific implementation process of processor 801 can be found in the above method embodiments, and its implementation principle and technical effect are similar. It will not be repeated here.

[0197] In the above embodiments, it should be understood that the processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this invention can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules within the processor.

[0198] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage device.

[0199] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, the buses shown in the accompanying drawings are not limited to a single bus or a single type of bus.

[0200] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.

[0201] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above-described method.

[0202] The aforementioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. The readable storage medium can be any available medium accessible to a general-purpose or special-purpose computer.

[0203] An exemplary readable storage medium is coupled to a processor, enabling the processor to read information from and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can reside in an Application Specific Integrated Circuit (ASIC). Alternatively, the processor and the readable storage medium can exist as discrete components in the device.

[0204] The division of units is merely a logical functional division; in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.

[0205] The units described as separate components may or may not be physically separate. 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 network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0206] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0207] If a function is implemented as 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 this invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0208] Those skilled in the art will understand that all or part of the steps of the above-described method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When executed, the program performs the steps of the above-described method embodiments; and the aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.

[0209] Finally, it should be noted that other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein, and is not limited to the precise structures described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.

Claims

1. A method for generating routes in a transmission network, characterized in that, include: Multiple levels of resource objects are identified, and a corresponding unique identifier is assigned to each resource object; wherein, the resource object includes at least one of city, station, equipment, board, port, circuit, and optical cable; Based on the unique identifier, establish hierarchical topological relationships between resource objects at each level to obtain a hierarchical resource model; Through the hierarchical resource model, corresponding attribute information is added to each resource object, wherein the attribute information includes geographic coordinates, resource status, and latency value; Based on the attribute information and the hierarchical resource model, the corresponding macro-routing direction is determined; Based on the macro-routing direction and the hierarchical topology association, a set of candidate routing schemes is determined; The candidate routing scheme set is filtered based on multiple target dimensions to obtain the optimal routing scheme or a sorted list of candidate schemes; wherein the target dimensions include latency, number of nodes, and routing preference.

2. The method according to claim 1, characterized in that, The step of establishing hierarchical topological relationships between resource objects at each level based on the unique identifier to obtain a hierarchical resource model includes: Based on the unique identifier, and according to the preset hierarchical mapping logic, the hierarchical topological relationship between the resource objects at each level is constructed using foreign key association to obtain the hierarchical resource model; wherein, the hierarchical mapping logic is the hierarchical mapping logic of "city-station-equipment-board-port-optical cable".

3. The method according to claim 1, characterized in that, The attribute information includes geographic coordinates, resource status, latency value, and region information; the resource status includes idle status, occupied status, and fault status.

4. The method according to claim 3, characterized in that, The step of determining the corresponding macro-routing direction based on the attribute information and the hierarchical resource model includes: Based on the region information, the macroscopic routing direction between the starting node and the ending node is determined.

5. The method according to claim 4, characterized in that, After determining the corresponding macroscopic routing direction, the process also includes: Based on the geographical coordinates, calculate the node distance between the starting node and each potential adjacent node in the macro-routing direction; The distance to each node is compared with a preset threshold for the starting node; If the distance between the nodes is less than the preset threshold of the starting node, the corresponding potential neighboring nodes are determined as the effective neighboring node range, and the effective neighboring node ranges are summarized to obtain the summarized effective neighboring node set. Using the starting node as the core and the set of effective adjacent nodes as the extension range, the route search range corresponding to the starting node is determined.

6. The method according to claim 5, characterized in that, The step of determining the candidate routing scheme set based on the macro-routing direction and the hierarchical topology association includes: Based on the macro-routing direction and the hierarchical topology relationship, a preset priority search strategy is used to traverse the resource objects and connect the nodes; wherein, the priority search strategy includes either a depth-first search strategy or a breadth-first search strategy. After the node connection is determined, each connected resource object is used as the first processing object. The legality is verified according to the preset connection rules and constraints to obtain the connection path that conforms to the connection rules and constraints. The connection rules are that resources in the same city or station are directly logically connected, while those in different cities are connected through optical fiber resources. The constraints are that an upper limit is set on the number of nodes passing through the same area. After the resource traversal is completed, each traversal path is used as a second processing object. It is determined whether each second processing object has reached the termination node and whether the resource status of all the resource objects on the traversal path is idle. If so, the second processing object is determined as a valid routing scheme; Each of the valid routing schemes and each of the concatenated paths are aggregated to determine the candidate routing scheme set.

7. The method according to claim 6, characterized in that, The step of filtering the candidate routing scheme set according to multiple target dimensions to obtain the filtered optimal routing scheme or the sorted candidate scheme list includes: Based on the candidate routing scheme set, the total path delay in each effective routing scheme in the candidate routing scheme set is determined, and the total path delay in each effective routing scheme in the candidate routing scheme set is evaluated and ranked according to a preset first evaluation criterion to obtain a corresponding first ranking result; wherein, the total path delay is the sum of the optical cable propagation delay and the equipment processing delay; Based on the number of nodes in the target dimension, determine the total number of devices or central station nodes for each effective routing scheme in the candidate routing scheme set; and evaluate and rank the total number of devices or central station nodes for each effective routing scheme in the candidate routing scheme set according to a preset second evaluation criterion to obtain the corresponding second ranking result. Based on the routing preferences in the target dimension, obtain the preset submarine and terrestrial cable preference table; Obtain the submarine and terrestrial cable segments traversed by each of the effective routing schemes in the candidate routing scheme set; The submarine-land cable segment is matched and verified with the submarine-land cable preference table to determine the routing preference priority of each valid routing scheme based on the degree of matching, and each routing preference level is determined as the corresponding third sorting result; Based on the first sorting result, the second sorting result, and the third sorting result, a comprehensive filtering is performed according to the preset target dimension priority to obtain the optimal routing scheme after filtering. If the optimal routing scheme is not required, the first sorting result, the second sorting result, and the third sorting result are sorted and summarized to generate and output the sorted candidate scheme list.

8. The method according to any one of claims 1 to 7, characterized in that, The hierarchical resource model is stored and managed using a relational database or a graph database.

9. A transmission network route generation device, characterized in that, include: A definition module is used to define resource objects at multiple levels and assign a corresponding unique identifier to each resource object; wherein, the resource object includes at least one of city, station, equipment, board, port, circuit, and optical cable; A module is established to establish hierarchical topological relationships between resource objects at each level based on the unique identifier, so as to obtain a hierarchical resource model; An add module is used to add corresponding attribute information to each resource object through the hierarchical resource model, wherein the attribute information includes geographic coordinates, resource status and latency value; The first processing module is used to determine the corresponding macro-routing direction based on the attribute information and the hierarchical resource model; The second processing module is used to determine a set of candidate routing schemes based on the macro-routing direction and the hierarchical topology association. The filtering module is used to filter the candidate routing scheme set according to multiple target dimensions to obtain the optimal routing scheme after filtering or the sorted candidate scheme list; wherein, the target dimensions include latency, number of nodes and routing preference.

10. A transmission network route generation device, characterized in that, include: Memory, processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory, causing the processor to perform the method as described in any one of claims 1-8.

11. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1-8.

12. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method described in any one of claims 1-8.

Images