WO2023078150A1

WO2023078150A1 - Path calculation method, route calculation device, electronic device, and computer storage medium

Info

Publication number: WO2023078150A1
Application number: PCT/CN2022/127910
Authority: WO
Inventors: 高勇; 陆钱春; 齐进; 严峰
Original assignee: 中兴通讯股份有限公司
Priority date: 2021-11-04
Filing date: 2022-10-27
Publication date: 2023-05-11
Also published as: CN116074204A

Abstract

The present disclosure provides a path calculation method, a route calculation device, an electronic device, and a computer storage medium. The path calculation method comprises: determining a target path corresponding to a path calculation request, on the basis of network topology information and path configuration information corresponding to the path calculation request; updating the network topology information by means of performing preset processing on the network topology information on the basis of the determined target path; determining whether the determined target path meets a target condition, repeating the step of determining a target path corresponding to a path calculation request and the step of updating the network topology information until the determined target path meets the target condition, and determining all different target paths corresponding to the path calculation request.

Description

Route calculation method, route calculation device, electronic device and computer storage medium

Cross References to Related Applications

This patent application claims priority to Chinese Patent Application 202111300379.4, filed with the State Intellectual Property Office of China on November 4, 2021, the disclosure of which is incorporated herein by reference in its entirety.

technical field

The present disclosure relates to the field of communication technologies.

Background technique

Segment Routing Policy (SR Policy), a new generation of Segment Routing Traffic Engineering (SR-TE), is a newly designed system architecture. SR Policy is identified by (head end, color, endpoint) triplet. Under the premise of a given head-end node, SR Policy is identified by a (color, endpoint) two-tuple.

When the SR Policy service is opened on a large-scale network, it is necessary to load balance the SR Policy traffic through multiple segment lists (Segment List, SL). At the same time, in order to prevent the damage of the main path from affecting the service, multiple sets of candidate paths (Candidate Path, Cpath) are required for backup, and each candidate path can have one or more SLs. In order to minimize the impact of path damage on services, it is often necessary to separate load-balanced links as much as possible.

Contents of the invention

The present disclosure aims at the above-mentioned deficiencies in the prior art, and provides a route calculation method, a route calculation device, an electronic device, and a computer storage medium.

An embodiment of the present disclosure provides a path calculation method, which includes: determining a target path corresponding to the path calculation request based on network topology information and path configuration information corresponding to the path calculation request; The information is pre-processed to update the network topology information; judge whether the determined target path meets the target condition, and repeat the steps of determining a target path corresponding to the path calculation request and updating the network topology until the determined target path meets the target condition , and determine all the different target paths corresponding to the path calculation request.

An embodiment of the present disclosure provides a routing computing device, which includes: a computing module configured to determine a target path corresponding to the path computing request based on network topology information and path configuration information corresponding to the path computing request; The processing module is configured to update the network topology information by performing preset processing on the network topology information based on the determined target path; the decision module is configured to judge whether the determined target path satisfies the target condition, so that the calculation module repeatedly determines and The operation of one target path corresponding to the path calculation request and the operation of causing the processing module to repeatedly update the network topology information until the determined target path satisfies the target condition, and determine all the different target paths corresponding to the path calculation request.

An embodiment of the present disclosure provides an electronic device, including: one or more processors; and a memory on which one or more programs are stored; when the one or more programs are executed by the one or more processors When , one or more processors are made to implement the above path calculation method.

An embodiment of the present disclosure provides a computer storage medium on which a computer program is stored, wherein any path calculation method in the embodiments of the present disclosure is implemented when the program is executed.

Description of drawings

Fig. 1 is a schematic structural diagram of an SR Policy according to an embodiment of the present disclosure;

FIG. 2 is a flowchart of a path calculation method according to an embodiment of the present disclosure;

3 is a flowchart of a method for updating network topology information according to an embodiment of the present disclosure;

Fig. 4a is a schematic diagram of network topology information according to an embodiment of the present disclosure;

Fig. 4b is a schematic diagram of network topology information according to an embodiment of the present disclosure;

5 is a flowchart of a path calculation method according to an embodiment of the present disclosure;

FIG. 6 is a flowchart of a path calculation method according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of network topology information according to an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of network topology information according to an embodiment of the present disclosure;

FIG. 9 is a schematic structural diagram of a route computing device according to an embodiment of the present disclosure;

FIG. 10 is a schematic structural diagram of a system for managing and controlling products according to an embodiment of the present disclosure;

FIG. 11 is a compositional block diagram of an electronic device according to an embodiment of the present disclosure.

Detailed ways

Example embodiments will be described more fully hereinafter with reference to the accompanying drawings, but may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

The terminology used herein is for describing particular embodiments only and is not intended to limit the present disclosure. As used herein, the singular forms "a" and "the" are intended to include the plural forms as well, unless the context clearly dictates otherwise. It will also be understood that when the terms "comprising" and/or "consisting of" are used in this specification, the stated features, integers, steps, operations, elements and/or components are specified to be present but not excluded to be present or Add one or more other features, integers, steps, operations, elements, components and/or groups thereof.

Embodiments described herein may be described with reference to plan views and/or cross-sectional views by way of idealized schematic illustrations of the present disclosure. Accordingly, the example illustrations may be modified according to manufacturing techniques and/or tolerances. Therefore, the embodiments are not limited to the ones shown in the drawings but include modifications of configurations formed based on manufacturing processes. Accordingly, the regions illustrated in the figures have schematic properties, and the shapes of the regions shown in the figures illustrate the specific shapes of the regions of the elements, but are not intended to be limiting.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having meanings consistent with their meanings in the context of the relevant art and the present disclosure, and will not be interpreted as having idealized or excessive formal meanings, Unless expressly so limited herein.

In recent years, software-defined network (Software Define Network, SDN) technology has received extensive attention. The SDN controller has the characteristics of separating forwarding and control. Through the SDN controller, functions such as network topology collection, path calculation, flow table generation and distribution can be realized. Among them, Path Computation Element (PCE) is an important module in the SDN controller.

FIG. 1 is a schematic structural diagram of an SR Policy according to an embodiment of the present disclosure. As shown in Figure 1, an SR Policy's candidate paths represent specific ways to deliver traffic from the SR Policy's headend to its endpoints. Each candidate path (Candidate Path, Cpath) corresponds to a preference value (Preference). The higher the preference value of the candidate path is, the better the candidate path is. Among them, the candidate path with the highest preference value is the active candidate path.

