CN114095807A

CN114095807A - Automatic routing method and device for optical cable route and electronic equipment

Info

Publication number: CN114095807A
Application number: CN202010858594.5A
Authority: CN
Inventors: 刘薇; 杨海啸
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Group Hebei Co Ltd
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Group Hebei Co Ltd
Priority date: 2020-08-24
Filing date: 2020-08-24
Publication date: 2022-02-25

Abstract

The embodiment of the invention relates to the technical field of communication transmission, and discloses an automatic routing method, a routing device, electronic equipment and a computer storage medium for an optical cable route, wherein the method comprises the following steps: screening target data from the equipment resource information; selecting a plurality of attributes of the target data to establish a corresponding undirected graph model; determining a starting node and a destination node in the undirected graph model; searching a plurality of routes from the starting node to the destination node, wherein different routes have different priorities; and outputting a corresponding automatic routing result according to the priority of the route. Through the mode, the embodiment of the invention realizes automatic generation of the analysis route, effectively improves the maintenance efficiency and accuracy and provides the effect of efficient automatic management.

Description

Automatic routing method and device for optical cable route and electronic equipment

Technical Field

The embodiment of the invention relates to the technical field of communication transmission, in particular to an automatic routing method, a routing device, electronic equipment and a computer storage medium for an optical cable route.

Background

At present, an internal transmission line system and an external transmission line system are independently managed respectively, and end-to-end cross-layer correlation is not formed. The transmission interior wiring system mainly comprises transmission equipment, a machine disk, ports, a machine room rack, an ODF (optical distribution framework) and other facilities, and configuration data such as service time slots, topological connection, cross connection, subnetworks, tunnels and the like. The external line transmission system mainly comprises various dumb resources including cable resources such as pipelines, pole lines, monuments, optical cables, optical cross-connects, fiber distribution boxes, joint boxes and hand wells.

The internal and external line association means that the internal line transmission equipment forms a complete transmission system by bearing on the fiber core of the external line optical cable, and the resource management system performs resource association on the internal line and the external line according to the actual networking equipment and the use condition of the fiber core to form an end-to-end logical relationship.

Wherein, the transmission internal line system is mainly based on a logic level for topology management. The device board card port and the ODF port where the port terminating optical fiber is located can be inquired through EMS data acquisition and transmission internal line topology connection data can be formed according to the network element and the port. However, the association between the internal line system and the external line system requires manual connection based on solidification, and the associated optical cable routing data depends on manual data query, so that automatic routing and association cannot be performed through data analysis.

In the process of implementing the embodiment of the present invention, the inventors found that: the existing association relationship between the internal transmission line and the external transmission line system is managed in a manual maintenance mode by using a manual report. With the larger and larger transmission network scale, the management mode leads to the huge maintenance data volume because the network adjustment times are more and more frequent.

Moreover, all the association relations need to be manually searched and analyzed, and then are manually selected and bound one by one, so that the workload is huge, and under the condition that the existing networking situation is increasingly complex, the data size required to be analyzed and calculated is huge, omission and wrong selection are difficult to avoid, and the accuracy cannot be ensured.

Disclosure of Invention

In view of the above problems, embodiments of the present invention provide an automatic routing method, a routing device, an electronic device, and a computer storage medium for optical cable routing, which overcome or at least partially solve the above problems.

According to an aspect of an embodiment of the present invention, there is provided an automatic routing method for optical cable routing, the method including:

screening target data from the equipment resource information; selecting a plurality of attributes of the target data to establish a corresponding undirected graph model; determining a starting node and a destination node in the undirected graph model; searching a plurality of routes from the starting node to the destination node, wherein different routes have different priorities; and outputting a corresponding automatic routing result according to the priority of the route.

In an optional manner, the outputting a corresponding automatic routing result according to the priority of the route further includes: and displaying the route in a map display interface in a graphical mode.

In an alternative approach, the cable routes include an in-use route currently in use and an available route that can be selected for use;

the graphically displaying the route in the map display interface further comprises:

when the active route exists, highlighting the active route in a map interface;

when the active route does not exist, highlighting the available route with the highest priority in the map interface.

