WO2018103738A1

WO2018103738A1 - Route establishment method and device

Info

Publication number: WO2018103738A1
Application number: PCT/CN2017/115272
Authority: WO
Inventors: 肖红运; 李兴明; 许晓健; 陈碧红; 何桓; 于洪宾
Original assignee: 中兴通讯股份有限公司
Priority date: 2016-12-08
Filing date: 2017-12-08
Publication date: 2018-06-14
Also published as: CN108183856B; CN108183856A

Abstract

A route establishment method, comprising: in a network topology, determining a shortest ring link which comprises a source node and a destination node; in the shortest ring link, determining two paths from the source node to the destination node; establishing a working route for the source node and the destination node according to one of the paths, and establishing a protection route for the source node and the destination node according to the other path.

Description

Method and device for establishing route

Technical field

The present disclosure relates to, but is not limited to, the field of communication technologies, and in particular, to a route establishment method and apparatus.

Background technique

With the development of large-scale multimedia networks and the emergence of new services such as multimedia streaming and video conferencing, higher requirements are placed on the network, which not only requires the network to meet the quality of service (QoS) requirements of the service, but also fails in the network connection. When the service is kept uninterrupted, if there is only one communication path between the source node and the destination node, the fast recovery service cannot be met when the link fails. To achieve the above requirements, a pair of link-separated paths can be provided between the source node and the destination node, one of which is a working route and the other is a protected route of the working route.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

The route establishment method can adopt the K-optimal path algorithm, first calculate a shortest path as a working route, and then calculate the shortest path separated from the working route as a protection route. For example, for the "Japanese-shaped" networking scenario, when performing work route calculation, the middle side of the "Japanese font" may be used as the partial path of the work route. When calculating the protection route, no matter how the path is selected, It will be separated from the working route. At this time, the working route needs to be recalculated, and the protection route is calculated according to the recalculated working route until the separated working route and the protection route are calculated. For a more complex networking scenario, it may be necessary to calculate thousands, tens of thousands, or even hundreds of millions of times through the K-optimal path algorithm to obtain separate working routes and protection routes.

The process of determining the working route and protecting the route is complicated and time consuming, and it is easy to cause the route establishment failure due to the timeout.

The present disclosure provides a route establishment method and apparatus, which can avoid the process of determining a working route and protecting a route from being complicated and time consuming.

The present disclosure provides a route establishment method, including: determining, in a network topology, a shortest ring link including a source node and a destination node; and determining, in the shortest ring link, from the source node to the destination node And establishing a working route of the source node and the destination node according to one path, and establishing a protection route of the source node and the destination node according to another path.

In an exemplary embodiment, the determining the shortest ring link including the source node and the destination node comprises: determining a first shortest path from the source node to the destination node; disabling the first in the network topology a shortest path; determining a second shortest path from the source node to the destination node according to a network topology after the first shortest path is disabled; deleting the first shortest path and the second shortest path The node link through which the first shortest path and the second shortest path pass together form a shortest ring link.

In an exemplary embodiment, the determining the first shortest path from the source node to the destination node comprises: determining all paths from the source node to the destination node; according to a plurality of nodes in the network topology in advance The initial weight of each node link in the link determines the sum of the weights of the node links through which each path passes, and the path corresponding to the sum of the weights is used as the first shortest path.

In an exemplary embodiment, the determining, according to the network topology after the first shortest path is disabled, determining a second shortest path from the source node to the destination node, including: according to a pre-network topology The initial weight of each node link in the multiple node links, and the shortest path distance from the source node to each node, modifying the weight of each node link in the multiple node links in the network topology Determining, from the network topology after the first shortest path, all paths from the source node to the destination node; according to the modified weight of each node link in the plurality of node links And determining a sum of weights of the node links through which each of the paths passes, and using the path corresponding to the sum of the weights as the second shortest path.