When the SR Policy service is opened on a large-scale network, it is necessary to load balance the SR Policy traffic through multiple segment lists (Segment List, SL). Usually, one SR Policy can be configured with up to 16 SLs for traffic load sharing. At the same time, in order to prevent path damage from affecting services, multiple sets of candidate paths are required for backup. For example, the candidate paths of the SR Policy in Figure 1 include Cpath1 to CpathN, and their corresponding preference values are p1 to pN, where the preference value p1> px, x∈[2,N], that is, the candidate path Cpath1 is the active candidate path.

Each candidate path can have one or more SLs. For example, Cpath1 in FIG. 1 has m SLs (S11, S12...S1m), Cpath2 has m SLs (S21, S22...S2m), and CpathN has k SLs (SN1, SN2...SNk). In order to minimize the impact on services caused by path damage, it is often necessary to separate the load-balanced paths (SL) as much as possible. "As much as possible" means: when selecting SL, if there is a path that is completely disjoint with the selected SL, then determine the path that is completely disjoint with the selected SL as the next SL; To a path completely disjoint with the selected SL, find the path with the least number of intersections with the selected SL as the next SL. Separate the load balancing paths as much as possible so that if any SL is damaged, all SLs will not fail to work. However, using the current mainstream link separation algorithm, an SR Policy service often needs to be serially and repeatedly calculated, resulting in a complicated process to achieve the effect of separation as much as possible, and the path calculation takes a long time, which cannot meet the current large-scale network scale and ultra-large network scale. The following performance requirements for batch business creation and recovery.

In order to solve the above problems, an embodiment of the present disclosure provides a route calculation method, which is applied to a route calculation device.

Fig. 2 is a flowchart of a path calculation method according to an embodiment of the present disclosure. As shown in FIG. 2, the method includes: step S201 to step S203.

In step S201, a target path corresponding to the path calculation request is determined based on network topology information and path configuration information corresponding to the path calculation request.

Network topology information includes network node information, link information, routing costs corresponding to each link, and available resource information for each link. In this embodiment, a link refers to a path between any node and an adjacent node in the network topology. The link information may be a unique identifier of the link. The routing cost corresponding to the link is an index used to evaluate the quality of the link. For example, in the case where the routing cost is only related to the delay, the greater the delay of the link, the corresponding route of the link The greater the price. The available resource information of the link includes bandwidth information of the link and the like.

The path configuration information corresponding to the path calculation request includes information of the source node and information of the destination node. The information of the source node may include information such as the identifier and address of the source node, and the information of the destination node may include information such as the identifier and address of the destination node. The destination path is the path with the least routing cost from the source node to the destination node in the network topology information.

A path calculation request is a request for calculating a candidate path from a source node to a destination node. The path calculation request includes path configuration information of a corresponding candidate path, and the path configuration information of the candidate path is a performance parameter that the candidate path needs to have. The path configuration information of the candidate path includes the information of the source node, the information of the destination node, the number of corresponding segment lists, the preset bandwidth, and path calculation constraint information.

The candidate path includes at least one section list, and a target path determined in step S201 can be used as a section list of the candidate path. The preset bandwidth is the minimum bandwidth that a candidate path needs to have. It should be noted that the multiple segment lists of the candidate path are used for load sharing. For example, when the preset bandwidth is 50Mpbs, the total bandwidth corresponding to the multiple segment lists included in the candidate path needs to be no less than 50Mpbs. The path calculation constraint is a special path requirement that needs to be met when calculating the path, for example, at least one of delay, hop count, bandwidth utilization and routing cost.

In step S202, the network topology information is updated by performing preset processing on the network topology information based on the determined target path.

The preset processing is to update the network topology information by modifying and/or clearing the path information of the target path in the network topology information, so that when determining the next target path, if there are other optional target paths , to effectively prevent the previously determined target path from being selected again, so that in the step of determining a target path corresponding to the path calculation request based on the updated network topology information and the path configuration information corresponding to the path calculation request, it can be Effectively filter out the paths that are completely disjoint with all the previously determined target paths, or effectively filter out the paths with the least intersecting times with all the previously determined target paths, and then realize all paths from the source node to the destination node Separate as much as possible.

In this embodiment, the path information of the target path includes, but is not limited to: the routing cost of each link of the target path, the parent-child relationship of the nodes passed by the target path, and the parent-child relationship of the child nodes corresponding to the passed nodes.

In one embodiment, in the case that paths that are completely disjoint with all previously determined target paths and paths that are not completely intersected with all previously determined target paths have been screened out, again based on the network topology information and the algorithm The target path determined by the path configuration information corresponding to the path request will be the same path as any previously determined target path.

Therefore, in order to realize the above-mentioned "separation as much as possible", after each determination of a target path, it is necessary to judge the target condition. The target condition includes: the determined target path is the same as the previously determined target path, or all the determined target paths are different from each other and the accumulated quantity of all the determined target paths is a preset quantity.

In some embodiments, judging whether the determined target path satisfies the target condition includes: judging whether the determined target path is the same as the previously determined target path. The link IDs of the links are all the same.

If the determined target path is the same as any previously determined target path, it is determined that the determined target path satisfies the target condition.

In some embodiments, if the determined target route is different from the previously determined target route, it is further determined whether the accumulated quantity of all determined target paths is a preset quantity.

In the case that all determined target paths are different from each other, it is further judged whether the accumulated quantity of all determined target paths is a preset quantity. The preset number may be the corresponding segment list number in the path configuration information included in the path calculation request, that is, the preset number represents one of the requirements of the path configuration.

When the cumulative quantity of all determined target paths is the preset quantity, it is determined that the determined target path meets the target condition; when the cumulative quantity of all determined target paths is less than the preset quantity, it is determined that the determined The target path does not meet the target condition.

In step S203, it is judged whether the determined target route satisfies the target condition, and steps S201 and S202 are repeated until the determined target route meets the target condition, and all different target routes corresponding to the path calculation request are determined.