In an alternative, the active route may be selected among the available routes according to a selection instruction from a user.

In an alternative mode, the target data includes point data and line data; selecting a plurality of attributes in the target data to establish a corresponding undirected graph model, further comprising: generating a plurality of corresponding nodes based on the point data; and generating a corresponding line model connecting the two nodes based on the line data.

In an optional manner, the searching for the plurality of routes between the starting node and the destination node further includes:

searching a node directly related to the starting node, and recording a path value between the node and the starting node; taking the node with the minimum path value with the initial node as a searched node; when the searched node is the destination node, outputting the current path information as one route; when the searched node is not the destination node, searching other nodes directly related to the searched node; when the path values of the other nodes directly related to the searched node are less than or equal to the initial node, updating the path information; and when a preset termination condition is met or all nodes in the undirected graph model are traversed, ending the search of the route from the starting node to the destination node.

In an alternative mode, the smaller the number of nodes passed by the route, the higher the priority of the route; when the number of nodes passed by the route is the same, the shorter the sum of the lengths of the line models passed by the route is, the higher the priority of the route is.

According to another aspect of the embodiments of the present invention, there is provided an automatic routing device for optical cable routing, including:

the target data screening module is used for screening target data from the equipment resource information; the model construction module is used for selecting a plurality of attributes of the target data to establish a corresponding undirected graph model; a transmission topology selection module for determining a starting node and a destination node in the undirected graph model; a route searching module, configured to search for multiple routes from the starting node to the destination node, where different routes have different priorities; and the automatic routing module is used for outputting a corresponding automatic routing result according to the priority of the route.

According to another aspect of the embodiments of the present invention, there is provided an electronic device including: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;

the memory is configured to store at least one executable instruction that causes the processor to perform the steps of the automatic routing method as described above.

According to yet another aspect of the embodiments of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing the processor to perform the steps of the automatic routing method as described above.

According to the embodiment of the invention, by establishing the graph model corresponding to the resource information such as the home relationship, the network management topological association relationship, the transmission optical cable end relationship and the like of the transmission equipment room, the automatic routing of the pipeline resources between the transmission equipment can be realized through a proper path searching method, the existing manual maintenance method is replaced, the routing accuracy can be effectively improved, and the maintenance work efficiency can be improved.

The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.

Drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:

FIG. 1 is a flow chart illustrating an automatic routing method provided by an embodiment of the present invention;

FIG. 2 illustrates a schematic diagram of a graph model provided by an embodiment of the invention;

fig. 3 is a flowchart illustrating a route searching method according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a network architecture provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of an automatic routing device provided by an embodiment of the present invention;

fig. 6 shows a schematic structural diagram of an electronic device provided in an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

Fig. 1 is a flow chart showing an embodiment of the method for automatically routing optical cable routes, which is applied to a pipeline resource management device of a transmission device. The pipeline resource management device can be any type of electronic computing platform with logical computing capability, such as an intelligent terminal like a server, a workstation, a personal computer, etc., or a combination thereof, and is used for realizing end-to-end management and presentation of internal and external pipeline resources in transmission. As shown in fig. 1, the method comprises the steps of:

step 110: and screening target data in the equipment resource information.

The device resource information refers to data information related to the internal and external transmission systems and used for describing devices and resources. For example, the machine room affiliation, gateway topology association, transmission cable termination, etc.

The target data is part of data screened from the equipment resource information according to the actual requirement of a subsequent path searching algorithm. The technical personnel can screen out proper target data from the equipment resource information according to the aspects of recursion depth, traversal complexity and the like.

Specifically, the target data may be divided into two types, namely, dot data and line data. The point data is data information related to node modeling in the undirected graph and comprises sites, light branches, light intersections or splice boxes and the like. The line data is data information related to edge modeling of the connection node in the undirected graph, such as cable segment data.

Step 120: selecting a plurality of attributes of the target data to establish a corresponding graph model.

The graph model is composed of a plurality of nodes and edges connecting the two nodes. For example, as shown in fig. 2, a plurality of nodes a and edges B connecting the nodes (which may also be referred to as "line models") are included in the graph model. When there is a cable connection between two nodes, the length of cable is reflected by the corresponding edge in the graph model.

