An OTN network mutex group service route calculation method and device and a storage medium

Abstract

The application relates to the technical field of path calculation, and provides an OTN network mutual exclusion group service route calculation method, device and storage medium. The method comprises the following steps: calculating a first temporary route from a source node to a destination node and with a constraint target optimal; deleting each link occupied by the first temporary route in the network, setting constraint weights of each link corresponding to the first temporary route in the reverse direction to corresponding opposite values, and obtaining a first network directed graph; according to the first network directed graph, calculating a second temporary route from the source node to the destination node and with the constraint target optimal; and determining a first route and a second route of the mutual exclusion group service according to the first temporary route and the second temporary route. The application can calculate a certain solution of the network mutual exclusion group service route under the condition that there is a reachable path, and can obtain the optimal solution of the mutual exclusion group service route without repeated exclusion calculation, so that the calculation efficiency is greatly improved.

Description

Technical field

[0001] The present invention relates to the field of path calculation technology, and in particular to an OTN network mutually exclusive group service routing calculation method, device and storage medium. [Background Technology]

[0002] In backbone optical network construction, due to the impact of access layer protection and service characteristics (for example, IP and optical segmentation protection, multiple fault protection for key services), different services are constrained from traversing the same path. Service routing algorithms typically convert constraints into weights to calculate the shortest path. However, due to resource constraints, simple weight conversion cannot be used to constrain the shortest path. Traditional algorithms typically use the exclusion method to perform multiple KSP (K-shortest paths) shortest path algorithm calculations. This method cannot find the optimal solution for mutually exclusive service paths in some scenarios. Moreover, the more paths there are, the more computational effort increases, ultimately leading to low computational efficiency.

[0003] In view of this, overcoming the defects of the prior art is an urgent problem to be solved in this technical field. [Summary of the invention]

[0004] The technical problem to be solved by the present invention is that when calculating multiple routes of mutually exclusive group services, the optimal solution of the mutually exclusive group service path may not be obtained, and the more paths there are, the more calculation amount will increase sharply, which will eventually lead to low calculation efficiency.

[0005] The present invention adopts the following technical solutions:

[0006] In a first aspect, the present invention provides a method for calculating mutually exclusive group service routes in an OTN network, comprising:

[0007] Calculate a first temporary route from the source node to the destination node with an optimal constraint target;

[0008] Deleting each link occupied by the first temporary route in the network, and setting the constraint weights of each link constituting the first temporary route in the reverse direction to corresponding opposite values, to obtain a first network directed graph;

[0009] A second temporary route from the source node to the destination node with an optimal constraint target is calculated according to the first network directed graph, thereby determining a first route and a second route for mutually exclusive group services according to the first temporary route and the second temporary route.

[0010] Preferably, determining the first route and the second route of the mutually exclusive group service according to the first temporary route and the second temporary route includes:

[0011] When there are mutually reverse links in the first temporary route and the second temporary route, construct a second network directed graph based on the links in the first temporary route and the second temporary route, and remove the mutually reverse links when constructing the second network directed graph;

[0012] The first route and the second route of the mutually exclusive group service are calculated based on the second network directed graph obtained after removing the links in opposite directions.

[0013] Preferably, determining the first route and the second route of the mutually exclusive group service according to the first temporary route and the second temporary route includes:

[0014] When there are no reverse links between the first temporary route and the second temporary route, the first temporary route and the second temporary route are used as the first route and the second route respectively.

[0015] Preferably, the calculating of a first temporary route from the source node to the destination node with an optimal constraint target specifically includes:

[0016] According to the bidirectional graph of the network, find all possible routing paths from the source node to the destination node;

[0017] According to the constraint weights corresponding to the links in the network bidirectional graph, the total constraint weights of the links occupied in the possible routing paths are calculated, and a possible routing path with the best total constraint weight is selected from all possible routing paths as the first temporary route.

[0018] Preferably, the topological resources of the network include at least OADM sites, direct links between adjacent OADM sites, a loss value of each direct link, and a length of each direct link.