In some embodiments, the target condition includes: the determined target path is the same as the previously determined target path. In the case that the determined target path is the same as the previously determined target path, it means that the paths that are completely disjoint with all the previously determined target paths and the paths that are not completely intersected with all the previously determined target paths have been screened out, even if this At this time, the cumulative number of all determined target paths does not meet the path configuration requirements, and the new target path corresponding to the path calculation request cannot be determined. Therefore, in the case where the determined target route is the same as the previously determined target route, all different target routes corresponding to the path calculation request have been determined.

For example, the currently determined target path is the target path 5 , and the previously determined target paths are the target path 1 , the target path 2 , the target path 3 and the target path 4 . In the case that the target route 5 is the same as the target route 3 , all different target routes corresponding to the path calculation request are determined as the target route 1 , the target route 2 , the target route 3 and the target route 4 .

In some embodiments, the target condition includes: all determined target paths are different from each other and the cumulative number is a preset number. In the case where all the determined target paths are different from each other and the cumulative amount is a preset number, it means that paths that are completely disjoint from all previously determined target paths and paths that are not completely intersected from all previously determined target paths may not have all However, the accumulated quantity of all determined target paths has reached the requirement of the path configuration, and there is no need to acquire new target paths. Therefore, in the case that all determined target routes are different from each other and the cumulative number is a preset number, all different target routes corresponding to the path calculation request have also been determined.

For example, the currently determined target path is target path 5, the previously determined target paths are target path 1, target path 2, target path 3, and target path 4, and the preset number is five. Then, in the case that the target path 5 is different from the target paths 1-4, and the cumulative number (there are 5 target paths 1-5) is equal to the preset number, it is determined that all different target paths corresponding to the path calculation request are Goal paths 1-5.

In this embodiment, since each determination of the target path is based on different network topology information (that is, updated network topology information), and the updated network topology information is based on the determined target path pair network topology information Obtained after preset processing, therefore, compared with the link separation algorithm in the prior art, in this embodiment, not only can effectively avoid multiple repeated calculations in the process of determining all different target paths corresponding to the path calculation request , it can also reduce the complexity of path calculation and shorten the time-consuming path calculation, so as to speed up the separation of all paths from the source node to the destination node as much as possible.

In an SR Policy business scenario, the path calculation method provided in this embodiment can reduce the complexity of path calculation and shorten the time-consuming path calculation, so as to achieve the effect of accelerating the separation of paths as much as possible, and can meet the current large-scale network scale and performance requirements for batch business creation and recovery under ultra-large network scale.

An embodiment of the present disclosure provides a path calculation method. First, based on network topology information and path configuration information corresponding to the path calculation request, a target path corresponding to the path calculation request is determined, and then, based on the target path, the network topology information is Preset processing to update the network topology information, and determine whether the determined target path meets the target condition, and then repeat the above steps of determining a target path corresponding to the path calculation request, updating network information, and judging whether the determined target path meets the target condition , until the determined target path satisfies the target condition, and determine all the different target paths corresponding to the path calculation request, which can accelerate the separation of all paths from the source node to the destination node as much as possible.

In one embodiment, based on network topology information and path configuration information corresponding to the path calculation request, the step of determining a target path corresponding to the path calculation request (step S201) includes: based on the path configuration information and network topology information, using The target path calculation algorithm determines a target path corresponding to the path calculation request, and the target path is the path with the minimum routing cost corresponding to the source node to the destination node in the network topology information.

The target path calculation algorithm includes a two-way Dijkstra algorithm, a one-way Dijkstra algorithm, or an A* algorithm.

Fig. 3 is a flowchart of a method for updating network topology information according to an embodiment of the present disclosure. The method includes steps S2021 to S2022.

In step S2021, the routing cost of each link of the target path in the network topology information is increased by a preset value.

The preset value is at least twice the value corresponding to the largest routing cost among the routing costs of each link in the network topology information. For example, if the value corresponding to the largest routing cost among the routing costs of each link in the network topology information is 100, the preset value may be a positive integer multiple of 100, that is, 100, 200, 300, or 400. The preset value can be set according to a specific application scenario, and is not specifically limited here.

In this embodiment, after the routing cost of each link of the target path in the network topology information is increased by a preset value, the routing cost of each link of the target path is greater than each link of the original network topology information The largest routing cost among the routing costs.

In this embodiment, the target path selected each time is the path with the least routing cost corresponding to the source node to the destination node in the network topology information, so after the target path is selected, each link corresponding to the target path If the routing cost of the path is increased by the preset value, it can effectively prevent the target path from being selected again when the target path is selected next time, so as to achieve the effect of "separation as much as possible".

In step S2022, the parent-child relationship between the nodes passed by the target path in the network topology information and the child nodes corresponding to the passed nodes is pruned.

Pruning refers to clearing the parent-child relationship between the nodes passed by the target path and the child nodes corresponding to the passed nodes in the network topology information stored in the cache.

In this embodiment, since the target path is the path with the least routing cost corresponding to the source node to the destination node in the network topology information, the target path is currently known in the network topology information from the source node to the destination node the best path selection. If the path search is continued in the network topology information, it is impossible to find a better option than the known target path, so it is necessary to stop continuing the path search in the network topology information. Wherein, the method for stopping the path search in the network topology information includes the above-mentioned pruning.

In this embodiment, after the target path is selected, by pruning the parent-child relationship between the nodes passed by the target path in the network topology information and the child nodes corresponding to the passed nodes, it can effectively prevent the target path from being selected next time. The target path is selected again, so as to achieve the effect of "separation as much as possible".

It should be noted that in the network topology information updated through the above steps S2021 and S2022, the routing cost of each link corresponding to the determined target path has increased by the preset value. Therefore, in the updated network In the case that there are paths different from the determined target paths in the topology information, these determined target paths will no longer be the routes with the least cost corresponding to the source node to the destination node in the updated network topology information path. Moreover, after updating the network topology information, in the subsequent step S203, when re-determining the target path, the link with the lowest inter-node routing cost will be selected, that is, the link whose inter-node routing cost has not been increased by the preset value will be preferentially selected . Based on this, according to the principle of selecting the path with the least routing cost, the paths that are completely disjoint with all previously determined target paths will be preferentially screened out, and then the paths that are not completely intersected with all previously determined Calculate all the different target paths corresponding to the path request.

Fig. 4a is a schematic diagram of network topology information according to an embodiment of the present disclosure.

