[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2022199150A1 - 路径获取方法、网元及计算机可读存储介质 - Google Patents

路径获取方法、网元及计算机可读存储介质 Download PDF

Info

Publication number
WO2022199150A1
WO2022199150A1 PCT/CN2021/138454 CN2021138454W WO2022199150A1 WO 2022199150 A1 WO2022199150 A1 WO 2022199150A1 CN 2021138454 W CN2021138454 W CN 2021138454W WO 2022199150 A1 WO2022199150 A1 WO 2022199150A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
link
segment
bandwidth
Prior art date
Application number
PCT/CN2021/138454
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 WO2022199150A1 publication Critical patent/WO2022199150A1/zh

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/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • 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/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • 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/08—Configuration management of networks or network elements
    • H04L41/0894—Policy-based network configuration management
    • 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/12—Shortest path evaluation
    • 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
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • 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/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion

Definitions

  • the embodiments of the present application relate to, but are not limited to, the field of communications technologies, and in particular, relate to a path acquisition method, a network element, and a computer-readable storage medium.
  • the core requirement of network slicing (Slice) for the bearer network is that different network slices need to have their own bearer sub-networks.
  • Algorithm Fex Algorithm, FA
  • IGP Interference Prediction Protocol
  • the current IGP FA technology only supports path computation based on minimum metric type constraints, such as path computation based on minimum IGP metric constraints, minimum Traffic Engineering (TE) metric constraints or minimum delay metric constraints, and cannot Supports path calculation based on link bandwidth constraints, which may lead to the situation that multiple service flows running in the FA plane are congested on a specific physical link while other physical links are very idle.
  • minimum metric type constraints such as path computation based on minimum IGP metric constraints, minimum Traffic Engineering (TE) metric constraints or minimum delay metric constraints.
  • Embodiments of the present application provide a path acquisition method, a network element, and a computer-readable storage medium.
  • an embodiment of the present application provides a method for obtaining a path, which is applied to a network element.
  • the method includes: determining a path to be selected from a starting node to a target node; when there are multiple paths to be selected , perform processing based on link bandwidth constraints on all the candidate paths to obtain the optimal path, wherein the link bandwidth constraints are determined according to flexible algorithm information flooded in the network, and the flexible algorithm information includes and Constraint type information corresponding to the link bandwidth constraint condition.
  • an embodiment of the present application further provides a network element, including: a memory, a processor, and a computer program stored in the memory and running on the processor, where the processor implements the above when executing the computer program The path obtaining method described in the first aspect.
  • an 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 path obtaining method.
  • FIG. 1 is a schematic diagram of a network topology for executing a path acquisition method provided by an embodiment of the present application
  • FIG. 2 is a flowchart of a path acquisition method provided by an embodiment of the present application.
  • FIG. 3 is a schematic partial structural diagram of a newly added Sub-TLV with constraint type information provided by an embodiment of the present application
  • Fig. 4 is the flow chart of the concrete steps of step S200 in Fig. 2;
  • Fig. 6 is the flow chart of the concrete steps of step S530 in Fig. 5;
  • Fig. 7 is a flowchart of the specific steps of step S540 in Fig. 5;
  • Fig. 9 is a flowchart of the specific steps of step S840 in Fig. 8;
  • FIG. 10 is a schematic diagram of the shortest path tree provided by a specific example of the present application.
  • FIG. 11 is a schematic diagram of a network topology for executing a path acquisition method provided by a specific example of the present application.
  • FIG. 12 is a schematic diagram of a shortest path tree provided by another specific example of the present application.
  • the present application provides a path acquisition method, a network element, and a computer-readable storage medium.
  • the network element can calculate the In the process of the optimal path from the starting node to the target node, the candidate paths from the starting node to the target node can be determined first. Processing of bandwidth constraints, so that network elements can obtain optimal paths from these candidate paths. Therefore, the solutions provided by the embodiments of the present application can support path selection based on link bandwidth constraints, so that the link bandwidth constraints can be selected according to the link bandwidth constraints.
  • the service traffic in the FA plane is routed to avoid unnecessary traffic congestion.
  • FIG. 1 is a schematic diagram of a network topology for executing a method for obtaining a path according to an embodiment of the present application.
  • the network topology includes a first node 110 , a second node 120 , a third node 130 , a fourth node 140 and a fifth node 150 .
  • the first node 110, the second node 120, the third node 130, the fourth node 140 and the fifth node 150 all belong to the same FA plane; between the first node 110 and the second node 120, the second node 120 and the third node 130, between the third node 130 and the fifth node 150, between the second node 120 and the fourth node 140, and between the fourth node 140 and the fifth node 150, there are bidirectional physical connections.
  • link, and each physical link has its own link bandwidth data and metric cost.
  • the link bandwidth data may include the total link bandwidth parameter, the link remaining bandwidth parameter, the link bandwidth idle rate, etc.
  • the measurement cost may include the IGP measurement cost, the TE measurement cost, and the delay measurement cost, etc. This embodiment This is not specifically limited. For example, in the physical link between the second node 120 and the third node 130 in FIG. 1 , assuming that the link bandwidth data is the total link bandwidth parameter, and the measurement cost is the IGP measurement cost, then the second node The link total bandwidth parameter of the physical link between 120 and the third node 130 is 10, and the IGP metric cost is 2.
  • the first node 110 , the second node 120 , the third node 130 , the fourth node 140 and the fifth node 150 may all be network devices such as routers or switches, and can forward packets.
  • the network topology may further include a network controller (not shown in FIG. 1 ), such as a software defined network (Software Defined Network, SDN) controller, etc., the network controller is respectively connected with the first node 110, the second node 110, the second The node 120 , the third node 130 , the fourth node 140 and the fifth node 150 are connected and can control the first node 110 , the second node 120 , the third node 130 , the fourth node 140 and the fifth node 150 respectively.
  • a network controller such as a software defined network (Software Defined Network, SDN) controller, etc.
  • SDN Software Defined Network
  • each node can flood the flexible algorithm information carrying the constraint type information corresponding to the link bandwidth constraint in the network topology; the network controller or the starting node that needs to send the message, It can use the link bandwidth data and metric cost of local links from other nodes in the network topology, and combine the link bandwidth constraints determined according to the constraint type information in the flexible algorithm information to carry out the process from the starting node to the target node. Calculation of the optimal path.
  • the network topology and application scenarios described in the embodiments of the present application are for the purpose of illustrating the technical solutions of the embodiments of the present application more clearly, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application.
  • the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.
  • topology shown in FIG. 1 does not constitute a limitation on the embodiments of the present application, and may include more or less components than shown, or combine some components, or different components layout.
  • FIG. 2 is a flowchart of a path acquisition method provided by an embodiment of the present application.
  • the path acquisition method can be applied to a network element in a network, such as a network controller in the network topology shown in FIG.
  • the starting node (such as the first node 110) that sends the message, the path acquisition method includes but is not limited to steps S100 and S200.
  • Step S100 determining a path to be selected from the starting node to the target node.
  • the FA plane can be traversed to find all reachable paths from the start node to the target node. There is only one path, and the reachable path obtained by the traversal can be considered as the optimal path from the starting node to the target node. If there are multiple reachable paths obtained by traversal, the reachable paths obtained by traversal can be used as the first. Paths to be selected, so that subsequent steps can obtain the optimal path from these paths to be selected. For example, in the network topology shown in FIG.
  • the network topology can be traversed first to obtain all possible paths from the first node 110 to the fifth node 150 .
  • reachable paths where these reachable paths are:
  • these two reachable paths can be determined as the candidate paths from the first node 110 to the fifth node 150, so that subsequent steps can choose from these two candidate paths. Get the optimal path.
  • Step S200 when there are multiple paths to be selected, perform processing based on link bandwidth constraints on all the paths to be selected to obtain an optimal path.
  • step S100 when there are multiple paths to be selected determined in step S100, all the paths to be selected can be processed based on the link bandwidth constraints, so as to obtain the optimal path from the starting node to the target node .
  • the number of optimal paths from the starting node to the target node may be one or multiple. When there are multiple optimal paths, load sharing can be formed among these optimal paths.
  • the link bandwidth constraint is determined according to flexible algorithm information flooded in the network, where the flexible algorithm information carries constraint type information corresponding to the link bandwidth constraint.
  • the link bandwidth constraint condition may include: in multiple paths from the same starting node to the same target node, the link bandwidth data of the link with the smallest link bandwidth data in the selected path is greater than any remaining one Link bandwidth data of the link with the smallest link bandwidth data in the path.
  • the link bandwidth data may include, but is not limited to, a total link bandwidth parameter, a link remaining bandwidth parameter, a link bandwidth idle rate, and the like.
  • the total link bandwidth parameter refers to the upper limit value of the maximum bandwidth that the link can provide, and the upper limit value of the maximum bandwidth can be specified and modified by configuration.
  • the link remaining bandwidth parameter refers to the bandwidth parameter obtained by subtracting the link used bandwidth parameter from the link total bandwidth parameter. The parameters will change dynamically with the changes of the service traffic in the network, and the used bandwidth parameters of the link can be obtained from the network through real-time measurement.
  • the link bandwidth idle ratio refers to the bandwidth parameter obtained by dividing the link remaining bandwidth parameter by the link total bandwidth parameter.
  • the link bandwidth data may be bandwidth data of a physical link, or may be bandwidth data corresponding to specific algorithm information (algorithm) on the physical link, which is not specifically limited in this embodiment.
  • the link bandwidth data is the bandwidth data corresponding to the specific algorithm information on the physical link
  • the link total bandwidth parameter is "the total bandwidth parameter corresponding to the specific algorithm information”
  • the link remaining bandwidth parameter is "the specific algorithm information”.
  • the used bandwidth parameter of the link is the “used bandwidth parameter corresponding to the specific algorithm information”
  • the link bandwidth idle rate is the "bandwidth idle rate corresponding to the specific algorithm information”.
  • the total bandwidth parameter corresponding to the specific algorithm information refers to the total bandwidth share allocated by the links shared by multiple FA planes for the FA plane corresponding to the specific algorithm information;
  • the remaining bandwidth corresponding to the specific algorithm information refers to the bandwidth parameter obtained by subtracting "the used bandwidth parameter corresponding to the specific algorithm information” from the “total bandwidth parameter corresponding to the specific algorithm information", wherein the "used bandwidth parameter corresponding to the specific algorithm information” is Refers to the traffic bandwidth parameter corresponding to the specific algorithm information flowing through the link.
  • the used bandwidth parameter corresponding to the algorithm information can be obtained from the network through real-time measurement; the “bandwidth idle ratio corresponding to the specific algorithm information” refers to the “remaining bandwidth parameter corresponding to the specific algorithm information” divided by the “remaining bandwidth parameter corresponding to the specific algorithm information”. Corresponding total bandwidth parameters" obtained bandwidth parameters.
  • the flexible algorithm information flooded in the network is described below with a specific example.
  • M occupies 1 bit, which is the identification bit defined in the current standard draft-ietf-lsr-flex-algo-13;
  • the path calculation does not need to be performed in combination with the link bandwidth constraints, and only the path calculation is performed according to the minimum metric type constraints defined in the current IGP FA technology;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link total bandwidth parameter to perform path calculation;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link remaining bandwidth parameter to perform path calculation;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link bandwidth idle rate for path calculation;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data for the total bandwidth parameter corresponding to the specific algorithm information to perform path calculation;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data for the remaining bandwidth parameter corresponding to the specific algorithm information to perform path calculation;
  • the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data for the bandwidth idle rate corresponding to the specific algorithm information to perform path calculation.
  • the specific value and related meaning of the B field are not limited to the above content, and can be appropriately set according to actual application conditions.
  • the value of the B field is 4, it means that the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link bandwidth idle rate to perform path calculation;
  • the value of the B field is 1, it means that the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link remaining bandwidth parameter for path calculation
  • B when the value of the field is 2, it means that the minimum metric type constraint defined in the current IGP FA technology needs to be combined with the link bandwidth constraint based on the link bandwidth data as the link total bandwidth parameter to perform path calculation.
  • the minimum metric type constraint is the constraint defined in the current IGP FA technology, including the minimum IGP metric constraint, the minimum TE metric constraint, and the minimum delay metric constraint.
  • the minimum metric type constraint you can refer to the relevant description in the current standard draft-ietf-lsr-flex-algo-13, which will not be repeated here.
  • multiple nodes in the same FA plane may advertise different flexible algorithm information.
  • each node in the FA plane will select the flexible algorithm information according to the priority.
  • the optimal path calculation in the FA plane is performed by selecting the optimal flexible algorithm information. If the constraint type information carried in the optimal flexible algorithm information is not 0, then during the calculation of the optimal path, the path with the optimal link bandwidth data will be selected first according to the corresponding link bandwidth constraints. When there are multiple optimal paths for the selected link bandwidth data, the optimal path is selected from the optimal paths with the optimal link bandwidth data according to the minimum metric type constraint. If there are multiple optimal paths finally obtained, Then these optimal paths can form load sharing.
  • this embodiment by adopting the path acquisition method including the above steps S100 and S200, in the case that the flexible algorithm information carrying the constraint type information corresponding to the link bandwidth constraint is flooded in the network, when the network is flooded
  • the candidate path from the starting node to the target node can be determined first, and when there are multiple candidate paths determined, all candidate paths can be calculated Based on the processing of link bandwidth constraints, the optimal path is obtained from these candidate paths. Therefore, this embodiment can support path selection based on link bandwidth constraints, so that the path selection in the FA plane can be determined according to the link bandwidth constraints. Service traffic is routed to avoid unnecessary traffic congestion.
  • the path acquisition method of this embodiment can be used to obtain the optimal path from the starting node to all other nodes in the FA plane, and after obtaining the optimal path from the starting node to all other nodes in the FA plane.
  • these optimal paths can be used to construct an acyclic shortest path tree related to the flexible algorithm information, wherein the root node of the shortest path tree is the starting node, and the other nodes of the shortest path tree are the other nodes within the FA plane.
  • the path acquisition method in this embodiment can also be used to implement the topology-independent loop-free alternate (TI-LFA) described in the current standard draft-ietf-rtgwg-segment-routing-ti-lfa-05 ) mechanism to calculate the backup path.
  • TI-LFA topology-independent loop-free alternate
  • the path acquisition method of this embodiment is used to obtain a new optimal path, and the new optimal path does not pass through the node that is assumed to be faulty. or link.
  • the path acquisition method when the path acquisition method is applied to an origin node that needs to send a message, the path acquisition method may further include, but is not limited to, the following steps:
  • the link bandwidth data of the local link is updated, and the updated link bandwidth data satisfies the external notification conditions, the updated link bandwidth data is notified externally, and all candidate paths are reprocessed based on the link bandwidth constraints. Get the new optimal path.
  • the link bandwidth data of the local link will change according to the actual situation.
  • the network controller or network administrator may Modify and configure the total link bandwidth parameter; when the link bandwidth data is the link remaining bandwidth parameter, because the service traffic in the network changes dynamically, that is, the link used bandwidth parameter changes dynamically, so the link remaining Bandwidth parameters are also dynamically changed.
  • the link bandwidth data of the local link of the node When the link bandwidth data of the local link of the node is updated, the link bandwidth data with the node as the target node or all paths passing through the node will change. Therefore, the node needs to advertise the local link to the outside world.
  • the updated link bandwidth data so that other nodes in the FA plane can obtain accurate results when calculating the optimal path with this node as the target node or calculating the optimal path through this node.
  • the link bandwidth data of the local link of the node when the link bandwidth data of the local link of the node is updated, the link bandwidth data of all the paths to be selected from the node to the target node will also change. Based on the processing of link bandwidth constraints, a new optimal path is obtained.
  • the external notification condition of the link bandwidth data can be set in each node, and only the updated link bandwidth Only when the data meets the external notification conditions will the updated link bandwidth data be notified externally, and all the paths to be selected will be reprocessed based on the link bandwidth constraints to obtain a new optimal path.
  • the external notification conditions may include at least one of the following conditions:
  • Condition 1 The absolute value of the difference between the updated link bandwidth data and the link bandwidth data before the update is greater than the preset update threshold
  • Condition 2 The time when the link bandwidth data is updated reaches a preset time threshold from the time when the link bandwidth data was last advertised to the outside world.
  • the preset update threshold in Condition 1 and the preset time threshold in Condition 2 can be appropriately selected according to actual application conditions, which are not specifically limited in this embodiment.
  • step S200 may include, but is not limited to, the following steps:
  • Step S210 randomly select two candidate paths from all the candidate paths
  • Step S220 performing a link comparison process based on the link bandwidth constraint and the minimum metric type constraint on the selected two candidate paths to obtain a preferred path;
  • Step S230 select a candidate path from the remaining candidate paths in turn, after each selection candidate path, compare the selected candidate path with the preferred path based on link bandwidth constraints and minimum metric type constraints Process to obtain the target path, and update the target path to the preferred path;
  • Step S240 taking the finally obtained optimal path as the optimal path.
  • two candidate paths may be randomly selected from all the candidate paths to perform link bandwidth constraint and minimum metric type constraint based processing. to obtain a preferred path, and then select a candidate path from the remaining candidate paths, and perform link comparison processing between the candidate path and the preferred path based on link bandwidth constraints and minimum metric type constraints, The target path is obtained, then the target path is updated to the preferred path, and then a candidate path is selected from the remaining candidate paths, and the candidate path and the updated preferred path are subjected to link bandwidth constraints and minimum metric type constraints.
  • the link comparison process is performed to obtain a new target path, and then use the new target path to update the updated preferred path, and so on, until all the candidate paths have completed the link bandwidth constraint and the minimum metric type Constrained link comparison processing, at this time, the final optimal path is the optimal path.
  • the link comparison processing based on the link bandwidth constraint and the minimum metric type constraint can be performed on all the paths to be selected, so that the matching links can be obtained from all the paths to be selected Bandwidth constraints and optimal paths for minimum metric type constraints, so that the service traffic in the FA plane can be routed according to the link bandwidth constraints to avoid unnecessary traffic congestion.
  • the link comparison processing based on the link bandwidth constraint and the minimum metric type constraint includes the following steps:
  • Step S510 determine the first path and the second path, the first path and the second path have the same head node and the same tail node;
  • Step S520 according to the direction from the head node to the tail node, determine the intersection nodes of the first path and the second path except the head node;
  • Step S530 obtaining the path segment of the first path and the path segment of the second path respectively according to the first node and the intersecting node;
  • Step S540 using the comparison judgment process based on the link bandwidth constraint and the minimum metric type constraint to compare the path segment of the first path and the path segment of the second path to obtain a preferred path segment;
  • Step S550 obtaining the path corresponding to the preferred path segment.
  • the link comparison processing based on the link bandwidth constraint and the minimum metric type constraint mainly includes: firstly determining the first path and the second path, wherein the first path and the second path need to have the same head node and The same tail node, and then, according to the direction from the head node to the tail node, determine the intersection nodes of the two paths except the head node. At this time, the paths of the two paths can be obtained respectively according to the head node and the intersection node. Then, compare the path fragments of the two paths by using the comparison judgment process based on the link bandwidth constraint and the minimum metric type constraint to obtain the preferred path fragment, and then obtain the path corresponding to the preferred path fragment, that is, the path based on the preferred path fragment is completed.
  • Link comparison processing for link bandwidth constraints and minimum metric type constraints are examples of link bandwidth constraints and minimum metric type constraints.
  • the path corresponding to the preferred path segment obtained in step S550 is a path with a higher degree of preference among the first path and the second path in step S510. Therefore, by using the link-based path in this embodiment The link comparison processing between the bandwidth constraint and the minimum metric type constraint can obtain the path with a higher degree of preference among the two paths.
  • the preferred path obtained by performing the link comparison process based on the link bandwidth constraint and the minimum metric type constraint on the two candidate paths to be selected in the above step S220 is a higher degree of preference among the two candidate paths.
  • the target path obtained by performing the link comparison processing based on the link bandwidth constraint and the minimum metric type constraint on the selected candidate path and the preferred path is the target path obtained by the candidate path and the selected path.
  • step S530 may specifically include, but is not limited to, the following steps:
  • Step S531 obtaining a path segment of the first path from the first node to the first intersecting node and a path segment between two adjacent intersecting nodes according to the first node and the intersecting node;
  • Step S532 Obtain a path segment of the second path from the first node to the first intersecting node and a path segment between two adjacent intersecting nodes according to the first node and the intersecting node.
  • both the first path and the second path can be divided into multiple path segments, which include paths from the head node to The path segment of the first intersecting node and the path segment between two adjacent intersecting nodes.
  • the first node 110 is the head node
  • the fifth node 150 is the tail node
  • the first path includes the first node 110 , the second node 120 , the third node 130 and the fifth node 150 .
  • the second path includes the first node 110 , the second node 120 , the fourth node 140 and the fifth node 150 , then the two paths can be divided into two path segments, wherein the first path and the second path Each path segment is from the first node 110 to the second node 120, the second path segment of the first path is from the second node 120 through the third node 130 to the fifth node 150, and the second path segment of the second path The path segment is from the second node 120 through the fourth node 140 to the fifth node 150 .
  • step S540 can be used to perform the link bandwidth constraint and minimum metric type based on the multiple path segments of the first path and the second path. Constraints are compared and judged to obtain a preferred path segment, so that a path corresponding to the preferred path segment can be obtained in subsequent steps.
  • step S540 may specifically include, but is not limited to, the following steps:
  • Step S541 along the direction from the head node to the tail node, select path segments with the same end node from the first path and from the second path respectively, and after each path segment is selected, the selected first path is selected.
  • the selected path segment and the selected path segment of the second path are subjected to comparison and judgment processing based on the link bandwidth constraint and the minimum metric type constraint to obtain an alternative path segment, until the alternative path segment satisfies the preset path conditions;
  • Step S542 taking the candidate path segment that meets the preset path condition as the preferred path segment.
  • preset path condition can be any of the following conditions:
  • Condition 1 The number of candidate path segments obtained in the current process is one
  • Condition 2 The number of candidate path segments obtained in the current process is two, and the selected path segment of the first path is the last path segment in the first path, and the selected path segment of the second path is the second path segment The last path fragment in the path.
  • the path from the head node to the For the direction of the tail node first select the first path segment of the first path and the first path segment of the second path to perform comparison and judgment processing based on link bandwidth constraints and minimum metric type constraints to obtain alternative path segments, and then judge Whether the candidate path segment satisfies the preset path condition.
  • the candidate path segment can be used as the preferred path segment; if there are two candidate path segments obtained, and the first path segment of the first path is the one in the first path the last path segment of the second path, the first path segment of the second path is the last path segment in the second path (that is, the first path and the second path only have the head node and the tail node as the intersection nodes), then you can use These two alternative path fragments are both used as preferred path fragments; if there are two alternative path fragments obtained, but the first path fragment of the first path is not the last path fragment of the first path, the first path fragment of the second path A path segment is not the last path segment in the second path (i.e.
  • the second path segment of the first path needs to be selected Perform a comparison and judgment process based on the link bandwidth constraint and the minimum metric type constraint with the second path segment of the second path to obtain a new candidate path segment, and then determine whether the new candidate path segment satisfies the preset path conditions. , and so on until the candidate path segment satisfies the preset path condition, and when the candidate path segment satisfies the preset path condition, the candidate path segment at this time is the preferred path segment.
  • the first path and the second path can be compared and judged based on the link bandwidth constraint and the minimum metric type constraint by means of segment judgment. Comparing and judging the path segments of the first path and the second path based on the link bandwidth constraint and the minimum metric type constraint does not need to obtain the full path information of the first path and the second path, so the amount of data to be processed can be reduced , so that the processing efficiency can be improved.
  • the comparison and judgment process based on the link bandwidth constraint and the minimum metric type constraint includes the following steps:
  • Step S810 determining a first forwarding path and a second forwarding path, where the first forwarding path and the second forwarding path have the same start node and the same end node;
  • Step S820 Obtain the first bandwidth parameter in the first forwarding path and the second bandwidth parameter in the second forwarding path, where the first bandwidth parameter is the link bandwidth of the link with the smallest link bandwidth data in the first forwarding path data, the second bandwidth parameter is the link bandwidth data of the link with the smallest link bandwidth data in the second forwarding path;
  • Step S830 obtaining the first metric cost of the first forwarding path and the second metric cost of the second forwarding path;
  • Step S840 compare and judge the first forwarding path and the second forwarding path according to the first bandwidth parameter, the second bandwidth parameter, the first metric cost and the second metric cost, and obtain a path with a higher degree of preference.
  • the comparison and judgment processing based on the link bandwidth constraint and the minimum metric type constraint mainly includes: firstly determining the first forwarding path and the second forwarding path, wherein the first forwarding path and the second forwarding path need to have the same The start node and the same end node, and then respectively obtain the link bandwidth data (ie, the first bandwidth parameter) of the link with the smallest link bandwidth data in the first forwarding path, the first metric cost of the first forwarding path, and the first forwarding path.
  • first bandwidth parameter and the second bandwidth parameter obtained in step S820 are the same type of bandwidth parameter, for example, can be any of the link total bandwidth parameter, the link remaining bandwidth parameter, and the link bandwidth idle rate.
  • first metric cost and the second metric cost obtained in step S830 are the same type of metric cost, for example, may be any one of the IGP metric cost, the TE metric cost, and the delay metric cost, and this embodiment does not apply to this. There is no specific limitation.
  • the first bandwidth parameter, the second bandwidth parameter, the first metric cost and the second metric cost can be used to compare the first forwarding path and the second forwarding path to determine A path with a higher degree of preference is obtained, thereby realizing path selection based on link bandwidth constraints, so that the service traffic in the FA plane can be routed according to the link bandwidth constraints to avoid unnecessary traffic congestion.
  • step S840 may specifically include, but is not limited to, the following steps:
  • Step S841 comparing the first bandwidth parameter with the second bandwidth parameter to obtain a first comparison result
  • Step S842 when the first comparison result is that the first bandwidth parameter is different from the second bandwidth parameter, the path corresponding to the one with the largest value in the first bandwidth parameter and the second bandwidth parameter is used as a path with a higher degree of preference;
  • Step S843 when the first comparison result is that the first bandwidth parameter is the same as the second bandwidth parameter, the first metric cost and the second metric cost are compared to obtain a second comparison result, and the second comparison result is obtained from the first forwarding path and the second A path with a higher degree of preference is obtained from the second forwarding path.
  • the first bandwidth is compared with the second bandwidth parameter to obtain a first comparison result, and then corresponding subsequent processing is performed according to the first comparison result. If the first comparison result is that the first bandwidth parameter is different from the second bandwidth parameter, it means that one of the first forwarding path and the second forwarding path has better link bandwidth data. Therefore, the first bandwidth parameter and The path corresponding to the largest value in the second bandwidth parameter is used as a path with a higher degree of preference.
  • the first forwarding path is a path with a higher degree of preference.
  • the forwarding path is a path with a higher degree of preference. If the first comparison result is that the first bandwidth parameter is the same as the second bandwidth parameter, it means that the first forwarding path and the second forwarding path have the same minimum link bandwidth data. Therefore, it is necessary to further compare the first measurement cost and the second forwarding path.
  • the metric cost is compared to obtain a second comparison result, and a path with a higher degree of preference is obtained from the first forwarding path and the second forwarding path according to the second comparison result.
  • a path with a higher degree of preference is first determined according to the comparison result of the first bandwidth parameter and the second bandwidth parameter, and then according to the comparison result of the first bandwidth parameter and the second bandwidth parameter
  • a path with a higher degree of preference is determined according to the comparison result of the first metric cost and the second metric cost, so as to determine the link bandwidth constraints first and then determine the minimum metric type Therefore, this embodiment can implement path selection based on link bandwidth constraints, so that service traffic in the FA plane can be routed according to the link bandwidth constraints to avoid unnecessary traffic congestion.
  • obtaining a path with a higher degree of preference from the first forwarding path and the second forwarding path according to the second comparison result in step S843 may specifically include, but is not limited to, the following steps:
  • the path corresponding to the one with the smallest value among the first metric cost and the second metric cost is regarded as a path with a higher degree of preference.
  • the second comparison result when the second comparison result is that the first metric cost and the second metric cost are different, it means that one of the first forwarding path and the second forwarding path has a better metric cost. Therefore, the first The path corresponding to the smallest value among the first metric cost and the second metric cost is regarded as the path with higher degree of preference. For example, if the first metric cost is less than the second metric cost, the first forwarding path is the one with higher degree of preference. path, otherwise, the second forwarding path is a path with a higher degree of preference.
  • obtaining a path with a higher degree of preference from the first forwarding path and the second forwarding path according to the second comparison result in step S843 may further include, but is not limited to, the following steps:
  • both the first forwarding path and the second forwarding path are regarded as paths with a higher degree of preference.
  • the second comparison result when the second comparison result is that the first metric cost and the second metric cost are the same, it means that the first forwarding path and the second forwarding path have the same metric cost.
  • a forwarding path and a second forwarding path have the same minimum link bandwidth data. Therefore, it can be determined that the first forwarding path and the second forwarding path have the same degree of preference. Therefore, both the first forwarding path and the second forwarding path can be used as A higher degree of path is preferred.
  • a first node 110 , a second node 120 , a third node 130 , a fourth node 140 and a fifth node 150 are included.
  • the first node 110, the second node 120, the third node 130, the fourth node 140 and the fifth node 150 all belong to the same FA plane; between the first node 110 and the second node 120, the second node 120 and the third node 130, between the third node 130 and the fifth node 150, between the second node 120 and the fourth node 140, and between the fourth node 140 and the fifth node 150, there are bidirectional physical connections.
  • link, and each physical link has its own link total bandwidth parameter and IGP metric cost.
  • the total link bandwidth parameter of the physical link between the first node 110 and the second node 120 is 1, and the IGP measurement cost is 1; the link of the physical link between the second node 120 and the third node 130 The total bandwidth parameter is 10, and the IGP measurement cost is 2; the link total bandwidth parameter of the physical link between the third node 130 and the fifth node 150 is 5, and the IGP measurement cost is 2; the second node 120 and the fourth node The total link bandwidth parameter of the physical link between 140 is 10, and the IGP measurement cost is 20; the link total bandwidth parameter of the physical link between the fourth node 140 and the fifth node 150 is 10, and the IGP measurement cost is 20.
  • the optimal paths from the first node 110 to other nodes are calculated, and the shortest path tree is constructed according to these optimal paths.
  • the specific processing process is as follows:
  • Path 1 the first node 110 ⁇ the second node 120 ⁇ the third node 130;
  • Path 2 first node 110 ⁇ second node 120 ⁇ fourth node 140 ⁇ fifth node 150 ⁇ third node 130 .
  • the path 1 and path 2 are compared by means of segment judgment. First, find the first intersection node (ie, the second node 120 ) of path 1 and path 2 along the direction from the first node 110 to the third node 130 , and then divide the path 1 from the first node 110 to the second node 120 Compare the path segment of path 2 with the path segment from the first node 110 to the second node 120 in path 2.
  • path segment A-B the path segment from the second node 120 to the third node 130 in path 1
  • path segment A-C-D-B the path segment from the second node 120 to the third node 130 in path 2
  • the path segment A-B has a higher degree of preference, and therefore, path 1 can be determined as the optimal path from the first node 110 to the third node 130 .
  • the FA plane is traversed to find all paths from the first node 110 to the fourth node 140, and the following two paths are obtained:
  • Path 1 the first node 110 ⁇ the second node 120 ⁇ the fourth node 140;
  • Path 2 first node 110 ⁇ second node 120 ⁇ third node 130 ⁇ fifth node 150 ⁇ fourth node 140 .
  • the path 1 and path 2 are compared by means of segment judgment. First, find the first intersection node (ie, the second node 120 ) of path 1 and path 2 along the direction from the first node 110 to the fourth node 140 , and then divide the path 1 from the first node 110 to the second node 120 Compare the path segment of path 2 with the path segment from the first node 110 to the second node 120 in path 2.
  • the two path segments are the same, continue to find the second intersection node of path 1 and path 2 (ie, the fourth node 140 ), and then the path segments from the second node 120 to the fourth node 140 in path 1 (denoted as path segments A-C) and the path segments from the second node 120 to the fourth node 140 in path 2 (denoted as path segments A-B-D-C) ) for comparison, since the total link bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment A-C is 10, the link total link bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment A-B-D-C is 5. , therefore, the degree of preference of the path segments A-C is higher, therefore, the path 1 can be determined as the optimal path from the first node 110 to the fourth node 140 .
  • Path 1 first node 110 ⁇ second node 120 ⁇ third node 130 ⁇ fifth node 150;
  • Path 2 first node 110 ⁇ second node 120 ⁇ fourth node 140 ⁇ fifth node 150 .
  • the path 1 and path 2 are compared by means of segment judgment. First, find the first intersection node (ie, the second node 120 ) of path 1 and path 2 along the direction from the first node 110 to the fifth node 150 , and then divide the path 1 from the first node 110 to the second node 120 Compare the path segment of path 2 with the path segment from the first node 110 to the second node 120 in path 2.
  • path segment A-B-D the path segment from the second node 120 to the fifth node 150 in path 1
  • path segment A-C-D the path segment from the second node 120 to the fifth node 150 in path 2
  • the first node 110 is the root node of the shortest path tree
  • the second node 120, the third node 130, the fourth node 140 and the fifth node 150 are other nodes in the shortest path tree, respectively.
  • the optimal path from the first node 110 to other nodes can be directly obtained from the shortest path tree.
  • the optimal path from the first node 110 to the third node 130 can be directly obtained from the shortest path tree shown in FIG. 10 as The first node 110 ⁇ the second node 120 ⁇ the third node 130; and the optimal path from the first node 110 to the fourth node 140 is the first node 110 ⁇ the second node 120 ⁇ the fourth node 140.
  • the first node 110 , the second node 120 , the third node 130 , the fourth node 140 , the fifth node 150 and the sixth node 160 belonging to the same FA plane are included.
  • Bidirectional physical links are connected between the fifth node 150 and the third node 130, between the third node 130 and the first node 110, and between the third node 130 and the fourth node 140, and each physical link is
  • Each link has its own link total bandwidth parameter and IGP metric cost.
  • the total link bandwidth parameter of the physical link between the first node 110 and the second node 120 is 10, and the IGP measurement cost is 100; the link of the physical link between the second node 120 and the fourth node 140 The total bandwidth parameter is 10, and the IGP measurement cost is 1; the link total bandwidth parameter of the physical link between the fourth node 140 and the sixth node 160 is 10, and the IGP measurement cost is 1; the sixth node 160 and the fifth node The total link bandwidth parameter of the physical link between 150 is 10, and the IGP measurement cost is 100; the link total bandwidth parameter of the physical link between the fifth node 150 and the third node 130 is 100, and the IGP measurement cost is 1; the link total bandwidth parameter of the physical link between the third node 130 and the first node 110 is 100, and the IGP measurement cost is 1; the link of the physical link between the third node 130 and the fourth node 140 The total bandwidth parameter is 10 and the IGP metric cost is 50.
  • the optimal paths from the first node 110 to other nodes are calculated, and the shortest path tree is constructed according to these optimal paths.
  • the specific processing process is as follows:
  • the FA plane is traversed to find all paths from the first node 110 to the second node 120, and the following three paths are obtained:
  • Path 1 the first node 110 ⁇ the second node 120;
  • Path 2 the first node 110 ⁇ the third node 130 ⁇ the fourth node 140 ⁇ the second node 120;
  • Path 3 first node 110 ⁇ third node 130 ⁇ fifth node 150 ⁇ sixth node 160 ⁇ fourth node 140 ⁇ second node 120 .
  • the path 1 and path 2 are compared by means of segment judgment.
  • the path segment (denoted as path segment S-A) is compared with the path segment (denoted as path segment S-B-C-A) from the first node 110 to the second node 120 in path 2, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest link bandwidth parameter is 10, and the link total bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment S-B-C-A is 10.
  • the path segment S-A and the path segment The minimum link total bandwidth parameters of S-B-C-A are the same.
  • the IGP metric cost is compared. Since the cumulative value of the IGP metric cost in the path segment S-A is 100, the cumulative value of the IGP metric cost in the path segment S-B-C-A is 52, so the path Fragment S-B-C-A is more preferred, so route 2 can be determined to be more preferred.
  • the minimum link total bandwidth parameter of path segment B-C and path segment B-D-E-C is the same.
  • the IGP metric cost is compared. Since the cumulative value of the IGP metric cost in path segment B-C is 50 , the cumulative value of the IGP metric cost in the path segment B-D-E-C is 102, so the path segment B-C has a higher degree of preference, so it can be determined that the path 2 has a higher degree of preference. Therefore, it can be determined that the path 2 is from the first node 110 to the The optimal path for two nodes 120 .
  • the FA plane is traversed to find all paths from the first node 110 to the third node 130, and the following three paths are obtained:
  • Path 1 the first node 110 ⁇ the third node 130;
  • Path 2 the first node 110 ⁇ the second node 120 ⁇ the fourth node 140 ⁇ the third node 130;
  • Path 3 first node 110 ⁇ second node 120 ⁇ fourth node 140 ⁇ sixth node 160 ⁇ fifth node 150 ⁇ third node 130 .
  • the path 1 and path 2 are compared by means of segment judgment.
  • the path segment (denoted as path segment S-B) is compared with the path segment (denoted as path segment S-A-C-B) from the first node 110 to the third node 130 in path 2, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest total link bandwidth parameter is 100, and the total link bandwidth parameter of the link with the smallest total link bandwidth parameter in the path segment S-A-C-B is 10. Therefore, the preference degree of the path segment S-B higher, so it can be determined that path 1 is more preferred.
  • the path 1 and path 3 are compared by means of segment judgment. First, find the first intersection node (ie, the third node 130 ) of path 1 and path 3 along the direction from the first node 110 to the third node 130 , and then divide the path 1 from the first node 110 to the third node 130 .
  • the path segment (denoted as path segment S-B) is compared with the path segment (denoted as path segment S-A-C-E-D-B) from the first node 110 to the third node 130 in path 3, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest link total bandwidth parameter is 100, and the link total link bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment S-A-C-E-D-B is 10, so the path segment S-B is more preferred. Therefore, it can be determined that path 1 has a higher degree of preference, and therefore, path 1 can be determined to be the optimal path from the first node 110 to the third node 130 .
  • the FA plane is traversed to find all paths from the first node 110 to the fourth node 140, and the following three paths are obtained:
  • Path 1 the first node 110 ⁇ the second node 120 ⁇ the fourth node 140;
  • Path 2 the first node 110 ⁇ the third node 130 ⁇ the fourth node 140;
  • Path 3 first node 110 ⁇ third node 130 ⁇ fifth node 150 ⁇ sixth node 160 ⁇ fourth node 140 .
  • the path 1 and path 2 are compared by means of segment judgment.
  • the path segment (denoted as path segment S-A-C) is compared with the path segment (denoted as path segment S-B-C) from the first node 110 to the fourth node 140 in path 2, and the total link bandwidth parameter is compared first.
  • the link total bandwidth parameter of the link with the smallest link bandwidth parameter is 10, and the link total link bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment S-B-C is 10.
  • the path segment S-A-C and the path segment The minimum link total bandwidth parameters of S-B-C are the same.
  • the IGP metric cost is compared. Since the cumulative value of the IGP metric cost in the path segment S-A-C is 101, and the cumulative value of the IGP metric cost in the path segment S-B-C is 51, so the path Fragment S-B-C is more preferred, so route 2 can be determined to be more preferred.
  • the minimum link total bandwidth parameter of path segment B-C and path segment B-D-E-C is the same.
  • the IGP metric cost is compared. Since the cumulative value of the IGP metric cost in path segment B-C is 50 , the cumulative value of the IGP metric cost in the path segment B-D-E-C is 102, so the path segment B-C has a higher degree of preference, so it can be determined that the path 2 has a higher degree of preference. Therefore, it can be determined that the path 2 is from the first node 110 to the Optimal path for four nodes 140 .
  • Path 1 the first node 110 ⁇ the third node 130 ⁇ the fifth node 150;
  • Path 2 first node 110 ⁇ third node 130 ⁇ fourth node 140 ⁇ sixth node 160 ⁇ fifth node 150;
  • Path 3 the first node 110 ⁇ the second node 120 ⁇ the fourth node 140 ⁇ the third node 130 ⁇ the fifth node 150;
  • Path 4 first node 110 ⁇ second node 120 ⁇ fourth node 140 ⁇ sixth node 160 ⁇ fifth node 150 .
  • the path 1 and path 2 are compared by means of segment judgment. First, find the first intersection node (ie, the third node 130 ) of path 1 and path 2 along the direction from the first node 110 to the fifth node 150 , and then divide the path 1 from the first node 110 to the third node 130 Compare the path segment of path 2 with the path segment from the first node 110 to the third node 130 in path 2.
  • the path 1 and path 3 are compared by means of segment judgment. First, find the first intersection node (ie, the third node 130 ) of path 1 and path 3 along the direction from the first node 110 to the fifth node 150 , and then divide the path 1 from the first node 110 to the third node 130
  • the path segment (denoted as path segment S-B) is compared with the path segment (denoted as path segment S-A-C-B) from the first node 110 to the third node 130 in path 3, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest total link bandwidth parameter is 100, and the total link bandwidth parameter of the link with the smallest total link bandwidth parameter in the path segment S-A-C-B is 10. Therefore, the preference degree of the path segment S-B higher, so it can be determined that path 1 is more preferred.
  • the path 1 and path 4 are compared by means of segment judgment. First, find the first intersection node (ie, the fifth node 150 ) of path 1 and path 4 along the direction from the first node 110 to the fifth node 150 , and then divide the path 1 from the first node 110 to the fifth node 150 .
  • the path segment (denoted as path segment S-B-D) is compared with the path segment (denoted as path segment S-A-C-E-D) from the first node 110 to the fifth node 150 in path 4, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest link total bandwidth parameter is 100, and the link total link bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment S-A-C-E-D is 10, so the path segment S-B-D is more preferred. Therefore, it can be determined that path 1 has a higher degree of preference, and therefore, path 1 can be determined to be the optimal path from the first node 110 to the fifth node 150 .
  • the FA plane is traversed to find all paths from the first node 110 to the sixth node 160, and the following four paths are obtained:
  • Path 1 first node 110 ⁇ third node 130 ⁇ fifth node 150 ⁇ sixth node 160;
  • Path 2 the first node 110 ⁇ the third node 130 ⁇ the fourth node 140 ⁇ the sixth node 160;
  • Path 3 the first node 110 ⁇ the second node 120 ⁇ the fourth node 140 ⁇ the sixth node 160;
  • Path 4 first node 110 ⁇ second node 120 ⁇ fourth node 140 ⁇ third node 130 ⁇ fifth node 150 ⁇ sixth node 160.
  • the path 1 and path 2 are compared by means of segment judgment. First, find the first intersection node (ie, the third node 130 ) of path 1 and path 2 along the direction from the first node 110 to the sixth node 160 , and then divide the path 1 from the first node 110 to the third node 130 Compare the path segment of path 2 with the path segment from the first node 110 to the third node 130 in path 2.
  • the minimum link total bandwidth parameters of path segment B-D-E and path segment B-C-E are the same.
  • the cumulative value of the IGP metric cost in path segment B-D-E is 101
  • the cumulative value of the IGP metric cost in the path segment B-C-E is 51, so the path segment B-C-E has a higher degree of preference, so it can be determined that the path 2 has a higher degree of preference.
  • path 2 and path 3 by means of segment judgment. First, find the first intersection node (ie, the fourth node 140 ) of path 2 and path 3 along the direction from the first node 110 to the sixth node 160 , and then divide the path 2 from the first node 110 to the fourth node 140
  • the path segment (denoted as path segment S-B-C) is compared with the path segment (denoted as path segment S-A-C) from the first node 110 to the fourth node 140 in path 3, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest link bandwidth parameter is 10, and the link total bandwidth parameter of the link with the smallest link total bandwidth parameter in the path segment S-A-C is 10.
  • the path segment S-B-C and the path segment The minimum link total bandwidth parameters of S-A-C are the same.
  • the IGP metric cost is compared. Since the cumulative value of the IGP metric cost in the path segment S-B-C is 51, and the cumulative value of the IGP metric cost in the path segment S-A-C is 101, so the path Fragment S-B-C is more preferred, so route 2 can be determined to be more preferred.
  • path 2 and path 4 are compared by means of segment judgment.
  • the path segment (denoted as path segment S-B) is compared with the path segment (denoted as path segment S-A-C-B) from the first node 110 to the third node 130 in path 4, and the total link bandwidth parameter is compared first.
  • the total link bandwidth parameter of the link with the smallest total link bandwidth parameter is 100, and the total link bandwidth parameter of the link with the smallest total link bandwidth parameter in the path segment S-A-C-B is 10, so the path segment S-B has a higher degree of preference. Therefore, it can be determined that the priority of the path 2 is higher, and therefore, the path 2 can be determined to be the optimal path from the first node 110 to the sixth node 160 .
  • the first node 110 is the root node of the shortest path tree
  • the second node 120, the third node 130, the fourth node 140, the fifth node 150 and the sixth node 160 are other nodes in the shortest path tree, respectively
  • the optimal path from the first node 110 to other nodes can be directly obtained in the shortest path tree, for example, the shortest path tree shown in FIG.
  • the optimal path is the first node 110 ⁇ the third node 130 ⁇ the fifth node 150; and the optimal path from the first node 110 to the second node 120 is the first node 110 ⁇ the third node 130 ⁇ the fourth node 140 ⁇ Second node 120.
  • an embodiment of the present application also provides a network element, where the network element includes: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor and memory may be connected by a bus or otherwise.
  • the memory can be used to store non-transitory software programs and non-transitory computer-executable programs.
  • 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 from the processor, which may be connected to the processor through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • the network element in this embodiment can be applied to, for example, the network controller or the first node 110 in the embodiment shown in FIG. 1 , and the network element in this embodiment can form the These embodiments all belong to the same inventive concept, so these embodiments have the same implementation principles and technical effects, and will not be described in detail here.
  • the non-transitory software programs and instructions required to implement the path acquisition method of the above embodiment are stored in the memory, and when executed by the processor, execute the path acquisition method in the above embodiment, for example, execute the above-described path acquisition method in FIG. 2 .
  • Method steps S810 to S840, method steps S841 to S843 in FIG. 9 are stored in the memory, and when executed by the processor, execute the path acquisition method in the above embodiment, for example, execute the above-described path acquisition method in FIG. 2 .
  • the network element embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • an embodiment of the present application also provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by a processor or controller, for example, by the above-mentioned Executed by a processor in the network element embodiment, the above-mentioned processor may execute the path acquisition method in the above-mentioned embodiment, for example, the above-described method steps S100 to S200 in FIG. 2 and method steps S210 to S210 in S240, method steps S510 to S550 in FIG. 5, method steps S531 to S532 in FIG. 6, method steps S541 to S542 in FIG. 7, method steps S810 to S840 in FIG. 8, method steps S841 to S841 in FIG. S843.
  • the above-mentioned processor may execute the path acquisition method in the above-mentioned embodiment, for example, the above-described method steps S100 to S200 in FIG. 2 and method steps S210 to S210 in S240, method steps S510 to S
  • the embodiment of the present application includes: determining the path to be selected from the starting node to the target node; when there are multiple paths to be selected, processing all the paths to be selected based on link bandwidth constraints to obtain the optimal path, wherein,
  • the link bandwidth constraints are determined according to flexible algorithm information flooded in the network, and the flexible algorithm information includes constraint type information corresponding to the link bandwidth constraints.
  • the solutions provided in the embodiments of the present application can support the path selection based on link bandwidth constraints, so that the service traffic in the FA plane can be routed according to the link bandwidth constraints, so as to avoid unnecessary Necessary traffic congestion.
  • 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, magnetic tape, magnetic disk storage or other magnetic storage devices, or may 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 can include any information delivery media, as is well known to those of ordinary skill in the art .