[0019] Preferably, before calculating the first temporary route from the source node to the destination node with the optimal constraint target, the method further includes constructing a network bidirectional graph based on the topological resources of the network, specifically:

[0020] With each OADM site as a vertex, a pair of reverse links are established between the vertices corresponding to adjacent OADM sites with direct links.

[0021] According to the loss value and length of the direct link, the constraint weight of the corresponding link is determined, thereby constructing a bidirectional network graph; wherein, links in opposite directions have the same constraint weight.

[0022] Preferably, the mutually exclusive group services are obtained from a mutually exclusive group service matrix, and the mutually exclusive group service matrix includes a source node and a sink node of each service in the mutually exclusive group.

[0023] Preferably, when any one route of the mutually exclusive group service fails, the first route and the second route of the mutually exclusive group service are recalculated.

[0024] In a second aspect, the present invention further provides an OTN network mutually exclusive group service route calculation device, which is used to implement the OTN network mutually exclusive group service route calculation method described in the first aspect, and the device includes:

[0025] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor to execute the OTN network mutually exclusive group service routing calculation method described in the first aspect.

[0026] In a third aspect, the present invention further provides a non-volatile computer storage medium storing computer executable instructions, which are executed by one or more processors to complete the OTN network mutually exclusive group service routing calculation method described in the first aspect.

[0027] The present invention proposes a method for finding mutually exclusive group service solutions, ensuring that network mutually exclusive group service routing calculations can consistently yield a guaranteed solution if a reachable path exists. While ensuring the completion of network mutually exclusive service calculations when resources are available, the present invention also ensures that the total path of the mutually exclusive group service routing is the shortest. The method achieves the optimal mutually exclusive group service routing solution by reconstructing a directed graph and offsetting constraint weights, eliminating the need for repeated exclusion calculations and significantly improving computational efficiency.

Brief Description of the Drawings

[0028] To more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention. Those skilled in the art can also derive other drawings based on these drawings without inventive effort.

[0029] Figure 1 This is a flow chart of a method for calculating mutually exclusive group service routes in an OTN network provided by an embodiment of the present invention;

[0030] Figure 2 This is a network topology diagram of an implementation method provided by an embodiment of the present invention;

[0031] Figure 3 This is a bidirectional network diagram of an implementation method provided by an embodiment of the present invention;

[0032] Figure 4 is a first network directed graph of an implementation manner provided by an embodiment of the present invention;

[0033] Figure 5 is a first network directed graph of an implementation manner provided by an embodiment of the present invention;

[0034] Figure 6 This is a flow chart of a method for calculating mutually exclusive group service routes in an OTN network provided by an embodiment of the present invention;

[0035] Figure 7 is a second network directed graph of an implementation manner provided by an embodiment of the present invention;

[0036] Figure 8 It is a network topology diagram in the mutually exclusive group service routing calculation method in the prior art provided by an embodiment of the present invention;

[0037] Figure 9 This is a network topology diagram of another implementation method provided by an embodiment of the present invention;

[0038] Figure 10 This is a bidirectional network graph of another embodiment provided by an embodiment of the present invention;

[0039] Figure 11 is a first network directed graph of another implementation manner provided by an embodiment of the present invention;

[0040] Figure 12 is a second network directed graph according to another embodiment of the present invention;

[0041] Figure 13 is a first network directed graph in another case provided by an embodiment of the present invention;

[0042] Figure 14 is a directed graph of mutually exclusive group service routes calculated in another case provided by an embodiment of the present invention;

[0043] Figure 15 FIG. 1 is a schematic diagram of the architecture of an OTN network mutually exclusive group service routing calculation device according to an embodiment of the present invention. [Specific implementation method]

[0044] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0045] In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0046] This invention is applicable to the optical network portion of a network that provides mixed protection for multiple services, such as those involving IP and optical networks. Network mutual exclusion algorithms are widely used in the field of transport network routing algorithms, typically in scenarios such as service route planning during the initial phase of network construction, capacity expansion routing planning during network operation and maintenance, and service route switching after network failures.