In an exemplary embodiment, the establishing a working route of the source node and the destination node according to one of the paths, and establishing a protection route of the source node and the destination node according to another path, including: Determining, in advance, an initial weight set for each node link of the plurality of node links in the network topology, determining a sum of weights of the node links through which the one path passes, and determining a node through which the other path passes The sum of the weights of the links; the working route of the source node and the destination node is established according to the path corresponding to the sum of the smaller weights, according to the sum of the larger weights The path of the path is established, and the protection route of the source node and the destination node is established.

In an exemplary embodiment, the determining the shortest ring link including the source node and the destination node includes determining a shortest ring link including the source node and the destination node using a preset Dijkstra algorithm.

The present disclosure also provides a route establishing apparatus, including: a determining module, configured to: determine, in a network topology, a shortest ring link including a source node and a destination node; and a determining module, configured to: in the shortest ring link Determining two paths from the source node to the destination node; establishing a module, configured to: establish a working route of the source node and the destination node according to one path, and establish the source according to another path The protection route of the node and the destination node.

In an exemplary embodiment, the determining module is configured to: determine a first shortest path from a source node to a destination node; disable the first shortest path in the network topology; a network topology after the shortest path, determining a second shortest path from the source node to the destination node; deleting, in the first shortest path and the second shortest path, the first shortest path and the The node link through which the second shortest path passes together forms the shortest ring link.

In an exemplary embodiment, the determining module is further configured to: determine all paths from the source node to the destination node; according to a preset for each node link in a plurality of node links in a network topology The initial weight value determines the sum of the weights of the node links through which each of the paths passes, and the path corresponding to the sum of the weights is the first shortest path.

In an exemplary embodiment, the determining module is further configured to: according to an initial weight set in advance for each of the plurality of node links in the network topology, and the source node to each node a shortest path distance, modifying a weight of each of the plurality of node links in the network topology; determining, from the source node to the destination node, in a network topology after the first shortest path is disabled All the paths; determining, according to the modified weights of each of the plurality of node links, the sum of the weights of the node links through which the path passes, and the sum of the weights The corresponding path is used as the second shortest path.

In an exemplary embodiment, the establishing module is configured to: determine, according to an initial weight set in advance for each node link of the plurality of node links in the network topology, the node through which one of the paths passes The sum of the weights of the links, and the sum of the weights of the node links through which the other path passes; establishing the work of the source node and the destination node according to the path corresponding to the sum of the smaller weights Routing, establishing the source node and the destination according to a path corresponding to a sum of larger weights The protected route of the node.

In an exemplary embodiment, the determining module is configured to determine a shortest ring link including a source node and a destination node by using a preset Dijkstra algorithm.

Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions that, when executed, implement the routing establishment method described above.

The beneficial effects of the disclosure are as follows:

The present disclosure determines the shortest ring link including the source node and the destination node through which the working and protection routes are determined. Since the ring link is a ring, the final determined work route and protection route are separate two independent routes, and it is because the ring link is the shortest ring link including the source node and the destination node. Therefore, the determined work route and protection route are the optimal work route and protection route. The disclosure reduces the complexity of determining the working route and the protection route, shortens the time-consuming determination, and can efficiently find the working route and the protection route thereof, and the result is the most preferable way, and thus can be a path-finding problem in actual engineering. Provide efficient, convenient and quality solutions.

Other aspects will be apparent upon reading and understanding the drawings and detailed description.

BRIEF abstract

1 is a flowchart of a route establishment method according to a first embodiment of the present disclosure;

2 is a flow chart showing the steps of determining a shortest ring link in accordance with a second embodiment of the present disclosure;

3 is a flowchart of a route establishment method according to a third embodiment of the present disclosure;

4-1 is a schematic diagram of a network topology according to a third embodiment of the present disclosure;

4-2 is a schematic diagram of a shortest path P1 according to a third embodiment of the present disclosure;

4-3 is a schematic diagram of a shortest path spanning tree according to a third embodiment of the present disclosure;

4-4 is a schematic diagram of a network topology in which the shortest path P1 is disabled according to the third embodiment of the present disclosure;