Landscapes

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

Abstract

一种路径获取方法、网元及计算机可读存储介质。其中，路径获取方法包括：确定从起始节点至目标节点的待选路径(S100)；当待选路径的数量有多个，对所有待选路径进行基于链路带宽约束条件的处理得到最优路径(S200)，其中，链路带宽约束条件根据网络中泛洪的灵活算法信息而确定，灵活算法信息包括与链路带宽约束条件对应的约束类型信息。

Description

路径获取方法、网元及计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为202110300323.2、申请日为2021年03月22日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及但不限于通信技术领域，尤其涉及一种路径获取方法、网元及计算机可读存储介质。
背景技术
网络切片(Slice)对承载网的核心需求，就是不同的网络切片需要有其专属的承载子网络，为了支持网络切片的需求，现有的方式是采用内部网关协议(Interior Gateway Protocol，IGP)灵活算法(Flex Algorithm，FA)技术，在同一物理网络拓扑内运行多种IGP算法创建多个包含有不同节点资源和链路资源的FA平面，每个FA平面可表示一张网络切片，可将不同的上层业务流量承载在不同的FA平面上。
然而，当前的IGP FA技术仅支持基于最小度量类型(metric type)约束的路径计算，例如基于最小IGP度量约束、最小流量工程(Traffic Engineering，TE)度量约束或最小延迟度量约束的路径计算，无法支持基于链路带宽约束的路径计算，从而可能会导致运行在FA平面内的多个业务流量在特定的物理链路上发生拥塞而其它物理链路却十分空闲的情况。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本申请实施例提供了一种路径获取方法、网元及计算机可读存储介质。
第一方面，本申请实施例提供了一种路径获取方法，应用于网元，所述方法包括：确定从起始节点至目标节点的待选路径；当所述待选路径的数量有多个，对所有所述待选路径进行基于链路带宽约束条件的处理得到最优路径，其中，所述链路带宽约束条件根据网络中泛洪的灵活算法信息而确定，所述灵活算法信息包括与所述链路带宽约束条件对应的约束类型信息。
第二方面，本申请实施例还提供了一种网元，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如上第一方面所述的路径获取方法。
第三方面，本申请实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如上所述的路径获取方法。本申请的其它特征和优点将在随后的说明书中阐述，并且，部分地从说明书中变得显而易见，或者通过实施本申请而了解。本申请的目的和其他优点可通过在说明书、权利要求书以及附图中所特别指出的结构来实现和获得。
附图说明
附图用来提供对本申请技术方案的进一步理解，并且构成说明书的一部分，与本申请的实施例一起用于解释本申请的技术方案，并不构成对本申请技术方案的限制。
图1是本申请一个实施例提供的用于执行路径获取方法的网络拓扑的示意图；
图2是本申请一个实施例提供的路径获取方法的流程图；
图3是本申请一个实施例提供的新增有约束类型信息的Sub-TLV的部分结构示意图；
图4是图2中步骤S200的具体步骤的流程图；
图5是本申请一个实施例提供的基于链路带宽约束和最小度量类型约束的链路比较处理的具体流程图；
图6是图5中步骤S530的具体步骤的流程图；
图7是图5中步骤S540的具体步骤的流程图；
图8是本申请一个实施例提供的基于链路带宽约束和最小度量类型约束的比较判断处理的具体流程图；
图9是图8中步骤S840的具体步骤的流程图；
图10是本申请一个具体示例提供的最短路径树的示意图；
图11是本申请一个具体示例提供的用于执行路径获取方法的网络拓扑的示意图；
图12是本申请另一具体示例提供的最短路径树的示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请提供了一种路径获取方法、网元及计算机可读存储介质，通过先在网络中泛洪包括有与链路带宽约束条件对应的约束类型信息的灵活算法信息，使得网元在计算从起始节点至目标节点的最优路径的过程中，可以先确定从起始节点至目标节点的待选路径，当确定的待选路径有多个时，再对所有待选路径进行基于链路带宽约束条件的处理，以便于网元能够从这些待选路径中获取最优路径，因此，本申请实施例提供的方案能够支持基于链路带宽约束的路径选择，从而能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
下面结合附图，对本申请实施例作进一步阐述。
如图1所示，图1是本申请一个实施例提供的用于执行路径获取方法的网络拓扑的示意图。在图1的示例中，该网络拓扑包括第一节点110、第二节点120、第三节点130、第四节点140和第五节点150。其中，第一节点110、第二节点120、第三节点130、第四节点140和第五节点150均归属于同一个FA平面；第一节点110和第二节点120之间、第二节点120和第三节点130之间、第三节点130和第五节点150之间、第二节点120和第四节点140之间、第四节点140和第五节点150之间，均连接有双向的物理链路，并且，每条物理链路均具有属于其的链路带宽数据和度量代价。
需要说明的是，链路带宽数据可以包括链路总带宽参数、链路剩余带宽参数和链路带宽空闲率等，度量代价可以包括IGP度量代价、TE度量代价和延迟度量代价等，本实施例对此并不作具体限定，例如图1中第二节点120和第三节点130之间的物理链路，假设链路带宽数据为链路总带宽参数，度量代价为IGP度量代价，则第二节点120和第三节点130之间的物理链路的链路总带宽参数为10，IGP度量代价为2。
其中，第一节点110、第二节点120、第三节点130、第四节点140和第五节点150均可以是路由器或者交换机等网络设备，能够对报文进行转发。
另外，该网络拓扑中还可以包括有网络控制器(图1中未示出)，例如软件定义网络(Software Defined Network，SDN)控制器等，该网络控制器分别与第一节点110、第二节点120、第三节点130、第四节点140和第五节点150连接，能够分别对第一节点110、第二节点120、第三节点130、第四节点140和第五节点150进行控制。
在图1的示例中，每一个节点均可以在该网络拓扑中泛洪携带有与链路带宽约束条件对应的约束类型信息的灵活算法信息；网络控制器或者需要发送报文的起始节点，能够利用来源于网络拓扑中其他节点的本地链路的链路带宽数据和度量代价，结合根据灵活算法信息中的约束类型信息而确定的链路带宽约束条件，进行从起始节点至目标节点的最优路径的计算。
本申请实施例描述的网络拓扑以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着网络拓扑的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域技术人员可以理解的是，图1中示出的拓扑结构并不构成对本申请实施例的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
基于上述网络拓扑的结构，提出本申请的路径获取方法的各个实施例。
如图2所示，图2是本申请一个实施例提供的路径获取方法的流程图，该路径获取方法可以应用于网络中的网元，例如图1所示网络拓扑中的网络控制器或者需要发送报文的起始节点(如第一节点110)，该路径获取方法包括但不限于有步骤S100和步骤S200。
步骤S100，确定从起始节点至目标节点的待选路径。
本步骤中，当需要计算FA平面中从起始节点至目标节点的最优路径时，可以先遍历该FA平面以寻找从起始节点至目标节点的所有可达路径，如果遍历得到的可达路径只有一个，即可认为该遍历得到的可达路径为从起始节点至目标节点的最优路径，如果遍历得到的可达路径有多个，则可以先将这些遍历得到的可达路径作为待选路径，以便于后续步骤可以从这些待选路径中获取最优路径。例如图1所示的网络拓扑中，假设需要计算从第一节点110至第五节点150的最优路径，则可以先遍历该网络拓扑，得到从第一节点110至第五节点150的所有可达路径，其中，这些可达路径分别为：
①第一节点110→第二节点120→第三节点130→第五节点150；
②第一节点110→第二节点120→第四节点140→第五节点150；
由于遍历得到的可达路径有两个，因此可以将这两个可达路径确定为从第一节点110至第五节点150的待选路径，以便于后续步骤可以从这两个待选路径中获取最优路径。
步骤S200，当待选路径的数量有多个，对所有待选路径进行基于链路带宽约束条件的处理得到最优路径。
本步骤中，当在步骤S100中确定的待选路径的数量有多个时，可以对所有待选路径进行基于链路带宽约束条件的处理，从而得到从起始节点至目标节点的最优路径。
值得注意的是，从起始节点至目标节点的最优路径的数量可能为一个，也可能为多个，当最优路径有多个时，这些最优路径之间可以形成负荷分担。
需要说明的是，链路带宽约束条件根据网络中泛洪的灵活算法信息而确定，其中，灵活算法信息携带有与该链路带宽约束条件对应的约束类型信息。具体地，链路带宽约束条件可以包括：在从同一起始节点至同一目标节点的多个路径中，所选择的路径中链路带宽数据最小的链路的链路带宽数据大于剩余的任一路径中链路带宽数据最小的链路的链路带宽数据。需要说明的是，链路带宽数据可以包括但不限于有链路总带宽参数、链路剩余带宽参数和链路带宽空闲率等。
需要说明的是，链路总带宽参数是指链路所能提供的最大带宽上限值，该最大带宽上限值可以受配置指定和修改。链路剩余带宽参数是指链路总带宽参数减去链路已用带宽参数所得到的带宽参数，其中，链路已用带宽参数是指流经链路的流量带宽参数，链路已用带宽参数会跟随网络中业务流量的变化而动态变化，链路已用带宽参数可以从网络中通过实时测量而得到。链路带宽空闲率是指链路剩余带宽参数除以链路总带宽参数所得到的带宽参数。
需要说明的是，链路带宽数据可以是物理链路的带宽数据，也可以是物理链路上对应于特定算法信息(algorithm)的带宽数据，本实施例对此并不作具体限定。当链路带宽数据为物理链路上对应于特定算法信息的带宽数据时，链路总带宽参数即为“与特定算法信息对应的总带宽参数”，链路剩余带宽参数即为“与特定算法信息对应的剩余带宽参数”，链路已用带宽参数即为“与特定算法信息对应的已用带宽参数”，链路带宽空闲率即为“与特定算法信息对应的带宽空闲率”。具体地，“与特定算法信息对应的总带宽参数”是指被多个FA平面共享的链路为与该特定算法信息对应的FA平面分配的总带宽份额；“与特定算法信息对应的剩余带宽参数”是指“与特定算法信息对应的总带宽参数”减去“与特定算法信息对应的已用带宽参数”所得到的带宽参数，其中，“与特定算法信息对应的已用带宽参数”是指流经链路的与特定算法信息对应的流量带宽参数，“与特定算法信息对应的已用带宽参数”会跟随网络中与该特定算法信息对应的业务流量的变化而动态变化，“与特定算法信息对应的已用带宽参数”可以从网络中通过实时测量而得到；“与特定算法信息对应的带宽空闲率”是指“与特定算法信息对应的剩余带宽参数”除以“与特定算法信息对应的总带宽参数”所得到的带宽参数。
下面以一个具体的示例对在网络中泛洪的灵活算法信息进行描述。
在一示例中，可以在标准draft-ietf-lsr-flex-algo-13的基础上，在ISIS Flexible Algorithm Definition Flags Sub-TLV或OSPF Flexible Algorithm Definition Flags Sub-TLV中新增一个约束类型信息，用以表示具体的链路带宽约束条件。新增有该约束类型信息的Sub-TLV的部分结构如图3所示，在图3中，包括有如下字段结构：
M：占1比特，为当前标准draft-ietf-lsr-flex-algo-13中定义的标识位；
B：占3比特，即本示例中新增的约束类型信息，用于表示在IGP FA平面的最优路径计算过程中是否需要结合链路带宽约束条件进行计算，其中，本字段的具体取值及相关含义如下：
取值为0时：不需要结合链路带宽约束条件进行路径计算，仅根据当前IGP FA技术中定义的最小度量类型约束条件进行路径计算；
取值为1时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路总带宽参数的链路带宽约束条件进行路径计算；
取值为2时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路剩余带宽参数的链路带宽约束条件进行路径计算；
取值为3时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路带宽空闲率的链路带宽约束条件进行路径计算；
取值为4时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为与特定算法信息对应的总带宽参数的链路带宽约束条件进行路径计算；
取值为5时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为与特定算法信息对应的剩余带宽参数的链路带宽约束条件进行路径计算；
取值为6时：需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为与特定算法信息对应的带宽空闲率的链路带宽约束条件进行路径计算。
值得注意的是，B字段的具体取值及相关含义并不限定为上述内容，可以根据实际的应用情况进行适当的设置。例如，当B字段取值为4时，表示需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路带宽空闲率的链路带宽约束条件进行路径计算；又如，当B字段取值为1时，表示需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路剩余带宽参数的链路带宽约束条件进行路径计算，而当B字段取值为2时，表示需将当前IGP FA技术中定义的最小度量类型约束条件结合基于链路带宽数据为链路总带宽参数的链路带宽约束条件进行路径计算。
需要说明的是，最小度量类型约束条件为当前IGP FA技术中定义的约束条件，包括最小IGP度量约束条件、最小TE度量约束条件和最小延迟度量约束条件。关于最小度量类型约束条件的具体内容，可以参考当前的标准draft-ietf-lsr-flex-algo-13中的相关描述，此处不再赘述。
需要说明的是，在同一个FA平面内的多个节点，可能会进行不同的灵活算法信息的通告，此时，该FA平面内的各节点均会根据优先级对这些灵活算法信息进行择优，以选择最优的灵活算法信息进行该FA平面内的最优路径计算。如果最优的灵活算法信息中携带的约束类型信息不为0，那么在进行最优路径的计算过程中，将会先根据相应的链路带宽约束条件选择链路带宽数据最优的路径，当选择的链路带宽数据最优的路径有多个时，再根据最小度量类型约束条件从这些链路带宽数据最优的路径中选择最优路径，如果最后获取到的最优路径有多个，则这些最优路径可以形成负荷分担。
本实施例中，通过采用包括有上述步骤S100和步骤S200的路径获取方法，使得在网络中泛洪有携带有与链路带宽约束条件对应的约束类型信息的灵活算法信息的情况下，当网元进行从起始节点至目标节点的最优路径的计算时，可以先确定从起始节点至目标节点的待选路径，当确定的待选路径有多个时，再对所有待选路径进行基于链路带宽约束条件的处理，从而从这些待选路径中获取最优路径，所以，本实施例能够支持基于链路带宽约束的路径选择，从而能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
值得注意的是，可以采用本实施例的路径获取方法得到从起始节点至FA平面内所有其他节点的最优路径，在获取了从该起始节点至FA平面内所有其他节点的最优路径的情况下，可以利用这些最优路径构建与灵活算法信息相关的无环的最短路径树，其中，该最短路径树的根节点 为该起始节点，该最短路径树的其他节点则分别为该FA平面内的其他节点。另外，还可以采用本实施例的路径获取方法实现当前标准draft-ietf-rtgwg-segment-routing-ti-lfa-05中描述的拓扑无关的无环备份(Topology Independent Loop-free Alternate，TI-LFA)机制以计算备份路径。例如，起始节点采用本实施例的路径获取方法得到至某个目标节点的最优路径后，可假设该最优路径中起始节点的下一跳节点或至下一跳节点的链路出现了故障，然后使用TI-LFA算法计算备份路径，在TI-LFA计算过程中，采用本实施例的路径获取方法得到新的最优路径，并且该新的最优路径没有经过假设发生故障的节点或链路。
在一实施例中，在该路径获取方法应用于需要发送报文的起始节点的情况下，该路径获取方法还可以包括但不限于有以下步骤：
当本地链路的链路带宽数据发生更新，并且更新后的链路带宽数据满足对外通告条件，对外通告更新后的链路带宽数据，重新对所有待选路径进行基于链路带宽约束条件的处理得到新的最优路径。
需要说明的是，本地链路的链路带宽数据会根据实际情况而发生变化，例如，当链路带宽数据为链路总带宽参数时，网络控制器或者网络管理员可能会根据当前的网络情况对链路总带宽参数进行修改配置；当链路带宽数据为链路剩余带宽参数时，由于网络中的业务流量是动态变化的，即链路已用带宽参数是动态变化的，因此链路剩余带宽参数也是动态变化的。
当本节点的本地链路的链路带宽数据发生更新时，将会导致以本节点作为目标节点或者经过本节点的所有路径的链路带宽数据发生变化，因此，本节点需要对外通告本地链路的更新后的链路带宽数据，以使FA平面内的其他节点在计算以本节点作为目标节点的最优路径或者计算途径本节点的最优路径时能够得到准确的结果。此外，当本节点的本地链路的链路带宽数据发生更新时，还会导致从本节点至目标节点的所有待选路径的链路带宽数据发生变化，因此，需要重新对所有待选路径进行基于链路带宽约束条件的处理，从而得到新的最优路径。
在一实施例中，为了避免由于链路带宽数据变化太频繁而导致需要频繁地重新计算最优路径，可以在各个节点内设置链路带宽数据的对外通告条件，只有在更新后的链路带宽数据满足对外通告条件的情况下，才会对外通告更新后的链路带宽数据，以及重新对所有待选路径进行基于链路带宽约束条件的处理以得到新的最优路径。
需要说明的是，对外通告条件可以包括如下至少一个条件：
条件1：更新后的链路带宽数据与更新前的链路带宽数据的差值的绝对值大于预设更新阈值；
条件2：链路带宽数据发生更新的时间距离上一次对外通告链路带宽数据的时间达到预设时间阈值。
需要说明的是，条件1中的预设更新阈值以及条件2中预设时间阈值，均可以根据实际应用情况而进行适当的选择，本实施例对此并不作具体限定。
在一实施例中，如图4所示，步骤S200可以包括但不限于有以下步骤：
步骤S210，从所有待选路径中随机选择两个待选路径；
步骤S220，将选择的两个待选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理得到优选路径；
步骤S230，从剩余的待选路径中依次选择一个待选路径，在每次选择待选路径之后，将选择的待选路径与优选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理得到目标路径，并将目标路径更新优选路径；
步骤S240，将最后得到的优选路径作为最优路径。
本实施例中，当需要对多个待选路径进行基于链路带宽约束条件的处理时，可以先从所有待选路径中随机选择两个待选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理，得到优选路径，然后从剩余的待选路径中选择一个待选路径，并将该待选路径与优选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理，得到目标路径，接着将目标路径更新优选路径，然后再从剩余的待选路径中选择一个待选路径，并将该待选路径与更新后的优选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理，得到新的目标路径，接着再利用该新的目标路径将该更新后的优选路径进行更新，如此循环，直到所有待选路径均完成了基于链路带宽约束和最小度量类型约束的链路比较处理，此时，最后得到的优选路径即为最优路 径。
本实施例中，通过采用上述步骤S210至步骤S240，能够对所有待选路径均进行基于链路带宽约束和最小度量类型约束的链路比较处理，从而能够从所有待选路径中获取符合链路带宽约束条件和最小度量类型约束条件的最优路径，以便于能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
在一实施例中，如图5所示，该基于链路带宽约束和最小度量类型约束的链路比较处理，包括有以下步骤：
步骤S510，确定第一路径和第二路径，第一路径和第二路径具有相同的首节点和相同的尾节点；
步骤S520，根据从首节点至尾节点的方向，确定第一路径和第二路径的除首节点之外的相交节点；
步骤S530，根据首节点和相交节点分别得到第一路径的路径片段和第二路径的路径片段；
步骤S540，利用基于链路带宽约束和最小度量类型约束的比较判断处理对第一路径的路径片段和第二路径的路径片段进行比较，得到优选路径片段；
步骤S550，获取优选路径片段对应的路径。
本实施例中，基于链路带宽约束和最小度量类型约束的链路比较处理，主要包括：先确定第一路径和第二路径，其中，第一路径和第二路径需要具有相同的首节点和相同的尾节点，然后，根据从首节点至尾节点的方向，确定这两个路径的除首节点之外的相交节点，此时，可以根据首节点和相交节点分别得到这两个路径的路径片段，接着，利用基于链路带宽约束和最小度量类型约束的比较判断处理对这两个路径的路径片段进行比较，得到优选路径片段，然后，获取该优选路径片段对应的路径，即完成了基于链路带宽约束和最小度量类型约束的链路比较处理。
需要说明的是，步骤S550中获取到的优选路径片段对应的路径，是步骤S510中的第一路径和第二路径中优选程度更高的路径，因此，通过采用本实施例中的基于链路带宽约束和最小度量类型约束的链路比较处理，能够得到两个路径中优选程度更高的路径。例如，上述步骤S220中的将选择的两个待选路径进行该基于链路带宽约束和最小度量类型约束的链路比较处理而得到的优选路径，是这两个待选路径中优选程度更高的路径；又如，上述步骤S230中的将选择的待选路径与优选路径进行该基于链路带宽约束和最小度量类型约束的链路比较处理而得到的目标路径，是该待选路径与该优选路径中优选程度更高的路径。
需要说明的是，步骤S540中的基于链路带宽约束和最小度量类型约束的比较判断处理，将在后面的内容中进行详细的描述说明。
在一实施例中，在相交节点的数量为多个的情况下，如图6所示，步骤S530具体可以包括但不限于有以下步骤：
步骤S531，根据首节点和相交节点得到第一路径的从首节点至第一个相交节点的路径片段以及相邻两个相交节点之间的路径片段；
步骤S532，根据首节点和相交节点得到第二路径的从首节点至第一个相交节点的路径片段以及相邻两个相交节点之间的路径片段。
在本实施例中，由于第一路径和第二路径的除首节点之外的相交节点包括有多个，因此第一路径和第二路径均可以分成多个路径片段，其中包括从首节点至第一个相交节点的路径片段和相邻两个相交节点之间的路径片段。例如图1所示的网络拓扑中，假设第一节点110为首节点，第五节点150为尾节点，第一路径包括第一节点110、第二节点120、第三节点130和第五节点150，第二路径包括第一节点110、第二节点120、第四节点140和第五节点150，那么，这两个路径均可以分成2个路径片段，其中，第一路径和第二路径的第一个路径片段均为从第一节点110至第二节点120，第一路径的第二个路径片段为从第二节点120经过第三节点130至第五节点150，而第二路径的第二个路径片段则为从第二节点120经过第四节点140至第五节点150。
在本实施例中，当得到第一路径和第二路径的多个路径片段之后，即可采用步骤S540对第一路径和第二路径的多个路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处理， 得到优选路径片段，以便于后续步骤能够获取该优选路径片段对应的路径。
在一实施例中，如图7所示，步骤S540具体可以包括但不限于有以下步骤：
步骤S541，沿着从首节点至尾节点的方向，分别从第一路径中和从第二路径中依次选择具有相同端节点的路径片段，在每次选择路径片段之后，将选择的第一路径的路径片段和选择的第二路径的路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处理得到备选路径片段，直到备选路径片段满足预设路径条件；
步骤S542，将满足预设路径条件的备选路径片段作为优选路径片段。
需要说明的是，预设路径条件可以为如下任意一个条件：
条件1：在当前处理中得到的备选路径片段的数量为一个；
条件2：在当前处理中得到的备选路径片段的数量为两个，并且选择的第一路径的路径片段为第一路径中的最后一个路径片段，选择的第二路径的路径片段为第二路径中的最后一个路径片段。
本实施例中，当需要对两个路径进行基于链路带宽约束和最小度量类型约束的比较判断处理时，在两个路径均包括有多个路径片段的情况下，可以沿着从首节点至尾节点的方向，先选择第一路径的第一个路径片段和第二路径的第一个路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处理以得到备选路径片段，然后判断该备选路径片段是否满足满足预设路径条件。如果得到的备选路径片段只有一个，则可以将该备选路径片段作为优选路径片段；如果得到的备选路径片段有两个，并且第一路径的第一个路径片段即是第一路径中的最后一个路径片段，第二路径的第一个路径片段即是第二路径中的最后一个路径片段(即第一路径和第二路径仅有首节点和尾节点为相交节点)，则可以将这两个备选路径片段均作为优选路径片段；如果得到的备选路径片段有两个，但第一路径的第一个路径片段不是第一路径中的最后一个路径片段，第二路径的第一个路径片段不是第二路径中的最后一个路径片段(即第一路径和第二路径具有除了首节点和尾节点之外的其他相交节点)，则需要选择第一路径的第二个路径片段和第二路径的第二个路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处理以得到新的备选路径片段，再判断该新的备选路径片段是否满足满足预设路径条件，如此循环，直到得到备选路径片段满足预设路径条件，当备选路径片段满足预设路径条件时，此时的备选路径片段即为优选路径片段。
本实施例中，通过采用上述步骤S541和步骤S542，能够利用分段判断的方式对第一路径和第二路径进行基于链路带宽约束和最小度量类型约束的比较判断处理，由于本实施例是对第一路径和第二路径的路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处理，并不需要获取第一路径和第二路径的全量路径信息，因此能够降低处理的数据量，从而能够提高处理效率。
在一实施例中，如图8所示，该基于链路带宽约束和最小度量类型约束的比较判断处理，包括有以下步骤：
步骤S810，确定第一转发路径和第二转发路径，第一转发路径和第二转发路径具有相同的开始节点和相同的结束节点；
步骤S820，获取第一转发路径中的第一带宽参数和第二转发路径中的第二带宽参数，其中，第一带宽参数为第一转发路径中链路带宽数据最小的链路的链路带宽数据，第二带宽参数为第二转发路径中链路带宽数据最小的链路的链路带宽数据；
步骤S830，获取第一转发路径的第一度量代价和第二转发路径的第二度量代价；
步骤S840，根据第一带宽参数、第二带宽参数、第一度量代价和第二度量代价对第一转发路径和第二转发路径进行比较判断，得到优选程度更高的路径。
本实施例中，基于链路带宽约束和最小度量类型约束的比较判断处理，主要包括：先确定第一转发路径和第二转发路径，其中，第一转发路径和第二转发路径需要具有相同的开始节点和相同的结束节点，然后，分别获取第一转发路径中链路带宽数据最小的链路的链路带宽数据(即第一带宽参数)、第一转发路径的第一度量代价、第二转发路径中链路带宽数据最小的链路的链路带宽数据(即第二带宽参数)以及第二转发路径的第二度量代价，接着，利用第一带宽参数、第二带宽参数、第一度量代价和第二度量代价对第一转发路径和第二转发路径进行比 较判断，即可从第一转发路径和第二转发路径中得到优选程度更高的路径，此时，即完成了基于链路带宽约束和最小度量类型约束的比较判断处理。
需要说明的是，步骤S820中获取到的第一带宽参数和第二带宽参数为同一类型的带宽参数，例如可以为链路总带宽参数、链路剩余带宽参数和链路带宽空闲率中的任意一个，本实施例对此并不作具体限定。另外，步骤S830中获取到的第一度量代价和第二度量代价为同一类型的度量代价，例如可以为IGP度量代价、TE度量代价和延迟度量代价中的任意一个，本实施例对此并不作具体限定。
本实施例中，通过采用上述步骤S810至步骤S840，能够利用第一带宽参数、第二带宽参数、第一度量代价和第二度量代价对第一转发路径和第二转发路径进行比较判断以得到优选程度更高的路径，从而实现了基于链路带宽约束的路径选择，以便于能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
在一实施例中，如图9所示，步骤S840具体可以包括但不限于有以下步骤：
步骤S841，将第一带宽参数和第二带宽参数进行比较得到第一比较结果；
步骤S842，当第一比较结果为第一带宽参数与第二带宽参数不相同，将第一带宽参数和第二带宽参数中数值最大的一个对应的路径作为优选程度更高的路径；
步骤S843，当第一比较结果为第一带宽参数与第二带宽参数相同，将第一度量代价和第二度量代价进行比较得到第二比较结果，根据第二比较结果从第一转发路径和第二转发路径中得到优选程度更高的路径。
本实施例中，在根据第一带宽参数、第二带宽参数、第一度量代价和第二度量代价对第一转发路径和第二转发路径进行比较判断的过程中，可以先对第一带宽参数和第二带宽参数进行比较以得到第一比较结果，然后再根据该第一比较结果执行对应的后续处理。如果第一比较结果为第一带宽参数与第二带宽参数不相同，即说明第一转发路径和第二转发路径中的一个具有更优的链路带宽数据，所以，可以将第一带宽参数和第二带宽参数中数值最大的一个对应的路径作为优选程度更高的路径，例如，假设第一带宽参数大于第二带宽参数，则第一转发路径为优选程度更高的路径，反之，第二转发路径为优选程度更高的路径。如果第一比较结果为第一带宽参数与第二带宽参数相同，即说明第一转发路径和第二转发路径具有相同的最小链路带宽数据，所以，需要进一步对第一度量代价和第二度量代价进行比较以得到第二比较结果，并根据第二比较结果从第一转发路径和第二转发路径中获取优选程度更高的路径。
本实施例中，通过采用上述步骤S841至步骤S843，先根据第一带宽参数与第二带宽参数的比较结果确定优选程度更高的路径，在根据第一带宽参数与第二带宽参数的比较结果确定不了优选程度更高的路径的情况下，再根据第一度量代价和第二度量代价的比较结果确定优选程度更高的路径，从而实现了先判断链路带宽约束条件而后判断最小度量类型约束条件的处理，所以，本实施例能够实现基于链路带宽约束的路径选择，从而能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
在一实施例中，步骤S843中的根据第二比较结果从第一转发路径和第二转发路径中得到优选程度更高的路径，具体可以包括但不限于有以下步骤：
当第二比较结果为第一度量代价和第二度量代价不相同，将第一度量代价和第二度量代价中数值最小的一个对应的路径作为优选程度更高的路径。
本实施例中，当第二比较结果为第一度量代价和第二度量代价不相同，即说明第一转发路径和第二转发路径中的一个具有更优的度量代价，所以，可以将第一度量代价和第二度量代价中数值最小的一个对应的路径作为优选程度更高的路径，例如，假设第一度量代价小于第二度量代价，则第一转发路径为优选程度更高的路径，反之，第二转发路径为优选程度更高的路径。
此外，在一实施例中，步骤S843中的根据第二比较结果从第一转发路径和第二转发路径中得到优选程度更高的路径，还可以包括但不限于有以下步骤：
当第二比较结果为第一度量代价和第二度量代价相同，将第一转发路径和第二转发路径均作为优选程度更高的路径。
本实施例中，当第二比较结果为第一度量代价和第二度量代价相同，即说明第一转发路径和第二转发路径具有相同的度量代价，由于在前面的比较判断中确定了第一转发路径和第二转 发路径具有相同的最小链路带宽数据，因此，可以确定第一转发路径和第二转发路径的优选程度相等，所以，可以将第一转发路径和第二转发路径均作为优选程度更高的路径。
为了更加清楚的说明路径获取方法的处理流程，下面以具体的示例进行说明。
示例一：
在如图1所示的网络拓扑中，包括有第一节点110、第二节点120、第三节点130、第四节点140和第五节点150。其中，第一节点110、第二节点120、第三节点130、第四节点140和第五节点150均归属于同一个FA平面；第一节点110和第二节点120之间、第二节点120和第三节点130之间、第三节点130和第五节点150之间、第二节点120和第四节点140之间、第四节点140和第五节点150之间，均连接有双向的物理链路，并且，每条物理链路均具有属于其的链路总带宽参数和IGP度量代价。其中，第一节点110和第二节点120之间的物理链路的链路总带宽参数为1，IGP度量代价为1；第二节点120和第三节点130之间的物理链路的链路总带宽参数为10，IGP度量代价为2；第三节点130和第五节点150之间的物理链路的链路总带宽参数为5，IGP度量代价为2；第二节点120和第四节点140之间的物理链路的链路总带宽参数为10，IGP度量代价为20；第四节点140和第五节点150之间的物理链路的链路总带宽参数为10，IGP度量代价为20。
在如图1所示网络拓扑的基础上，计算从第一节点110至其他节点的最优路径，并根据这些最优路径构建最短路径树，具体的处理过程如下所示：
(1)计算从第一节点110至第二节点120的最优路径。
首先，遍历FA平面以寻找从第一节点110至第二节点120的所有路径，根据图1所示的网络拓扑可知，从第一节点110至第二节点120的路径只有一个，因此，该路径即为从第一节点110至第二节点120的最优路径。
(2)计算从第一节点110至第三节点130的最优路径。
首先，遍历FA平面以寻找从第一节点110至第三节点130的所有路径，得到如下两个路径：
路径1：第一节点110→第二节点120→第三节点130；
路径2：第一节点110→第二节点120→第四节点140→第五节点150→第三节点130。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第三节点130的方向找到路径1和路径2的第一个相交节点(即第二节点120)，然后将路径1中从第一节点110至第二节点120的路径片段与路径2中从第一节点110至第二节点120的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径1和路径2的第二个相交节点(即第三节点130)，然后将路径1中从第二节点120至第三节点130的路径片段(记为路径片段A-B)与路径2中从第二节点120至第三节点130的路径片段(记为路径片段A-C-D-B)进行比较，由于路径片段A-B中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段A-C-D-B中的链路总带宽参数最小的链路的链路总带宽参数为5，因此，路径片段A-B的优选程度更高，所以，可以确定路径1为从第一节点110至第三节点130的最优路径。
(3)计算从第一节点110至第四节点140的最优路径。
首先，遍历FA平面以寻找从第一节点110至第四节点140的所有路径，得到如下两个路径：
路径1：第一节点110→第二节点120→第四节点140；
路径2：第一节点110→第二节点120→第三节点130→第五节点150→第四节点140。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第四节点140的方向找到路径1和路径2的第一个相交节点(即第二节点120)，然后将路径1中从第一节点110至第二节点120的路径片段与路径2中从第一节点110至第二节点120的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径1和路径2的第二个相交节点(即第四节点140)，然后将路径1中从第二节点120至第四节点140的路径片段(记为路径片段A-C)与路径2中从第二节点120至第四节点140的路径片段(记为路径片段A-B-D-C)进行比较，由于路径片段A-C中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段A-B-D-C中的链路总带宽参数最小的链路的链路总带宽参数为5，因此，路径片段A-C的优选程度更高，所以，可以确定路径1为从第一节点110至第四节点140的最优路径。
(4)计算从第一节点110至第五节点150的最优路径。
首先，遍历FA平面以寻找从第一节点110至第五节点150的所有路径，得到如下两个路径：
路径1：第一节点110→第二节点120→第三节点130→第五节点150；
路径2：第一节点110→第二节点120→第四节点140→第五节点150。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第五节点150的方向找到路径1和路径2的第一个相交节点(即第二节点120)，然后将路径1中从第一节点110至第二节点120的路径片段与路径2中从第一节点110至第二节点120的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径1和路径2的第二个相交节点(即第五节点150)，然后将路径1中从第二节点120至第五节点150的路径片段(记为路径片段A-B-D)与路径2中从第二节点120至第五节点150的路径片段(记为路径片段A-C-D)进行比较，由于路径片段A-B-D中的链路总带宽参数最小的链路的链路总带宽参数为5，路径片段A-C-D中的链路总带宽参数最小的链路的链路总带宽参数为10，因此，路径片段A-C-D的优选程度更高，所以，可以确定路径2为从第一节点110至第五节点150的最优路径。
(5)根据上述得到的各个最优路径，构建如图10所示的FA平面内的最短路径树。其中，第一节点110为该最短路径树的根节点，第二节点120、第三节点130、第四节点140和第五节点150分别为该最短路径树中的其他节点，并且，可以在该最短路径树中直接得到从第一节点110至其他节点的最优路径，例如，从如图10所示的最短路径树中可以直接得到从第一节点110至第三节点130的最优路径为第一节点110→第二节点120→第三节点130；而从第一节点110至第四节点140的最优路径则为第一节点110→第二节点120→第四节点140。
示例二：
在如图11所示的网络拓扑中，包括有归属于同一个FA平面的第一节点110、第二节点120、第三节点130、第四节点140、第五节点150和第六节点160。其中，第一节点110和第二节点120之间、第二节点120和第四节点140之间、第四节点140和第六节点160之间、第六节点160和第五节点150之间、第五节点150和第三节点130之间、第三节点130和第一节点110之间、第三节点130和第四节点140之间，均连接有双向的物理链路，并且，每条物理链路均具有属于其的链路总带宽参数和IGP度量代价。其中，第一节点110和第二节点120之间的物理链路的链路总带宽参数为10，IGP度量代价为100；第二节点120和第四节点140之间的物理链路的链路总带宽参数为10，IGP度量代价为1；第四节点140和第六节点160之间的物理链路的链路总带宽参数为10，IGP度量代价为1；第六节点160和第五节点150之间的物理链路的链路总带宽参数为10，IGP度量代价为100；第五节点150和第三节点130之间的物理链路的链路总带宽参数为100，IGP度量代价为1；第三节点130和第一节点110之间的物理链路的链路总带宽参数为100，IGP度量代价为1；第三节点130和第四节点140之间的物理链路的链路总带宽参数为10，IGP度量代价为50。
在如图11所示网络拓扑的基础上，计算从第一节点110至其他节点的最优路径，并根据这些最优路径构建最短路径树，具体的处理过程如下所示：
(1)计算从第一节点110至第二节点120的最优路径。
首先，遍历FA平面以寻找从第一节点110至第二节点120的所有路径，得到如下三个路径：
路径1：第一节点110→第二节点120；
路径2：第一节点110→第三节点130→第四节点140→第二节点120；
路径3：第一节点110→第三节点130→第五节点150→第六节点160→第四节点140→第二节点120。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第二节点120的方向找到路径1和路径2的第一个相交节点(即第二节点120)，然后将路径1中从第一节点110至第二节点120的路径片段(记为路径片段S-A)与路径2中从第一节点110至第二节点120的路径片段(记为路径片段S-B-C-A)进行比较，先比较链路总带宽参数，由于路径片段S-A中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段S-B-C-A中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段S-A和路径片段S-B-C-A的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段S-A中的IGP度量代价的累计值为100，路径片段S-B-C-A中的IGP度量代价的累计值为52，因此路径片段S-B-C-A 的优选程度更高，所以可以确定路径2的优选程度更高。
然后，采用分段判断的方式对路径2和路径3进行比较。首先，沿着第一节点110至第二节点120的方向找到路径2和路径3的第一个相交节点(即第三节点130)，然后将路径2中从第一节点110至第三节点130的路径片段与路径3中从第一节点110至第三节点130的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径2和路径3的第二个相交节点(即第四节点140)，然后将路径2中从第三节点130至第四节点140的路径片段(记为路径片段B-C)与路径3中从第三节点130至第四节点140的路径片段(记为路径片段B-D-E-C)进行比较，先比较链路总带宽参数，由于路径片段B-C中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段B-D-E-C中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段B-C和路径片段B-D-E-C的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段B-C中的IGP度量代价的累计值为50，路径片段B-D-E-C中的IGP度量代价的累计值为102，因此路径片段B-C的优选程度更高，所以可以确定路径2的优选程度更高，因此，可以确定路径2为从第一节点110至第二节点120的最优路径。
(2)计算从第一节点110至第三节点130的最优路径。
首先，遍历FA平面以寻找从第一节点110至第三节点130的所有路径，得到如下三个路径：
路径1：第一节点110→第三节点130；
路径2：第一节点110→第二节点120→第四节点140→第三节点130；
路径3：第一节点110→第二节点120→第四节点140→第六节点160→第五节点150→第三节点130。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第三节点130的方向找到路径1和路径2的第一个相交节点(即第三节点130)，然后将路径1中从第一节点110至第三节点130的路径片段(记为路径片段S-B)与路径2中从第一节点110至第三节点130的路径片段(记为路径片段S-A-C-B)进行比较，先比较链路总带宽参数，由于路径片段S-B中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段S-A-C-B中的链路总带宽参数最小的链路的链路总带宽参数为10，因此，路径片段S-B的优选程度更高，所以可以确定路径1的优选程度更高。
然后，采用分段判断的方式对路径1和路径3进行比较。首先，沿着第一节点110至第三节点130的方向找到路径1和路径3的第一个相交节点(即第三节点130)，然后将路径1中从第一节点110至第三节点130的路径片段(记为路径片段S-B)与路径3中从第一节点110至第三节点130的路径片段(记为路径片段S-A-C-E-D-B)进行比较，先比较链路总带宽参数，由于路径片段S-B中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段S-A-C-E-D-B中的链路总带宽参数最小的链路的链路总带宽参数为10，因此路径片段S-B的优选程度更高，所以可以确定路径1的优选程度更高，因此，可以确定路径1为从第一节点110至第三节点130的最优路径。
(3)计算从第一节点110至第四节点140的最优路径。
首先，遍历FA平面以寻找从第一节点110至第四节点140的所有路径，得到如下三个路径：
路径1：第一节点110→第二节点120→第四节点140；
路径2：第一节点110→第三节点130→第四节点140；
路径3：第一节点110→第三节点130→第五节点150→第六节点160→第四节点140。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第四节点140的方向找到路径1和路径2的第一个相交节点(即第四节点140)，然后将路径1中从第一节点110至第四节点140的路径片段(记为路径片段S-A-C)与路径2中从第一节点110至第四节点140的路径片段(记为路径片段S-B-C)进行比较，先比较链路总带宽参数，由于路径片段S-A-C中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段S-B-C中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段S-A-C和路径片段S-B-C的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段S-A-C中的IGP度量代价的累计值为101，路径片段S-B-C中的IGP度量代价的累计值为51，因此路径片段S-B-C的优选程度更高，所以可以确定路径2的优选程度更高。
然后，采用分段判断的方式对路径2和路径3进行比较。首先，沿着第一节点110至第四节点140的方向找到路径2和路径3的第一个相交节点(即第三节点130)，然后将路径2中从第一节点110至第三节点130的路径片段与路径3中从第一节点110至第三节点130的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径2和路径3的第二个相交节点(即第四节点140)，然后将路径2中从第三节点130至第四节点140的路径片段(记为路径片段B-C)与路径3中从第三节点130至第四节点140的路径片段(记为路径片段B-D-E-C)进行比较，先比较链路总带宽参数，由于路径片段B-C中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段B-D-E-C中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段B-C和路径片段B-D-E-C的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段B-C中的IGP度量代价的累计值为50，路径片段B-D-E-C中的IGP度量代价的累计值为102，因此路径片段B-C的优选程度更高，所以可以确定路径2的优选程度更高，因此，可以确定路径2为从第一节点110至第四节点140的最优路径。
(4)计算从第一节点110至第五节点150的最优路径。
首先，遍历FA平面以寻找从第一节点110至第五节点150的所有路径，得到如下四个路径：
路径1：第一节点110→第三节点130→第五节点150；
路径2：第一节点110→第三节点130→第四节点140→第六节点160→第五节点150；
路径3：第一节点110→第二节点120→第四节点140→第三节点130→第五节点150；
路径4：第一节点110→第二节点120→第四节点140→第六节点160→第五节点150。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第五节点150的方向找到路径1和路径2的第一个相交节点(即第三节点130)，然后将路径1中从第一节点110至第三节点130的路径片段与路径2中从第一节点110至第三节点130的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径1和路径2的第二个相交节点(即第五节点150)，然后将路径1中从第三节点130至第五节点150的路径片段(记为路径片段B-D)与路径2中从第三节点130至第五节点150的路径片段(记为路径片段B-C-E-D)进行比较，先比较链路总带宽参数，由于路径片段B-D中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段B-C-E-D中的链路总带宽参数最小的链路的链路总带宽参数为10，因此，路径片段B-D的优选程度更高，所以可以确定路径1的优选程度更高。
然后，采用分段判断的方式对路径1和路径3进行比较。首先，沿着第一节点110至第五节点150的方向找到路径1和路径3的第一个相交节点(即第三节点130)，然后将路径1中从第一节点110至第三节点130的路径片段(记为路径片段S-B)与路径3中从第一节点110至第三节点130的路径片段(记为路径片段S-A-C-B)进行比较，先比较链路总带宽参数，由于路径片段S-B中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段S-A-C-B中的链路总带宽参数最小的链路的链路总带宽参数为10，因此，路径片段S-B的优选程度更高，所以可以确定路径1的优选程度更高。
接着，采用分段判断的方式对路径1和路径4进行比较。首先，沿着第一节点110至第五节点150的方向找到路径1和路径4的第一个相交节点(即第五节点150)，然后将路径1中从第一节点110至第五节点150的路径片段(记为路径片段S-B-D)与路径4中从第一节点110至第五节点150的路径片段(记为路径片段S-A-C-E-D)进行比较，先比较链路总带宽参数，由于路径片段S-B-D中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段S-A-C-E-D中的链路总带宽参数最小的链路的链路总带宽参数为10，因此路径片段S-B-D的优选程度更高，所以可以确定路径1的优选程度更高，因此，可以确定路径1为从第一节点110至第五节点150的最优路径。
(5)计算从第一节点110至第六节点160的最优路径。
首先，遍历FA平面以寻找从第一节点110至第六节点160的所有路径，得到如下四个路径：
路径1：第一节点110→第三节点130→第五节点150→第六节点160；
路径2：第一节点110→第三节点130→第四节点140→第六节点160；
路径3：第一节点110→第二节点120→第四节点140→第六节点160；
路径4：第一节点110→第二节点120→第四节点140→第三节点130→第五节点150→第六节点 160。
接着，采用分段判断的方式对路径1和路径2进行比较。首先，沿着第一节点110至第六节点160的方向找到路径1和路径2的第一个相交节点(即第三节点130)，然后将路径1中从第一节点110至第三节点130的路径片段与路径2中从第一节点110至第三节点130的路径片段进行比较，由于两个路径片段相同，因此继续寻找路径1和路径2的第二个相交节点(即第六节点160)，然后将路径1中从第三节点130至第六节点160的路径片段(记为路径片段B-D-E)与路径2中从第三节点130至第六节点160的路径片段(记为路径片段B-C-E)进行比较，先比较链路总带宽参数，由于路径片段B-D-E中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段B-C-E中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段B-D-E和路径片段B-C-E的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段B-D-E中的IGP度量代价的累计值为101，路径片段B-C-E中的IGP度量代价的累计值为51，因此路径片段B-C-E的优选程度更高，所以可以确定路径2的优选程度更高。
然后，采用分段判断的方式对路径2和路径3进行比较。首先，沿着第一节点110至第六节点160的方向找到路径2和路径3的第一个相交节点(即第四节点140)，然后将路径2中从第一节点110至第四节点140的路径片段(记为路径片段S-B-C)与路径3中从第一节点110至第四节点140的路径片段(记为路径片段S-A-C)进行比较，先比较链路总带宽参数，由于路径片段S-B-C中的链路总带宽参数最小的链路的链路总带宽参数为10，路径片段S-A-C中的链路总带宽参数最小的链路的链路总带宽参数为10，所以，路径片段S-B-C和路径片段S-A-C的最小链路总带宽参数相同，此时，再比较IGP度量代价，由于路径片段S-B-C中的IGP度量代价的累计值为51，路径片段S-A-C中的IGP度量代价的累计值为101，因此路径片段S-B-C的优选程度更高，所以可以确定路径2的优选程度更高。
接着，采用分段判断的方式对路径2和路径4进行比较。首先，沿着第一节点110至第六节点160的方向找到路径2和路径4的第一个相交节点(即第三节点130)，然后将路径2中从第一节点110至第三节点130的路径片段(记为路径片段S-B)与路径4中从第一节点110至第三节点130的路径片段(记为路径片段S-A-C-B)进行比较，先比较链路总带宽参数，由于路径片段S-B中的链路总带宽参数最小的链路的链路总带宽参数为100，路径片段S-A-C-B中的链路总带宽参数最小的链路的链路总带宽参数为10，因此路径片段S-B的优选程度更高，所以可以确定路径2的优选程度更高，因此，可以确定路径2为从第一节点110至第六节点160的最优路径。
(6)根据上述得到的各个最优路径，构建如图12所示的FA平面内的最短路径树。其中，第一节点110为该最短路径树的根节点，第二节点120、第三节点130、第四节点140、第五节点150和第六节点160分别为该最短路径树中的其他节点，并且，可以在该最短路径树中直接得到从第一节点110至其他节点的最优路径，例如，从如图12所示的最短路径树中可以直接得到从第一节点110至第五节点150的最优路径为第一节点110→第三节点130→第五节点150；而从第一节点110至第二节点120的最优路径则为第一节点110→第三节点130→第四节点140→第二节点120。
另外，本申请的一个实施例还提供了一种网元，该网元包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序。
处理器和存储器可以通过总线或者其他方式连接。
存储器作为一种非暂态计算机可读存储介质，可用于存储非暂态软件程序以及非暂态性计算机可执行程序。此外，存储器可以包括高速随机存取存储器，还可以包括非暂态存储器，例如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器可以包括相对于处理器远程设置的存储器，这些远程存储器可以通过网络连接至该处理器。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
需要说明的是，本实施例中的网元，可以应用为例如图1所示实施例中的网络控制器或者第一节点110，本实施例中的网元能够构成图1所示实施例中的网络拓扑的一部分，这些实施例均属于相同的发明构思，因此这些实施例具有相同的实现原理以及技术效果，此处不再详述。
实现上述实施例的路径获取方法所需的非暂态软件程序以及指令存储在存储器中，当被处 理器执行时，执行上述实施例中的路径获取方法，例如，执行以上描述的图2中的方法步骤S100至S200、图4中的方法步骤S210至S240、图5中的方法步骤S510至S550、图6中的方法步骤S531至S532、图7中的方法步骤S541至S542、图8中的方法步骤S810至S840、图9中的方法步骤S841至S843。
以上所描述的网元实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
此外，本申请的一个实施例还提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个处理器或控制器执行，例如，被上述网元实施例中的一个处理器执行，可使得上述处理器执行上述实施例中的路径获取方法，例如，执行以上描述的图2中的方法步骤S100至S200、图4中的方法步骤S210至S240、图5中的方法步骤S510至S550、图6中的方法步骤S531至S532、图7中的方法步骤S541至S542、图8中的方法步骤S810至S840、图9中的方法步骤S841至S843。
本申请实施例包括：确定从起始节点至目标节点的待选路径；当待选路径的数量有多个，对所有待选路径进行基于链路带宽约束条件的处理得到最优路径，其中，链路带宽约束条件根据网络中泛洪的灵活算法信息而确定，灵活算法信息包括与链路带宽约束条件对应的约束类型信息。根据本申请实施例提供的方案，当节点在网络中泛洪包括有与链路带宽约束条件对应的约束类型信息的灵活算法信息之后，当网元进行从起始节点至目标节点的最优路径的计算时，可以先确定从起始节点至目标节点的待选路径，当确定的待选路径有多个时，再对所有待选路径进行基于链路带宽约束条件的处理，从而从这些待选路径中获取最优路径，所以，本申请实施例提供的方案能够支持基于链路带宽约束的路径选择，从而能够根据链路带宽约束条件对FA平面内的业务流量进行路径编排，以避免不必要的流量拥塞。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
以上是对本申请的若干实施进行了具体说明，但本申请并不局限于上述实施方式，熟悉本领域的技术人员在不违背本申请精神的前提下还可作出种种的等同变形或替换，这些等同的变形或替换均包含在本申请权利要求所限定的范围内。

