WO2024001210A1 - 路径计算方法、控制器和计算机可读存储介质 - Google Patents

路径计算方法、控制器和计算机可读存储介质 Download PDF

Info

Publication number
WO2024001210A1
WO2024001210A1 PCT/CN2023/076231 CN2023076231W WO2024001210A1 WO 2024001210 A1 WO2024001210 A1 WO 2024001210A1 CN 2023076231 W CN2023076231 W CN 2023076231W WO 2024001210 A1 WO2024001210 A1 WO 2024001210A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
constraints
segment routing
calculation method
pass
Prior art date
Application number
PCT/CN2023/076231
Other languages
English (en)
French (fr)
Inventor
高勇
陆钱春
张天祥
严峰
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024001210A1 publication Critical patent/WO2024001210A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the embodiments of the present application relate to but are not limited to the field of IP communication technology, and in particular, to a path calculation method, a controller and a computer-readable storage medium.
  • SR Policy Segment Routing Policy
  • This policy includes the carrying requirements and forwarding paths of business traffic. It is one of the current key technologies for large-scale networks and can support ultra-large-scale networks. Traffic engineering.
  • the routing constraints of SR Policy are complex and changeable. When there are multiple constraints superimposed on mandatory constraints, path calculation may fail, which reduces the stability of routing and cannot meet business requirements in large-scale networks.
  • Embodiments of the present application provide a path calculation method, a controller, and a computer-readable storage medium.
  • embodiments of the present application provide a path calculation method, which includes: obtaining network topology data information, analyzing the topology data information, and obtaining constraints on a segment routing policy; and calculating the topology data based on the constraints.
  • the data information is calculated to obtain the target segment routing path; the path delivery operation is performed according to the target segment routing path.
  • embodiments of the present application provide a controller, including: a route calculation module configured to perform the path calculation method described in the first aspect; a southbound interface, the southbound interface The southbound interface is configured to receive the topology data information sent by the network and forward the topology data information to the route calculation module. The southbound interface is also configured to receive the target segment routing path sent by the route calculation module, and Forward the target segment routing path to the network; a northbound interface, the northbound interface is configured to receive an analysis request sent by an external client and forward the analysis request to the route calculation module.
  • embodiments of the present application provide an electronic device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program When implementing the path calculation method as described in the first aspect above.
  • embodiments of the present application provide a computer-readable storage medium that stores a computer-executable program.
  • the computer-executable program is used to cause a computer to execute the method described in the first aspect. Path calculation method.
  • Figure 1 is the main flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 2 is another sub-flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 3 is another sub-flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 4 is another sub-flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 5 is another sub-flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 6 is another sub-flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 7 is another main flow chart of a path calculation method provided by an embodiment of the present application.
  • Figure 8 is a schematic structural diagram of a controller provided by an embodiment of the present application.
  • Figure 9 is a schematic diagram of weights provided by an embodiment of the present application.
  • Figure 10 is a schematic diagram of topology data information provided by an embodiment of the present application.
  • Figure 11 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • SR Policy Segment Routing Policy, Segment routing strategy
  • SR Policy is represented by headend, color and endpoint, where headend is the place where SR Policy is generated/implemented; endpoint is the endpoint of SR Policy, and color is an important attribute of SR Policy, which usually represents the intention and can be simply understood as the SR Policy routing process.
  • the optimal path calculation strategy in represents a specific way to reach the endpoint.
  • the candidate paths of the SR Policy represent a specific way to transmit traffic from the corresponding SR Policy headend to the endpoint.
  • Each candidate path has a preference value. The higher the preference value of the path, the more preferred it is.
  • the SR Policy has at least one candidate. path, where the valid candidate path with the highest preference value is the active candidate path.
  • Each candidate path can have one or more SLs (Segment List, label stack). Each SL has an associated load balancing weight w to guide to this path. Traffic is load balanced among all valid SLs according to the weight ratio.
  • the routing constraints of SR Policy are complex and changeable.
  • path calculation may fail, which reduces the stability of routing and cannot meet business requirements in large-scale networks.
  • the current path calculation method of SR Policy cannot solve the superposition of multiple complex constraints while taking into account path optimization and speed calculation. quick.
  • the path calculation method of this application can quickly calculate the optimal path, that is, the target segment routing path, when multiple constraints are superimposed and must pass through. Perform path delivery operations based on the target segment routing path, ensuring network stability and meeting business requirements in large-scale networks.
  • an embodiment of the present application provides a path calculation method, including but not limited to step S110, step S120, and step S130.
  • Step S110 Obtain the topology data information of the network, analyze the topology data information, and obtain the constraints of the segment routing policy.
  • Step S120 Calculate the topology data information according to the constraints to obtain the target segment routing path.
  • Step S130 Perform a path delivery operation according to the target segment routing path.
  • the path calculation method of this application can obtain the topological data information of the network with the help of the global view of the controller, because the topological data information contains a lot of information, including the node information, link information and constraints of the network, etc., and more The detailed division also includes the available resource information of the link, so this application can analyze the topology data information to obtain the constraints of the SR Policy.
  • constraints include must-travel constraints, and must-travel constraints include link must-travel constraints and node must-travel constraints, and link must-travel constraints and node must-travel constraints are both strong constraints, where link must-travel constraints refer to The link of the SL path must include the specified link, and the node must-pass constraint means that the nodes of the SL path must include the specified node.
  • the topology data information has a field through which the type of required constraints can be directly obtained.
  • the required constraints are link-required constraints, or the required constraints are node-required constraints.
  • this application can calculate the topology data information according to the constraints, so as to calculate the optimal path of the network, that is, the target analysis when multiple constraints are superimposed and must pass through.
  • segment routing path and perform path delivery operations based on the target segment routing path, so that the corresponding network devices in the network can divert traffic according to the target segment routing path, that is, the traffic directed to this path is among all valid SLs according to the weight ratio.
  • Load balancing is performed between the nodes to ensure the stability of the network and meet the business requirements of large-scale networks.
  • SR Policy also includes complex routing policies, where routing policies include multiple types, such as strong constraints on path calculation, best-effort constraints on path calculation, separation strategies within candidate paths, and separation strategies between candidate paths. etc., so that factors such as delay, delay difference, hop count and bandwidth should also be considered when calculating topology data information.
  • the path calculation method of this application can also obtain the target score while taking into account multiple routing strategies. Segment routing path.
  • embodiments of the present application provide a method for calculating topological data information according to constraints, including but not limited to step S210 and step S220.
  • Step S210 determine the required constraints and obtain the judgment result.
  • the judgment result is that the link must be constrained, convert the link required constraints to obtain the node required constraints.
  • Step S220 Calculate the topology data information according to the constraints that nodes must pass through.
  • this application calculates topological data information by calculating multiple optimal paths between two points, that is, the KSP algorithm, because the KSP algorithm is generally based on node information and calculates the distance between nodes.
  • the KSP algorithm is generally based on node information and calculates the distance between nodes.
  • converting the link must-go constraints to obtain the node must-go constraints includes: converting the starting node of the must-go link with the link must-go constraint into a must-go node, and obtaining the node must-go constraints based on the must-go nodes. Constrained.
  • Figure 10 is a schematic diagram of topology data information provided by an embodiment of the present application; according to an embodiment of the present application, when the judgment result is that the link must be constrained, and the link must be constrained from C to D, Since the starting node of the link that must pass through the constraint at this time is point C, point C is converted into a must-pass node, thus obtaining the must-pass constraint of the node that must pass through point C, that is, the SR Policy The path must pass through point C.
  • embodiments of the present application provide a method of calculating topology data information according to constraints to obtain a target segment routing path, including but not limited to step S310, step S320, and step S330.
  • Step S310 combine the preset shortest path calculation method and constraints to calculate the topology data information to obtain the first segment routing path.
  • Step S320 Verify the first segment routing path according to the constraints to obtain the verification result.
  • Step S330 Update the first segment routing path according to the verification result until the calibration conditions are met, and the target segment routing path is obtained.
  • the link must-travel constraints need to be converted to obtain the node must-travel constraints, and then based on the preset shortest
  • the path method and node must pass constraints are used to calculate the topology data information to obtain the first segment routing path; when the judgment result is that the node must pass through constraints, the topology can be calculated directly based on the preset shortest path method and node must pass constraints.
  • the data information is calculated to obtain the first segment routing path.
  • this application uses the shortest path algorithm, that is, the KSP algorithm, in the calculation of the top K optimal paths.
  • the core idea is to calculate the top K optimal paths and obtain the shortest possible path.
  • the path calculation method of the present application can also complete the function of calculating the shortest path between two points by calling the Dijkstra algorithm or the A* algorithm multiple times instead of the KSP algorithm.
  • Figure 7 is another main flow chart of a path calculation method provided by an embodiment of the present application; it can be understood that, in order to ensure that the first segment routing path calculated by the path calculation method of the invention is in Taking into account the optimal path under the superposition of multiple complex constraints, after calculating the first segment routing path, it is necessary to perform multiple verifications on the first segment routing path, and based on the verification results, the first segment routing path needs to be verified.
  • the routing path is updated until the calibration conditions are met, the target segment routing path is obtained, and the path is delivered based on the target segment routing path.
  • the target segment routing path can ensure that the routing quality of the SR Policy strictly meets user requirements.
  • embodiments of the present application provide a shortest path calculation method, including but not limited to steps S410 and S420.
  • Step S410 Set weights according to constraints.
  • Step S420 Calculate the topology data information according to the weight to obtain the first segment routing path.
  • the shortest path calculation method can calculate an SL from the starting point to the end point, and quickly verify whether the first segment routing path meets the requirements by using the idea of trial and error.
  • the shortest path calculation method is implemented by a single SL routing algorithm module.
  • the SL routing algorithm module has a built-in shortest path calculation method. It can perform multiple path calculations on topology data information based on the shortest path calculation method. It is understandable Yes, the SL routing algorithm module is similar to an iterator and can be called multiple times to update the first segment routing path multiple times, and the SL routing algorithm module has an upper limit on the number of iterations. When the preset upper limit of the number of iterations is reached, even if the first segment routing path at this time does not satisfy the strong constraints, the calculation of the topology data information will still be terminated.
  • the upper limit of the number of iterations is set by the operator.
  • the upper limit of the number of iterations is set to save network resources and prevent waste of network resources.
  • the SL routing algorithm module when the SL routing algorithm module has executed tens of thousands of procedures, that is, updated the first segment routing path tens of thousands of times, the upper limit of the number of iterations has been reached, and the first segment routing path has not yet been updated. If the calibration conditions are met, it may be caused by the unreachable path in the topology data information. At this time, there is no need to waste network traffic to update the first segment routing path, and the calculation of the topology data information can be directly terminated.
  • the SL routing algorithm module is also equipped with a weight reader to constrain the links and nodes that the path passes through.
  • the weight reader sets the weight according to the constraints and calculates the topology data information based on the weight to obtain the first segmented route. path.
  • the weight reader will avoid mandatory links and nodes in the topology data information based on the value of the weight, and obtain the first segment routing path, where the value of the weight is determined according to the type of constraint, making the path calculation method of this application Achieve the purpose of filtering mandatory links and mandatory nodes.
  • the first segment routing path also needs to be verified to verify the first segment routing path. Whether the mandatory constraints of the SL level are met. If the first segment routing path does not satisfy the mandatory constraints of the SL level, the first segment routing path needs to be updated until the target segment routing path is obtained.
  • setting the weight according to the constraints includes: setting the weight value according to the priority of the constraint from high to low, so that constraints with high weight values are preferentially avoided when the topology data information is calculated.
  • the path calculation method of this application strictly cannot pass the links and nodes that are forcibly excluded by the SR Policy configuration and the links that do not meet the affinity, packet loss rate, and traffic thresholds.
  • the topology data information includes There are many complex constraint types. Some constraints have higher priority, and some constraints have lower priority. In order to avoid constraints one by one, it is necessary to set the weight value according to the priority of the constraint from high to low, so that the weight reader can The weights of different constraints are differentiated hierarchically to give priority to constraints with high weight values when calculating topological data information.
  • its link weight and node weight need to be set to infinity to filter out the links and nodes that must be arranged.
  • Figure 9 is a schematic diagram of weights provided by an embodiment of the present application.
  • the hierarchical weight has a multiple of 64.
  • initialMax the size of the weight is as shown in Figure 9, in which the shared risk link group failure, sharing The weight of risk node group failure and domain separation failure is equal to initialMax, because initialMax itself is also a maximum value, which is much larger than the weight value of the link itself in the topology data information, which can make the topology data information to be avoided first when calculating the topology data information. Open constraints with high weight values. When calculating the topology data information of this application, link separation failure will be excluded first. Secondly, node separation failure, network element separation failure, shared risk link group separation failure, shared risk node group separation failure and domain separation failure will be excluded in order. .
  • link separation failure, node separation failure, network element separation failure, sharing risk link group separation failure, sharing Risk node group separation failure and domain separation failure are both best-effort exclusion constraints.
  • Best-effort exclusion constraints are separation of best-effort exclusion nodes and best-effort exclusion links, and try not to pass through these elements when calculating paths.
  • the link separation constraint is the default policy, that is, two SLs cannot completely overlap.
  • the concept of complete overlap in link separation is that the three-layer links are completely consistent from beginning to end, and similar nodes also completely overlap; the node separation constraint is the nodes of the two SLs. It cannot completely overlap.
  • the concept of complete overlap in node separation is that the nodes are completely consistent from beginning to end.
  • the two SLs completely overlap. For example, one SL passes through A. , B, C, and another SL passes through A, B, C, D, then the two SLs are not overlapped; the shared risk link group separation constraint is between two SLs, and try to avoid paths with the same shared risk link. The link of the group; the shared risk node group separation constraint is between two SLs, and try to avoid nodes with the same shared risk node group.
  • the best-effort excluded links are links that are tried to be avoided during path calculation
  • the best-effort excluded nodes are nodes that are tried to be avoided during path calculation.
  • the operator can also set the weight appropriately according to the priority of the constraints.
  • the embodiment of the present application provides another shortest path calculation method, including but not limited to step S510, step S520, and step S530.
  • Step S510 Calculate the shortest reachable path from the starting point to the necessary node to obtain the first reachable path.
  • Step S520 update the starting point according to the constraints to obtain the updated starting point, calculate the shortest reachable path to the next must-pass node based on the updated starting point, and obtain the second reachable path, until all second reachable paths are obtained.
  • Step S530 Splice the first reachable path and the second reachable path to obtain the first segment routing path.
  • the preferred path calculation method in this application is to set the weight according to the constraints and calculate the topology data information according to the weight to obtain the first segment routing path.
  • the first segment routing path is calculated by the preferred path calculation method.
  • the verification result of the segment routing path is that it does not meet the calibration conditions, the first segment routing path needs to be updated, that is, the first segment routing path is calculated according to the path calculation method selected in this application.
  • the must-travel constraint is a link must-travel constraint
  • the starting node of is converted into a must-pass node, and the node must-pass constraints are obtained based on the must-pass nodes. If the must-pass constraint is a node must-pass constraint, it jumps directly to the step of calculating the shortest path. Therefore, the topological data information at this time includes the starting point, the end point, and There are several must-pass nodes.
  • the shortest reachable path from the starting point to the must-pass node closest to the starting point needs to be calculated to obtain the first reachable path. Then update the starting point according to the constraints to obtain the updated starting point. At this time, the updated starting point is the must-pass node when calculating the first reachable path. At this time, the steps of calculating the first reachable path can be repeated to calculate the distance from the updated starting point to the updated starting point. The shortest reachable path of the nearest must-pass node is obtained, and the starting point is continuously updated. Repeat the above calculation steps until the second reachable path from the starting point to the end point is obtained, and finally the first reachable path is obtained. By splicing with all second reachable paths, the first segment routing path can be obtained.
  • the path calculation method chosen secondly in this application uses the KSP algorithm in parallel through multi-threads to obtain the shortest reachable path of the starting point and the nearest must-pass node, the updated starting point and the nearest must-passed node, the updated starting point and the end point, and the shortest reachable path is obtained by splicing the corresponding The reachable paths form the new first segment routing path.
  • the first segment routing path after splicing the first reachable path and the second reachable path to obtain the first segment routing path, the first segment routing path also needs to be verified to verify Whether the first segment routing path satisfies the mandatory constraints of the SL level. If the first segment routing path does not satisfy the mandatory constraints of the SL level, the first segment routing path still needs to be updated until the target segment routing path is obtained.
  • updating the starting point according to the constraints to obtain the updated starting point includes: when the judgment result of the must-pass constraint is that the node must pass through the constraint, the must-pass node included in the node must-pass constraint is set as the update starting point; when the must-pass constraint is When the constraint judgment result is that the link must pass through the constraint, the end point of the must-pass link included in the link must pass through constraint is set as the update starting point.
  • the starting point needs to be updated according to the constraints to obtain the updated starting point.
  • the must-pass node of the node must-pass constraint needs to be set as the update starting point, and the shortest reachable path from the update start point to the must-pass node closest to the update start point is calculated.
  • the must-travel constraint is a link must-travel constraint
  • the link must-travel constraint must be If the starting node is converted into a must-pass node, then after obtaining the shortest reachable path from the starting point to the starting node of the must-pass link, it is also necessary to set the end point of the must-pass link included in the link must-pass constraint as the update starting point. Calculate the shortest reachable path from the update start point to the nearest must-pass node from the update start point.
  • the target segment routing path is the first segment routing path, and the path can be executed on the network based on the target segment routing path. Release operation.
  • the starting point of the topology data information is A
  • the end point is E
  • the necessary link that the link must pass through is C to M
  • the starting node C of the necessary link C to M is converted into the necessary node C, and then combined with the shortest path calculation method, the first segment routing path with the starting point A and the end point E is obtained, that is, A-B-C-D-E.
  • the first score After getting the segment routing path is obtained, it is verified, and the verification result does not satisfy the constraint that the link must pass from C to M, so the first segment routing path needs to be updated.
  • the topology data information needs to be calculated again according to the shortest path calculation method.
  • the target segment routing path is the first segment routing path.
  • the network execution path can be executed based on the target segment routing path. Send operation.
  • the embodiment of the present application provides another shortest path calculation method, including but not limited to step S610, step S620, step S630, step S640, and step S650.
  • Step S610 Calculate several reachable paths from the starting point to the necessary nodes to obtain the first path set.
  • Step S620 Update the starting point according to the constraints to obtain an updated starting point, and obtain a second path set based on several reachable paths from the updated starting point to the next necessary node.
  • Step S630 Arrange and combine the first path set and the second path set to obtain a third path set.
  • Step S640 Exclude the third path set according to constraints to obtain a fourth path set.
  • Step S650 Sort the fourth path set according to the preset policy to obtain the first segment routing path.
  • the first segment routing path after setting the weight according to the priority of the constraint and calculating the topology data information to obtain the first segment routing path, the first segment routing path also needs to be verified, such as the first The segment routing path does not meet the mandatory constraints of the SL level, and the first segment routing path needs to be updated, that is, the first segment routing path is calculated according to the second path calculation method of this application; after the first reachable path and After splicing the second reachable path and obtaining the first segmented routing path, the first segmented routing path still needs to be verified. If the first segmented routing path still does not meet the mandatory constraints of the SL level, it is necessary to verify the first segmented routing path according to this application.
  • the third path calculation method calculates the first segment routing path.
  • the third path calculation method is to first calculate several reachable paths from the starting point to the must-pass nodes, and then arrange and combine these reachable paths to obtain the first path set, and then update the starting point according to the second path calculation method.
  • the method updates the starting point to obtain the updated starting point, and calculates several reachable paths from the updated starting point to the must-pass nodes closest to the updated starting point.
  • the second path set is obtained, and then Arrange the first path set and the second path set according to the constraints to obtain several reachable paths from the starting point to the end point, that is, the third path set.
  • the policy sorts the fourth path set, selects the shortest path, and obtains the first segment routing path.
  • the first segment routing path still needs to be verified. If the first segment routing path still does not meet the SL level Mandatory constraints, the first segment routing path needs to be updated, that is, the first segment routing path is updated again according to the third path calculation method until all paths of the topology data information are traversed, as obtained at this time.
  • the first segment routing path still does not meet the mandatory constraints of the SL level, and the verification result is that the path is unreachable, and the shortest path calculation method can be terminated directly to save network traffic.
  • sorting the fourth path set according to the preset strategy to obtain the first segment routing path includes: sorting the fourth path set in order from short to long according to the preset strategy, and in the fourth Select the shortest reachable path from the path set to obtain the first segment routing path.
  • the fourth path combination includes several different reachable paths, so it is necessary to sort the reachable paths included in the fourth path set in order from shortest to longest, and select the shortest reachable path among them, to obtain First segment routing path.
  • the starting point of the topology data information is A
  • the end point is E
  • the mandatory node that the link must pass through is C
  • the mandatory node is D
  • the path calculation method obtains the first segment routing path with starting point A and ending point E, that is, ABCDE. After obtaining the first segment routing path, it is verified. The verification result does not satisfy the required node D, so An update to the first segment routing path is required.
  • the topology data information needs to be calculated again according to the second shortest path calculation method.
  • the shortest reachable path from the starting point A to the must-pass node C nearest to A needs to be calculated to obtain the first reachable path ABC, and then according to the must-pass node Constraint C updates the starting point, and sets the must-pass node C as the updated starting point.
  • the second reachable path ME is obtained, because at this time, the updated starting point to For the second reachable path of the end point, the first reachable path and all the second reachable paths can be spliced to obtain the first segment routing path, which is: ABCME.
  • the verification result does not satisfy the required node D.
  • the topology data information needs to be calculated according to the third shortest path calculation method.
  • the first path set includes: A-B-C and A-H-C, and then update the starting point according to the node must-pass constraint C, set the must-pass node C as the update starting point, and obtain several reachable paths based on the update of the reachable path from the starting point C to the end point E closest to C, namely
  • the second path set includes: C-D-E and C-M-E.
  • the first path set and the second path set can be arranged and combined to obtain the third path set.
  • the third path set includes: A-B-C-D-E, A-B-C-M-E, A-H-C-D-E, A-H-C-M-E.
  • the third path set is excluded according to the node must-travel constraint C and the must-row node D, and the reachable paths that have not passed the must-travel constraint and the reachable paths that have passed the must-row constraint are excluded, and the fourth path set is obtained.
  • Path set the fourth path set includes: A-B-C-M-E and A-H-C-M-E. According to the preset strategy, the fourth path set is sorted from shortest to longest, and the shortest reachable path is selected as A-B-C-M-E.
  • A-B-C-M-E is the first point.
  • Segment routing path after obtaining the first segment routing path, verify it, and obtain the verification result that satisfies the necessary constraints and other constraints.
  • the target segment routing path is the first segment routing path, which can be calculated according to The target segment routing path performs path delivery operations to the network.
  • the first segment routing path is verified according to the constraints and the verification result is obtained, including one of the following: when the first segment routing path does not satisfy the constraints, the verification result is that the conditions are not met; when the first segment routing path does not satisfy the constraints, the verification result is that the conditions are not met; When a segment routing path satisfies the constraints, the verification result is that the conditions are met.
  • constraints include must-travel constraints, must-row constraints and other constraints.
  • the first segment routing path needs to be verified according to the constraints, including: verifying the first segment routing path. Whether the segment routing path meets the mandatory constraints of the SL level, such as whether it meets the maximum delay constraint, minimum delay constraint, delay difference constraint, maximum hop count constraint, and must-travel constraint. If it does not meet the calibration conditions, it means that the first If the segment routing path does not meet the mandatory constraints of the SL level, the first segment routing path needs to be updated until the calibration conditions are met; if the calibration conditions are met, the first segment routing path is the target segment routing path at this time.
  • the maximum delay constraint is: once the maximum delay constraint is configured on the candidate path, the sum of delays of the SL path links must be less than the maximum delay;
  • the minimum delay constraint is: once the minimum delay constraint is configured on the candidate path, the SL path link The sum of the delays of the paths must be greater than the minimum delay;
  • the delay difference constraint is: the delay difference constraint threshold T of the SL level. The total delay is obtained for multiple SLs in the candidate path, and the delay of each SL is required. The difference cannot exceed the threshold; the maximum hop count constraint is: This constraint only takes effect under the "minimum hop policy", and the number of SL path links is required to be less than the minimum hop count constraint.
  • the first segment routing path is updated according to the verification result until the calibration condition is met, and the target segment routing path is obtained, including one of the following: when the verification result is that the condition is not met, it is updated according to the shortest path calculation method The first segment routing path; when the verification result satisfies the condition, the first segment routing path is the target segment routing path.
  • the path calculation method of this application can calculate the optimal reachable path, that is, the target segment routing path, every time the first segment routing path is calculated, it should be verified. .
  • the shortest path calculation method should be used to update the first segment routing path based on the verification results.
  • the first segment routing path is the target. Segment routing path can perform path delivery operations to the network based on the target segment routing path.
  • embodiments of the present application provide a controller, including a route calculation module, a southbound interface, and a northbound interface.
  • Route calculation module the route calculation module is configured to execute the path calculation method as in the first embodiment of the present application, for example, execute the above-described method steps S110 to S130 in Figure 1, method steps S210 to S220 in Figure 2, Method steps S310 to S330 in FIG. 3 , method steps S410 to S420 in FIG. 4 , method steps S510 to S530 in FIG. 5 , and method steps S610 to S650 in FIG. 6 .
  • the southbound interface is set to receive topology data information sent by the network, and forward the topology data information to the route calculation module.
  • the southbound interface is also set to receive the target segment routing path sent by the route calculation module, and forward the topology data information to the route calculation module.
  • the target segment routing path is delivered to the network;
  • the northbound interface is configured to receive analysis requests sent by external clients and forward the analysis requests to the route calculation module.
  • FIG 8 is a schematic structural diagram of a controller provided by an embodiment of the present application; it can be understood that the controller has the function of collecting global topology data information of the network, and the controller includes a route calculation module, and the route calculation module can With the controller's global view, the network's topological data information is obtained and calculated. And the route calculation module actually contains many functions. It is a complex system in itself. In addition to the route calculation function, it also has resource management functions and graph management functions. The route calculation module coordinates and schedules the interaction between various functional modules to achieve The purpose of route calculation.
  • the route calculation module is connected to the network through the southbound interface.
  • the southbound interface is set to receive the topology data information sent by the network and forward the topology data information to the route calculation module.
  • the southbound interface is also set to receive the target points sent by the route calculation module. segment routing path and delivers the target segment routing path to the network; the route calculation module is connected to the client through the northbound interface, and the northbound interface is set to receive analysis requests sent by external clients and forward the analysis requests to the route calculation module.
  • the network includes several IP network devices, such as routers, switches, etc.
  • the path calculation method of this application can be applied to large-scale traffic engineering, such as several network devices in a certain community, a certain village, a certain urban area, a certain province, and a certain region. Because of the large scale and complex network environment, the involved Constraints and routing strategies are also complex and changeable. Traditional methods usually cannot take into account both calculation speed and superimposed routing constraints in complex network environments. Through the path calculation method of this application, the path calculation method can be obtained in a short time based on the network topology data information. The optimal reachable path can also ensure that the routing quality of the SR Policy can strictly meet user requirements.
  • the analysis request initiated by the operator reaches the routing calculation module through the northbound interface.
  • the routing calculation module obtains the topology data information of the network through the southbound interface, and performs the analysis on the routing calculation module.
  • the topology data information is analyzed and path calculated, and finally the target segment routing path is obtained.
  • the path delivery operation is performed based on the target segment routing path, that is, the service channel is delivered through the southbound interface, and the target segment routing path is delivered to
  • the network enables network devices in the network to forward bandwidth/traffic according to the target routing path.
  • users can use the client to configure the SR Policy of the network, such as adding the AZ point of the SR Policy, the number of candidate paths, the priority of the candidate paths, SL data within the candidate paths, and various constraints.
  • an embodiment of the present application provides an electronic device, including:
  • Programs are stored in memory and the processor executes at least one program to achieve:
  • the processor and memory can be connected via a bus or other means.
  • memory can be used to store non-transitory software instructions and non-transitory instructions.
  • the memory may include high-speed random access memory and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device.
  • the memory may include memory located remotely relative to the processor, and that the remote memory may be connected to the processor via a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the processor executes non-transient software instructions, instructions and signals stored in the memory to implement various functional applications and data processing, that is, to implement the path calculation method of the above-mentioned first aspect embodiment.
  • the non-transient software instructions and instructions required to implement the path calculation method of the above embodiment are stored in the memory.
  • the path calculation method of the first embodiment of the present application is executed.
  • the above-described diagram is executed.
  • inventions of the present application provide a computer-readable storage medium.
  • the computer-readable storage medium stores computer-executable signals.
  • the computer-executable signals are used to execute:
  • Steps S110 to S130 in FIG. 1 For example, the above-described method steps S110 to S130 in FIG. 1 , method steps S210 to S220 in FIG. 2 , method steps S310 to S330 in FIG. 3 , method steps S410 to S420 in FIG. 4 , and the method in FIG. 5 are performed. Steps S510 to S530 and method steps S610 to S650 in Figure 6 .
  • Embodiments of the present application include: obtaining topology data information of the network, analyzing the topology data information, and obtaining the constraints of the segment routing policy; calculating the topology data information according to the constraints, and obtaining the target segment routing path; Perform a path delivery operation according to the target segment routing path. Based on this, compared with the existing path calculation method, this application can quickly calculate the optimal path, that is, the target segment routing path, when multiple constraints are superimposed and must be traversed. Executing path delivery operations ensures network stability and meets business requirements in large-scale networks.
  • the device embodiments described above are only illustrative.
  • the units described as separate components may or may not be physically separated.
  • the components shown as units may or may not be physical units, that is, they may be located in one place. , or it can be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • 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 cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically embodies a computer-readable signal, data structure, instruction module, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请公开了路径计算方法、控制器和计算机可读存储介质，获取网络的拓扑数据信息，对拓扑数据信息进行分析，得到分段路由策略的约束(S110)；根据约束对拓扑数据信息进行计算，得到目标分段路由路径(S120)；根据目标分段路由路径执行路径下发操作(S130)。