[0047] In network planning scenarios, users provide the algorithm module with the network physical and logical resources to be calculated, along with the associated service matrix. The routing algorithm then outputs the corresponding routing results and allocates resources. In automatic network switching scenarios, when a fiber failure is detected and routing recalculation is required, the control software inputs the service matrix to be recalculated into the algorithm module. The algorithm then outputs the newly available routes and allocates resources.

[0048] This paper mainly introduces a method based on the existing KSP algorithm, which realizes the calculation of non-intersecting paths with the primary goal of completing the calculation and the shortest secondary goal by adjusting the constraint weights during the calculation process (for example, the weight is negated, assuming the original weight is 10, it will be -10 after modification). When resources are sufficient, the path calculation of mutually exclusive group services is guaranteed to be completed and the total length is the shortest. The specific implementation scheme is described in detail below.

[0049] Embodiment 1:

[0050] The prior art does not necessarily obtain the optimal solution for mutually exclusive group service paths when calculating multiple routes for mutually exclusive group services. Moreover, the more paths there are, the more computational effort will increase dramatically, ultimately leading to low computational efficiency. To solve this problem, embodiment 1 of the present invention provides a method for calculating mutually exclusive group service routes in an OTN network. Figure 1 As shown, including:

[0051] In step 201, a network bidirectional graph is constructed based on network topology resources.

[0052] As an optional implementation, the topology resources of the network include at least OADM sites, direct links between adjacent OADM sites, a loss value of each direct link, and a length of each direct link.

[0053] In practice, routing calculations for mutually exclusive group services typically have a primary objective and one or more secondary objectives. The primary objective is successfully achieving mutually exclusive service results; secondary objectives include minimizing the total path length. This invention primarily describes a method for solving the path planning problem for mutually exclusive group services in an optical network while ensuring the secondary objectives are met.

[0054] In order to model the problem, we need to abstract the problem to a certain extent and use a graph model to describe the optical network path planning problem. First, we regard the OADM (Optical Add-Drop Multiplexer) site as the vertex of the graph, and the optical fiber link between adjacent OADM stations (which may include OA stations, referred to as "links") as the link in the graph. Here we use a bidirectional directed graph model, that is, two forward and reverse links are used to represent the direct link between adjacent OADMs. The link contains available wavelength space, and the forward and reverse links share the same wavelength space. That is, according to the network topology resources, a network bidirectional graph is constructed, which specifically includes:

[0055] The actual topology map is obtained based on the network's topology resources. Each OADM site in the actual topology map is used as a vertex. A pair of mutually reverse links is established between the vertices corresponding to adjacent OADM sites with direct links. The aforementioned direct links refer to links existing in the actual topology map. A pair of mutually reverse links can be understood as two virtual links formed by assigning forward and reverse directions to the direct link.

[0056] Each link corresponds to a constraint weight, and a method for calculating the constraint weight is obtained by those skilled in the art based on demand analysis of mutually exclusive group service routing.

[0057] For example, when mutually exclusive group service routing requires the minimum total link loss and the shortest total link length, the constraint weights of the corresponding links can be determined based on the direct link loss and length, thereby constructing a bidirectional network graph. In this case, links in opposite directions have the same constraint weights.

[0058] For example, if there is a network topology (actual topology diagram) such as Figure 2 As shown, there are 9 OADM sites, namely A, B, C, D, E, F, G, H, and D. Among them, there are direct links between AE, EF, FC, AB, BC, CD, BG, GH, and HD, forming the following Figure 3 The network bidirectional diagram shown in the figure takes the direct link between two OADMs AB as an example, which forms a pair of reverse links A->B and B->A. Both links have A and B as vertices, but in opposite directions. Figure 3 In the example, the constraint weight of each link is 1, and since the links in opposite directions have the same constraint weight, Figure 3 A single value is used to identify the constraint weight of two links.