4-5 are schematic diagrams of network topologies for modifying node link weights according to a third embodiment of the present disclosure;

4-6 are schematic views of a shortest path P2 according to a third embodiment of the present disclosure;

4-7 are schematic diagrams of a node link through which a shortest path P1 and a shortest path P2 pass together according to a third embodiment of the present disclosure;

4-8 are schematic diagrams of a shortest loop link in accordance with a third embodiment of the present disclosure;

FIG. 5 is a schematic diagram of a network topology according to a fourth embodiment of the present disclosure; FIG.

FIG. 6 is a schematic diagram of a shortest path P1 according to a fourth embodiment of the present disclosure; FIG.

7 is a schematic diagram of a network topology for modifying a node link weight according to a fourth embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a shortest path P2 according to a fourth embodiment of the present disclosure; FIG.

9 is a schematic diagram of a node link through which a shortest path P1 and a shortest path P2 pass together according to a fourth embodiment of the present disclosure;

10 is a schematic diagram of a shortest ring link in accordance with a fourth embodiment of the present disclosure;

11 is a schematic diagram of a work route and a protection route according to a fourth embodiment of the present disclosure;

FIG. 12 is a structural diagram of a route establishing apparatus according to a fifth embodiment of the present disclosure.

Preferred embodiment of the present disclosure

Embodiments of the present disclosure will be described below with reference to the accompanying drawings.

The first embodiment of the present disclosure provides a route establishment method. As shown in FIG. 1 , which is a flowchart of a route establishment method according to the first embodiment of the present disclosure, referring to FIG. 1 , the route establishment method may include:

Step S110, in the network topology, determine the shortest ring link including the source node and the destination node.

Step S120, in the shortest ring link, determine two paths from the source node to the destination node.

Step S130: Establish a working route of the source node and the destination node according to one path, and establish a protection route of the source node and the destination node according to another path.

A plurality of nodes and a plurality of node links for connecting two nodes may be included in the network topology.

Optionally, a source node and a destination node are specified among the plurality of nodes. The shortest ring link containing the source node and the destination node, ie the shortest ring link, is determined in the network topology. Alternatively, the shortest ring link including the source node and the destination node may be determined using a preset algorithm. The preset algorithm can be, for example, the Dijkstra algorithm.

An optimal working route and a protection route can be determined based on the shortest ring link. In the shortest ring link, the path with the source node as the starting point and the destination node as the ending point can be determined. Since the shortest ring link is a ring, the path that meets the requirements can be two, one of the paths. As a working route, another path acts as a protection route.

In this embodiment, the working route and the protection route of the source node and the destination node can be determined only by determining the shortest ring link including the source node and the destination node, and the determining process is simple and time-consuming, thereby improving route establishment efficiency. Reduces the risk of route setup failures.

In this embodiment, since the shortest ring link is a ring, the final determined work route and the protection route are two separate routes. In the work route, if the intermediate node or the link between the source node and the destination node is If the path fails, you can enable the protection route instead of the work route. It is also because the shortest ring link is the shortest ring path containing the source node and the destination node, so the final determined work route and protection route are the optimal work route and protection route.

In order to make the process of determining the shortest ring link clearer in the present disclosure, the steps of determining the shortest ring link are described below. 2 is a flow chart showing the steps of determining the shortest ring link according to the second embodiment of the present disclosure. Referring to FIG. 2, the step of determining the shortest ring link of the second embodiment of the present disclosure may include:

Step S210: Determine a first shortest path from the source node to the destination node based on the current network topology.

The first shortest path may refer to the shortest path between the source node and the destination node in the current network topology.

The initial weight set for each node link of the multiple node links in the network topology may be pre-defined, for example, the initial weight of each node link is set to 1.

Optionally, determining all paths from the source node to the destination node; determining the weight of the node link through which each path passes according to an initial weight set in advance for each node link of the plurality of node links in the network topology The sum, and the path corresponding to the sum of the weights (the sum of the minimum weights) is taken as the first shortest path.