In one implementation scenario, as shown in Figure 4a, the network topology information includes network node information (A, B, C, D, F), link information (the connection between each node), and the corresponding Routing cost (data on the link), etc. The obtained path calculation request sent by the path calculation client includes: path calculation request 1, the source node in the path configuration information of the corresponding candidate path is A, the destination node is B, and the number of corresponding segment lists is 3, then according to the figure The method for calculating the path based on the network topology information shown in 4a includes the following steps.

Step 1: Determine a target path corresponding to the path calculation request based on the network topology information and the path configuration information corresponding to the path calculation request.

In this implementation scenario, the single Dijkstra algorithm is used to calculate the path. After reaching the destination node B from the source node A, a path with the minimum routing cost is obtained as the target path, and the parent-child relationship from the source node A to other nodes is obtained at the same time. The path with the minimum routing cost is A---B, and the parent-child relationship from source node A to other nodes is the parent-child relationship from A to C and the parent-child relationship from A to D.

Step 2, updating the network topology information by performing preset processing on the network topology information based on the target path, and judging whether the determined target path satisfies the target condition.

The preset processing includes: increasing the routing cost of each link of the target path in the network topology information to a preset value, cutting the parent-child relationship between the node passed by the target path in the network topology information and the child node corresponding to the passed node branch.

Fig. 4b is a schematic diagram of network topology information according to an embodiment of the present disclosure. As shown in Figure 4b, after the preset processing of the network topology information based on the target path, the routing cost of the A---B path increases by 98, from the original 2 to 100. And, the parent-child relationship from A to B, the parent-child relationship from A to C, and the parent-child relationship from A to D are pruned, that is, the parent-child relationship from A to B, the parent-child relationship from A to C, and the parent-child relationship from A to D are saved from the cache information is cleared.

Step 3: repeat the

above steps

1 and 2, and continue to obtain the path with the minimum routing cost from the source node A to the destination node B based on the updated network topology information as the next target path, that is, A---C---B. Step 1 and Step 2 in this embodiment are repeated again to continuously obtain the next target path A---D---F---B from the source node A to the destination node B.

In one embodiment, after determining all the different target paths corresponding to the path calculation request, it further includes: generating routing information corresponding to the path calculation request based on all the determined different target paths, and sending the routing information to the forwarding device , for the forwarding device to perform routing and forwarding operations based on the routing information.

The routing information includes candidate paths, and the candidate paths include at least one section list, and one section list corresponds to one determined target path.

Fig. 5 is a flowchart of a path calculation method according to an embodiment of the present disclosure. In one embodiment, as shown in Figure 5, before determining a target path corresponding to the path calculation request based on the network topology information and the path configuration information corresponding to the path calculation request, the path calculation method further includes steps S501 to S503.

In step S501, at least one path calculation request sent by a path calculation client is acquired.

The path calculation request includes the path configuration information of the corresponding candidate path, and the path configuration information is the performance parameter that the candidate path needs to have. The path configuration information includes source node information, destination node information, the number of corresponding segment lists, preset bandwidth and path calculation constraint information. The preset bandwidth is the minimum bandwidth required by the candidate path, that is, the required bandwidth of each target path is the ratio of the preset bandwidth to the number of corresponding segment lists. Path calculation constraints are special requirements that need to be met when calculating paths, for example, at least one of delay, hop count, bandwidth utilization, and routing cost.

A path calculation client is a device used to send path calculation requests. The path calculation client can be used to configure the SR Policy path calculation unit, such as adding the source node and destination node of the SR Policy, the number of candidate paths, the priority of candidate paths, the number of segment lists corresponding to each candidate path, and path calculation constraints information etc. After the user configures the route calculation data on the operation interface of the route calculation client, the route calculation client generates at least one route calculation request based on the route calculation data, and sends the route calculation request to the route calculation device. Each path calculation request requires the calculation of a candidate path.

In step S502, when the quantity of at least one path calculation request is multiple, based on the path configuration information corresponding to each path calculation request, a plurality of path calculation requests satisfying a predetermined condition among at least one path calculation request are combined For a combined path calculation request.

The predetermined condition refers to that the information of the source node, the information of the destination node, and the number of corresponding segment lists in the path configuration information corresponding to any number of path calculation requests are all corresponding to the same, the difference between the preset bandwidth is less than the first preset threshold, and the calculation The difference between the constraint values included in the road constraint information is smaller than the second preset threshold. The first preset threshold and the second preset threshold may be set according to specific implementation scenarios, and are not specifically limited in this embodiment of the present disclosure.

In step S503, according to the path configuration information corresponding to each of the plurality of path calculation requests satisfying the predetermined condition, the path configuration information corresponding to the merged path calculation request is determined.

In the route configuration information corresponding to the merged route calculation request, the source node and destination node correspond to the same source node and destination node of any one of the multiple route calculation requests that meet the predetermined conditions, and the number of corresponding segment lists is satisfied The sum of the number of corresponding segment lists included in multiple path calculation requests that meet the predetermined conditions. The preset bandwidth is the largest preset bandwidth among the preset bandwidths included in the multiple path calculation requests that meet the predetermined conditions. The path calculation constraint information is Among the route calculation constraint information included in the plurality of route calculation requests with predetermined conditions, the route calculation constraint information has the minimum constraint value, or the route calculation constraint information is a union of multiple route calculation constraints.

For example, multiple path calculation requests that meet the predetermined conditions include: path calculation request 1, the source node in the corresponding path configuration information is A1, the destination node is A2, the corresponding segment list number is 2, the preset bandwidth is 30Mbps, and the path calculation The constraint information is the minimum delay constraint; path calculation request 2, the source node in the corresponding path configuration information is A1, the destination node is A2, the corresponding segment list number is 2, the preset bandwidth is 40Mbps, and the path calculation constraint information is the minimum extension constraints. In this case, in the route configuration information corresponding to the merged route calculation request obtained by combining route calculation request 1 and route calculation request 2, the source node is A1, the destination node is A2, and the number of corresponding segment lists is 4 , The preset bandwidth is 40Mbps, and the path calculation constraint information is the minimum delay constraint.