[0059] Because the service paths for services within mutually exclusive groups must not overlap, after abstracting the bidirectional network graph, the routing of mutually exclusive services is abstracted to finding multiple paths between source and destination nodes on the bidirectional network graph. The service paths or subpaths for services within mutually exclusive groups must not overlap. When adding relays, a complete source-to-destination path is divided into multiple subpaths. These subpaths must also meet this requirement.

[0060] In step 202, a first temporary route from the source node to the sink node with an optimal constraint target is calculated.

[0061] In this embodiment, the first temporary route is calculated based on the network bidirectional graph. In actual use, it is also feasible to directly calculate the first temporary route based on the network topology. The constraint target is determined by those skilled in the art based on the requirements analysis of mutually exclusive group service routing. For example, the optimal constraint target can be one or more of the following conditions: shortest path length, minimum link loss, etc.

[0062] In step 203, the links occupied by the first temporary route in the network are deleted, and the constraint weights of the links constituting the first temporary route in the reverse direction are set to corresponding opposite values ​​(that is, the constraint weights of the reverse links corresponding to the links occupied by the first temporary route are set to corresponding opposite values), thereby obtaining a first network directed graph.

[0063] Deleting the links occupied by the first temporary route in the network does not mean that the corresponding links in the network are disconnected, but for the mutually exclusive group service route calculation method, the links occupied by the first temporary route cannot be used in the network bidirectional graph. When the network bidirectional graph is used to calculate the first temporary route, deleting the links occupied by the first temporary route in the network refers to deleting the links occupied by the first temporary route in the network bidirectional graph.

[0064] For example, for Figure 2 In the actual topology shown, there are two mutually exclusive groups of services AD and AD. Figure 3 For example, if the first temporary route is calculated to be A->B->C->D, then after deleting the links occupied by the first temporary route in the network (i.e., A->B, B->C, and C->D), the resulting network directed graph is as follows: Figure 4 Then, in Figure 4Based on the network directed graph shown, the constraint weights of the links constituting the first temporary route in the reverse direction are set to the corresponding opposite values ​​(that is, the constraint weight of B->A is set to the opposite value of A->B, the constraint weight of C->B is set to the opposite value of B->C, and the constraint weight of D->C is set to the opposite value of C->D). Since the constraint weights of the three forward links A->B, B->C, and C->D are all 1, the new constraint weight values ​​of B->A, C->B, and D->C are all -1. The first network directed graph finally constructed is as follows: Figure 5 shown.

[0065] according to Figure 5 The constraint weights of the links shown are directly involved in the subsequent constraint calculations, and the constraint weights can be offset by opposite values.

[0066] In step 204, a second temporary route from the source node to the destination node with an optimal constraint target is calculated based on the first network directed graph, thereby determining a first route and a second route for mutually exclusive group services based on the first temporary route and the second temporary route.

[0067] The mutually exclusive group services are obtained from a mutually exclusive group service matrix, and the mutually exclusive group service matrix includes a source node and a sink node of each service in the mutually exclusive group.

[0068] In an optional embodiment, when there are mutually reverse links in the first temporary route and the second temporary route, the first route and the second route of the mutually exclusive group service are determined according to the first temporary route and the second temporary route, such as Figure 6 As shown, specifically including:

[0069] In step 301, a second network directed graph is constructed based on each link in the first temporary route and the second temporary route, and when constructing the second network directed graph, links that are in opposite directions to each other are removed.

[0070] In step 302, a first route and a second route of mutually exclusive group services are calculated based on the second network directed graph obtained after removing the reverse links.

[0071] by Figure 4 or Figure 5 For example, if the second temporary route is calculated to be A->E->F->C->B->G->H->D, Figure 3 The network bidirectional graph shown in the figure calculates the first temporary route as A->B->C->D, where the link C->B in the second temporary route is the reverse of the link B->C in the first temporary route. The second network directed graph is constructed as follows: Figure 7As shown, there are 8 links including A->B, C->D, A->E, E->F, F->C, B->G, G->H and H->D. The two routes calculated according to the second network directed graph are A->B->G->H->D and A->E->F->C->D respectively.