Claims (14)

  1. 一种路径获取方法，应用于网元，所述方法包括：
    确定从起始节点至目标节点的待选路径；
    当所述待选路径的数量有多个，对所有所述待选路径进行基于链路带宽约束条件的处理得到最优路径，其中，所述链路带宽约束条件根据网络中泛洪的灵活算法信息而确定，所述灵活算法信息包括与所述链路带宽约束条件对应的约束类型信息。
  2. 根据权利要求1所述的方法，还包括：
    当本地链路的链路带宽数据发生更新，并且更新后的链路带宽数据满足对外通告条件，对外通告所述更新后的链路带宽数据，重新对所有所述待选路径进行基于链路带宽约束条件的处理得到新的最优路径。
  3. 根据权利要求2所述的方法，其中，所述对外通告条件包括：
    更新后的链路带宽数据与更新前的链路带宽数据的差值的绝对值大于预设更新阈值；
    和/或，
    链路带宽数据发生更新的时间距离上一次对外通告链路带宽数据的时间达到预设时间阈值。
  4. 根据权利要求1所述的方法，其中，所述对所有所述待选路径进行基于链路带宽约束条件的处理得到最优路径，包括：
    从所有所述待选路径中随机选择两个待选路径；
    将选择的所述两个待选路径进行基于链路带宽约束和最小度量类型约束的链路比较处理得到优选路径；
    从剩余的待选路径中依次选择一个待选路径，在每次选择待选路径之后，将选择的待选路径与所述优选路径进行所述基于链路带宽约束和最小度量类型约束的链路比较处理得到目标路径，并将所述目标路径更新所述优选路径；
    将最后得到的优选路径作为最优路径。
  5. 根据权利要求4所述的方法，其中，所述基于链路带宽约束和最小度量类型约束的链路比较处理，包括以下步骤：
    确定第一路径和第二路径，所述第一路径和所述第二路径具有相同的首节点和相同的尾节点；
    根据从所述首节点至所述尾节点的方向，确定所述第一路径和所述第二路径的除所述首节点之外的相交节点；
    根据所述首节点和所述相交节点分别得到所述第一路径的路径片段和所述第二路径的路径片段；
    利用基于链路带宽约束和最小度量类型约束的比较判断处理对所述第一路径的路径片段和所述第二路径的路径片段进行比较，得到优选路径片段；
    获取所述优选路径片段对应的路径。
  6. 根据权利要求5所述的方法，其中，所述相交节点的数量为多个，所述根据所述首节点和所述相交节点分别得到所述第一路径的路径片段和所述第二路径的路径片段，包括：
    根据所述首节点和所述相交节点得到所述第一路径的从所述首节点至第一个相交节点的路径片段以及相邻两个相交节点之间的路径片段；
    根据所述首节点和所述相交节点得到所述第二路径的从所述首节点至第一个相交节点的路径片段以及相邻两个相交节点之间的路径片段。
  7. 根据权利要求6所述的方法，其中，所述利用基于链路带宽约束和最小度量类型约束的比较判断处理对所述第一路径的路径片段和所述第二路径的路径片段进行比较，得到优选路径片段，包括：
    沿着从所述首节点至所述尾节点的方向，分别从所述第一路径中和从所述第二路径中依次选择具有相同端节点的路径片段，在每次选择路径片段之后，将选择的所述第一路径的路径片段和选择的所述第二路径的路径片段进行基于链路带宽约束和最小度量类型约束的比较判断处 理得到备选路径片段，直到所述备选路径片段满足预设路径条件；
    将满足所述预设路径条件的备选路径片段作为优选路径片段；
    其中，所述预设路径条件为：
    在当前处理中得到的备选路径片段的数量为一个；或者，在当前处理中得到的备选路径片段的数量为两个，并且选择的所述第一路径的路径片段为所述第一路径中的最后一个路径片段，选择的所述第二路径的路径片段为所述第二路径中的最后一个路径片段。
  8. 根据权利要求5或7所述的方法，其中，所述基于链路带宽约束和最小度量类型约束的比较判断处理，包括以下步骤：
    确定第一转发路径和第二转发路径，所述第一转发路径和所述第二转发路径具有相同的开始节点和相同的结束节点；
    获取所述第一转发路径中的第一带宽参数和所述第二转发路径中的第二带宽参数，其中，所述第一带宽参数为所述第一转发路径中链路带宽数据最小的链路的链路带宽数据，所述第二带宽参数为所述第二转发路径中链路带宽数据最小的链路的链路带宽数据；
    获取所述第一转发路径的第一度量代价和所述第二转发路径的第二度量代价；
    根据所述第一带宽参数、所述第二带宽参数、所述第一度量代价和所述第二度量代价对所述第一转发路径和所述第二转发路径进行比较判断，得到优选程度更高的路径。
  9. 根据权利要求8所述的方法，其中，所述根据所述第一带宽参数、所述第二带宽参数、所述第一度量代价和所述第二度量代价对所述第一转发路径和所述第二转发路径进行比较判断，得到优选程度更高的路径，包括：
    将所述第一带宽参数和所述第二带宽参数进行比较得到第一比较结果；
    当所述第一比较结果为所述第一带宽参数与所述第二带宽参数不相同，将所述第一带宽参数和所述第二带宽参数中数值最大的一个对应的路径作为优选程度更高的路径；
    当所述第一比较结果为所述第一带宽参数与所述第二带宽参数相同，将所述第一度量代价和所述第二度量代价进行比较得到第二比较结果，根据所述第二比较结果从所述第一转发路径和所述第二转发路径中得到优选程度更高的路径。
  10. 根据权利要求9所述的方法，其中，所述根据所述第二比较结果从所述第一转发路径和所述第二转发路径中得到优选程度更高的路径，包括：
    当所述第二比较结果为所述第一度量代价和所述第二度量代价不相同，将所述第一度量代价和所述第二度量代价中数值最小的一个对应的路径作为优选程度更高的路径；
    当所述第二比较结果为所述第一度量代价和所述第二度量代价相同，将所述第一转发路径和所述第二转发路径均作为优选程度更高的路径。
  11. 根据权利要求1所述的方法，其中，所述链路带宽约束条件包括：
    在从同一起始节点至同一目标节点的多个路径中，所选择的路径中链路带宽数据最小的链路的链路带宽数据大于剩余的任一路径中链路带宽数据最小的链路的链路带宽数据。
  12. 根据权利要求2、3或11所述的方法，其中，所述链路带宽数据包括链路总带宽参数、链路剩余带宽参数和链路带宽空闲率中的任意一个。
  13. 一种网元，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如权利要求1至12中任意一项所述的路径获取方法。
  14. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1至12中任意一项所述的路径获取方法。