Nodes and edges may be modeled by point data and line data in the target data, respectively. That is, the target data may be divided into two types of point data and line data, which are used for modeling of nodes and edges, respectively.

An "attribute" is a dimension that is used to describe the target data. A target data may be generally described by a number of different attributes. For example, a site may be described by various attributes such as name, identity, type, etc. In modeling, a technician can choose to use the attributes in which the key is compared to model according to the needs of the actual situation.

Taking the point data as an example, the unique identifier, the name, the type and other attributes of the point data can be used as key attributes for modeling (for example, the type can be used for identifying whether the point data is a routing point, so that the point data can be used for rule calculation in the subsequent path searching process).

Step 130: a starting node and a destination node in the graph model are determined.

The "originating node" and the "destination node" are nodes selected by the user. As noted in the above step, after the modeling is completed, each transmission network element (i.e., point data) has a corresponding node in the figure. Thus, nodes corresponding to the transmission network element as a starting point and the transmission network element as an end point can be found in the graph as a starting node and a destination node, respectively.

Step 140: a plurality of routes between the originating node to the destination node are searched.

"route" refers to a path that can be taken from an originating node to a destination node. In an undirected graph, there may be multiple different routes from one node to another. In particular, any suitable type of path search algorithm, such as dijkstra's algorithm, may be used to search for the optimal route.

In some embodiments, on the basis of the path search algorithm, a plurality of filtering rules may be further added to filter and filter the searched route, so that the route more meets the actual use requirement. The specific filtering rule can be set according to the needs of the actual situation, such as no repetition rule, setting a recursion depth threshold value and the like.

In practical use cases, a plurality of different optimal paths may be obtained through algorithm search. On the basis, corresponding priorities or weights can be set for the routes according to preset evaluation rules.

The priority of the route may be used to reflect the specifics of the route. The specific priority setting situation can be determined according to the needs of the actual situation. For example, the lower the number of nodes traversed by the route, the higher the priority of the route. And when the number of the nodes passed by the route is the same, the shorter the sum of the lengths of the edges passed by the route is, the higher the priority of the route is.

Step 150: and outputting a corresponding automatic routing result according to the priority of the route.

The automatic routing results are route recommendation results provided to the user, which can be used as directions and references. The specific recommendation result can be set according to the needs of the actual situation, for example, the optimal route is automatically recommended or the optimal route is presented in a list form according to the priority order.

In some embodiments, one or more of the routes may be graphically presented in a corresponding map display interface. The term "graphical" means that a route is visually and intuitively displayed in a preset display mode on a corresponding map interface. For example, in a map display interface, a particular path is shown in a highlighted green or other prominent color.

Specifically, the cable routes may include both currently in use routes and available routes that may be selected for use. Of course, there is a possibility of inter-conversion between the used route and the available route. The user can edit the used route according to the actual situation, and selects the available route as the used route in a manual confirmation mode and stores the selected route in the server.

Wherein the active route is highlighted in a map interface when the active route exists. And when the active route does not exist, highlighting the available route with the highest priority in the map interface.

For example, during the actual display process, a map interface and a list interface can be included on the display interface. And displaying the corresponding active route of the selected transmission network element topology on a map interface in a bold highlight green color. And the list interface is used for showing the details of the in-use route.

Additionally, the list interface may also contain a list of available routes for displaying all available routes. Selection of available routes may be linked with map interface display. That is, when a user selects a certain available route, the available route is displayed on the map interface, and details of the available route (name site name/machine room name/transmission device 1 name, slot/board/port name, site name/machine room name/odf 1 name, cable segment 1 name, optical cross box 1 name, cable segment 2 name, optical cross box 2 name, site name/machine room name/odf 2 name, slot/board/port name, site name/machine room name/transmission device 2 name, etc.) are displayed on the list interface.

The automatic routing method provided by the embodiment of the invention defines the corresponding node and edge model structures in the undirected graph based on the service concatenation analysis requirements. Wherein, the node model contains the characteristic information (namely key resource information and type) of the service point, and the side model contains the key resource information (namely unique identification and length).

