WO2023087844A1 - Procédé et appareil de routage, support de stockage et produit-programme - Google Patents

Procédé et appareil de routage, support de stockage et produit-programme Download PDF

Info

Publication number
WO2023087844A1
WO2023087844A1 PCT/CN2022/115922 CN2022115922W WO2023087844A1 WO 2023087844 A1 WO2023087844 A1 WO 2023087844A1 CN 2022115922 W CN2022115922 W CN 2022115922W WO 2023087844 A1 WO2023087844 A1 WO 2023087844A1
Authority
WO
WIPO (PCT)
Prior art keywords
metric
path
constraint value
value
target
Prior art date
Application number
PCT/CN2022/115922
Other languages
English (en)
Chinese (zh)
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 WO2023087844A1 publication Critical patent/WO2023087844A1/fr

Links

Images

Classifications

    • 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/14—Routing performance; Theoretical aspects
    • 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
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric

Definitions

  • the present application relates to the technical field of communication, in particular to a routing method, a routing device, a storage medium and a program product.
  • RFC8655 describes the architecture of a deterministic network, and defines the QoS (Quality of Service) goals of deterministic forwarding: minimum and maximum delays from source to destination, and bounded delay jitter; allowed packets Loss rate; upper bound on out-of-order packet delivery.
  • QoS Quality of Service
  • deterministic networks adopt means such as resource reservation, explicit routing, and service protection.
  • a deterministic path is a strictly explicit path calculated by a centralized controller, and resources are reserved on nodes along the path to meet the SLA (Service Level Agreement) requirements of deterministic services.
  • SLA Service Level Agreement
  • a virtual network is customized to include deterministic resources, and then a method of providing deterministic routing through a distributed routing protocol in the virtual network.
  • the deterministic resource category is known, and the resources of a specific category can be further classified to reflect different delay accuracy (such as 10ms, 20ms, etc.) or delay jitter accuracy (such as 10us, 20us, etc.).
  • IGP Interior Gateway Protocol, Interior Gateway Protocol
  • IGP uses SPF (Shortest Path First, the shortest path first) to calculate the shortest path, that is, the cumulative metric of the selected optimal path is the smallest among all candidate paths.
  • Embodiments of the present application provide a routing method, a routing device, a storage medium, and a program product.
  • the embodiment of the present application provides a routing method, including: when the network topology changes, calculating the target path to the target node and the target metric constraint value corresponding to the target path; according to the target metric constraint value Perform iterative calculation processing of the temporary path with the first metric constraint value until the metric value of the temporary path satisfies the preset condition; wherein, in the iterative calculation process, each time the temporary path is successfully calculated, the activated the temporary path, and recalculate the temporary path after the activation time of the temporary path reaches a preset time; the first metric constraint value is the metric value corresponding to the initial path to the target node; when The metric value of the temporary path satisfies the preset condition, and the target path is enabled.
  • the embodiment of the present application also provides a routing device, including: a memory, a processor, and a computer program stored on the memory and operable on the processor.
  • a routing device including: a memory, a processor, and a computer program stored on the memory and operable on the processor.
  • the embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, where the computer-executable instructions are used to execute the above-mentioned routing method.
  • the embodiment of the present application further provides a computer program product, including a computer program or a computer instruction, the computer program or the computer instruction is stored in a computer-readable storage medium, and the processor of the computer device reads from the The computer-readable storage medium reads the computer program or the computer instruction, and the processor executes the computer program or the computer instruction, so that the computer device executes the routing method as described above.
  • Fig. 1 is a flow chart of the routing method provided by the first embodiment of the present application
  • Fig. 2 is the flowchart of the first method of step S120 in Fig. 1;
  • Fig. 3 is the flowchart of the method of step S210 in Fig. 2;
  • Fig. 4 is the flowchart of the second method of step S120 in Fig. 1;
  • FIG. 5 is a flow chart of the routing method provided in the second embodiment of the present application.
  • Fig. 6 is the flowchart of the third method of step S120 in Fig. 1;
  • Fig. 7 is a flowchart of a routing method provided by an example of the present application.
  • Fig. 8 is the flowchart of the fourth method of step S120 in Fig. 1;
  • FIG. 9 is a flow chart of the routing method provided in the third embodiment of the present application.
  • FIG. 10 is a flow chart of the routing method provided in the fourth embodiment of the present application.
  • Fig. 11 is the flowchart of the fifth method of step S120 in Fig. 1;
  • FIG. 12 is a schematic diagram of a network topology for performing a routing method applied to a single-path scenario provided by an embodiment of the present application
  • FIG. 13 is a schematic diagram of a network topology for implementing a routing method applied to a multipath scenario provided by an embodiment of the present application;
  • FIG. 14 is a schematic diagram of a network topology for executing a routing method applied to a multipath scenario provided by another embodiment of the present application;
  • Fig. 15 is a schematic structural diagram of a routing device provided by an embodiment of the present application.
  • the present application provides a routing method, a routing device, a storage medium, and a program product.
  • the target path to the target node and the target metric constraint value corresponding to the target path are calculated, and then according to the target metric constraint value and the The first metric constraint value corresponding to the initial path to the target node performs iterative calculation processing of the temporary path until the metric value of the temporary path meets the preset condition, wherein, in the iterative calculation process, each time the temporary path is successfully calculated, enable The temporary path is recalculated after the activation time of the temporary path reaches the preset time.
  • the target path is enabled.
  • the temporary path is introduced multiple times so that the initial path can be smoothly transitioned to the target path, which can reduce the risk of problems that do not meet the measurement constraint requirements due to the adjustment of the initial path to the target path, which is conducive to satisfying certainty
  • the measurement constraint requirements of the business are introduced multiple times so that the initial path can be smoothly transitioned to the target path, which can reduce the risk of problems that do not meet the measurement constraint requirements due to the adjustment of the initial path to the target path, which is conducive to satisfying certainty The measurement constraint requirements of the business.
  • FIG. 1 is a flowchart of a routing method provided by an embodiment of the present application, and the routing method may be applied to a routing device.
  • the routing method may include but not limited to step S110, step S120 and step S130.
  • Step S110 When the network topology changes, calculate the target path to the target node and the target metric constraint value corresponding to the target path.
  • a node or link in the network fails (such as link interruption or interface abnormality), or some new devices are added to the network, or two A path between devices, or changing the delay value, bandwidth, etc. in the current path, is not specifically limited here.
  • the network may be a virtual network, or an original physical network, etc., which are not specifically limited here.
  • the target path can be a converged path.
  • the target path can be the path with the smallest metric value, etc., which can be selected according to the actual situation, and is not specifically limited here.
  • Step S120 Perform iterative calculation processing of the temporary path according to the target metric constraint value and the first metric constraint value until the metric value of the temporary path satisfies the preset condition; wherein, in the iterative calculation process, each time the temporary path is successfully calculated, The temporary path is enabled, and the temporary path is recalculated after the activation time of the temporary path reaches a preset time; the first metric constraint value is a metric value corresponding to the initial path to the target node.
  • step S110 since the target metric constraint value is calculated in step S110, the iterative calculation process of the temporary path can be performed according to the target metric constraint value and the first metric constraint value until the metric value of the temporary path satisfies the preset condition So far, in the iterative calculation process, if the temporary path is successfully calculated, the temporary path will be enabled, and the temporary path will be recalculated after the activation time of the temporary path reaches the preset time.
  • temporary paths are introduced several times so that the initial path can be smoothly transitioned to the target path, which is beneficial to reduce the risk of problems that do not meet the metric constraints caused by adjusting the initial path to the target path.
  • the temporary path can be calculated according to the target metric constraint value and the first metric constraint value, and the metric value of the temporary path can be accumulated according to the temporary path.
  • Types can include IGP (Interior Gateway Protocol, Interior Gateway Protocol) Metric, Unidirectional Link Delay (one-way link delay), TE default metric (default metric), Bandwidth Metric (bandwidth metric), Deterministic Delay Metric (deterministic delay metric) , where Deterministic Delay includes both link delay and intra-node delay, which is not specifically limited in this embodiment.
  • the preset time can be set according to actual conditions, such as 1 second, 100 milliseconds, or 200 microseconds, etc., which are not specifically limited here.
  • the preset condition is that the difference between the metric value of the temporary path and the target metric constraint value does not exceed the second preset threshold, where the second preset threshold may be a jitter value that the route can tolerate. Not specifically limited.
  • the expression form of the temporary route can be the Segment List expression form in the SR (Segment Routing, segment routing) technology, or any other way that can represent the path information, and there is no specific limitation here.
  • Step S130 when the metric value of the temporary path satisfies the preset condition, activate the target path.
  • the metric value of the temporary path can be obtained according to the target metric constraint value and the first metric constraint value in step S120, the metric value of the temporary path can be verified, and when the metric value of the temporary path satisfies the preset condition, the target path can be enabled.
  • the target path to the target node and the target metric constraint value corresponding to the target path can be calculated, and then according to the target metric constraint value and the first metric constraint value to carry out the iterative calculation processing of the temporary path.
  • the temporary path can be enabled, and the temporary path can be recalculated after the activation time of the temporary path reaches the preset time. path until the metric value of the temporary path meets the preset condition.
  • the target path can be enabled.
  • the first metric constraint value is a metric value corresponding to the initial path to the target node.
  • step S120 is further described, and step S120 may include but not limited to step S210 , step S220 and step S230 .
  • Step S210 When the difference between the target metric constraint value and the first metric constraint value exceeds a first preset threshold, update the first metric constraint value according to the first metric constraint value and the first preset threshold.
  • the first metric constraint value can be updated according to the first metric constraint value and the first preset threshold, so that subsequent steps can be based on The updated first metric constraint value calculates a temporary path.
  • the first preset threshold may be a jitter value that the route can tolerate, or other values, which are not specifically limited here.
  • the method for updating the first metric constraint value according to the first metric constraint value and the first preset threshold value may be to update the first metric constraint value in steps of the first preset threshold value, or to update the first metric constraint value in other ways.
  • a metric constraint value which is not specifically limited in this embodiment.
  • Step S220 Calculate a temporary path according to the updated first metric constraint value.
  • step S210 since the first metric constraint value is updated in step S210, the temporary path can be calculated according to the updated first metric constraint value, so that the subsequent step can use the successfully calculated temporary path.
  • the CSPF (Constrained Shortest Path First) algorithm can be used to calculate the temporary path, and other algorithms can also be used to calculate the temporary path, and an appropriate selection can be made according to the actual application situation. Specific limits.
  • the CSPF algorithm is evolved from the shortest path first algorithm. It first deletes nodes and links that do not meet the tunnel constraints in the current topology, and then passes the SPF (Shortest Path First, shortest path first) algorithm. Or calculate it through the SPF (Shortest Path First, shortest path first) algorithm first, and then delete the nodes and links that do not meet the tunnel constraints in the current topology through the CSPF algorithm.
  • the source node first uses SPF to calculate the shortest path to the destination node, that is, the path with the smallest cumulative metric value, and then uses the metric value of the shortest path to step into the third preset threshold as the constraint, and use CSPF calculation to satisfy the constraint other subpaths.
  • the temporary path is a traffic engineering path that satisfies the constraint of the updated first metric constraint value.
  • Step S230 When the temporary path is successfully calculated and the activation time of the temporary path reaches the preset time, re-update the first metric constraint value according to the first preset threshold and the updated first metric constraint value, and re-update the first metric constraint value according to the new The updated first metric constraint value recalculates a new temporary path.
  • the temporary path can be verified.
  • the temporary path is activated.
  • the activation time of the temporary path reaches the preset time, the temporary path can be verified according to The first preset threshold value and the updated first metric constraint value re-update the first metric constraint value, and recalculate a new temporary path according to the re-updated first metric constraint value, so that the subsequent re-enabling of the successful calculation New temporary paths, and so on, until the converged target path is finally used.
  • the preset time may be set according to configuration, which is not specifically limited in this embodiment.
  • the calculated temporary path is verified. When the temporary path meets a certain constraint condition, it indicates that the temporary path is the desired temporary path. That is to say, the temporary path has been successfully calculated.
  • the temporary path is the desired temporary path, which means that the temporary path has been successfully calculated; for another example, when the metric value of the temporary path is equal to the initial first metric constraint value, it indicates that the temporary path is the desired temporary path, that is, Said that the temporary path was successfully calculated.
  • the floating value is closer to the updated first metric constraint value than the initial first metric constraint value, which is not specifically limited in this embodiment.
  • the first metric constraint value is updated according to the first metric constraint value and the first preset threshold.
  • the temporary path is calculated, and when the activation time of the temporary path reaches the preset time, according to the first preset threshold and the updated first A metric constraint value re-updates the first metric constraint value, and recalculates a new temporary path according to the re-updated first metric constraint value, that is, on the basis of the first metric constraint value of the initial path
  • Use the first preset threshold as the step amount to approach the target metric constraint value of the target path, calculate the temporary route with the first metric constraint value after the step as a constraint, and use the temporary route to take effect for a period of time, that is, the preset time, when After the enabling time exceeds the preset time, continue to step into the first preset threshold, calculate the temporary route again and take effect for a preset period of time, and so on, until the converged target path is finally used.
  • step S210 is further described, and step S210 may include but not limited to step S310 and step S320 .
  • Step S310 when the target metric constraint value is greater than the first metric constraint value, add the first metric constraint value and the first preset threshold to obtain an added value;
  • Step S320 Update the added value to the first metric constraint value.
  • the routing method including the above steps S310 to S320, when the target metric constraint value is greater than the first metric constraint value, the first metric constraint value and the first preset threshold are added to obtain the sum Therefore, the added value can be updated to the first metric constraint value, so that step S220 calculates the temporary path according to the updated first metric constraint value.
  • step S210 is further described, and step S210 may include but not limited to step S410 and step S420 .
  • Step S410 When the target metric constraint value is smaller than the first metric constraint value, subtract the first metric constraint value from the first preset threshold to obtain a subtraction value;
  • Step S420 Update the subtraction value to the first metric constraint value.
  • the routing method including the above steps S410 to S420, when the target metric constraint value is less than the first metric constraint value, the first metric constraint value is subtracted from the first preset threshold to obtain the relative and then update the subtraction value to the first metric constraint value, so that step S220 calculates the temporary path according to the updated first metric constraint value.
  • the routing method may further include but not limited to step S510.
  • Step S510 During the iterative calculation process of the temporary path, when the network topology changes, recalculate the new target path to the target node and the new target metric constraint value corresponding to the new target path, and based on the new The target metric constraint value and the first metric constraint value are subjected to the iterative calculation process of the temporary path again.
  • this embodiment can flexibly deal with sudden network topology changes.
  • step S120 is further described, and step S120 may also include but not limited to step S610 and step S620 .
  • Step S610 When the temporary path is not successfully calculated, re-update the first metric constraint value according to the first preset threshold and the updated first metric constraint value.
  • step S120 when the temporary path is not successfully calculated during the iterative calculation process of step S120, that is, the calculated temporary path does not satisfy a certain constraint condition, then according to the first preset threshold and the updated first degree
  • the quantity constraint value re-updates the first metric constraint value, and the constraint condition is not specifically limited here.
  • a floating value when the metric value of the temporary path is less than the difference between the first metric constraint value and the floating value, or the metric value of the temporary path is greater than the sum of the first metric constraint value and the floating value, it means that the temporary path is not
  • the expected temporary path means that the temporary path has not been successfully calculated; for another example, when the metric value of the temporary path is not equal to the initial first metric constraint value, it means that the temporary path is not the expected temporary path, that is to say, the temporary path has not been The temporary path is successfully calculated.
  • the floating value is closer to the updated first metric constraint value than the initial first metric constraint value, which is not specifically limited in this embodiment.
  • Step S620 recalculate the temporary path according to the updated first metric constraint value until the temporary path is successfully calculated.
  • the temporary path can be recalculated according to the re-updated first metric constraint value until the temporary path is successfully calculated, so that the calculation can be enabled again later Successful new temporary paths until the converged target path is finally used.
  • the routing method including the above steps S610 to S620, when the temporary route is not successfully calculated during the iterative calculation process of step S120, then according to the first preset threshold and the updated first Re-update the first metric constraint value with a metric constraint value, and then recalculate the temporary path according to the re-updated first metric constraint value until the temporary path is successfully calculated, so that a new temporary path with successful calculation can be re-enabled later, That is to say, in the process of adjusting the initial path of packet forwarding to the target path, multiple temporary paths are introduced so that the initial path can smoothly transition to the target path, which can reduce the dissatisfaction caused by adjusting the initial path to the target path. Measure the risk of the problem required by the constraint, so that it is beneficial to meet the measurement constraint requirement of the deterministic business.
  • Prefix-D a route to a destination node with a prefix that can handle metric jitter is created on the source node (denoted as S node), and it is recorded to
  • the path corresponding to the current route of Prefix-D is current_path, and the cumulative metric value (metric) of this path is current_metric.
  • node S When node S senses that the network topology changes, it will calculate the converged path for this route, which is recorded as ultimate_path , the cumulative metric of the path is ultimate_metric, then the S node checks the absolute value of the difference between ultimate_metric and current_metric, if it is within the first preset threshold within the limited metric jitter range, record the first preset threshold as ⁇ , then allow ultimate_path to take effect immediately It is used for the route to Prefix-D; otherwise, based on current_metric, step ⁇ along the direction of approaching ultimate_metric, that is, when ultimate_metric is larger than current_metric, the metric value after stepping is current_metric+ ⁇ (this case is called accumulation), when the ultimate_metric is smaller than the current_metric, the stepped metric is current_metric- ⁇ (this situation is called accumulation).
  • the source node uses CSPF to calculate the traffic engineering path satisfying the constraint with the stepped metric as the constraint (recorded as metric_constraint). If the calculation is unsuccessful, take the current_metric as the basis and step 2 ⁇ as the metric_constraint, and then try to calculate the path that satisfies the constraint. If still unsuccessful, take the current_metric as the basis and step 3 ⁇ as the metric_constraint, and so on, until a path satisfying the metric_constraint (denoted as path_x) can be successfully calculated for the temporary route to Prefix-D.
  • the ultimate_path can only take effect for the route to Prefix-D. If ultimate_path takes effect, update current_path to ultimate_path for the route to Prefix-D, update current_metric to the cumulative metric of ultimate_path, and the process ends, waiting for the next topology event to occur. Otherwise, if path_x takes effect instead of ultimate_path, update current_path to path_x for the temporary route to Prefix-D, and update current_metric to the cumulative metric of path_x.
  • path_x will take effect temporarily for a period of time, that is, it will be enabled until the preset time is reached.
  • the effective time of path_x expires, recalculate the traffic engineering path that satisfies the constraint with the stepped metric as the constraint; if a new topology change occurs during the effective period of path_x, the S node needs to calculate a new converged path and Update ulitimate_path. Eventually all stepping will be done gradually and final_path will be used for routing to Prefix-D.
  • step S120 is further described, and step S120 may also include but not limited to step S710 .
  • Step S710 When the re-updated first metric constraint value reaches or exceeds the target metric constraint value, stop the iterative calculation process of the temporary path.
  • step S120 if during the iterative calculation process in step S120, if the re-updated first metric constraint value reaches or exceeds the target metric constraint value, the iterative calculation process of the temporary path is stopped.
  • the re-updated first metric constraint value is equal to or greater than the target metric constraint value, and the iterative calculation process of the temporary path is stopped; if If the initial first metric constraint value is greater than the target metric constraint value, then the re-updated first metric constraint value is equal to or smaller than the target metric constraint value, and the iterative calculation process of the temporary path is stopped.
  • the routing method may further include but not limited to step S810.
  • Step S810 When the iterative calculation processing of the temporary path is stopped, the target path is activated.
  • the target path may be activated after the iterative calculation processing of the temporary path is stopped.
  • the routing method may further include but not limited to step S910.
  • Step S910 When the difference between the target metric constraint value and the first metric constraint value does not exceed a first preset threshold, activate the target path.
  • the target path to the target node and the target metric constraint value corresponding to the target path are calculated, and if the difference between the target metric constraint value and the first metric constraint value does not exceed the first preset threshold, Enable target paths.
  • step S120 is further described. In a case where there are more than two initial paths, step S120 may also include but not limited to step S1010 and step S1020 .
  • Step S1010 Simplify all first metric constraint values to obtain second metric constraint values.
  • the second metric constraint value may be the metric value of the currently effective primary path, which is not specifically limited in this embodiment.
  • Step S1020 Perform iterative calculation processing of the temporary path according to the target metric constraint value and the second metric constraint value.
  • step S1010 since the second metric constraint value is obtained in step S1010, iterative calculation processing of the temporary path can be performed according to the target metric constraint value and the second metric constraint value.
  • the calculation is completely similar to the calculation of a single initial path, except that multiple temporary paths must be calculated each time, and any two initial paths or temporary paths should be The smooth transition condition is met, which is not specifically limited in this embodiment. It should also be noted that when there are multiple initial paths to the destination node in the network, the calculated temporary path will be a set containing multiple sub-paths.
  • the number of subpaths contained in the new temporary path and the old temporary path may be different, which is caused by the different metric constraints on which they are calculated, that is, the number of successfully calculated temporary paths is different ;
  • the new temporary path and the old temporary path generally always contain two sub-paths, the master and the backup.
  • any two initial paths or temporary paths should satisfy the smooth transition condition that the absolute value of the difference between any two first metric constraint values is less than or equal to a third preset threshold, where the third The preset threshold may be the first preset threshold, or other values, or other limiting conditions, which are not specifically limited here.
  • the sub-paths contained in the new temporary path can be compared with the sub-paths contained in the old temporary path to avoid large metric jitters, when the new temporary path is one step ahead of the old temporary path It is only meaningful when there are three preset thresholds, because when stepping n third preset thresholds, the metric jitter is already very large at this time, where n>1, and no specific limitation is set here.
  • the old temporary path when the old temporary path is stepped in an accumulative way, it is necessary to ensure that the calculated new temporary path contains the largest first metric constraint value in the set of sub-routes contained in the old temporary path and the set of sub-paths contained in the old temporary path
  • the difference between the minimum first metric constraint values in can not be greater than twice the third preset threshold, or when the old temporary path is stepping in a cumulative manner, it is necessary to ensure that the child contained in the old temporary path
  • the difference between the largest first metric constraint value in the path set and the smallest first metric constraint value in the sub-path set contained in the new temporary path cannot be greater than twice the third preset threshold.
  • the absolute value of the difference between any two first metric constraint values is less than or equal to the third preset threshold, which is more suitable for ECMP groups or copy elimination groups; for FRR groups, temporary paths may be calculated
  • the metric value of the target path differs greatly from the target metric constraint value of the target path, but such a temporary path is better than nothing.
  • the source node can also be configured with a policy to simplify the processing of the calculated temporary path, that is, a collection of multiple sub-paths, for example, only a single sub-path is included in the temporary path path, and the final effective target path contains multiple sub-paths.
  • the network is an original physical network, including a source node 100, a first node 110, a second node 120, a third node 130, a fourth node 140, a fifth node 150 and a destination Node 190, wherein the source node 100, the first node 110, the second node 120 and the destination node 190 are sequentially connected end to end to form an initial path, and the source node 100, the third node 130, the fourth node 140 and the destination node 190 are sequentially connected end to end to form In the target path, the source node 100, the third node 130, the fifth node 150, and the destination node 190 are sequentially connected end to end to form a temporary path.
  • the process is as follows:
  • the link between the source node 100 and the third node 130 is denoted as link(S-P3), where S is the source node 100, P3 is the third node 130, and the state of the link is interrupted , then the source node 100 calculates the path to the destination node 190 according to the SPF, that is, the initial path, denoted as S-P1-P2-D, where P1 is the first node 110, P2 is the second node 120, and D is the destination node 190. Assuming that a local prefix-D is generated on the destination node 190, after the source node 100 learns the Prefix-D, it will create a corresponding routing entry for the Prefix-D, as follows:
  • Metric value 60 (it is the cumulative metric value of the path S-P1-P2-D)
  • the first preset threshold be 10
  • the floating value be 4
  • the preset time be 1 second.
  • the source node 100 will calculate the target path to the destination node 190 according to the latest topology and SPF as S-P3-P4-D, Wherein P4 is the fourth node 140, the cumulative metric value of this path is 40 (ie, the target metric constraint value), and compared with the cumulative metric value of the currently effective initial path of 60 (ie, the first metric constraint value), the difference has been exceeds the first preset threshold.
  • the source node 100 does not allow the target path to take effect immediately for the route of prefix-D, but uses the updated first metric constraint value 50 (that is, the cumulative step by one The first preset threshold) is to constrain the use of CSPF to calculate the temporary path to the destination node 190, and obtain S-P3-P5-D, wherein, P5 is the fifth node 150, and its accumulated metric value is exactly 50, in [metric_constraint- margin,metric_constraint+margin], where metric_constraint is the updated first metric constraint value, and margin is a floating value, then the source node 100 will temporarily enable the temporary path and update the corresponding routing entry of Prefix-D, as follows:
  • Metric value 50 (it is the cumulative metric value of the path S-P3-P5-D)
  • the source node 100 may start a timer and wait for a preset time of 1 second to expire. Then, on the source node 100, the CSPF calculation is used again with the re-updated first metric constraint value 40 (that is, based on the updated first metric constraint value 50, accumulatively stepping by a first preset threshold) as a constraint
  • the target path can be directly enabled, so the source node 100 updates the corresponding routing entry of Prefix-D, as follows :
  • Metric value 40 (it is the cumulative metric value of path S-P3-P4-D)
  • This example and the above example 1 are based on the same network topology, that is, this example is also applicable to the network topology shown in Figure 12.
  • the difference between this example and the above example 1 is that the network in example 1 is the original physical network, and this example The network is a virtual network, which takes the entire virtual network as an object and configures it to support smooth transition.
  • Flex-algo Flexible Algorithm, flexible algorithm
  • a suggested method is to add related parameters that can smooth transition in FAD (Flexible Algorithm Definition, flexible algorithm definition), such as using Can switch, tolerable jitter value, floating value, preset time of temporary path.
  • the route calculated on each node to any other destination node 190 will automatically support smooth transition.
  • the process is as follows:
  • the link between the source node 100 and the third node 130 is denoted as link(S-P3)
  • the state of the link is interrupted
  • the source node 100 calculates the path to the destination node 190 according to the SPF, namely
  • the initial path is denoted as S-P1-P2-D
  • the first preset threshold is set as 10
  • the floating value is 4
  • the preset time is 1 second.
  • the source node 100 When the network topology changes and the state of the link (S-P3) changes from interruption to normal startup, the source node 100 will calculate the target path to the destination node 190 according to the latest topology and SPF as S-P3-P4-D, Wherein P4 is the fourth node 140, the cumulative metric value of this path is 40 (ie, the target metric constraint value), and compared with the cumulative metric value of the currently effective initial path of 60 (ie, the first metric constraint value), the difference has been exceeds the first preset threshold.
  • the source node 100 does not allow the target path to take effect immediately for the route of prefix-D, but uses the updated first metric constraint value 50 (that is, the cumulative step by one The first preset threshold) is to constrain the use of CSPF to calculate the temporary path to the destination node 190, and obtain S-P3-P5-D, wherein, P5 is the fifth node 150, and its accumulated metric value is exactly 50, in [metric_constraint- margin,metric_constraint+margin], where metric_constraint is the updated first metric constraint value, and margin is a floating value, then the source node 100 will temporarily enable the temporary path.
  • the updated first metric constraint value 50 that is, the cumulative step by one
  • the first preset threshold is to constrain the use of CSPF to calculate the temporary path to the destination node 190, and obtain S-P3-P5-D, wherein, P5 is the fifth node 150, and its accumulated metric value is exactly 50, in [metric_constrain
  • the destination path is applicable for routing to any prefix (eg Prefix-D) to which the destination node 190 belongs.
  • the routing table entry to any prefix (such as Prefix-D) to which the destination node 190 belongs is the same as that in Example 1.
  • virtual network can be created using many other technologies, such as IGP multi-topology, network slicing, etc., which are not specifically limited here.
  • This example describes a multipath scenario.
  • multipath capabilities need to be explicitly configured on nodes in the network to find multiple paths when calculating routes.
  • ECMP group as an example, in the network topology shown in FIG.
  • the fifth node 150, the sixth node 160, the seventh node 170, the eighth node 180, and the destination node 190 wherein the source node 100, the first node 110, the second node 120, and the destination node 190 are sequentially connected end to end to form the first initial
  • the path is denoted as S-P1-P2-D
  • the source node 100, the third node 130, the fourth node 140 and the destination node 190 are sequentially connected end to end to form the second initial path, denoted as S-P3-P4-D
  • the source node 100, the fifth node 150, the sixth node 160 and the destination node 190 are sequentially connected end to end to form a target path, denoted as S-P5-P6-D
  • the end-to-end connection forms the first temporary path, denoted as S-P5-P7-D
  • the link between the source node 100 and the fifth node 150 is denoted as link (S-P5), and the state is interrupted, then the source node 100 calculates the ECMP multipath to the destination node 190 according to the SPF, that is, the first An initial path S-P1-P2-D and a second initial path S-P3-P4-D. Because the difference between the metric value of the first initial path and the metric value of the second initial path is 0, it meets the metric jitter smoothing requirement.
  • Metric value 60 (it is the cumulative metric value of path S-P1-P2-D)
  • Metric value 60 (it is the cumulative metric value of path S-P3-P4-D)
  • the first preset threshold be 10
  • the floating value be 4
  • the preset time be 1 second.
  • the source node 100 will calculate the target path to the destination node 190 according to the latest topology and SPF, that is, S-P5-P6-D , the cumulative metric value of the path is 40 (ie, the target metric constraint value), and the cumulative metric value of the currently effective initial path is 60 (ie, the first metric constraint value, assuming that the first degree from the currently effective multiple paths Compared with the average value of the quantity constraint value), the difference has exceeded the first preset threshold.
  • the source node 100 does not allow the target path to take effect immediately for the route of prefix-D, but uses the updated first metric constraint value 50 (that is, the cumulative step by one
  • the first preset threshold is to constrain the use of CSPF to calculate the ECMP multipath to the destination node 190, that is, the first temporary path and the second temporary path, and its cumulative metric value is exactly 50 (assuming that the first temporary path and the second temporary path path), within the range of [metric_constraint-margin, metric_constraint+margin], and the difference between the metric values of S-P5-P7-D and S-P5-P8-D is 0, which also satisfies the metric jitter smoothness required.
  • the source node 100 will temporarily enable the temporary path, and update the corresponding routing table entry of Prefix-D, as follows:
  • Metric value 50 (it is the cumulative metric value of path S-P5-P7-D)
  • Metric value 50 (it is the cumulative metric value of path S-P5-P8-D)
  • the source node 100 may start a timer and wait for a preset time of 1 second to expire. Then, on the source node 100, the CSPF calculation is used again with the re-updated first metric constraint value 40 (that is, based on the updated first metric constraint value 50, accumulatively stepping by a first preset threshold) as a constraint
  • the target path can be directly enabled, so the source node 100 updates the corresponding routing entry of Prefix-D, as follows :
  • Metric value 40 (it is the cumulative metric value of path S-P5-P6-D)
  • the network includes a source node 100, a first node 110, a second node 120, a third node 130, a fourth node 140, a fifth node 150, a sixth node 160, a seventh node The node 170, the eighth node 180, and the destination node 190, wherein, the source node 100, the first node 110, the second node 120 and the destination node 190 are sequentially connected end to end to form a target path, which is denoted as S-P1-P2-D, and the source node 100, the third node 130, the fourth node 140 and the destination node 190 are sequentially connected end to end to form a temporary path, denoted as S-P3-P4-D, the source node 100, the fifth node 150, the sixth node 160 and the destination node 190 in sequence
  • the end-to-end connection is denoted as S-P5-P6-D,
  • the initial path calculated by the source node 100 to the destination node 190 according to the SPF is S-P3-P4-D, and its cumulative metric value is 30 (ie, the first metric constraint value).
  • Prefix-D As a prefix that can handle measurement jitter, and the first preset threshold is 10, the floating value is 5, and the preset time is 1 second.
  • the destination node 190 When the state of the network topology event link (S-P3) changes from normal startup to interruption, the destination node 190 will calculate the converged target path to the destination node 190 according to the latest topology and SPF, which is S-P1-P2 -D, the cumulative metric value of the path is 60 (ie, the target metric constraint value), and compared with the cumulative metric value of 30 of the currently effective initial path, the difference has exceeded the first preset threshold.
  • SPF state of the network topology event link
  • the source node 100 does not allow the target path to take effect immediately for the routing of prefix-D, but uses the updated first metric constraint value 40 (that is, stepping a first metric constraint value on the basis of the first metric constraint value 30 A preset threshold) is to constrain the use of CSPF to calculate the temporary path to the destination node 190, that is, S-P7-P8-D, and its cumulative metric value is exactly 45, which is within the range of [metric_constraint-margin, metric_constraint+margin] .
  • the source node 100 may start a timer and wait for a preset time of 1 second to expire. Then the first metric constraint value is updated to the metric value 45 of the temporary path, and the initial path is updated to the temporary path.
  • the CSPF is used as a constraint with the re-updated first metric constraint value 55 (that is, stepping a first preset threshold on the basis of the first metric constraint value 45)
  • the temporary path to the destination node 190 is calculated to obtain S-P1-P2-D, whose cumulative metric value is exactly 60, which is within the range of [metric_constraint-margin, metric_constraint+margin]. Since S-P1-P2-D is the target path, the target path is directly enabled, and the stepping process ends.
  • the re-converged target path calculated by IGP is always the path with the smallest cumulative metric in the current network, and the new target path and the old If the difference between the target metric constraint values of the target path is large, it is an objective fact that there is no longer path smoothing metric jitter smaller than the metric value of the converged target path.
  • a suggested method is to add related parameters capable of smooth transition in the configuration of the multi-topology instance on each node, such as enable switch, tolerance Jitter value, float value, preset time.
  • related parameters capable of smooth transition in the configuration of the multi-topology instance on each node, such as enable switch, tolerance Jitter value, float value, preset time.
  • the route calculated on each node to any other destination node will automatically support smooth transition.
  • the embodiment of the present application also provides a routing device 200, as shown in Figure 15, the routing device 200 includes but is not limited to:
  • memory 202 for storing programs
  • the processor 201 is configured to execute the program stored in the memory 202.
  • the processor 201 executes the program stored in the memory 202, the processor 201 is configured to execute the above data processing method.
  • the processor 201 and the memory 202 may be connected through a bus or other means.
  • the memory 202 can be used to store non-transitory software programs and non-transitory computer-executable programs, such as the data processing method described in the embodiment of the present application.
  • the processor 201 implements the above data processing method by running the non-transitory software programs and instructions stored in the memory 202 .
  • the memory 202 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application program required by at least one function; the data storage area may store and execute the above-mentioned data processing method.
  • memory 202 may include high-speed random access memory 202, and may also include non-transitory storage 202, such as at least one disk storage 202, flash memory device, or other non-transitory solid-state storage 202.
  • the memory 202 may optionally include memory 202 remotely located relative to the processor 201, and these remote memories 202 may be connected to the processor 201 through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the non-transitory software programs and instructions required to realize the above-mentioned data processing method are stored in the memory 202, and when executed by one or more processors 201, the above-mentioned data processing method is executed, for example, the above-described execution in FIG. 1 is executed.
  • an embodiment of the present application also provides a computer-readable storage medium, the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by a processor or a controller, for example, by the above-mentioned Execution by a processor in the device embodiment can cause the above-mentioned processor to execute the routing method in the above-mentioned embodiment, for example, execute the method steps S110 to S130 in FIG. 1 and the method steps S210 to S210 in FIG. 2 described above.
  • an embodiment of the present application also provides a computer program product, including computer programs or computer instructions, where the computer programs or computer instructions are stored in a computer-readable storage medium, and the processor of the computer device reads the computer program from the computer-readable storage medium.
  • the processor executes the computer program or computer instruction, so that the computer device executes the routing method in the above-mentioned embodiment, for example, executes the method step S110 to step S130 in Fig. 1 described above, the method in Fig. 2 Step S210 to step S230, method step S310 and step S320 in FIG. 3, method step S410 and step S420 in FIG. 4, method step S510 in FIG. 5, method step S610 and step S620 in FIG. 6, method step S620 in FIG. method step S710 in FIG. 9 , method step S810 in FIG. 9 , method step S910 in FIG. 10 , method step S1010 and step S1020 in FIG. 11 .
  • the embodiment of the present application includes: when the network topology changes, calculating the target path to the target node and the target metric constraint value corresponding to the target path, and then according to the target metric constraint value and the first metric corresponding to the initial path to the target node Constraint value carries out the iterative calculation processing of the temporary path until the metric value of the temporary path satisfies the preset condition, wherein, in the iterative calculation process, each time the temporary path is successfully calculated, the temporary path is enabled, and the temporary path reaches the preset time when the temporary path is enabled. After setting the time, the temporary path is recalculated. When the metric value of the temporary path satisfies the preset condition, the target path is enabled.
  • the initial path can smoothly transition to the target path, which can reduce the risk of problems that do not meet the measurement constraint requirements due to the adjustment of the initial path to the target path, thereby helping to meet the measurement constraint requirements of deterministic services.
  • Computer storage media include, but are 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.
  • 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 .

Landscapes

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

Abstract

La présente demande divulgue un procédé et un appareil de routage, un support de stockage et un produit-programme. Le procédé de routage consiste : lorsqu'une topologie de réseau change, à calculer un chemin cible jusqu'à un nœud cible et une valeur de contrainte de mesure cible correspondant au chemin cible (S110) ; selon la valeur de contrainte de mesure cible et une première valeur de contrainte de mesure, à effectuer un traitement de calcul itératif sur un chemin temporaire jusqu'à ce qu'une valeur de mesure du chemin temporaire vérifie une condition prédéfinie, au cours du traitement de calcul itératif, un chemin temporaire s'obtenant par chaque calcul réussi, le chemin temporaire étant activé et après qu'un temps de validation du chemin temporaire atteint un temps prédéfini, le chemin temporaire étant recalculé et la première valeur de contrainte de mesure correspondant à un chemin initial jusqu'au nœud cible (S120) ; et lorsque la valeur de mesure du chemin temporaire vérifie la condition prédéfinie, à permettre le chemin cible (S130).
PCT/CN2022/115922 2021-11-17 2022-08-30 Procédé et appareil de routage, support de stockage et produit-programme WO2023087844A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111362285.X 2021-11-17
CN202111362285.XA CN116155790A (zh) 2021-11-17 2021-11-17 路由方法、路由装置、存储介质及程序产品

Publications (1)

Publication Number Publication Date
WO2023087844A1 true WO2023087844A1 (fr) 2023-05-25

Family

ID=86354809

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/115922 WO2023087844A1 (fr) 2021-11-17 2022-08-30 Procédé et appareil de routage, support de stockage et produit-programme

Country Status (2)

Country Link
CN (1) CN116155790A (fr)
WO (1) WO2023087844A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1416242A (zh) * 2002-12-30 2003-05-07 清华大学 基于线性构造的服务质量路由性能评价方法
US20090285124A1 (en) * 2008-05-13 2009-11-19 Nortel Networks Limited Wireless mesh network transit link topology optimization method and system
EP2704489A1 (fr) * 2012-08-31 2014-03-05 ABB Research Ltd. Sélection de liaison dans des réseaux de communication à pertes
CN104601473A (zh) * 2014-12-29 2015-05-06 广东顺德中山大学卡内基梅隆大学国际联合研究院 一种带约束的多目标路径的路由生成方法及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1416242A (zh) * 2002-12-30 2003-05-07 清华大学 基于线性构造的服务质量路由性能评价方法
US20090285124A1 (en) * 2008-05-13 2009-11-19 Nortel Networks Limited Wireless mesh network transit link topology optimization method and system
EP2704489A1 (fr) * 2012-08-31 2014-03-05 ABB Research Ltd. Sélection de liaison dans des réseaux de communication à pertes
CN104601473A (zh) * 2014-12-29 2015-05-06 广东顺德中山大学卡内基梅隆大学国际联合研究院 一种带约束的多目标路径的路由生成方法及系统

Also Published As

Publication number Publication date
CN116155790A (zh) 2023-05-23

Similar Documents

Publication Publication Date Title
US12063154B2 (en) Methods and apparatuses for sending and receiving segment routing traffic engineering policy, network element, and computer-readable storage medium
US11032197B2 (en) Reroute detection in segment routing data plane
US8605619B2 (en) Dynamic TE-LSP priority and preemption
US9270598B1 (en) Congestion control using congestion prefix information in a named data networking environment
US8369213B2 (en) Optimization of distributed tunnel rerouting in a computer network with path computation at an intermediate node
US7660254B2 (en) Optimization of distributed tunnel rerouting in a computer network with coordinated head-end node path computation
US7693055B2 (en) Optimization of distributed tunnel rerouting in a computer network with intermediate node feedback
US20080049751A1 (en) Method and system for computing as-disjoint inter-as traffic engineering-label switched paths (TE-LSPs)
US20060182035A1 (en) Technique for efficient load balancing of TE-LSPs
US20080198755A1 (en) Probing-based mechanism to reduce preemption perturbation caused by higher priority tunnel establishment in a computer network
EP1836599A2 (fr) Propagation d'informations de routage dans un protocole rsvp-te pour trajets te-lsps inter-domaines
US20160308786A1 (en) Temporal Tunnel Services
US9967179B2 (en) Constrained shortest path first for temporal tunnel services
US11323387B2 (en) Prioritized communication session establishment in computer networks
US11502940B2 (en) Explicit backups and fast re-route mechanisms for preferred path routes in a network
US11296983B1 (en) Stateless multicasting over traffic engineered unicast tunnels
US20160380888A1 (en) Software-Defined Network for Temporal Label Switched Path Tunnels
WO2023087844A1 (fr) Procédé et appareil de routage, support de stockage et produit-programme
EP3637699B1 (fr) Procédé et dispositif de publication d'une route de réseau
WO2024152527A1 (fr) Procédé de routage et appareil associé, support d'enregistrement et produit programme d'ordinateur
EP4443841A1 (fr) Procédé de calcul de trajet, noeud, support de stockage et produit-programme d'ordinateur
CN114041279B (zh) 用于对igp分区进行抽象化的系统和方法
US20240146648A1 (en) Circuit Style Segment Routing Policies with Compressed SID List
CN107645447B (zh) 一种标签交换路径lsp创建方法和装置
CN109729006B (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: 22894384

Country of ref document: EP

Kind code of ref document: A1