PCT/CN2021/138454 2021-03-22 2021-12-15 路径获取方法、网元及计算机可读存储介质 WO2022199150A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110300323.2 2021-03-22
CN202110300323.2A CN115190065A (zh) 2021-03-22 2021-03-22 路径获取方法、网元及计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2022199150A1 true WO2022199150A1 (zh) 2022-09-29

Family

ID=83396291

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/138454 WO2022199150A1 (zh) 2021-03-22 2021-12-15 路径获取方法、网元及计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN115190065A (zh)
WO (1) WO2022199150A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030161338A1 (en) * 2002-02-27 2003-08-28 Ng David D. Network path selection based on bandwidth
CN108023761A (zh) * 2016-11-04 2018-05-11 华为技术有限公司 分配资源的方法和设备
CN110768837A (zh) * 2019-10-28 2020-02-07 北京邮电大学 一种网络切片虚拟资源分配方法、系统及装置
CN111385207A (zh) * 2018-12-29 2020-07-07 中兴通讯股份有限公司 一种业务数据的转发方法、网络设备及网络系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030161338A1 (en) * 2002-02-27 2003-08-28 Ng David D. Network path selection based on bandwidth
CN108023761A (zh) * 2016-11-04 2018-05-11 华为技术有限公司 分配资源的方法和设备
CN111385207A (zh) * 2018-12-29 2020-07-07 中兴通讯股份有限公司 一种业务数据的转发方法、网络设备及网络系统
CN110768837A (zh) * 2019-10-28 2020-02-07 北京邮电大学 一种网络切片虚拟资源分配方法、系统及装置