After modeling is completed, a corresponding path search algorithm is used in the graph model, the calculation result of the path is found, and one or more paths are recommended to the user according to the calculation result.

Therefore, the original manual route combing mode is changed into automatic generation and analysis of the route, the efficiency and the accuracy are effectively improved, and the effect of efficient automatic management is provided.

Fig. 3 is a flowchart illustrating an embodiment of a route searching method between a search start node and a destination node according to the present invention. The method can be applied to an undirected graph, and the shortest route (i.e. the optimal route) from the starting node to other nodes is searched. As shown in fig. 3, the method comprises the steps of:

step 310: a first path value between the starting node and each of the unsearched nodes is determined.

And other nodes except the initial node belong to the unsearched nodes in the initial state. These unsearched nodes include both direct association with the start node and the inability to reach the start node directly.

The path value is the distance between two nodes in the graph, and is specifically determined by the edge (i.e., line model) connecting the two nodes. For those nodes that cannot be reached directly, the path value can be set to infinity directly to facilitate algorithm implementation.

Step 320: and taking the unsearched node with the minimum first path value as the searched node, and recording the routing information reaching the unsearched node from the starting node.

Wherein a searched node is a concept of a set. In step 320, the non-searched node with the smallest first path value may be selected to be added to the searched node set based on the first path value, indicating that the node has changed state and belongs to the searched node.

Step 330: second path values are recorded from the start node, through the searched node and other nodes determined in step 320.

The second path value is a path value from the start node to the other nodes through the searched node. The second path value may be obtained in an overlapping manner. That is, the first path value of the searched node is obtained by superimposing the path values of the searched node and other nodes.

Step 340: judging whether the second path value from the starting node to each node is smaller than the first path value or not; if yes, go to step 350; if not, go to step 360.

Each of the other nodes has a first path value and a second path value with respect to the originating node through the above-described

steps

310 and 330. The specific path value is determined by the edge (i.e., line model) in the undirected graph.

Step 350: and updating the first path value into the second path value and updating corresponding routing information.

Here, "routing information" refers to data information describing a specific path from the originating node to one other node to determine or define a certain path.

Step 360: keeping the first path value and the routing information unchanged.

The above steps 310 to 360 are a complete recursive process for searching the route with the shortest route value from the starting node to other nodes. The route with the shortest path value may be considered as the optimal route.

Step 370: and judging whether the nodes which are not searched exist, if so, returning to the step 320 so as to continue the route searching. If not, ending the route searching process.

As the path search continues, other nodes except the initial node will continue to move from the set of unsearched nodes to the set of searched nodes. Therefore, after all the nodes are moved to the searched node set, it can be determined that all other nodes have traversed, and the process of the path search can be ended.

In other embodiments, since traversing all nodes may not be necessary, the further searched path may have no practical significance. Therefore, one or more termination conditions can be preset according to the requirements of actual conditions. Therefore, the process of path search can be ended in advance to improve the search efficiency under the condition that the search reaches the termination condition.

The termination condition may include whether the path value reaches a preset path threshold and whether the number of searched routes reaches a preset number threshold.

The path threshold is the upper limit of the path value of the route preset by the technician according to the needs of the actual situation. For example, when performing automatic routing for the access stratum, the path threshold may be set to 5. And when automatic routing is performed on the convergence layer or above, a smaller path threshold value is set to be 3.

The number threshold refers to an upper limit of the number of routes that the technician has searched and is preset according to the needs of the actual situation. For example, when performing automatic routing for the access stratum, the number threshold may be set to 20. And a smaller number threshold is set at 12 for automatic routing at or above the convergence layer.

Figure 4 shows a schematic diagram of one embodiment of the network architecture of the present invention. Fig. 2 is a graph model corresponding to the network structure shown in fig. 4, and an implementation process of the path search method shown in fig. 3 is described in detail below with reference to the graph model shown in fig. 2. As shown in fig. 2 and 4, the model includes: a first node A, a second node B, a third node C, an optical cable A, an optical cable B, an optical cable C and an optical cable D.

Two edges exist between the first node A and the second node B and respectively correspond to the optical cable A and the optical cable B. An edge exists between the first node a and the third node C, corresponding to the optical cable C. An edge exists between the third node C and the second node B, corresponding to the optical cable D.