Description

路径计算方法、控制器和计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为202210748228.3、申请日为2022年6月29日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及但不限于IP通信技术领域，特别是涉及一种路径计算方法、控制器和计算机可读存储介质。
背景技术
SR Policy(Segment Routing Policy，分段路由策略)是网络的一种策略，这种策略包含了业务流量的承载诉求和转发路径，是当前针对大规模网络的关键技术之一，可以支撑超大规模的流量工程。同时，SR Policy的路由约束复杂多变，当存在着多个约束叠加必经约束的情况下，可能会使得路径计算失败，而降低了路由的稳定性，无法满足大规模网络下的业务要求。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本申请实施例提供了一种路径计算方法、控制器和计算机可读存储介质。
第一方面，本申请实施例提供了一种路径计算方法，包括：获取网络的拓扑数据信息，对所述拓扑数据信息进行分析，得到分段路由策略的约束；根据所述约束对所述拓扑数据信息进行计算，得到目标分段路由路径；根据所述目标分段路由路径执行路径下发操作。
第二方面，本申请实施例提供了一种控制器，包括：路由计算模块，所述路由计算模块被设置为执行如上第一方面所述的路径计算方法；南向接口，所述南向接口被设置为接收网络发送的拓扑数据信息，并将所述拓扑数据信息转发给所述路由计算模块，所述南向接口还被设置为接收所述路由计算模块发送的目标分段路由路径，并将所述目标分段路由路径转发给所述网络；北向接口，所述北向接口被设置为接收外部的客户端发送的分析请求并将所述分析请求转发给所述路由计算模块。
第三方面，本申请实施例提供了一种电子设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现如上第一方面所述的路径计算方法。
第四方面，本申请实施例提供了一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行程序，所述计算机可执行程序用于使计算机执行如上第一方面所述的路径计算方法。
本申请的附加方面和优点将在下面的描述中部分给出，部分将从下面的描述中变得明显，或通过本申请的实践了解到。
附图说明
附图用来提供对本申请技术方案的进一步理解，并且构成说明书的一部分，与本申请的实施例一起用于解释本申请的技术方案，并不构成对本申请技术方案的限制。
图1是本申请一个实施例提供的一种路径计算方法的主流程图；
图2是本申请一个实施例提供的一种路径计算方法的另一子流程图；
图3是本申请一个实施例提供的一种路径计算方法的另一子流程图；
图4是本申请一个实施例提供的一种路径计算方法的另一子流程图；
图5是本申请一个实施例提供的一种路径计算方法的另一子流程图；
图6是本申请一个实施例提供的一种路径计算方法的另一子流程图；
图7是本申请一个实施例提供的一种路径计算方法的另一主流程图；
图8是本申请一个实施例提供的控制器的结构示意图；
图9为本申请一个实施例提供的权重的示意图；
图10为本申请一个实施例提供的拓扑数据信息的示意图；
图11为本申请一个实施例提供的电子设备结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
应了解，在本申请实施例的描述中，多个(或多项)的含义是两个以上，大于、小于、超过等理解为不包括本数，以上、以下、以内等理解为包括本数。如果有描述到“第一”、“第二”等只是用于区分技术特征为目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量或者隐含指明所指示的技术特征的先后关系。
随着5G、多云、物联网的发展以及行业数字化进程的深入，传统网络也面临着许多新的需求，为应对这些新的需求，统一各个不同的域，业界提出了SR Policy(Segment Routing Policy，分段路由策略)。SR Policy是网络的一种策略，这种策略包含了业务流量的承载诉求和转发路径，是当前针对大规模网络的关键技术之一，可以支撑超大规模的流量工程。
SR Policy由头端、颜色和端点表示，其中头端是SR Policy生成/实现的地方；端点是SR Policy的终结点，颜色是SR Policy的重要属性，通常代表意图，可简单理解为SR Policy路由过程中的算路最优策略，表示到达端点的特定方式。其中，SR Policy的候选路径代表将流量从相应的SR Policy头端传送到端点的特定方式，每条候选路径都有一个偏好值，路径的偏好值越高则越优选，SR Policy具有至少一条候选路径，其中具有最高偏好值的有效候选路径是活动候选路径，每条候选路径可以具有一个或者多个SL(Segment List，标签栈)每个SL具有关联的负载均衡权重w，以引导至此路径的流量根据权重比例，在所有的有效SL之间进行负载均衡。
同时，SR Policy的路由约束复杂多变，当存在着多个约束叠加必经约束的情况下，可能会使得路径计算失败，而降低了路由的稳定性，无法满足大规模网络下的业务要求。而且，当前SR Policy的算路方法无法在解决多个复杂约束的叠加的同时兼顾路径最优和速度计算 快。基于此，相较于现有的SR Policy算路方法，本申请的路径计算方法能够在多个约束叠加必经约束的情况下，快速地计算出最优路径，即目标分段路由路径，并根据目标分段路由路径执行路径下发操作，保证了网络的稳定性，满足了大规模网络下的业务要求。
需要说明的是，为了更好地解释本申请的路径计算方法，假设此处的SR Policy配置单个候选路径。
参照图1，第一方面，本申请实施例提供了一种路径计算方法，包括但不限于步骤S110、步骤S120、步骤S130。
步骤S110，获取网络的拓扑数据信息，对拓扑数据信息进行分析，得到分段路由策略的约束。
步骤S120，根据约束对拓扑数据信息进行计算，得到目标分段路由路径。
步骤S130，根据目标分段路由路径执行路径下发操作。
需要说明的是，本申请的路径计算方法能够借助控制器的全局视野，获取网络的拓扑数据信息，因为拓扑数据信息中包含了许多信息，包括网络的节点信息、链路信息和约束等，更细致的划分还有链路的可用资源信息，所以本申请可以通过对拓扑数据信息进行分析，以得到SR Policy的约束。
可以理解的是，约束包括必经约束，必经约束包括链路必经约束和节点必经约束，且链路必经约束和节点必经约束都是强约束，其中链路必经约束指的是SL途径的链路必经包括指定的链路，节点必经约束指的是SL途径的节点必须包括制定的节点。
其中，拓扑数据信息有一个字段，通过这个字段可以直接得出必经约束的类型，如必经约束为链路必经约束，或必经约束为节点必经约束。
需要说明的是，在通过拓扑数据信息得到约束后，本申请能够根据约束对拓扑数据信息进行计算，以在多个约束叠加必经约束的情况下，计算出网络的最优路径，即目标分段路由路径，并根据目标分段路由路径执行路径下发操作，使得网络中的相应网络设备能够根据目标分段路由路径进行引流，即引导至此路径的流量根据权重比例，在所有的有效SL之间进行负载平衡，保证了网络的稳定性，还满足了大规模网络下的业务要求。
根据本申请的一个实施例，SR Policy还包括复杂的路由策略，其中路由策略包含了多种类型，如算路强约束、算路尽力约束、候选路径内的分离策略和候选路径间的分离策略等，使得在对拓扑数据信息进行计算时还应考虑到时延、时延差、跳数和带宽等因素，本申请的路径计算方法同样能够在兼顾到多种路由策略的情况下得到目标分段路由路径。
参照图2，第一方面，本申请实施例提供了一种根据约束对拓扑数据信息进行计算的方法，包括但不限于步骤S210、步骤S220。
步骤S210，判断必经约束，得到判断结果，判断结果为链路必经约束时，对链路必经约束进行转换，得到节点必经约束。
步骤S220，根据节点必经约束对拓扑数据信息进行计算。
需要说明的是，本申请是通过计算两点之间多条最优路径方法，即KSP算法以对拓扑数据信息进行计算的，因为KSP算法一般是以节点信息为基础，以计算节点和节点之间的最短路的，为方便后续KSP算法的运用，需要先判断SR Policy的必经约束类型，根据判断结果进行具体分析。当判断结果为链路必经约束时，需要对链路必经约束进行转换，将链路必经约束转换为对应的节点必经约束，再根据节点必经约束对拓扑数据信息进行计算；当判断结 果为节点必经约束时，无需对节点必经约束进行转换，可直接根据节点必经约束对拓扑数据信息进行计算。
可以理解的是，对链路必经约束进行转换，得到节点必经约束，包括：将链路必经约束的必经链路的起始节点转化为必经节点，根据必经节点得到节点必经约束。
参照图10，图10为本申请一个实施例提供的拓扑数据信息的示意图；根据本申请的一个实施例，当判断结果为链路必经约束，且链路必经约束为C到D时，由于此时链路必经约束的必经链路的起始节点为C点，因此将C点转化为必经节点，由此得到必经节点为C点的节点必经约束，即SR Policy的路径必须经过C点。
参照图3，第一方面，本申请实施例提供了一种根据约束对拓扑数据信息进行计算，得到目标分段路由路径的方法，包括但不限于步骤S310、步骤S320、步骤S330。
步骤S310，结合预设的最短路径计算方法和约束，对拓扑数据信息进行计算，得到第一分段路由路径。
步骤S320，根据约束对第一分段路由路径进行校验，得到校验结果。
步骤S330，根据校验结果更新第一分段路由路径，直至满足校准条件，得到目标分段路由路径。
需要说明的是，在对必经约束完成判断，得到判断结果后，当判断结果为链路必经约束，需要对链路必经约束进行转换，得到节点必经约束，再根据预设的最短路径方法和节点必经约束，对拓扑数据信息进行计算，得到第一分段路由路径；当判断结果为节点必经约束时，可直接根据预设的最短路径方法和节点必经约束，对拓扑数据信息进行计算，得到第一分段路由路径。
可以理解的是，本申请在前K优路径计算中采用最短路径算法，即KSP算法，其核心思想为计算出前K优的路径，获得尽量短的路径。根据本申请的一个实施例，本申请的路径计算方法还可以通过多次调用Dijkstra算法或A*算法以替代KSP算法完成本申请的计算两点间最短路径的功能。
参照图7，图7是本申请一个实施例提供的一种路径计算方法的另一主流程图；可以理解的是，为确保发明的路径计算方法计算的得到的第一分段路由路径是在兼顾多个复杂约束的叠加的情况下的最优路径，在计算得到第一分段路由路径后还需要对第一分段路由路径进行多次校验，并根据校验结果对第一分段路由路径进行更新，直至满足校准条件，得到目标分段路由路径，根据目标分段路由路径进行路径下发。目标分段路由路径能够保证SR Policy的路由质量严格满足用户要求。
参照图4，第一方面，本申请实施例提供了一种最短路径计算方法，包括但不限于步骤S410、S420。
步骤S410，根据约束设置权重。
步骤S420，根据权重对拓扑数据信息进行计算，得到第一分段路由路径。
需要说明的是，最短路径计算方法可以从起点开始计算一条到终点的SL，通过采用试错的想法快速校验第一分段路由路径是否满足要求。另一方面，最短路径计算方法是由路由单个SL路由算法模块来实现的，SL路由算法模块内置了最短路径计算方法，可以根据最短路径计算方法对拓扑数据信息进行多次算路，可以理解的是，SL路由算法模块类似一个迭代器，可供多次调用，以对第一分段路由路径进行多次更新，且SL路由算法模块有迭代次数上限， 当达到预设的迭代次数上限后，即使此时的第一分段路由路径不满足强约束，仍然会终止对拓扑数据信息的计算。
迭代次数上限是由操作人员设置的，设置迭代次数上限是为了节省网络资源，防止造成网络资源浪费。
根据本申请的一个实施例，当SL路由算法模块执行了上万次程序，即对第一分段路由路径进行了上万次更新，已经达到了迭代次数上限，第一分段路由路径仍未满足校准条件，可能是拓扑数据信息内路径不可达造成的，则此时无需再浪费网络流量对第一分段路由路径进行更新，可直接终止对拓扑数据信息进行计算。
需要说明的是，SL路由算法模块内部还设有权重阅读器以约束路径经过的链路和节点，权重阅读器根据约束设置权重，并根据权重对拓扑数据信息进行计算，得到第一分段路由路径。权重阅读器会根据权重的数值以规避拓扑数据信息中的必排链路和必排节点，得到第一分段路由路径，其中权重的数值根据约束的类型而确定，使得本申请的路径计算方法实现过滤必排链路和必排节点的目的。
参照图7，需要说明的是，在根据约束对拓扑数据信息进行计算，得到第一分段路由路径后，还需要对第一分段路由路径进行校验，以校验第一分段路由路径是否满足SL级别的强制约束，如第一分段路由路径不满足SL级别的强制约束，还需要对第一分段路由路径进行更新，直至得到目标分段路由路径。
可以理解的是，根据约束设置权重，包括：根据约束的优先级由高到低设置权重的数值，使得拓扑数据信息进行计算时优先避开权重数值高的约束。
需要说明的是，本申请的路径计算方法对于SR Policy配置的强制排除的链路、节点和不满足亲和力、丢包率、流量阈值门限的链路，要求严格不能经过，但拓扑数据信息中包括许多复杂的约束类型，有的约束优先级较高，有的约束优先级较低，为一一对约束进行规避，需要根据约束的优先级由高到低设置权重的数值，使得权重阅读器能够对不同的约束的权重进行层次化区分，以在对拓扑数据信息进行计算时优先避开权重数值高的约束。
根据本申请的一个实施例，如针对不能经过链路和节点，为防止第一分段路由路径经过，需要将其链路权重和节点权重设置成无穷大，以过滤必排链路和必排节点。
参照图9，图9为本申请一个实施例提供的权重的示意图，根据本申请的一个实施例，假设当前约束包括链路分离失败(avoidLinkFail)、节点分离失败(avoidNodeFail)、网元分离失败(avoidNeFail)、共享风险链路组(SRLG，Share Risk Link Group)分离失败、共享风险节点组(SRNG，Share Risk Node Group)分离失败和域分离失败(avoidDomainFail)，其中约束的优先级为：链路分离失败>节点分离失败>网元分离失败>共享风险链路组分离失败>＝共享风险节点组分离失败>＝域分离失败。因为一条路径的跳数一般在64跳以下，所以使得层次权重有64倍数关系，在有基础值initialMax的情况下，权重的大小如图9所示，其中设置了共享风险链路组失败、共享风险节点组失败和域分离失败的权重等同于initialMax，因为initialMax本身也是一个极大的值，其远大于拓扑数据信息中链路本身的权重值，能够使得在对拓扑数据信息进行计算时优先避开权重数值高的约束。在对本申请的拓扑数据信息进行计算时，会优先排除链路分离失败，其次，依次排除节点分离失败、网元分离失败、共享风险链路组分离失败、共享风险节点组分离失败和域分离失败。
其中，链路分离失败、节点分离失败、网元分离失败、共享风险链路组分离失败、共享 风险节点组分离失败和域分离失败都为尽力排除约束，尽力排除约束为分离尽力排除节点、尽力排除链路，且算路时尽量不经过这些元素。链路分离约束为默认策略，即两条SL不能完全重合，链路分离中完全重合的概念是从头到尾三层链路完全一致，类似节点也完全重合；节点分离约束为两条SL的节点不能完全重合，节点分离中完全重合的概念是节点从头到尾完全一致，如两条SL都依次经过了A，B，C三个节点，则这两条SL完全重合，如一条SL经过了A，B，C，另一条SL经过了A，B，C，D，则这两条SL不算重合；共享风险链路组分离约束为两条SL之间，尽量避免途径具有相同共享风险链路组的链路；共享风险节点组分离约束为两条SL之间，尽量避免途径具有相同共享风险节点组的节点。
需要说明的是，如果SR Policy配置了多条候选路径之间的链路分离约束时，当计算第N个候选路径是，会把前N-1个候选路径的所有SL经过的链路当做尽力排除链路，若当前候选路径选择了网元分离，则也会把前N-1个候选路径经过的所有非头尾节点当做尽力排除节点。
其中，尽力排除链路为算路时尽量避开的链路，尽力排除节点为算路时尽量避开的节点。
需要说明的是，约束的优先级为：链路分离失败>节点分离失败>网元分离失败>共享风险链路组分离失败>＝共享风险节点组分离失败>＝域分离失败是默认的共识，当拓扑数据信息中还包含别的约束，操作人员也可根据约束的优先级合理设置权重的大小。
参照图5，第一方面，本申请实施例提供了另一种最短路径计算方法，包括但不限于步骤S510、步骤S520、步骤S530。
步骤S510，计算起点到必经节点的最短的可达路径，得到第一可达路径。
步骤S520，根据约束对起点进行更新，得到更新起点，根据更新起点计算到下一必经节点的最短的可达路径，得到第二可达路径，直至得到所有第二可达路径。
步骤S530，对第一可达路径和第二可达路径进行拼接，得到第一分段路由路径。
需要说明的是，本申请首选的路径计算方法为根据约束设置权重，并根据权重对拓扑数据信息进行计算，以得到的第一分段路由路径，当首选的路径计算方法计算出的第一分段路由路径的校验结果为不满足校准条件时，需要对第一分段路由路径进行更新，即根据本申请次选的路径计算方法计算第一分段路由路径。
因为在结合最短路径计算方法和约束对拓扑数据信息进行计算前，需要对必经约束的类型进行判断，如必经约束为链路必经约束，需要将链路必经约束的必经链路的起始节点转化为必经节点，根据必经节点得到节点必经约束，如必经约束为节点必经约束则直接跳转到计算最短路径步骤，因此此时拓扑数据信息包括起点、终点和若干必经节点，首先需要计算起点到距离起点最近的必经节点的最短的可达路径，得到第一可达路径。再根据约束对起点进行更新，得到更新起点，此时的更新起点为计算第一可达路径时的必经节点，此时可重复计算第一可达路径的步骤，计算更新起点到距离更新起点最近的必经节点的最短可达路径，得到第二可达路径，并不断对起点进行更新，重复上述计算步骤，直至得到更新起点到终点的第二可达路径，最后对第一可达路径和所有第二可达路径进行拼接，可得到第一分段路由路径。
本申请次选的路径计算方法通过多线程并行运用了KSP算法，以得到了起点和最近必经节点、更新起点和最近必经节点、更新起点和终点的最短的可达路径，并通过拼接相应的可达路径，组成了新的第一分段路由路径。
参照图7，需要说明的是，在对第一可达路径和第二可达路径进行拼接，得到第一分段路由路径后，还需要对第一分段路由路径进行校验，以校验第一分段路由路径是否满足SL级别的强制约束，如第一分段路由路径不满足SL级别的强制约束，还需要对第一分段路由路径进行更新，直至得到目标分段路由路径。
可以理解的是，根据约束对起点进行更新，得到更新起点，包括：当必经约束的判断结果为节点必经约束时，将节点必经约束包括的必经节点设为更新起点；当必经约束的判断结果为链路必经约束时，将链路必经约束包括的必经链路的终点设为更新起点。
需要说明的是，在对拓扑数据信息进行计算，得到起点到距离起点最近的必经节点的最短的可达路径，即第一可达路径后，需要根据约束对起点进行更新，以得到更新起点。当必经约束的类型为节点必经约束时，需要将节点必经约束的必经节点设为更新起点，计算更新起点到距离更新起点最近的必经节点的最短可达路径。
在结合最短路径计算方法和约束对拓扑数据信息进行计算前，需要对必经约束的类型进行判断，如必经约束为链路必经约束，需要将链路必经约束的必经链路的起始节点转化为必经节点，则在得到起点到必经链路的起始节点的最短可达路径后，还需要将链路必经约束包括的必经链路的终点设为更新起点，计算更新起点到距离更新起点最近的必经节点的最短可达路径。
参照图10，根据本申请的一个实施例，当拓扑数据信息的起点为A，终点为E，链路必经约束的必经链路为C到D时，首先需要将链路必经约束的必经链路C到D的起始节点C转化为必经节点C，再结合最短路径计算方法计算得到起点为A，终点为E的第一分段路由路径，即A-B-C-D-E，在得到第一分段路由路径后，对其进行校验，得到校验结果满足必经约束及其他约束，此时目标分段路由路径即为第一分段路由路径，可根据目标分段路由路径对网络执行路径下发操作。
参照图10，根据本申请的另一个实施例，当拓扑数据信息的起点为A，终点为E，链路必经约束的必经链路为C到M时，首先需要将链路必经约束的必经链路C到M的起始节点C转化为必经节点C，再结合最短路径计算方法得到起点为A，终点为E的第一分段路由路径，即A-B-C-D-E，在得到第一分段路由路径后，对其进行校验，得到校验结果不满足链路必经约束C到M，因此需要对第一分段路由路径进行更新。需要再次根据最短路径计算方法对拓扑数据信息进行计算，首先需要计算起点A到距离A最近的必经节点C的最短可达路径，得到第一可达路径A-B-C，再根据链路必经约束C到M对起点进行更新，将必经链路的终点M设为更新起点，根据更新起点M计算更新起点M到距离M最近的终点E的可达路径，得到第二可达路径M-E，因为此时已经得到了更新起点到终点的第二可达路径，可对第一可达路径和所有第二可达路径进行拼接，得到第一分段路由路径，为：A-B-C-M-E，在得到第一分段路由路径后，对其进行校验，得到校验结果满足必经约束及其他约束，此时目标分段路由路径即为第一分段路由路径，可根据目标分段路由路径对网络执行路径下发操作。
参照图6，第一方面，本申请实施例提供了另一种最短路径计算方法，包括但不限于步骤S610、步骤S620、步骤S630、步骤S640、步骤S650。
步骤S610，计算起点到必经节点的若干条可达路径，得到第一路径集合。
步骤S620，根据约束对起点进行更新，得到更新起点，根据更新起点到下一必经节点的若干条可达路径，得到第二路径集合。
步骤S630，对第一路径集合和第二路径集合进行排列组合，得到第三路径集合。
步骤S640，根据约束对第三路径集合进行排除，得到第四路径集合。
步骤S650，根据预设的策略对第四路径集合进行排序，得到第一分段路由路径。
参照图7，需要说明的是，在根据约束的优先级设置权重并对拓扑数据信息进行计算，得到第一分段路由路径后，还需要对第一分段路由路径进行校验，如第一分段路由路径不满足SL级别的强制约束，需要对第一分段路由路径进行更新，即根据本申请的第二种路径计算方法计算第一分段路由路径；在对第一可达路径和第二可达路径进行拼接，得到第一分段路由路径后，还需要对第一分段路由路径进行校验，如第一分段路由路径仍然不满足SL级别的强制约束，需要根据本申请第三种路径计算方法计算第一分段路由路径。
第三种路径计算方法为先计算起点到必经节点的若干条可达路径，通过对这若干条可达路径进行排列组合，得到第一路径集合，再根据第二种路径计算方法的更新起点的方法对起点进行更新，得到更新起点，并计算更新起点到距离更新起点最近的必经节点的若干条可达路径，通过对这若干条可达路径进行排列组合，得到第二路径集合，再根据约束对第一路径集合和第二路径集合进行排列，得到若干条从起点到达终点的可达路径，即第三路径集合。在得到第三路径集合后还需要根据约束对第三路径集合进行排除，排除未经过必经约束的可达路径和经过必排约束的可达路径，得到第四路径集合，最后根据预设的策略对第四路径集合进行排序，选取最短的路径，得到第一分段路由路径。
需要说明的是，在根据本申请的第三种路径计算方法得到第一分段路由路径后，还需要对第一分段路由路径进行校验，如第一分段路由路径仍然不满足SL级别的强制约束，需要对第一分段路由路径进行更新，即再次根据第三种路径计算方法对第一分段路由路径进行更新，直至将拓扑数据信息的所有路径均遍历完，如此时得到的第一分段路由路径仍然不满足SL级别的强制约束，则校验结果为路径不可达，可直接结束最短路径计算方法，以节约网络流量。
可以理解的是，根据预设的策略对第四路径集合进行排序，得到第一分段路由路径，包括：根据预设的策略对第四路径集合按照从短到长的顺序排序，在第四路径集合中选取最短的可达路径，得到第一分段路由路径。
可以理解的是，第四路径结合包括若干条不同的可达路径，因此需要对第四路径集合包括的可达路径按照从短到长的顺序排序，并选择其中最短的可达路径，以得到第一分段路由路径。
参照图10，根据本申请的一个实施例，当拓扑数据信息的起点为A，终点为E，链路必经约束的必经节点为C，必排节点为D时，首先结合第一种最短路径计算方法得到起点为A，终点为E的第一分段路由路径，即A-B-C-D-E，在得到第一分段路由路径后，对其进行校验，得到校验结果不满足必排节点D，因此需要对第一分段路由路径进行更新。需要再次根据第二种最短路径计算方法对拓扑数据信息进行计算，首先需要计算起点A到距离A最近的必经节点C的最短可达路径，得到第一可达路径A-B-C，再根据节点必经约束C对起点进行更新，将必经节点C设为更新起点，根据更新起点C到距离C最近的终点E的可达路径，得到第二可达路径M-E，因为此时已经得到了更新起点到终点的第二可达路径，可对第一可达路径和所有第二可达路径进行拼接，得到第一分段路由路径，为：A-B-C-M-E，在得到第一分段路由路径后，对其进行校验，得到校验结果不满足必排节点D。
此时需要根据第三种最短路径计算方法对拓扑数据信息进行计算，首先计算起点A到距离A最近的必经节点C的若干条可达路径，得到第一路径集合，第一路径集合包括：A-B-C和A-H-C，再根据节点必经约束C对起点进行更新，将必经节点C设为更新起点，根据更新起点C到距离C最近的终点E的可达路径，得到若干条可达路径，即第二路径集合，第二路径集合包括：C-D-E和C-M-E，此时可对第一路径集合和第二路径集合进行排列组合，得到第三路径集合，第三路径集合包括：A-B-C-D-E、A-B-C-M-E、A-H-C-D-E、A-H-C-M-E。在得到第三路径集合后，根据节点必经约束C和必排节点D对第三路径集合进行排除，排除未经过必经约束的可达路径和经过必排约束的可达路径，得到第四路径集合，第四路径集合包括：A-B-C-M-E和A-H-C-M-E，根据预设的策略对第四路径集合按照从短至长的顺序排序，选取得到最短的可达路径为A-B-C-M-E，此时A-B-C-M-E即为第一分段路由路径，在得到第一分段路由路径后，对其进行校验，得到校验结果满足必经约束及其他约束，此时目标分段路由路径即为第一分段路由路径，可根据目标分段路由路径对网络执行路径下发操作。
可以理解的是，根据约束对第一分段路由路径进行校验，得到校验结果，包括以下之一：当第一分段路由路径不满足约束时，校验结果为不满足条件；当第一分段路由路径满足约束时，校验结果为满足条件。
需要说明的是，约束包括必经约束、必排约束和其他约束，在计算得到第一分段路由路径后还需要根据约束对第一分段路由路径进行校验，包括：校验第一分段路由路径是否满足SL级别的强制约束，如是否满足最大时延约束、最小时延约束、时延差约束、最大跳数约束、必经约束，如不满足校准条件，则说明此刻的第一分段路由路径不满足SL级别的强制约束，还需要对第一分段路由路径进行更新，直至满足校准条件；如满足校准条件，则此时第一分段路由路径为目标分段路由路径。
其中，最大时延约束为：候选路径一旦配置最大时延约束，SL途径链路的时延之和必须小于最大时延；最小时延约束为：候选路径一旦配置最小时延约束，SL途径链路的时延之和必须大于最小时延；时延差约束为：SL级别的时延差约束阈值T，对候选路径内的多条SL分别求得总的时延，要求各个SL的时延差不能超过阈值；最大跳数约束为：该约束只在“最小跳策略下”才生效，要求SL途径链路的个数要小于最小跳数约束。
可以理解的是，根据校验结果更新第一分段路由路径，直至满足校准条件，得到目标分段路由路径，包括以下之一：当校验结果为不满足条件时，根据最短路径计算方法更新第一分段路由路径；当校验结果为满足条件时，第一分段路由路径为目标分段路由路径。
需要说明的是，为保证本申请的路径计算方法能够计算出最优的可达路径，即目标分段路由路径，在每次计算得到第一分段路由路径后，都应该对其进行校验。当校验结果为不满足条件时，应根据校验结果，使用最短路径计算方法对第一分段路由路径进行更新，当校验结果为满足条件时，此时第一分段路由路径为目标分段路由路径，可根据目标分段路由路径对网络执行路径下发操作。
第二方面，本申请实施例提供了一种控制器，包括路由计算模块、南向接口和北向接口。
路由计算模块，路由计算模块被设置为执行如本申请第一方面实施例的路径计算方法，例如，执行以上描述的图1中的方法步骤S110至S130、图2中的方法步骤S210至S220、图3中的方法步骤S310至S330、图4中的方法步骤S410至S420、图5中的方法步骤S510至S530、图6中的方法步骤S610至S650。
南向接口，南向接口被设置为接收网络发送的拓扑数据信息，并将拓扑数据信息转发给路由计算模块，南向接口还被设置为接收路由计算模块发送的目标分段路由路径，并将目标分段路由路径下发给网络；
北向接口，北向接口被设置为接收外部的客户端发送的分析请求并将分析请求转发给路由计算模块。
参照图8，图8是本申请一个实施例提供的控制器的结构示意图；可以理解的是，控制器具有收集网络的全局的拓扑数据信息的功能，控制器包括路由计算模块，路由计算模块可以借助控制器的全局视野，获取网络的拓扑数据信息并对其进行计算。且路由计算模块实际上包含了许多功能，其自身就是一个复杂的系统，除了路由计算功能，还有资源管理功能和图管理功能等，路由计算模块通过协调调度各功能模块之间的交互，达到路由计算的目的。路由计算模块通过南向接口和网络连接，南向接口被设置为接收网络发送的拓扑数据信息并将拓扑数据信息转发给路由计算模块，南向接口还被设置为接收路由计算模块发送的目标分段路由路径并将目标分段路由路径下发给网络；路由计算模块通过北向接口和客户端连接，北向接口被设置为接收外部的客户端发送的分析请求并将分析请求转发给路由计算模块。
需要说明的是，网络包括若干IP网络设备，如路由器、交换机等。本申请的路径计算方法可应用于大规模的流量工程，如某个小区、某个村、某市区、某省、某区域的若干网络设备，因为规模较大，网络环境复杂，涉及到的约束和路由策略也复杂多变，传统的方法通常无法在复杂的网络环境下同时兼顾到计算速度和叠加的路由约束，通过本申请的路径计算方法可以根据网络的拓扑数据信息在短时间内得到最优的可达的路径，同时还能够保证SR Policy的路由质量能够严格满足用户的要求。
根据本申请的一个实施例，操作人员在客户端触发操作后，发起的分析请求通过北向接口到达路由计算模块，路由计算模块接收到分析请求后通过南向接口获取网络的拓扑数据信息，并对拓扑数据信息进行分析和算路操作，最后得到目标分段路由路径，根据目标分段路由路径执行路径下发操作，即通过南向接口进行业务通道下发，将目标分段路由路径下发给网络，使得网络中的网络设备根据目标路由路径进行带宽/流量的转发。其中，用户可使用客户端配置网络的SR Policy，如添加SR Policy的AZ点、候选路径的个数、候选路径的优先级、候选路径内的SL数据及各种约束等。
第三方面，参照图11，本申请实施例提供了一种电子设备，包括：
-至少一个存储器；
-至少一个处理器；
-至少一个程序；
-程序被存储在存储器中，处理器执行至少一个程序以实现：
-如本申请第一方面任一项实施例的路径计算方法。
-处理器和存储器可以通过总线或者其他方式连接。
存储器作为一种非暂态可读存储介质，可用于存储非暂态软件指令以及非暂态性可指令。此外，存储器可以包括高速随机存取存储器，还可以包括非暂态存储器，例如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。可以理解的是，存储器可包括相对于处理器远程设置的存储器，这些远程存储器可以通过网络连接至该处理器。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
处理器通过运行存储在存储器中的非暂态软件指令、指令以及信号，从而各种功能应用以及数据处理，即实现上述第一方面实施例的路径计算方法。
实现上述实施例的路径计算方法所需的非暂态软件指令以及指令存储在存储器中，当被处理器执行时，执行本申请第一方面实施例的路径计算方法，例如，执行以上描述的图1中的方法步骤S110至S130、图2中的方法步骤S210至S220、图3中的方法步骤S310至S330、图4中的方法步骤S410至S420、图5中的方法步骤S510至S530、图6中的方法步骤S610至S650。
第四方面，本申请实施例提供了一种计算机可读存储介质，计算机可读存储介质存储有计算机可执行信号，计算机可执行信号用于执行：
如发明第一方面任一项实施例的路径计算方法。
例如执行以上描述的图1中的方法步骤S110至S130、图2中的方法步骤S210至S220、图3中的方法步骤S310至S330、图4中的方法步骤S410至S420、图5中的方法步骤S510至S530、图6中的方法步骤S610至S650。
本申请实施例包括：获取网络的拓扑数据信息，对所述拓扑数据信息进行分析，得到分段路由策略的约束；根据所述约束对所述拓扑数据信息进行计算，得到目标分段路由路径；根据所述目标分段路由路径执行路径下发操作。基于此，相较于现有的路径计算方法，本申请能够在多个约束叠加必经约束的情况下，快速地计算出最优路径，即目标分段路由路径，并根据目标分段路由路径执行路径下发操作，保证了网络的稳定性，满足了大规模网络下的业务要求。以上所描述的装置实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
通过以上的实施方式的描述，本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在可读介质上，可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读信号、数据结构、指令模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读信号、数据结构、指令模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
上面结合附图对本申请实施例作了详细说明，但是本申请不限于上述实施例，在所属技术领域普通技术人员所具备的知识范围内，还可以在不脱离本申请范围的前提下，做出各种变化。