The node links are directional, such as a bidirectional link and a unidirectional link; the unidirectional link may include: an uplink, a downlink. The weight corresponding to the direction may be set for the node link. For example, when the initial weight is set, for the node link between the node A and the node B, the weights in the two directions may be the same, such as link A→ Both B and link B→A have a weight of 1. Can follow the direction of the path, Obtain the weights corresponding to the link of each node through which the path passes, and add the obtained weights to determine the sum of the weights corresponding to the path.

In this embodiment, the initial weight corresponding to the two directions of the node link may be 1, and when determining the sum of the weights corresponding to the paths between any two nodes, the first node to the last in the path may be determined. The hop count of a node, which is the sum of the weights.

Step S220, disabling the first shortest path in the network topology.

In the network topology, it may be determined that the first shortest path passes through each of the plurality of node links, and the direction of each of the node links is disabled according to the direction of the first shortest path.

Step S230, determining a second shortest path from the source node to the destination node according to the network topology after the first shortest path is disabled.

The second shortest path may refer to the shortest path between the source node and the destination node in the network topology after the first shortest path is disabled.

After the first shortest path is disabled in the network topology, a new network topology can be formed. The original network topology and the new network topology do not change on the node, but the link changes; it can be based on the pre-existing network topology. The initial weight of each node link setting in the node link, and the shortest path distance from the source node to each node in the new network topology, modifying each node chain in the multiple node links in the new network topology The weight of the road; when determining the second shortest path, all paths from the source node to the destination node may be determined in the new network topology; may be based on the weight of each node link in the modified plurality of node links And determining the sum of the weights of the node links through which each path (each path from the source node to the destination node in the new network topology) passes, and the path corresponding to the sum of the weights as the second shortest path.

Step S240, in the first shortest path and the second shortest path, delete the node link through which the first shortest path and the second shortest path pass together to form a shortest ring link.

In the new network topology, the previously disabled first shortest path can be re-enabled, so that the first shortest path and the second shortest path will exist in the network topology at the same time, and the first shortest path and the second shortest path are found together. Passing node link; after deleting the commonly passed node link in the first shortest path and the second shortest path, the remaining shortest link of the first shortest path and the second shortest path will form a ring link, and the The ring link is the shortest ring that contains the source node and the destination node. Link.

Based on the shortest ring link determined in this embodiment, in the shortest ring link, two paths with the source node as the starting point and the destination node as the end point may be determined according to the plurality of node links in the network topology. The initial weight of each node link setting, determining the sum of the weights of the node links through which one path passes, and the sum of the weights of the node links through which the other path passes; according to the sum of the smaller weights The corresponding path establishes a working route between the source node and the destination node; and establishes a protection route of the source node and the destination node according to the path corresponding to the sum of the larger weights.

The determination process of this embodiment has a large degree of optimization in time complexity and space complexity. The two paths finally selected by the embodiment are completely separated, and the protection path does not depend on the working path, and works. The cost (weight) of the path and the protection path is minimal.

FIG. 3 is a flowchart of a route establishment method according to a third embodiment of the present disclosure. 4 (including FIGS. 4-1 to 4-8) is a schematic diagram of a route establishment method according to a third embodiment of the present disclosure. Referring to FIG. 3 and FIG. 4, the route establishment method of the third embodiment of the present disclosure may include the following steps:

Step S310, setting initial weights for each of the plurality of node links in the network topology, and determining the shortest path P1 of the source node to the destination node by using the Dijkstra algorithm.

As shown in Figure 4-1, in the network topology, nodes A to J can be included, node A is the source node, and node J is the destination node. In the network topology, you can set the initial weight of each node link to be 1, and the number in Figure 4-1 represents the weight. Optionally, each node link is a bidirectional link, and the initial weight corresponding to each direction is 1.

Among each path from the source node to the destination node, the shortest path P1 refers to the path in which the sum of the initial weights of the links through each node is the smallest. The shortest path P1 is the first shortest path described above.