In one embodiment, after combining the multiple route calculation requests satisfying the predetermined condition, each of the remaining route calculation requests in the multiple route calculation requests except the multiple route calculation requests satisfying the predetermined condition is sequentially and merging the path calculation requests, the above step S201 to step S203 are executed to determine all different target paths corresponding to each path calculation request.

It should be noted that after combining multiple route calculation requests that meet the predetermined conditions, it is only necessary to perform a route calculation process (including the above steps S201 to S203) on the combined route calculation requests to determine the number of routes that meet the predetermined conditions. Each of the path calculation requests corresponds to the target path, without performing the path calculation process for each of the multiple path calculation requests that meet the predetermined conditions, so that the complexity of path calculation can be effectively reduced. , to shorten the time-consuming path calculation, thereby speeding up the path best-effort separation.

Fig. 6 is a flowchart of a path calculation method according to an embodiment of the present disclosure. As shown in FIG. 6 , in one embodiment, when the path calculation request is a combined path calculation request obtained by combining multiple path calculation requests, all different target paths corresponding to the combined path calculation request are determined Afterwards, the path calculation method further includes steps S601 to S604.

In step S601, the merged route calculation request is divided into multiple route calculation requests before being merged.

After splitting into multiple path calculation requests before merging, each path calculation request corresponds to its own path configuration information.

In step S602, based on the path configuration information corresponding to each of the multiple path calculation requests obtained by splitting, assign a corresponding number of target paths to each of the multiple path calculation requests obtained by splitting.

In this embodiment, since the route calculation request is a combined route calculation request obtained by combining multiple route calculation requests, the number of segment lists corresponding to the combined route calculation request is the number of segment lists included in each of the multiple route calculation requests Therefore, after splitting the combined path calculation request into multiple path calculation requests before merging, based on the determined number of different target paths and the number of corresponding segment lists included in each path calculation request, it is Each path calculation request is assigned a corresponding number of target paths.

For example, when the number of all different target paths determined is the sum of the number of segment lists included in each of multiple path calculation requests, when assigning a corresponding number of target paths to each path calculation request, for any calculation request The number of target paths allocated by the path request is the number of segment lists included in the path calculation request.

In the case that the number of all different target paths determined is less than the sum of the number of corresponding segment lists included in each of the multiple path calculation requests, when assigning a corresponding number of target paths to each path calculation request, the allocation will be Minimize the number of path calculation requests with target paths whose number is less than the number of corresponding segment lists. The number of target paths assigned to as few path calculation requests as possible is smaller than the number of segment lists corresponding to the path calculation requests. For example, the combined path calculation request is split into three path calculation requests before merging, the number of segment lists corresponding to each of the three path calculation requests is 3, and the number of all different target paths determined is 7 , then, when assigning a corresponding number of target paths to each path calculation request, the number of target paths allocated to two path calculation requests is 3, and the number of target paths allocated to the other path calculation request is 1.

In one embodiment, after allocating a corresponding number of target paths to each split path calculation request based on the path configuration information corresponding to each split path computation request, the path calculation method further includes: If the number of target paths corresponding to any path calculation request obtained by splitting is less than the number of segment lists corresponding to the path calculation request, determine the path corresponding to the path calculation request based on the network topology information and the path configuration information corresponding to the path calculation request. Other target paths corresponding to the request.

It should be noted that the path calculation request is a combined path calculation request obtained by combining multiple path calculation requests, and in the path configuration information corresponding to the combined path calculation request, the preset bandwidth is the combined path calculation request that meets the predetermined conditions. The largest preset bandwidth among the included preset bandwidths, and the path calculation constraint information is the path calculation constraint information with the smallest constraint value among the path calculation constraint information included in the multiple path calculation requests that meet the predetermined condition. Therefore, for the path calculation request whose corresponding target path quantity is less than the corresponding section list quantity, there may exist in the path configuration information corresponding to the path calculation request, the preset bandwidth is smaller than the preset bandwidth and the preset bandwidth corresponding to the combined path calculation request /or the condition that the constraint value of the path calculation constraint information is greater than the constraint value of the path calculation constraint information corresponding to the merged path calculation request. In other words, there may be a situation that the target path does not satisfy the path configuration information corresponding to the merged path calculation request, but satisfies the path configuration information corresponding to the path calculation request.

Therefore, when the number of target paths corresponding to any path calculation request obtained by splitting is less than the number of segment lists corresponding to the path calculation request, based on the network topology information and the path configuration information corresponding to the path calculation request, Determining other target paths corresponding to the path calculation request can filter out target paths that do not satisfy the path configuration information corresponding to the merged path calculation request but satisfy the path configuration information corresponding to the path calculation request, so as to achieve path separation as much as possible.

Step S603, based on the target route corresponding to each route calculation request obtained by splitting, generate routing information corresponding to each route calculation request obtained by splitting.

The routing information includes candidate paths, where the candidate paths include at least one segment list, and each segment list corresponds to a determined target path.

In one embodiment, when the number of target paths corresponding to any path calculation request obtained by splitting is less than the number of segment lists corresponding to the path calculation request and other target paths corresponding to the path calculation request are determined, when generating The routing information corresponding to the path calculation request also includes other determined target paths.

In step S604, the routing information is sent to the forwarding device for the forwarding device to perform routing and forwarding operations based on the routing information.

A route calculation method provided by an embodiment of the present disclosure combines multiple route calculation requests that meet predetermined conditions into one merged route calculation request, and after combining multiple route calculation requests that meet predetermined conditions, sequentially path calculation requests (including combined route calculation requests and other route calculation requests except for multiple route calculation requests that meet predetermined conditions), execute the above steps S201 to S203 to determine the remaining All the different target paths corresponding to each route calculation request. Finally, for the merged route calculation request, split the merged route calculation request into multiple route calculation requests before merging. Path configuration information, which allocates a corresponding number of target paths for each path calculation request obtained by splitting, and can determine the target corresponding to each path calculation request that meets the predetermined conditions only by performing a path calculation process on the merged path calculation request The path reduces the complexity of path calculation, shortens the time-consuming path calculation, and can accelerate the best-effort separation of paths.

FIG. 7 is a schematic diagram of network topology information according to an embodiment of the disclosure. In an implementation scenario, as shown in FIG. 7 . Network topology information includes network node information (A, B, C, D, E, F), link information (the connection between each node), and the routing cost corresponding to each link (the first link in parentheses on the link One data represents the delay cost of the link) and the available resource information of each link (the second data in brackets on the link represents the bandwidth of the link), etc. Then, the method for calculating the path according to the network topology information shown in FIG. 7 includes the following steps.