Claims (15)

  1. 一种路径计算方法，包括：
    获取网络的拓扑数据信息，对所述拓扑数据信息进行分析，得到分段路由策略的约束；
    根据所述约束对所述拓扑数据信息进行计算，得到目标分段路由路径；
    根据所述目标分段路由路径执行路径下发操作。
  2. 根据权利要求1所述的路径计算方法，其中，所述约束包括必经约束，所述根据所述约束对所述拓扑数据信息进行计算，包括：
    判断所述必经约束，得到判断结果；所述判断结果为链路必经约束时，对所述链路必经约束进行转换，得到节点必经约束；
    根据所述节点必经约束对所述拓扑数据信息进行计算。
  3. 根据权利要求2所述的路径计算方法，其中，所述对所述链路必经约束进行转换，得到节点必经约束，包括：
    将所述链路必经约束的必经链路的起始节点转化为必经节点，根据所述必经节点得到所述节点必经约束。
  4. 根据权利要求2所述的路径计算方法，其中，所述根据所述约束对所述拓扑数据信息进行计算，得到目标分段路由路径，还包括：
    结合预设的最短路径计算方法和所述约束，对所述拓扑数据信息进行计算，得到第一分段路由路径；
    根据所述约束对所述第一分段路由路径进行校验，得到校验结果；
    根据所述校验结果更新所述第一分段路由路径，直至满足校准条件，得到所述目标分段路由路径。
  5. 根据权利要求4所述的路径计算方法，其中，所述最短路径计算方法包括：
    根据所述约束设置权重；
    根据所述权重对所述拓扑数据信息进行计算，得到所述第一分段路由路径。
  6. 根据权利要求5所述的路径计算方法，其中，所述根据所述约束设置权重，包括：
    根据所述约束的优先级由高到低设置所述权重的数值，使得对所述拓扑数据信息进行计算时优先避开所述权重数值高的所述约束。
  7. 根据权利要求4所述的路径计算方法，其中，所述拓扑数据信息包括起点、若干所述必经节点和终点，所述最短路径计算方法还包括：
    计算所述起点到所述必经节点的最短的可达路径，得到第一可达路径；
    根据所述约束对所述起点进行更新，得到更新起点，根据所述更新起点计算到下一所述必经节点的最短的可达路径，得到第二可达路径，直至得到所有所述第二可达路径；
    对所述第一可达路径和所述第二可达路径进行拼接，得到所述第一分段路由路径。
  8. 根据权利要求7所述的路径计算方法，其中，所述根据所述约束对所述起点进行更新，得到更新起点，包括：
    当所述必经约束的判断结果为所述节点必经约束时，将所述节点必经约束包括的必经节点设为所述更新起点；
    当所述必经约束的判断结果为所述链路必经约束时，将所述链路必经约束包括的必经链 路的终点设为所述更新起点。
  9. 根据权利要求8所述的路径计算方法，还包括：
    计算所述起点到所述必经节点的若干条可达路径，得到第一路径集合；
    根据所述约束对所述起点进行更新，得到更新起点，根据所述更新起点到下一所述必经节点的若干条可达路径，得到第二路径集合；
    对所述第一路径集合和所述第二路径集合进行排列组合，得到第三路径集合；
    根据所述约束对所述第三路径集合进行排除，得到第四路径集合；
    根据预设的策略对所述第四路径集合进行排序，得到所述第一分段路由路径。
  10. 根据权利要求9所述的路径计算方法，其中，所述根据预设的策略对所述第四路径集合进行排序，得到所述第一分段路由路径，包括：
    根据预设的策略对所述第四路径集合按照从短至长的顺序排序，在所述第四路径集合中选取最短的可达路径，得到所述第一分段路由路径。
  11. 根据权利要求4所述的路径计算方法，其中，所述根据所述约束对所述第一分段路由路径进行校验，得到校验结果，包括以下之一：
    当所述第一分段路由路径不满足所述约束时，所述校验结果为不满足条件；
    当所述第一分段路由路径满足所述约束时，所述校验结果为满足条件。
  12. 根据权利要求11所述的路径计算方法，其中，所述根据所述校验结果更新所述第一分段路由路径，直至满足校准条件，得到所述目标分段路由路径，包括以下之一：
    当所述校验结果为不满足条件时，根据所述最短路径计算方法更新所述第一分段路由路径；
    当所述校验结果为满足条件时，所述第一分段路由路径为所述目标分段路由路径。
  13. 一种控制器，包括：
    路由计算模块，所述路由计算模块被设置为执行如权利要求1至12中任一项所述的路径计算方法；
    南向接口，所述南向接口被设置为接收网络发送的拓扑数据信息，并将所述拓扑数据信息转发给所述路由计算模块，所述南向接口还被设置为接收所述路由计算模块发送的目标分段路由路径，并将所述目标分段路由路径下发给所述网络；
    北向接口，所述北向接口被设置为接收外部的客户端发送的分析请求并将所述分析请求转发给所述路由计算模块。
  14. 一种电子设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如权利要求1至12中任一项所述的路径计算方法。
  15. 一种计算机可读存储介质，存储有计算机可执行程序，其中，所述计算机可执行程序用于使计算机执行如权利要求1至12中任一项所述的路径计算方法。