Using the Dijkstra algorithm, it can be determined that the shortest path P1 between the source node A and the destination node J is A→B→H→I→J, as indicated by the thick arrow in FIG. 4-2. Optionally, the path between the source node A and the destination node J includes: A→F→G→H→I→J (the sum of the weights is 5), A→F→G→H→I→D→E →J (sum of weights is 7), A→F→G→H→B→C→D→E→J (sum of weights is 8), A→B→H→I→J (weight And 4), A→B→C→D→I→J (the sum of weights is 5), A→B→C→D→E→J (the sum of weights is 5); The short path P1 is A→B→H→I→J, and the path A→B→H→I→J is the path with the smallest sum of weights in each path between the node A and the node J.

Step S320, using the Dijksta algorithm, determining the shortest path distance of each node from the source node to the network topology, and forming a shortest path spanning tree.

Optionally, the Dijkstra algorithm is used to determine the shortest path from the source node to the designated node, in which the hop count from the source node to the designated node is the shortest path distance.

It is determined that in the network topology, the shortest path distance from node A to node B is 1, the shortest path distance from node A to node C is 2, the shortest path distance from node A to node D is 3, and node A to node E The shortest path distance is 4, the shortest path distance from node A to node F is 1, the shortest path distance from node A to node G is 2, the shortest path distance from node A to node H is 2, and the shortest path from node A to node I The distance is 3, and the shortest path distance from node A to node J is 4.

According to the determination result, it is known that node A is the starting point, the node with the shortest path distance of 1 is node B and node F, and the node with the shortest path distance of 2 is node C, node G and node H, and the node with the shortest path distance is 3. For node D and node I, the node with the shortest path distance of 4 is node E and node J. The shortest path spanning tree formed according to the determined result is shown in Fig. 4-3, and the number in Fig. 4-3 indicates the shortest path distance.

Step S330, disabling the shortest path P1 of the source node to the destination node in the network topology.

Since the link has directionality, each node link through which the shortest path P1 passes can be disabled in the network topology, that is, the path A→B→H→I→J is disabled, but it is worth noting that in the network topology, The path A←B←H←I←J may not be disabled, so in Figure 4-4, the link between ABHIJs may be a single arrow.

Step S340, in the network topology in which the shortest path P1 is disabled, the initial weight of each node link in the plurality of node links is modified.

You can use the formula w'(u,v)=w(u,v)-d(s,v)+d(s,u) to modify the initial settings for each link in multiple links in the network topology. Weight.

Where u is the starting point of the link, v is the end point of the link, s is the source node, w'(u,v) is the modified weight of the link u→v, and w(u,v) is the link u → initial weight of v, d(s, v) is the shortest path distance from the source node to the end of the link, and d(s, u) is the shortest path distance from the source node to the start of the link.

For example, to determine the weight of link H→B, the initial weight of link H→B is 1, the shortest path distance from node A to node B is 1, and the shortest path distance from node A to node H is 2, then the chain The weight of the path H→B is w'(H,B)=w(H,B)-d(A,B)+d(A,H)=1-1+2=2.

For another example, determining the weight of the link I→H, the initial weight of the link I→H is 1, the shortest path distance from the node A to the node H is 2, and the shortest path distance from the node A to the node I is 3, then The weight of the link I→H is w'(I,H)=w(I,H)-d(A,H)+d(A,I)=1-2+3=2.

For another example: determine the weight of link B→C, the initial weight of link B→C is 1, the shortest path distance from node A to node C is 2, and the shortest path distance from node A to node B is 1, then The weight of link B→C is w'(B,C)=w(B,C)-d(A,C)+d(A,B)=1-2+1=0. Determine the weight of link C→B, the initial weight of link C→B is 1, the shortest path distance from node A to node C is 2, and the shortest path distance from node A to node B is 1, then link C →B weight w'(C,B)=w(C,B)-d(A,B)+d(A,C)=1-1+2=2.

As shown in Figure 4-5, the weights in Figure 4-5 are the new weights for the weights modified according to the method given in this step.