In step 1, at least one path calculation request sent by the acquired path calculation client is obtained.

The obtained path calculation request sent by the path calculation client includes: path calculation request 1, the source node in the path configuration information of the corresponding candidate path is A, the destination node is F, the corresponding segment list number is 2, and the preset bandwidth is 30Mbps , The route calculation constraint information is the minimum delay constraint; the route calculation request 2, in the path configuration information of the corresponding candidate path, the source node is A, the destination node is F, the corresponding segment list number is 2, the preset bandwidth is 40Mbps, and the calculation The path constraint information is the minimum delay constraint.

In step 2, when at least one path calculation request includes multiple path calculation requests, based on the path configuration information corresponding to each path calculation request, multiple path calculation requests that meet the predetermined conditions are combined into one merged path calculation request , and determine the path configuration information corresponding to the combined path calculation request.

According to route calculation request 1 and route calculation request 2, determine the path configuration information corresponding to the merged route calculation request, the source node is A, the destination node is F, the corresponding segment list number is 4, the preset bandwidth is 40Mbps, and the route calculation The constraint information is the minimum delay constraint.

It should be noted that for route calculation request 1, the bandwidth shared by each segment list is 15 Mbps; for route calculation request 2, the bandwidth shared by each segment list is 20 Mbps. Therefore, when multiple route calculation requests that meet the predetermined conditions After being merged into one merged path calculation request, the calculation is performed based on the largest bandwidth among the bandwidth shared by each segment list. Since the bandwidth shared by each segment list is 20 Mbps, in any target path determined in the subsequent path calculation process, the bandwidth corresponding to each link needs to be greater than the 20 Mbps.

In step 3, all different target paths corresponding to the combined path calculation request are determined based on the network topology information and the path configuration information corresponding to the combined path calculation request.

All the different target paths determined corresponding to the combined path calculation request include: A---B---F, A---C---F, A---D---F, A--- E---F.

In one embodiment, the bandwidth check may also be performed on all the different target paths determined corresponding to the combined path calculation request, so as to ensure that in any determined target path, the bandwidth corresponding to each link is greater than the each segment list Shared bandwidth.

In step 4, split the merged route calculation request into multiple route calculation requests before merging, and allocate corresponding number of target paths.

In this embodiment, the merged route calculation request is split into route calculation request 1 and route calculation request 2 before merging, and the target paths assigned to route calculation request 1 are A---B---F and A--- C---F, the target paths assigned to path calculation request 2 are A---D---F and A---E---F. Since the path calculation request is a request for calculating the candidate path from the source node to the destination node, therefore, in this embodiment, two candidate paths from the source node to the destination node are determined, and each candidate path includes 2 segment lists , the segment list corresponding to the determined candidate path of path calculation request 1 is A---B---F and A---C---F, and the segment list corresponding to the determined candidate path of path calculation request 2 is A ---D---F and A---E---F.

In another implementation scenario, the network topology information is as shown in FIG. 7 . Network topology information includes network node information (A, B, C, D, E, F), link information (the connection between each node), and the routing cost corresponding to each link (the first link in parentheses on the link One data represents the delay cost of the link) and the available resource information of each link (the second data in brackets on the link represents the bandwidth of the link), etc. The method for calculating the path according to the network topology information shown in FIG. 7 includes the following steps.

The obtained path calculation request sent by the path calculation client includes: path calculation request 1, the source node in the path configuration information of the corresponding candidate path is A, the destination node is F, the corresponding segment list number is 2, and the preset bandwidth is 90Mbps , The route calculation constraint information is the minimum delay constraint; the route calculation request 2, the source node in the path configuration information of the corresponding candidate path is A, the destination node is F, the corresponding segment list number is 2, the preset bandwidth is 90Mbps, and the calculation The path constraint information is the minimum delay constraint.

According to route calculation request 1 and route calculation request 2, determine the route configuration information corresponding to the merged route calculation request, the source node is A, the destination node is F, the corresponding segment list number is 4, the preset bandwidth is 90Mbps, and the route calculation The constraint information is the minimum delay constraint.

For route calculation request 1, the bandwidth shared by each segment list is 45 Mbps; for route calculation request 2, the bandwidth shared by each segment list is 45 Mbps. After the road request, the bandwidth shared by each segment list is 45Mbps.

In step 3, all different target paths corresponding to the merged path calculation request are determined based on the network topology information and the path configuration information corresponding to the path calculation request.

All determined different target paths corresponding to the merged path calculation request include: A---B---F, A---C---F, and A---E---F.

In step 4, split the merged route calculation request into multiple route calculation requests before merging, and assign a corresponding Number of target paths.

In this embodiment, the merged route calculation request is split into route calculation request 1 and route calculation request 2 before merging, and the target path allocated for route calculation request 1 is A---B---F, A--- C---F, the target path assigned to path calculation request 2 is A---E---F. Since the path calculation request is a request for calculating the candidate path from the source node to the destination node, therefore, in this embodiment, two candidate paths from the source node to the destination node are determined, and the determined candidate path of the path calculation request 1 corresponds to There are 2 segment lists, and the determined candidate path of path calculation request 2 can only correspond to 1 segment list.

Fig. 8 is a schematic diagram of network topology information according to an embodiment. In the implementation scenario shown in Figure 8, the network topology information includes network node information (A, B, C, D, E), link information (the connection between each node), and the route corresponding to each link. Cost (data on the link), etc. The obtained path calculation request sent by the path calculation client includes: path calculation request 1, the source node in the path configuration information of the corresponding candidate path is A, the destination node is F, the corresponding segment list number is 2, and the preset bandwidth is 40Mbps , The route calculation constraint information is the minimum delay constraint; the route calculation request 2, in the path configuration information of the corresponding candidate path, the source node is A, the destination node is F, the corresponding segment list number is 2, the preset bandwidth is 40Mbps, and the calculation The path constraint information is the minimum delay constraint.

In this implementation scenario, if link separation is not performed, then according to the minimum delay constraint principle, among the two candidate paths determined by the two path calculation requests, the two segment lists corresponding to the first candidate path are both A- --E---F, the two segment lists corresponding to the second candidate path are also A---E---F.