PCT/CN2023/076231 2022-06-29 2023-02-15 路径计算方法、控制器和计算机可读存储介质 WO2024001210A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210748228.3A CN117354160A (zh) 2022-06-29 2022-06-29 路径计算方法、控制器和计算机可读存储介质
CN202210748228.3 2022-06-29

Publications (1)

Publication Number Publication Date
WO2024001210A1 true WO2024001210A1 (zh) 2024-01-04

Family

ID=89358112

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/076231 WO2024001210A1 (zh) 2022-06-29 2023-02-15 路径计算方法、控制器和计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN117354160A (zh)
WO (1) WO2024001210A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109194577A (zh) * 2018-10-23 2019-01-11 清华大学 一种基于部分部署的分段路由网络的流量工程方法及装置
CN109412954A (zh) * 2017-08-18 2019-03-01 中国电信股份有限公司 基于无序节点约束的路由确定方法、装置以及存储介质
CN112448886A (zh) * 2019-08-30 2021-03-05 中兴通讯股份有限公司 最短路径计算方法、路由获取装置及服务器
CN113542123A (zh) * 2021-05-31 2021-10-22 网络通信与安全紫金山实验室 一种转发路径的确定方法及装置
US20220103463A1 (en) * 2020-09-30 2022-03-31 Juniper Networks, Inc. Recomputation of multipaths in a segment routing-enabled network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109412954A (zh) * 2017-08-18 2019-03-01 中国电信股份有限公司 基于无序节点约束的路由确定方法、装置以及存储介质
CN109194577A (zh) * 2018-10-23 2019-01-11 清华大学 一种基于部分部署的分段路由网络的流量工程方法及装置
CN112448886A (zh) * 2019-08-30 2021-03-05 中兴通讯股份有限公司 最短路径计算方法、路由获取装置及服务器
US20220103463A1 (en) * 2020-09-30 2022-03-31 Juniper Networks, Inc. Recomputation of multipaths in a segment routing-enabled network
CN113542123A (zh) * 2021-05-31 2021-10-22 网络通信与安全紫金山实验室 一种转发路径的确定方法及装置