Also Published As

Publication number Publication date
CN115190065A (zh) 2022-10-14

Similar Documents

Publication Publication Date Title
US11909645B2 (en) Segment routing traffic engineering based on link utilization
US10148564B2 (en) Multiple paths computation for label switched paths
US9847939B2 (en) Optimal route reflection using efficient border gate protocol best path selection
EP3073684B1 (en) Path weighted equal-cost multipath
US10135716B2 (en) Latency optimized segment routing tunnels
US8068411B2 (en) Method and apparatus to compute local repair paths taking into account link resources and attributes
US9660897B1 (en) BGP link-state extensions for segment routing
US8743866B2 (en) Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks
US8447849B2 (en) Negotiated parent joining in directed acyclic graphs (DAGS)
KR101384400B1 (ko) 라우팅 정보 베이스의 향상된 업데이트를 위한 방법 및 라우터
US8406153B2 (en) Affecting node association through load partitioning
US10148551B1 (en) Heuristic multiple paths computation for label switched paths
JP2007503771A (ja) 使用しているリンクステートとパスベクトルテクニックテクニカルフィールドとをルーティングするためのシステムと方法
US10462045B1 (en) Topology independent fast reroute for node and SRLG local protection
US20090316583A1 (en) Method and apparatus for calculating mpls traffic engineering paths
US10476772B2 (en) Soft constrained shortest-path tunneling
WO2023082815A1 (zh) 确定性路由的构建方法、装置和存储介质
EP2063585A1 (en) Method and apparatus for computing a path in a network
EP3059913A1 (en) Lsp data packet generating method and device
WO2022199150A1 (zh) 路径获取方法、网元及计算机可读存储介质
WO2018090852A1 (zh) 链路状态数据包的传输方法及路由节点
Tomovic et al. Bandwidth-delay constrained routing algorithms for backbone SDN networks
Vo et al. Permutation routing for increased robustness in IP networks
US20120063362A1 (en) Method and apparatus for computing paths to destinations in networks having link constraints
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: 21932757

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21932757

Country of ref document: EP

Kind code of ref document: A1