It can be seen that the path calculation method provided by the embodiments of the present disclosure can achieve the effect of classifying paths as much as possible.

Fig. 9 is a schematic structural diagram of a route computing device according to an embodiment of the present disclosure. As shown in FIG. 9 , the route calculation device includes: a calculation module 91 , a processing module 92 and a decision module 93 .

The calculation module 91 is configured to determine a target path corresponding to the path calculation request based on network topology information and path configuration information corresponding to the path calculation request.

Network topology information includes network node information, link information, routing costs corresponding to each link, and available resource information for each link. In this embodiment, a link refers to a path between any node and an adjacent node in the network topology. The link information may be a unique identifier of the link. The routing cost corresponding to the link is an index used to evaluate the quality of the link. For example, in the case where the routing cost is only related to the delay, the greater the delay of the link, the corresponding routing cost of the link bigger. The available resource information of the link includes bandwidth information of the link and the like.

The path configuration information corresponding to the path calculation request includes information on the source node and information on the destination node, where the information on the source node may include information such as an identifier and an address of the source node. The information of the destination node may include information such as the identifier and address of the destination node. The destination path is the path with the least routing cost from the source node to the destination node in the network topology information.

A path calculation request is a request for calculating a candidate path from a source node to a destination node, and the path calculation request includes path configuration information of a corresponding candidate path, and the path configuration information is a performance parameter that the candidate path needs to have. The path configuration information includes the information of the source node, the information of the destination node, the number of corresponding segment lists, the preset bandwidth and the path calculation constraint information.

The processing module 92 is configured to update the network topology information by performing preset processing on the network topology information based on the determined target path.

The decision-making module 93 is used to judge whether the determined target path satisfies the target condition, so that the calculation module 91 repeats the operation of determining a target path corresponding to the path calculation request and makes the processing module 93 repeat the operation of updating the network topology information until the determined target path The path satisfies the goal condition, and all the different goal paths corresponding to the routing request are determined.

The target condition includes: the determined target path is the same as the previously determined target path, or all the determined target paths are different from each other and the accumulated quantity of all the determined target paths is a preset quantity.

In one embodiment, the route calculation device further includes: a route generating module and a sending module (not shown).

The route generation module is used to generate route information corresponding to the path calculation request based on the determined target paths.

The sending module is used to send the routing information to the forwarding device, so that the forwarding device can perform routing and forwarding operations based on the routing information.

In one embodiment, the routing computing device further includes: an obtaining module, a merging module and a splitting module (not shown).

The acquiring module is configured to acquire at least one path calculation request sent by the path calculation client, each of the at least one path calculation request includes path configuration information of candidate paths.

The merging module is configured to combine multiple route calculation requests satisfying predetermined conditions into one merged route calculation request based on path configuration information corresponding to each route calculation request; Configuration information, to determine the path configuration information corresponding to the merged path calculation request.

The splitting module is used to split the merged route calculation request into multiple route calculation requests before merging; based on the path configuration information corresponding to each route calculation request obtained by splitting, assign the corresponding number to each route calculation request obtained by splitting target path.

In one embodiment, the calculation module 91 is further configured to: if the number of target paths corresponding to any path calculation request obtained by splitting is less than the number of segment lists corresponding to the path calculation request, based on the network topology information and the The path configuration information corresponding to the path calculation request determines other target paths corresponding to the path calculation request.

The route generating module is further configured to generate routing information corresponding to each split route calculation request based on the target path corresponding to each split route calculation request.

The sending module is also used to send the routing information to the forwarding device, so that the forwarding device can perform routing and forwarding operations based on the routing information.

An embodiment of the present disclosure provides a route calculation device. The calculation module is used to determine a target path corresponding to the route calculation request based on the network topology information and the path configuration information corresponding to the route calculation request. The network topology information is pre-processed to update the network topology information, and the decision-making module is used to judge whether the determined target path meets the target condition, so that the calculation module 91 repeats the operation of determining a target path corresponding to the path calculation request and makes the processing module 93 repeat The operation of updating network topology information until the determined target path satisfies the target condition, and determining all the different target paths corresponding to the path calculation request can speed up the best-effort separation of all paths from the source node to the destination node.

In one embodiment, the route computing device provided by the present disclosure is applied to management and control products.

Fig. 10 is a schematic diagram of a system structure of a management and control product according to an embodiment of the present disclosure, for example, the management and control product is an SDN controller. As shown in Figure 10, the system of the management and control product includes: IP (Internet Protocol, Internet Interconnection Protocol) network device 1000, southbound interface 1001, topology resource module 1002, path calculation unit (Path Calculate Element, PCE) 1003 and northbound Interface 1004.

The IP network device 100 includes routers, switches, and the like.

The southbound interface 1001 is a module for controlling the interaction between the product and the IP network equipment, and adopts the protocol so that the SDN controller can collect the information of the application equipment, for example, the information of the optical equipment. The southbound interface is also used to collect network topology information.

The topology resource module 1002 is used to receive and store the network topology information sent by the southbound interface.

Path Calculate Element (PCE) 1003 actually includes many sub-modules, which itself is a complex system. The PCE includes the above routing computing device provided by the embodiments of the present disclosure. In addition to the above routing computing equipment, the PCE also includes a resource management module, a graph management module, and the like. PCE achieves the purpose of routing calculation by coordinating and scheduling the interaction between modules.

The northbound interface 1004 mainly interacts with upper-layer application modules, for example, a path calculation client.

FIG. 11 is a compositional block diagram of an electronic device according to an embodiment of the present disclosure. As shown in FIG. 11 , the electronic device includes: one or more processors 1101 , a memory 1102 and one or more I/O interfaces 1103 .

One or more programs are stored in the memory 1102, and when the one or more programs are executed by one or more processors, the one or more processors implement any one of the above path calculation methods.

The I/O interface 1103 is connected between the processor 1101 and the memory 1102, and is configured to realize information exchange between the processor and the memory.