Step S350, after the shortest path P1 is disabled in the network topology, the shortest path P2 of the source node to the destination node is determined again by using the Dijkstra algorithm.

The Dijkstra algorithm can be used to determine that the shortest path P2 between the source node A and the destination node J is A→F→G→H→B→C→D→E→J, as shown by the thick arrow in Figure 4-6. .

The shortest path P2 may be the second shortest path described above.

In step S360, in the shortest path P1 and the shortest path P2, the node link through which the shortest path P1 and the shortest path P2 pass together is deleted.

Enabling the shortest path P1 in the network topology results in the initial network topology shown in Figure 4-1.

The shortest path P1 and the shortest path P2 are simultaneously shown in FIG. 4-7. By comparison, the node link through which the shortest path P1 and the shortest path P2 pass together is B-H, that is, link B→H and link H→B.

Delete link B→H in the shortest path P1 (A→B→H→I→J), and delete the link in the shortest path P2 (A→F→G→H→B→C→D→E→J) H→B, Figure 4-8 shows the shortest ring link obtained after deleting link B→H and link H→B.

Step S370, determining the work according to the remaining node links in the shortest path P1 and the shortest path P2. Route and protect routes.

The remaining node links in the shortest path P1 and the shortest path P2 may constitute the shortest ring link ABCDEFGHIJ, and the shortest ring link may include two paths: A→B→C→D→E→J, A→F →G→H→I→J. The sum of the weights of the node links in each path may be determined according to the initial weight set for each node link, and the path with the smallest sum of weights is used as the working route, and the sum of the weights is the second smallest path. As a protection route. If the weights of the two paths are the same, one path can be randomly selected as the working path, and the other is used as the protection path; or the path with the best link quality is selected as the working path, and the other is used as the protection path.

For example, the sum of the weights of the path A→B→C→D→E→J is 5, and the sum of the weights of the path A→F→G→H→I→J is also 5, and the path A→B→C is determined. →D→E→J and path A→F→G→H→I→J packet loss rate, the link with a small packet loss rate is used as the working link, and the other link is used as the protection path.

Step S380, establishing a route according to the determined result of the working route and the protection route.

An optional fourth embodiment will be described below with reference to FIGS. 5-11 to describe the route establishment process of the present disclosure.

As shown in FIG. 5, a network topology is established (for example, a network topology may be established according to a physical topology), and nodes 1 to 21 may be included in the network topology, the designated node 12 may be a source node, and the node 9 may be a sink node. (destination node), and you can set the initial weight of each node link to 1.

As shown in FIG. 6, the preset Dijkstra algorithm can be called to determine that the shortest path P1 from node 12 to node 9 is node 12 → node 10 → node 11 → node 9.

As shown in FIG. 7, the node link through which the shortest path P1 passes can be disabled, of course, only in the direction of the shortest path P1, forming a new network topology, and determining the weight of each node link in the new network topology. The number on the node link in FIG. 7 is the weight of the link of the node, and the process of determining the weight can refer to the third embodiment described above.

According to FIG. 8, the preset Dijkstra algorithm can be called according to the new network topology, and the shortest path P2 from the node 12 to the node 9 is determined to be the node 12→the node 14→the node 11→the node 10→ Node 7 → Node 9.

According to FIG. 9, the shortest path P1 can be enabled, and the shortest path P1 and the shortest path P2 can be put together. In the shortest path P1 and the shortest path P2, the node link in which the shortest path P1 and the shortest path P2 coincide is removed (node 10) - Node 11), the remaining node links in the shortest path P1 and the shortest path P2 form the shortest ring link.

According to FIG. 10, the shortest ring link may include: node 12 - node 14 - node 11 - node 9 - node 7 - node 10.

According to FIG. 11, the node links other than the shortest ring link can be disabled, the preset Dijkstra algorithm is called, and the shortest path from the node 12 to the node 9 is determined by using the initial weight of each node link. The work route disables each link of the node corresponding to the work route, and calls the preset Dijkstra algorithm again to determine the shortest path from the node 12 to the node 9 as the protection route. Once determined, enable all node links in the network topology.