The length of the optical fiber cable a was 8km, the length of the optical fiber cable B was 6km, the length of the optical fiber cable C was 2km, and the length of the optical fiber cable D was 3 km.

When the path search is carried out, firstly, an array distance is set for storing the shortest distance between the starting node and other nodes, an object route is set for recording the path information between the starting node and each other node, and a set T is set as a searched node set for recording the searched node.

Assume that the first node a is used as a starting node, a path between the first node a and other nodes is searched, and corresponding path values and path information are stored.

In fig. 4, a first node a may reach a second node B through an optical cable a. At this time, the path value between the two may be set to distance [ a-B ] ═ 1, and the corresponding path information is recorded as route [ a-B ] ═ cable a.

The first node a may also reach the second node B via the optical cable B. At this time, the path value between the two is also 1. However, since the length of the optical cable B is smaller than that of the optical cable a, the path may be considered to be a better path, and the path information may be updated to route [ a-B ] — optical cable B.

Further, the first node a also reaches the third node C via the optical cable C. At this time, the path value between the two may also be set to distance [ a-C ] ═ 1, and the corresponding path information is recorded as route [ a-C ] ═ cable C.

Then, the node with the smallest first path value is found. Since in fig. 4, the path values of both nodes are 1. Thus, one of the paths may be randomly selected.

Assuming that distance [ a-B ] is chosen to be 1, the second node B belongs to an unsearched node, and thus can be placed in the traversed node set T. At this point, since the second node B is already the destination node, it no longer looks up its neighbors, updates the relevant distance operation, and clears the data for distance [ A-B ].

And continuing to select the minimum path for continuing concatenation to search for the path (the residual distance [ A-C ] is 1 in FIG. 4). At this time, the third node C belongs to the unsearched node, so that the third node C can be put into the traversed node set T and continue to search for other nodes centering on it.

The third node C can reach the opposite end B through the optical cable D, and it can be seen that a new path is present between the first node a and the second node B at this time. Comparing the original first path value distance [ a-B ] with the new second path value, it can be seen that the first path value is 1, and the new second path value is 2 (i.e., distance [ a-C ] + cable D ═ 2), which is greater than the original first path value, so that the path information route [ a-B ] ═ cable B remains unchanged.

Finally, the second node B and the third node C are both classified into the searched set T, and all the nodes in the undirected graph have been traversed. Therefore, the present path search process can be ended.

To summarize, 3 routes are searched in the network structure shown in fig. 4 by the algorithm provided by the embodiment of the present invention. The routes corresponding to the optical cable A and the optical cable B are direct routes, and the routes corresponding to the optical cable C and the optical cable D pass through 2-hop optical cables.

Then, according to the principle that the hop count is equal and the length is first, it can be determined that the route corresponding to the optical cable B is the first priority, the route corresponding to the optical cable a is the second priority, and the routes corresponding to the optical cables C and D (passing through 2-hop optical cables) are the third priority.

By applying the automatic routing method provided by the embodiment of the invention, the transmission system can realize automatic generation and analysis of the route and automatic arrangement. In the process of completing the presentation of the data analysis, the user may select a specific transmission network element.

In the actual use process, one topological route may exist between the transmission network elements, or two or more topological routes may exist between the transmission network elements. When there is only one topological route, the user does not need to select. And when a plurality of topological routes exist, a user can select to click a certain topological route for presentation.

Specific presentation interfaces may include: a routing list (the routing list includes both a list of in-use routes and available routes) and a map for both end transport network element port names. And preferentially presenting the active routes in the map, and if no active route is set, presenting available routes with higher priority according to the rule.

1) For an active route: and displaying the details of the topological in-use route by using a route list, and displaying the route in a bold and highlighted green color by using a route map (the details of the route can be viewed by using the route list, and the slot position, the board card and the port name of the network element at the two ends of the route are displayed).

2) For available routes: the list of available routes presents all available routes corresponding to the topology. Available routes are prioritized for recommendation by rule. The priority ordering rule is: if the number of route hops is small, the priority is given, and if the number of hops is the same, the priority is given to the short route distance.