Also Published As

Publication number Publication date
CN117354160A (zh) 2024-01-05

Similar Documents

Publication Publication Date Title
EP3687124B1 (en) Method and network device for computing forwarding path
EP3414874B1 (en) Border gateway protocol for communication among software defined network controllers
JP6393773B2 (ja) Ｉｐネットワークにおける部分ソフトウェア定義ネットワークのスイッチ置換
US9571381B2 (en) System and method for inter-domain RSVP-TE LSP load balancing
US20140029438A1 (en) SYSTEM, METHOD AND APPARATUS CONFORMING PATH COST CRITERIA ACROSS MULTIPLE ABRs
US10348632B2 (en) Traffic steering
US9166903B2 (en) System, method and apparatus to resolve RPF-vector attribute conflicts
JP2013510459A (ja) 分離的なパス計算アルゴリズム
US9049145B2 (en) Method and apparatus for calculating MPLS traffic engineering paths
CN103795628A (zh) 提供商链路状态桥接（plsb）计算方法
CN112291151B (zh) 一种报文转发方法、装置、网络设备及存储介质
US20130058324A1 (en) Method for establishing associated bidirectional label switching path and system thereof
CN112615780A (zh) 一种sdn网络中数据流的备选路径确定方法及装置
CN114448877A (zh) 路径切换方法、设备及系统
CN113542120A (zh) 一种路径选择方法及装置、计算机可读存储介质
US9001651B2 (en) Method for call admission control in MPLS networks
WO2024001210A1 (zh) 路径计算方法、控制器和计算机可读存储介质
CN107710701B (zh) 约束分离路径计算
US20120176930A1 (en) System and method for providing co-signaled return label switch paths
WO2018219298A1 (zh) 一种pcc请求算路失败的处理方法及装置
US8798050B1 (en) Re-optimization of loosely routed P2MP-TE sub-trees
JP2010199882A (ja) 通信システム、経路計算装置、経路計算方法及びプログラム
JP4673329B2 (ja) マルチキャストツリーを作成するための装置、方法及びプログラム
CN103023780A (zh) 一种路由计算方法和装置
CN114448868A (zh) 一种基于分段路由策略的路径调度方法、装置及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23829403

Country of ref document: EP

Kind code of ref document: A1