Wherein, the processor 1101 is a device with data processing capability, which includes but not limited to a central processing unit (CPU), etc.; the memory 1102 is a device with data storage capability, which includes but not limited to a random access memory (RAM, more specifically Such as SDRAM, DDR, etc.), read-only memory (ROM), electrified erasable programmable read-only memory (EEPROM), flash memory (FLASH); I/O interface (read-write interface) 1103 is connected between processor 1101 and memory 1102 , can realize information interaction between the processor 1101 and the memory 1102, which includes but not limited to a data bus (Bus) and the like.

In some embodiments, the processor 1101, the memory 1102 and the I/O interface 1103 are connected to each other through a bus, and further connected to other components of the computing device.

An embodiment of the present disclosure also provides a computer storage medium on which a computer program is stored, wherein any one of the path calculation methods is implemented when the program is executed.

Those skilled in the art can understand that all or some of the steps in the method disclosed above and the functional modules/units in the device can be implemented as software, firmware, hardware and an appropriate combination 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 one function or step may be composed of several physical components. Components cooperate to execute. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, 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 computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As known to those of ordinary skill in the art, the term computer storage media includes both volatile and nonvolatile media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. permanent, removable and non-removable media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, tape, magnetic disk storage or other magnetic storage devices, or can Any other medium used to store desired information and which can be accessed by a computer. In addition, as is well known to those of ordinary skill in the art, communication media typically embodies 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 may include any information delivery media .

Example embodiments have been disclosed herein, and while specific terms have been employed, they are used and should be construed in a generic descriptive sense only and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that features, characteristics and/or elements described in connection with a particular embodiment may be used alone, or may be described in combination with other embodiments, unless explicitly stated otherwise. Combinations of features and/or elements. It will be understood by those skilled in the art that various changes in form and details may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

A path calculation method, comprising:

determining a target path corresponding to the path calculation request based on network topology information and path configuration information corresponding to the path calculation request;

updating the network topology information by performing preset processing on the network topology information based on the determined target path; and

judging whether the determined target path satisfies the target condition, repeating the steps of determining a target path corresponding to the path calculation request and updating the network topology information until the determined target path satisfies the target condition, and determining All different target paths corresponding to the path calculation request.
The method according to claim 1, wherein the target condition includes: the determined target path is the same as a previously determined target path.
The method according to claim 1, wherein the target condition includes: all determined target paths are different from each other and the accumulated quantity of all determined target paths is a preset quantity.
The method according to claim 1, before determining a target path corresponding to the path calculation request based on the network topology information and the path configuration information corresponding to the path calculation request, further comprising:

At least one path calculation request sent by the path calculation client is acquired, where each of the at least one path calculation request includes path configuration information of candidate paths.
The method according to claim 4, wherein the number of the at least one path calculation request is multiple, and after acquiring the at least one path calculation request sent by the path calculation client, the method further comprises:

Based on the path configuration information corresponding to each of the at least one path calculation request, combining multiple path calculation requests satisfying a predetermined condition in the at least one path calculation request into one merged path calculation request; and

The path configuration information corresponding to the merged path calculation request is determined according to the path configuration information corresponding to each of the plurality of path calculation requests satisfying the predetermined condition.
The method according to claim 1, wherein the step of determining a target path corresponding to the path calculation request based on the network topology information and the path configuration information corresponding to the path calculation request comprises:

Determine a target path corresponding to the path calculation request by using a target path calculation algorithm based on the path configuration information and the network topology information; and

Wherein, the path configuration information includes the information of the source node and the information of the destination node, and the destination path is the path with the smallest routing cost from the source node to the destination node in the network topology information.
The method according to claim 6, wherein the target path calculation algorithm comprises a two-way Dijkstra algorithm, a one-way Dijkstra algorithm or an A* algorithm.
The method according to claim 6, wherein the step of updating the network topology information by performing preset processing on the network topology information based on the determined target path comprises:

increasing the routing cost of each link of the determined target path in the network topology information by a preset value; and

Pruning the parent-child relationship between the nodes passed by the target path and the child nodes corresponding to the passed nodes in the network topology information.
The method according to claim 1, after determining all different target paths corresponding to the path calculation request, further comprising:

generating routing information corresponding to the path calculation request based on all determined different target paths; and

Sending the routing information to a forwarding device for the forwarding device to perform a routing and forwarding operation based on the routing information.
The method according to claim 5, wherein, when the path calculation request is the combined path calculation request obtained by combining the multiple path calculation requests, when determining the path calculation request corresponding to the combined path calculation request After all the different target paths, the method also includes:

Splitting the combined path calculation request into the multiple path calculation requests before merging;

Allocating a corresponding number of target paths to each of the plurality of route calculation requests obtained by splitting based on the path configuration information corresponding to each of the plurality of route calculation requests obtained by splitting;

generating routing information respectively corresponding to the plurality of route calculation requests obtained by the split based on the target paths respectively corresponding to the plurality of route calculation requests obtained by the split; and

Sending the routing information to a forwarding device for the forwarding device to perform a routing and forwarding operation based on the routing information.
The method according to claim 10, wherein, based on the path configuration information corresponding to each of the multiple path calculation requests obtained by the split, for each of the multiple path calculation requests obtained by the split After allocating a corresponding number of target paths, the method further includes:

If the number of target paths corresponding to any path calculation request obtained by splitting is less than the number of segment lists corresponding to the path calculation request, based on the network topology information and the path configuration information corresponding to the path calculation request, Determine other target paths corresponding to the path calculation request.
The method according to claim 1, wherein the path configuration information further includes source node information, destination node information, corresponding segment list numbers, preset bandwidth and path calculation constraint information.
A routing computing device comprising:

A calculation module configured to determine a target path corresponding to the path calculation request based on network topology information and path configuration information corresponding to the path calculation request;

a processing module configured to update the network topology information by performing preset processing on the network topology information based on the determined target path; and

A decision-making module configured to judge whether the determined target path satisfies a target condition, make the calculation module repeat the operation of determining a target path corresponding to the path calculation request, and make the processing module repeatedly update the network The topology information is operated until the determined target path satisfies the target condition, and all the different target paths corresponding to the path calculation request are determined.
An electronic device comprising:

one or more processors; and

memory on which one or more programs are stored;

When the one or more programs are executed by the one or more processors, the one or more processors are made to implement the path calculation method according to any one of claims 1-12.
A computer storage medium, on which a computer program is stored, wherein the path calculation method according to any one of claims 1-12 is implemented when the program is executed.