The route hop count is one hop per external line facility. The routing distance is the sum of all the hop count cable lengths traversed by the route). The first priority route map is displayed in bold and green, and other routes can be distinguished by the route color in the route list. All the routing support maps in the available routing list are presented at the same time, and the routing details (slot positions, board cards and port names of network elements at two ends of the routing are presented) can be checked.

Additionally, when a user manually selects a route in the route list, the map may present the corresponding selection in a highlighted resource linkage.

A route selection button and a route detail button are provided on the interface. The user can click a route selection button, then a certain route is confirmed to be the in-use route, and the background stores the result, so that the editing operation of the in-use route is realized. The user may also click a route detail button to cause the route to present the route details (e.g., name station name/machine room name/transmission device 1 name, slot/board/port name, station name/machine room name/odf 1 name, cable segment 1 name, optical cable box 1 name, cable segment 2 name, optical cable box 2 name, station name/machine room name/odf 2 name, slot/board/port name, station name/machine room name/transmission device 2 name) in serial order.

When a plurality of topological routes exist, a user can jump to a topological selection interface after a certain topological route is completed. At this time, the topological connection lines with completed topological relation are displayed in blue. And the user can click other topological connecting lines to repeat the above process to complete the operation.

The automatic routing method provided by the embodiment of the invention adjusts the original form of manually combing the cables on site by the offline optical cable routing into the automatic realization of the system, and effectively overcomes the defects that the manual mode depends on external line resources, the automatic batch routing effect of the system cannot be realized, and the efficiency and the accuracy are low. The method can realize efficient automatic management of analysis, optimization and planning of the optical cable route of the transmission system.

Fig. 5 is a schematic structural diagram of an embodiment of the automatic routing device of the present invention. As shown in fig. 5, the automatic routing device 500 includes: a target data screening module 510, a model building module 520, a transmission topology selection module 530, a route search module 540, and an auto-routing module 550.

The target data screening module 510 is configured to screen the device resource information for target data. The model building module 520 is configured to select a plurality of attributes of the target data to build a corresponding graph model, where the graph model is composed of a plurality of nodes and edges connecting the two nodes. The transmission topology selection module 530 is used to determine the originating node and the destination node in the graph model. The route searching module 540 is configured to search a plurality of routes from the start node to the destination node, wherein different routes have different priorities. The automatic routing module 550 is configured to output a corresponding automatic routing result according to the priority of the route.

In an alternative, the auto-routing module 550 is specifically configured to present the routes graphically in a map display interface.

In particular, the routes may include an in-use route currently in use and an available route that may be selected for use. The auto-routing module 550 is used to highlight the active route in the map interface when it exists and the available route with the highest priority in the map interface when it does not exist.

In an optional manner, the route search module 540 is specifically configured to determine, one by one, a minimum route value and corresponding route information between other nodes and a start node in the graph model according to a breadth-first principle, where a node that has already determined optimal route information is a searched node, and a node that has not determined optimal route information is an unsearched node; terminating the search when each unsearched node in the graph model is converted into a searched node; and outputting a plurality of routes from the starting node to the destination node according to the path information.

In an optional manner, the route search module 540 is specifically configured to determine, one by one, a minimum route value and corresponding route information between other nodes and a start node in the graph model according to a breadth-first principle, where a node that has already determined optimal route information is a searched node, and a node that has not determined optimal route information is an unsearched node; when a preset termination condition is met, terminating the search, wherein the termination condition comprises the following steps: whether the path value reaches a preset path threshold value and whether the searched route number reaches a preset number threshold value; and outputting a plurality of routes from the starting node to the destination node according to the path information.

In an alternative embodiment, the route searching module 540, when executing the step of determining the optimal path information between other nodes and the starting node in the graph model one by one according to the breadth-first principle, is further configured to:

determining a first path value between the starting node and each unsearched node; converting the unsearched node with the minimum first path value into a searched node, and recording routing information reaching the searched node from the starting node; determining a second path value from the starting node to each of the other unsearched nodes through the searched node; when the second path value is smaller than or equal to the first path value, updating the first path value to the second path value, and updating the routing information of the initial node reaching the node which is not searched; and when the second path value is larger than the first path value, keeping the first path value and the routing information unchanged.