[0072] Since there are mutually reverse links in the first temporary route and the second temporary route, in step 203, when constructing the first network directed graph, by setting the constraint weights of the reverse links of each link corresponding to the first temporary route to opposite values, when calculating the second temporary route in step 204, the constraint weights of the mutually reverse links in the first temporary route and the second temporary route are offset against each other, so that the links in the first temporary route and the second temporary route finally obtained are the links used when the mutually exclusive group service needs to achieve the optimal solution of the constraint. The goal of step 205 is to assign the used links to the first route and the second route to form non-overlapping service routes. In this embodiment, this is achieved by constructing the second network directed graph using the links in the first temporary route and the second temporary route, and recalculating the routes.

[0073] In another optional embodiment, when there are no reverse links between the first temporary route and the second temporary route, the first temporary route and the second temporary route are used as the first route and the second route respectively, that is, the first temporary route is used as the first route and the second temporary route is used as the second route, or the first temporary route is used as the second route and the first temporary route is used as the second route.

[0074] There is another optional implementation method here, that is, when there are mutually reverse links in the first temporary route and the second temporary route, the first route and the second route of the mutually exclusive group service obtained by re-routing according to the second network directed graph can also be obtained by interactively splicing the links in the first temporary route and the second temporary route.

[0075] Here still Figure 2For example, if the calculated first temporary route is A->B->C->D, and the calculated second temporary route is A->E->F->C->B->G->H->D, where the link B->C in the first temporary route and the link C->B in the second temporary route are in opposite directions, then the first temporary route is divided into two parts, A->B and C->D, with B->C as the boundary. The second temporary route is divided into two parts, A->E->F->C and B->G->H->D, with C->B as the boundary. Link A->B on the side of the first temporary route close to source node A and link B->G->H->D on the side of the second temporary route close to sink node D are concatenated to obtain the first route A->B->G->H->D. Link A->E->F->C on the side of the second temporary route close to source node A and link C->D on the side of the first temporary route close to sink node D are concatenated to obtain the second route A->E->F->C->D. In this way, a route with two non-overlapping sub-links is obtained.

[0076] In the prior art, if a bidirectional network diagram is not set, when calculating the route of the mutually exclusive group service of the OTN network, after obtaining the first optimal route, such as Figure 8 As shown in the figure, suppose we need to find the shortest mutually exclusive service path from A to D. Using existing techniques, after finding the first route A->B->C->D and excluding the corresponding links AB, BC, and CD, we cannot find a second path from A to D. If we want to obtain routes for two mutually exclusive service groups, the number of KSP shortest path calculations must be greater than two.

[0077] However, after adopting this solution, since the link is set to be bidirectional, that is, the link between the sites is virtualized into two, if a link is occupied by the first route, there is still a reverse link participating in the route calculation. Then, in the pathfinding process of the second route, it is possible to pass through the mutually opposite links (converted from the same link). After obtaining two routes that occupy each other's reverse links, the links used by these two routes are used as the basis to find the routes of two mutually exclusive group services that do not intersect with each other. In this way, the mutually exclusive group service routes are obtained with only two KSP shortest path calculations, which can improve the efficiency of route calculation, especially improve the efficiency of calculating mutually exclusive group service routes in large and complex topology networks.

[0078] It should be noted here that the routing described in this embodiment can be understood as an abstract concept. In the corresponding network directed graph, it is manifested as a path composed of one or more links. In the actual network, it is manifested as a path composed of one or more links. In different contexts, different descriptions may be used for the objects it contains. This is understandable to those skilled in the art and should not be regarded as an unclear determination of the technical disclosure.