In this embodiment, the two paths from the node 12 to the node 9 are node 12 → node 10 → node 7 → node 9, respectively, and node 12 → node 14 → node 11 → node 9, the weight of the two paths The sum is 3, so the path with the best link quality is selected as the working route, and the other is the protection route.

A fifth embodiment of the present disclosure provides a route establishing apparatus. As shown in FIG. 12, it is a structural diagram of a route establishing apparatus according to a fifth embodiment of the present disclosure.

The device can include:

The determining module 1210 is configured to: determine, in the network topology, a shortest ring link including the source node and the destination node, and in the shortest ring link, determine two paths from the source node to the destination node .

The establishing module 1220 is configured to: establish a working route of the source node and the destination node according to one path, and establish a protection route of the source node and the destination node according to another path.

Optionally, the determining module 1210 is configured to: determine a first shortest path from the source node to the destination node; disable the first shortest path in the network topology; according to the network topology after the first shortest path is disabled Determining a second shortest path from the source node to the destination node; In the first shortest path and the second shortest path, the node link through which the first shortest path and the second shortest path pass together is deleted to form a shortest ring link.

Optionally, the determining module 1210 is further configured to: determine all paths from the source node to the destination node; determine according to an initial weight set in advance for each node link of the multiple node links in the network topology. The sum of the weights of the node links through which each of the paths passes, and the path corresponding to the sum of the weights as the first shortest path.

Optionally, the determining module 1210 is further configured to modify according to an initial weight set in advance for each node link of the plurality of node links in the network topology, and a shortest path distance from the source node to each node. a weight of each of the plurality of node links in the network topology; in the network topology after the first shortest path is disabled, determining all paths from the source node to the destination node; The weight of each of the plurality of node links in the subsequent plurality of node links, determining the sum of the weights of the node links through which each of the paths passes, and using the path corresponding to the sum of the weights as the second The shortest path.

Optionally, the establishing module 1220 is configured to: determine, according to an initial weight set in advance for each node link of the multiple node links in the network topology, a weight of the node link through which the one path passes And determining a sum of weights of the node links through which the another path passes; establishing a working route of the source node and the destination node according to the path corresponding to the sum of the smaller weights, according to a larger A path corresponding to the sum of the weights establishes a protection route of the source node and the destination node.

Optionally, the determining module 1210 is configured to: determine, by using a preset Dijkstra algorithm, a shortest ring link including the source node and the destination node.

The functions of the device in this embodiment have been described in the method embodiments shown in FIG. 1 to FIG. 11. Therefore, in the description of the present embodiment, reference may be made to the related description in the foregoing embodiment. This will not be repeated.

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and functional blocks/units of the methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or A function or step can be performed cooperatively by several physical components. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer readable medium, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media. Computer storage media include, but are not limited to, Random Access Memory (RAM), Read-Only Memory (ROM), and Electrically Erasable Programmable Read-only Memory (EEPROM). Flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cassette, magnetic tape, disk storage or other magnetic storage device, or Any other medium used to store the desired information and that can be accessed by the computer. Moreover, it is well known to those skilled in the art that communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .

A person skilled in the art can understand that the technical solutions of the present disclosure may be modified or equivalent, without departing from the spirit and scope of the present disclosure, and should be included in the scope of the claims of the present disclosure.

Industrial applicability

Claims

A route establishment method includes:

In the network topology, determine the shortest ring link including the source node and the destination node;

Determining, in the shortest ring link, two paths from the source node to the destination node;

Establishing a working route of the source node and the destination node according to one path, and establishing a protection route of the source node and the destination node according to another path.
The method of claim 1 wherein said determining a shortest ring link comprising a source node and a destination node comprises:

Determining a first shortest path from the source node to the destination node;

Disabling the first shortest path in the network topology;

Determining a second shortest path from the source node to the destination node according to a network topology after the first shortest path is disabled;