In an alternative embodiment, the smaller the number of nodes passed by the route, the higher the priority of the route; when the number of nodes passed by the route is the same, the shorter the sum of the lengths of the edges passed by the route is, the higher the priority of the route is.

The automatic routing device adjusts the original form of manually combing the cables on site for the offline optical cable routing into the automatic realization of the system, and effectively overcomes the defects that the manual mode depends on external line resources, the automatic batch routing effect of the system cannot be realized, and the efficiency and the accuracy are low. The method can realize efficient automatic management of analysis, optimization and planning of the optical cable route of the transmission system.

An embodiment of the present invention provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction can execute the automatic routing method in any of the above method embodiments.

The executable instructions may be specifically configured to cause the processor to: screening target data from the equipment resource information; selecting a plurality of attributes of the target data to establish a corresponding graph model, wherein the graph model consists of a plurality of nodes and edges connecting the two nodes; determining a starting node and a destination node in the graph model; searching a plurality of routes from the starting node to the destination node in the graph model, wherein different routes have different priorities; and outputting a corresponding automatic routing result according to the priority of the route.

In an alternative approach, the routes include an in-use route currently in use and an available route that can be selected for use; the graphically displaying the route in the map display interface further comprises: when the active route exists, highlighting the active route in a map interface; when the active route does not exist, highlighting the available route with the highest priority in the map interface.

In an optional manner, the searching for the plurality of routes between the starting node and the destination node further includes: according to the breadth-first principle, determining the minimum path values and the corresponding path information between other nodes and the initial node in the graph model one by one, wherein the node with the determined optimal path information is a searched node, and the node without the determined optimal path information is an unsearched node; terminating the search when each unsearched node in the graph model is converted into a searched node; and outputting a plurality of routes from the starting node to the destination node according to the path information.

In an optional manner, the searching for the plurality of routes between the starting node and the destination node further includes: according to the breadth-first principle, determining the minimum path values and the corresponding path information between other nodes and the initial node in the graph model one by one, wherein the node with the determined optimal path information is a searched node, and the node without the determined optimal path information is an unsearched node; when a preset termination condition is met, terminating the search, wherein the termination condition comprises the following steps: whether the path value reaches a preset path threshold value and whether the searched route number reaches a preset number threshold value; and outputting a plurality of routes from the starting node to the destination node according to the path information.

In an optional manner, the determining optimal path information between other nodes and the start node in the graph model one by one according to a breadth-first principle further includes:

In an alternative mode, the smaller the number of nodes passed by the route, the higher the priority of the route; when the number of nodes passed by the route is the same, the shorter the sum of the lengths of the edges passed by the route is, the higher the priority of the route is.

The nonvolatile computer storage medium provided by the embodiment of the invention changes the original manual carding routing mode into automatic generation and analysis routing, and can realize multi-routing batch analysis. And moreover, the chart display mode is changed, the optical cable routes are displayed in batch by changing the graph visualization, the routing results are automatically sorted, the suggestions of the in-use and standby routes are automatically output, the maintenance personnel are guided to select, the control line cutover process is facilitated, and the routing conditions before and after the line cutover are timely updated.

Fig. 6 is a schematic structural diagram of an embodiment of the electronic device according to the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the electronic device.

As shown in fig. 6, the electronic device may include: a processor (processor)602, a communication Interface 604, a memory 606, and a communication bus 608.

Wherein: the processor 602, communication interface 604, and memory 606 communicate with one another via a communication bus 608. A communication interface 604 for communicating with network elements of other devices, such as clients or other servers. The processor 602 is configured to execute the program 610, and may specifically execute relevant steps in the above embodiments of the automatic routing method for an electronic device for cable route analysis.

In particular, program 610 may include program code comprising computer operating instructions.

The processor 602 may be a central processing unit CPU or an application Specific Integrated circuit asic or one or more Integrated circuits configured to implement embodiments of the present invention. The electronic device comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.

And a memory 606 for storing a program 610. Memory 606 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.