[0079] This embodiment proposes a method for finding mutually exclusive group service solutions, ensuring that network mutually exclusive group service routing calculations can consistently yield a guaranteed solution if a reachable path exists. This method ensures that network mutually exclusive group service routing calculations are completed while ensuring the shortest total path for the mutually exclusive group service routing is calculated, given the availability of resources. This method achieves the optimal mutually exclusive group service routing solution by reconstructing a directed graph and offsetting constraint weights, eliminating the need for repeated exclusion calculations and significantly improving computational efficiency.

[0080] In this embodiment, calculating the first temporary route from the source node to the destination node with the optimal constraint target may include: finding all possible routing paths from the source node to the destination node based on a bidirectional network graph; calculating the total constraint weight of each link occupied in the possible routing paths based on the constraint weights corresponding to each link in the bidirectional network graph; and selecting a possible routing path with the optimal total constraint weight from all possible routing paths as the first temporary route. In actual application scenarios, determining the first temporary route may also be implemented using the KSP shortest path algorithm.

[0081] It should be noted here that the network bidirectional graph, the first network directed graph, and the second network directed graph are all abstract concepts used to express network topology characteristics. In actual use, the network bidirectional graph, the first network directed graph, and the second network directed graph can all be expressed as a collection of corresponding links.

[0082] The method described in the above embodiment is performed in a network planning scenario and a network automatic switching scenario. In the network planning scenario, the user provides the network physical resources and logical resources to be calculated, as well as the relevant routing matrix. According to the method described in this embodiment, the corresponding routing results are output, and resources are allocated according to the routing results.

[0083] In the automatic network switching scenario, when any route of a mutually exclusive group service fails, the first and second routes of the mutually exclusive group service are recalculated. That is, when a fiber failure is detected and it is determined that route recalculation is necessary, the system outputs new available routes and allocates resources based on the recalculated service matrix.

[0084] The "first", "second" and "third" in this embodiment do not have any special limiting meanings. They are used for description only to facilitate the description of different individuals in a category of objects. They should not be interpreted as order or other aspects with special limiting meanings.

[0085] Example 2:

[0086] The present invention is based on the method described in Example 1, combined with specific application scenarios, and uses technical descriptions in related scenarios to illustrate the implementation process of the present invention in characteristic scenarios.

[0087] This embodiment is based on Figure 9 Take the network topology shown in FIG2 as an example, where two mutually exclusive group service routes with source node A and sink node B are found. The primary goal is to ensure that the mutually exclusive group services are connected, and the secondary goal is to minimize the total link length of the mutually exclusive group services.

[0088] according to Figure 9 The network topology shown is constructed as follows Figure 10 The network bidirectional graph shown in FIG is shown, and the weights of each link in the directed graph are set according to the original link length (which can be understood as the constraint weights described in Example 1), where the weights of AC, CD, and DE are 1, the weight of BE is 2, the weight of AD is 3, the weights of DB and BC are 5, and the weight of AE is 10; where AC and similar descriptions all refer to the corresponding two reverse links. For example, if the weight of AC is 1, it means that the weights of links A->C and C->A are both 1. Figure 10 In the figure, since the links in opposite directions have the same weight, only a single value is used to identify the weights of the two links.

[0089] According to the bidirectional network graph, the KSP shortest path algorithm is used to calculate the shortest first temporary route A->C->D->E->B (with a total weight of 5).

[0090] Delete the links occupied by the first temporary route and set the weight of the corresponding reverse link to the opposite value of the original weight, so as to obtain Figure 11 In the first network directed graph shown, compared to the network bidirectional graph, the four links A->C, C->D, D->E, and E->B are deleted, and the weight of C->A is set to the opposite value of the weight of A->C, that is, updated from 1 to -1. Similarly, the weights of D->C and E->D are set to -1, and the weight of B->E is set to -2.

[0091] According to the first network directed graph, the KSP shortest path algorithm is used to calculate the second temporary route A->D->C->B with the shortest path (total weight is 7).