In the first shortest path and the second shortest path, the node link through which the first shortest path and the second shortest path pass together is deleted to form a shortest ring link.
The method of claim 2 wherein said determining a first shortest path from a source node to a destination node comprises:

Determining all paths from the source node to the destination node;

Determining, according to an initial weight set in advance for each node link of the plurality of node links in the network topology, a sum of weights of the node links through which each of the paths passes, and corresponding to the sum of the weights The path is the first shortest path.
The method of claim 3, wherein the determining a second shortest path from the source node to the destination node according to a network topology after disabling the first shortest path comprises:

Modifying each of the plurality of node links in the network topology according to an initial weight set in advance for each of the plurality of node links in the network topology, and a shortest path distance from the source node to each node The weight of the link of the node;

Determining all paths from the source node to the destination node in a network topology after disabling the first shortest path;

Determining, according to the weight of each of the plurality of node links in the modified plurality of node links, a sum of weights of the node links through which each of the paths passes, and using a path corresponding to the sum of the weights as a minimum value The second shortest path.
The method of claim 1, wherein the establishing a working route of the source node and the destination node according to one of the paths, establishing a protection route of the source node and the destination node according to another path, including :

Determining, according to an initial weight set in advance for each node link of the plurality of node links in the network topology, a sum of weights of the node links through which the one path passes, and determining that the other path passes The sum of the weights of the node links;

Establishing, according to the path corresponding to the sum of the smaller weights, the working route of the source node and the destination node, and establishing the protection of the source node and the destination node according to the path corresponding to the sum of the larger weights routing.
The method of any of claims 1 to 5, wherein the determining the shortest ring link comprising the source node and the destination node comprises:

The shortest ring link containing the source node and the destination node is determined using the preset Dijkstra algorithm.
A route establishing device includes:

Determining a module, configured to: determine, in a network topology, a shortest ring link including a source node and a destination node; and, in the shortest ring link, determine two paths from the source node to the destination node ;

And establishing a module, configured to: establish a working route of the source node and the destination node according to one path, and establish a protection route of the source node and the destination node according to another path.
The apparatus of claim 7 wherein said determining module is configured to:

Determining a first shortest path from the source node to the destination node;

Disabling the first shortest path in the network topology;

Determining a second shortest path from the source node to the destination node according to a network topology after the first shortest path is disabled;

Deleting the first shortest path and the first shortest path and the second shortest path The node links through which the second shortest path passes together form a shortest ring link.
The apparatus of claim 8 wherein said determining module is further configured to:

Determining all paths from the source node to the destination node;

Determining, according to an initial weight set in advance for each node link of the plurality of node links in the network topology, a sum of weights of the node links through which each of the paths passes, and corresponding to the sum of the weights The path is the first shortest path.
The apparatus of claim 9, the determining module further configured to:

Modifying each of the plurality of node links in the network topology according to an initial weight set in advance for each of the plurality of node links in the network topology, and a shortest path distance from the source node to each node The weight of the link of the node;

Determining all paths from the source node to the destination node in a network topology after disabling the first shortest path;

Determining, according to the weight of each of the plurality of node links in the modified plurality of node links, a sum of weights of the node links through which each of the paths passes, and using a path corresponding to the sum of the weights as a minimum value The second shortest path.
The apparatus of claim 7 wherein said establishing module is configured to:

Determining, according to an initial weight set in advance for each node link of the plurality of node links in the network topology, a sum of weights of the node links through which the one path passes, and determining that the other path passes The sum of the weights of the node links;

Establishing, according to the path corresponding to the sum of the smaller weights, the working route of the source node and the destination node, and establishing the protection of the source node and the destination node according to the path corresponding to the sum of the larger weights routing.
The apparatus according to any one of claims 7 to 11, wherein the determining module is configured to determine a shortest ring link including a source node and a destination node by using a preset Dijkstra algorithm.
A computer readable storage medium storing computer executable instructions that, when executed, implement the route establishment method of any one of claims 1 to 6.