The program 610 may specifically be configured to cause the processor 602 to perform the following operations:

screening target data from the equipment resource information; selecting a plurality of attributes of the target data to establish a corresponding graph model, wherein the graph model consists of a plurality of nodes and edges connecting the two nodes; determining a starting node and a destination node in the graph model; searching a plurality of routes from the starting node to the destination node in the graph model, wherein different routes have different priorities; and outputting a corresponding automatic routing result according to the priority of the route.

The electronic device for optical cable analysis provided by the embodiment of the invention rapidly calculates the optical cable routing condition between the devices at two ends by using a routing calculation analysis method based on a graph model, presents a routing calculation result, associates the actual optical cable line routing with the device topology, and completes routing. This electronic equipment changes the artifical route mode of combing one by one of tradition, improves interior outer line series efficiency to can demonstrate through the mode of imaging, easily know the topology optical cable route condition, thereby overcome the human cost height that prior art scheme exists, data readability is poor, data authenticity can't be ensured, the inefficiency problem.

The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.

In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the invention and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specified otherwise.

Claims

1. A method for automatic routing of optical cable routes, the method comprising:

screening target data from the equipment resource information;

selecting a plurality of attributes of the target data to establish a corresponding graph model, wherein the graph model consists of a plurality of nodes and edges connecting the two nodes;

determining a starting node and a destination node in the graph model;

searching a plurality of routes from the starting node to the destination node in the graph model, wherein different routes have different priorities;

and outputting a corresponding automatic routing result according to the priority of the route.

2. The method of claim 1, wherein outputting the corresponding automatic routing result according to the priority of the route further comprises:

and displaying the route in a map display interface in a graphical mode.

3. The method of claim 2, wherein the routes include an in-use route currently in use and an available route that can be selected for use;

when the active route exists, highlighting the active route in a map interface;

4. The method of claim 1, wherein the searching for the plurality of routes between the originating node to the destination node further comprises:

according to the breadth-first principle, determining the minimum path values and the corresponding path information between other nodes and the initial node in the graph model one by one, wherein the node with the determined optimal path information is a searched node, and the node without the determined optimal path information is an unsearched node;

terminating the search when each unsearched node in the graph model is converted into a searched node;

and outputting a plurality of routes from the starting node to the destination node according to the path information.

5. The method of claim 1, wherein the searching for the plurality of routes between the originating node to the destination node further comprises:

when a preset termination condition is met, terminating the search, wherein the termination condition comprises the following steps: whether the path value reaches a preset path threshold value and whether the searched route number reaches a preset number threshold value;

6. The method according to claim 4 or 5, wherein the determining optimal path information between other nodes and a starting node in the graph model one by one according to a breadth-first principle further comprises:

determining a first path value between the starting node and each unsearched node;

converting the unsearched node with the minimum first path value into a searched node, and recording routing information reaching the searched node from the starting node;

determining a second path value from the starting node to each of the other unsearched nodes through the searched node;

when the second path value is smaller than or equal to the first path value, updating the first path value to the second path value, and updating the routing information of the initial node reaching the node which is not searched;

and when the second path value is larger than the first path value, keeping the first path value and the routing information unchanged.

7. The method of claim 1, wherein the lower the number of nodes traversed by the route, the higher the priority of the route;

when the number of nodes passed by the route is the same, the shorter the sum of the lengths of the edges passed by the route is, the higher the priority of the route is.

8. An automatic routing device for optical cable routing, the device comprising:

the target data screening module is used for screening target data from the equipment resource information;

the model building module is used for selecting a plurality of attributes of the target data to build a corresponding graph model, and the graph model consists of a plurality of nodes and edges connecting the two nodes;

a transmission topology selection module for determining a starting node and a destination node in the graph model;

a route searching module, configured to search for multiple routes from the starting node to the destination node, where different routes have different priorities;

and the automatic routing module is used for outputting a corresponding automatic routing result according to the priority of the route.

9. An electronic device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;

the memory is for storing at least one executable instruction that causes the processor to perform the steps of the auto-routing method as recited in any one of claims 1-7.

10. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform the steps of the automatic routing method as recited in any one of claims 1-7.