[0092] Comparing the first temporary route with the second temporary route, we can find that the link C->D occupied by the first temporary route and the link D->C occupied by the second temporary route are inversely proportional to each other. Therefore, when constructing the second network directed graph, after removing C->D from all the links occupied by the first temporary route, A->C, D->E and E->B remain. After removing D->C from all the links occupied by the second temporary route, A->D and C->B remain. The remaining links are used to construct the following directed graph: Figure 12 The second network is shown as a directed graph.

[0093] According to the directed graph of the first network, the two shortest routes calculated using the KSP shortest path algorithm are A->C->B (total weight is 6) and A->D->E->B (total weight is 6), which are the first route and the second route respectively. The total weight sum of the first route and the second route (which can be understood as the overall constraint of the first route and the second route) is calculated to be 12.

[0094] The calculated total weight sum of the first temporary route and the second temporary route (which can be understood as the overall constraint of the first temporary route and the second temporary route) is also 12. At the same time, each link of the first route and the second route is a link used in the first temporary route and the second temporary route. Therefore, the principle of this embodiment is:

[0095] First, two routes (i.e., the first temporary route and the second temporary route) that are equivalent to the mutually exclusive group service routes (the first route and the second route) in terms of overall constraints are obtained by reconstructing and calculating the network directed graph. The overall constraint equivalence is achieved by offsetting the constraint weights. If there is no path overlap between the two routes, they are directly used as the mutually exclusive group service routes. If there is path overlap, the paths used by the two routes are reallocated to obtain a mutually exclusive group service route with no path overlap and optimal constraints.

[0096] In order to show that the method described in this embodiment obtains the optimal mutually exclusive group service route, another case is assumed here. For example, when constructing the first network directed graph, the weight of the reverse link corresponding to the forward link of the first temporary route is not set to the opposite value of the original weight. Then, the following is constructed: Figure 13 The first network directed graph shown, according to Figure 13 For the first network directed graph shown in FIG, the second temporary route with the shortest path is calculated using the KSP shortest path algorithm as A->D->B (weight 8), which does not overlap with the first temporary route A->C->D->E->B (weight 5) and can be directly used as the first route and the second route. Figure 14As shown, the overall constraint calculated at this time is 8+5=13. Obviously, compared with this situation, the constraint of the method described in this embodiment is better, that is, the total path length of the mutually exclusive group service is shorter.

[0097] Example 3:

[0098] like Figure 15 FIG. 1 is a schematic diagram of the architecture of an OTN network mutually exclusive group service routing calculation device according to an embodiment of the present invention. The OTN network mutually exclusive group service routing calculation device according to this embodiment includes one or more processors 21 and a memory 22. Figure 15 A processor 21 is taken as an example.

[0099] The processor 21 and the memory 22 may be connected via a bus or other means. Figure 15 The bus connection is taken as an example.

[0100] The memory 22, as a nonvolatile computer-readable storage medium, can be used to store nonvolatile software programs and nonvolatile computer executable programs, such as the method for calculating mutually exclusive service routes in an OTN network in Example 1. The processor 21 executes the method for calculating mutually exclusive service routes in an OTN network by running the nonvolatile software programs and instructions stored in the memory 22.

[0101] The memory 22 may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state memory device. In some embodiments, the memory 22 may optionally include a memory remotely located relative to the processor 21, and such remote memory may be connected to the processor 21 via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0102] The program instructions / modules are stored in the memory 22 , and when executed by the one or more processors 21 , the OTN network mutually exclusive group service routing calculation method in the above-mentioned embodiment 1 is executed.

[0103] It is worth noting that the information interaction, execution process, etc. between the modules and units within the above-mentioned devices and systems are based on the same concept as the processing method embodiment of the present invention. The specific content can be found in the description of the method embodiment of the present invention and will not be repeated here.

[0104] Embodiment 4:

[0105] Based on the above-mentioned embodiments 1 to 3, this embodiment further provides a computer storage medium, which stores computer-executable instructions. The computer-executable instructions are executed by one or more processors to implement the OTN network mutually exclusive group service routing calculation method described in embodiment 1 or embodiment 2.

[0106] Those skilled in the art will understand that all or part of the steps in the various methods of the embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), a disk or an optical disk, etc.

[0107] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for calculating mutually exclusive group service routing in an OTN network, characterized in that: include: Calculate a first temporary route from the source node to the destination node with an optimal constraint target; Deleting each link occupied by the first temporary route in the network, and setting the constraint weights of each link constituting the first temporary route in the reverse direction to corresponding opposite values, to obtain a first network directed graph; Calculating, based on the first network directed graph, a second temporary route from the source node to the sink node with an optimal constraint target, thereby determining a first route and a second route for mutually exclusive group services based on the first temporary route and the second temporary route; The determining, according to the first temporary route and the second temporary route, the first route and the second route of the mutually exclusive group service includes: When there are mutually reverse links in the first temporary route and the second temporary route, construct a second network directed graph based on the links in the first temporary route and the second temporary route, and remove the mutually reverse links when constructing the second network directed graph; Calculating a first route and a second route for mutually exclusive group services according to a second network directed graph obtained after removing mutually reverse links; When there are no reverse links between the first temporary route and the second temporary route, the first temporary route and the second temporary route are used as the first route and the second route respectively; When there are mutually opposite links in the first temporary route and the second temporary route, the first route and the second route are obtained by interactively splicing the links in the first temporary route and the second temporary route. Specifically, with the mutually opposite links as the boundary, the links on the side of the first temporary route close to the source node are spliced ​​with the links on the side of the second temporary route close to the destination node to obtain the first route, and the links on the side of the second temporary route close to the source node are spliced ​​with the links on the side of the first temporary route close to the destination node to obtain the second route.

2. The OTN network mutually exclusive group service routing calculation method according to claim 1, characterized in that: The calculating of a first temporary route from the source node to the destination node with an optimal constraint target specifically includes: According to the bidirectional graph of the network, find all possible routing paths from the source node to the destination node; According to the constraint weights corresponding to the links in the network bidirectional graph, the total constraint weights of the links occupied in the possible routing paths are calculated, and a possible routing path with the best total constraint weight is selected from all possible routing paths as the first temporary route.

3. The OTN network mutually exclusive group service routing calculation method according to any one of claims 1-2, characterized in that: The topological resources of the network include at least OADM sites, direct links between adjacent OADM sites, a loss value of each direct link, and a length of each direct link.

4. The OTN network mutually exclusive group service routing calculation method according to claim 3, characterized in that: Before calculating the first temporary route from the source node to the destination node with the optimal constraint target, the method further includes constructing a network bidirectional graph based on the topological resources of the network, specifically: With each OADM site as a vertex, a pair of reverse links are established between the vertices corresponding to adjacent OADM sites with direct links. According to the loss value and length of the direct link, the constraint weight of the corresponding link is determined, thereby constructing a bidirectional network graph; wherein, links in opposite directions have the same constraint weight.

5. The OTN network mutually exclusive group service routing calculation method according to any one of claims 1-2, characterized in that: The mutually exclusive group services are obtained from a mutually exclusive group service matrix, and the mutually exclusive group service matrix includes a source node and a sink node of each service in the mutually exclusive group.

6. The OTN network mutually exclusive group service routing calculation method according to any one of claims 1-2, characterized in that: When any one of the routes of the mutually exclusive group service fails, the first route and the second route of the mutually exclusive group service are recalculated.

7. An OTN network mutually exclusive group service routing calculation device, characterized in that: include: at least one processor; And, a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor to execute the OTN network mutually exclusive group service routing calculation method according to any one of claims 1-6.

8. A computer storage medium, characterized in that The computer storage medium stores computer-executable instructions, which are executed by one or more processors to implement the OTN network mutually exclusive group service routing calculation method according to any one of claims 1 to 6.

Images