WO2022213830A1 - Procédé et appareil de détermination de chemin - Google Patents

Procédé et appareil de détermination de chemin Download PDF

Info

Publication number
WO2022213830A1
WO2022213830A1 PCT/CN2022/083172 CN2022083172W WO2022213830A1 WO 2022213830 A1 WO2022213830 A1 WO 2022213830A1 CN 2022083172 W CN2022083172 W CN 2022083172W WO 2022213830 A1 WO2022213830 A1 WO 2022213830A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
bandwidth
path
nodes
algorithm
Prior art date
Application number
PCT/CN2022/083172
Other languages
English (en)
Chinese (zh)
Inventor
于树松
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2022213830A1 publication Critical patent/WO2022213830A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/14—Routing performance; Theoretical aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion

Definitions

  • the present application relates to the field of network technologies, and more particularly, to a method and apparatus for determining a path.
  • the traditional interior gateway protocol can calculate the shortest path to the destination address according to the cost value of the link and the shortest path first (SPF) algorithm.
  • SPF shortest path first
  • the SPF algorithm based on the cost value of the link is fixed and cannot be adjusted by users, so it is not convenient to calculate the optimal path according to their own needs.
  • a metric rule can be selected from a variety of metric rules, such as link overhead, delay, or traffic engineering (TE) constraints, as a metric type based on Flex-algo path calculation, so that according to different metric types Calculate paths to meet different needs.
  • metric rules such as link overhead, delay, or traffic engineering (TE) constraints
  • the present application provides a method and device for determining a path, which can perform Flex-Algo path calculation based on link bandwidth, and the determined path is conducive to meeting bandwidth requirements of different services and avoiding traffic congestion.
  • a method for determining a path is provided, which is applied to a network including multiple nodes, including: a first node in the multiple nodes determines a bandwidth constraint, where the bandwidth constraint is used to indicate that a packet is transmitted based on a target flexible algorithm.
  • the bandwidth constraint condition that needs to be satisfied at the time of writing; the first node determines at least one target path to the second node among the plurality of nodes based on the target flexible algorithm, and the target path satisfies the bandwidth constraint condition.
  • the first node and the second node are nodes that support flexible algorithms.
  • the first node calculates the target path to the second node, according to the bandwidth constraints, the path calculation based on the target flexible algorithm is performed, so that nodes or links that do not meet the bandwidth constraints are excluded in the process of calculating the path, so that the calculation can be performed.
  • a path that satisfies the bandwidth constraint is created, avoiding traffic congestion caused by insufficient bandwidth.
  • the first node receives a first packet from other nodes in the network, where the first packet includes the bandwidth constraint.
  • the first node does not know the bandwidth constraint, but other nodes in the network that know the bandwidth constraint can send the first packet to the first node to announce the bandwidth constraint.
  • the first subtype-length-value (type-length-value, TLV) field of the first packet includes the bandwidth constraint, and the first packet includes the bandwidth constraint.
  • the text includes the definition of flexible algorithm (flexible algorithm definition, FAD).
  • the bandwidth constraint condition may be carried in the FAD of the target flexible algorithm and published to the outside.
  • the bandwidth constraint condition may be carried in the first sub-TLV field of the first packet, so that it is convenient for the first node to parse the field to obtain the bandwidth constraint condition.
  • the flexible algorithm definition FAD includes at least one of the following: an identification of a flexible algorithm, a calculation type identification, or a metric type identification.
  • the first node determines, based on the target flexible algorithm, at least one target path to the second node in the plurality of nodes, including: the first node is based on at least one of the identification of the flexible algorithm, the metric type identification, or the calculation type identification.
  • One, multiple candidate paths are determined; the first node determines at least one target path reaching the second node from the multiple candidate paths based on the bandwidth constraint.
  • the calculation type identifier includes an SPF algorithm identifier or a strict SPF algorithm identifier.
  • the metric type identifier includes one of the following: an identifier of a link delay rule, an identifier of an interior gateway protocol IGP overhead rule, an identifier of a traffic engineering TE rule, or The ID of the link bandwidth rule.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint
  • the affinity attribute constraint is used to indicate a chain that needs to be satisfied by the transmission packet path attribute, the target path satisfies the bandwidth constraint condition and the affinity attribute constraint condition.
  • the first packet further includes an affinity attribute constraint, which can further control the selection of paths, determine target paths that meet different constraints, and make the target paths more available.
  • the first message is an intermediate system to intermediate system (intermediate system to intermediate system, ISIS) message or an open shortest path first (open shortest path first, OSPF) message ) message.
  • ISIS intermediate system to intermediate system
  • OSPF open shortest path first
  • the first node before the first node determines, based on the target flexibility algorithm, at least one target path to reach the second node among the plurality of nodes, the first node receives the A second packet of a neighbor node of the first node, where the second packet carries the remaining bandwidth between adjacent nodes among the multiple nodes; the first node determines, based on the target flexible algorithm, to reach the multiple nodes At least one target path of the second node in the nodes, comprising: the first node determining at least one path to the second node in the plurality of nodes based on the target flexible algorithm and the remaining bandwidth between adjacent nodes in the plurality of nodes Target path.
  • the first node can obtain the remaining bandwidth of each link in the candidate path through the second packet, so that the remaining bandwidth of the link in the candidate path can be compared with the bandwidth constraint when calculating the path, to determine if the calculated path meets the bandwidth requirements.
  • the second packet is an ISIS packet or an OSPF packet.
  • the first node and the second node are in different processes of the same routing protocol, and the routing protocol includes ISIS and OSPF.
  • the bandwidth constraint may be transmitted between different processes along with the first packet, which is beneficial for network nodes in different processes to obtain the bandwidth constraint and implement cross-domain transmission.
  • a method for determining a path is provided, which is applied to a network including a plurality of nodes, including: a third node in the plurality of nodes sends a bandwidth constraint condition to other nodes in the network, where the bandwidth constraint condition is used to represent Bandwidth constraints that need to be met when transmitting packets based on the target flexible algorithm.
  • the first node and the third node may also be the same node, that is, the first node performs the same steps as the third node, and sends the bandwidth constraint condition to other nodes in the network.
  • the third node sending the bandwidth constraint condition to other nodes in the network includes: the third node sending a first message to other nodes in the network message, the first message includes the bandwidth constraint, the first subtype length value TLV field of the first message includes the bandwidth constraint, and the first message includes the definition FAD of the flexible algorithm. That is to say, the bandwidth constraint can be carried in the FAD of the target flexible algorithm and published to the outside. Specifically, the bandwidth constraint condition may be carried in the first sub-TLV field of the first packet, so that it is convenient for the first node to parse the field to obtain the bandwidth constraint condition.
  • the FAD includes at least one of the following: an identification of a flexible algorithm, a calculation type identification, or a metric type identification.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint, and the affinity attribute constraint is used to indicate a link that needs to be satisfied for transmitting the packet Attributes.
  • the first packet is an ISIS packet or an OSPF packet.
  • an apparatus for determining a path including: a determining module configured to determine a bandwidth constraint, where the bandwidth constraint is used to represent a bandwidth constraint that needs to be satisfied when a packet is transmitted based on the target flexible algorithm; processing A module for determining, based on the target flexibility algorithm, at least one target path to a second node of the plurality of nodes, where the target path satisfies the bandwidth constraint.
  • the apparatus further includes a receiving module, configured to receive a first packet from other nodes in the network, where the first packet includes the bandwidth constraint condition.
  • the first subtype length value TLV field of the first packet includes the bandwidth constraint, and the first packet includes the definition FAD of the flexible algorithm.
  • the FAD includes at least one of the following: an identifier of a flexible algorithm, a calculation type identifier or a metric type identifier; the processing module is used for: an identifier based on the flexible algorithm , at least one of the metric type identifier or the calculation type identifier, determining multiple candidate paths; and, based on the bandwidth constraint, determining at least one target path reaching the second node from the multiple candidate paths.
  • the calculation type identifier includes an SPF algorithm identifier or a strict SPF algorithm identifier.
  • the metric type identifier includes one of the following: an identifier of a link delay rule, an identifier of an interior gateway protocol IGP overhead rule, an identifier of a traffic engineering TE rule, or The ID of the link bandwidth rule.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint
  • the affinity attribute constraint is used to indicate a chain that needs to be satisfied by the transmission packet path attribute, the target path satisfies the bandwidth constraint condition and the affinity attribute constraint condition.
  • the first packet is an ISIS packet or an OSPF packet.
  • the receiving module before the apparatus determines, based on the target flexible algorithm, at least one target path to reach the second node among the plurality of nodes, the receiving module is configured to: receive data from the The second message of the neighbor node of the device, the second message carries the remaining bandwidth between the adjacent nodes in the plurality of nodes; the processing module is used for: based on the target flexible algorithm and between the adjacent nodes in the plurality of nodes. The remaining bandwidth is determined, and at least one target path to the second node of the plurality of nodes is determined.
  • the second message is an ISIS message or an OSPF message.
  • the first node and the second node are in different processes of the same routing protocol, and the routing protocol includes ISIS and OSPF.
  • another device for determining a path including: a determining module configured to determine a bandwidth constraint, where the bandwidth constraint is used to represent a bandwidth constraint that needs to be satisfied when transmitting a message based on the target flexible algorithm; sending Module for sending this bandwidth constraint to other nodes in the network.
  • the sending module is configured to: send a first packet to other nodes in the network, where the first packet includes the bandwidth constraint, and the first packet is The first subtype length value TLV field includes the bandwidth constraint, and the first message includes the definition FAD of the flexible algorithm.
  • the FAD includes at least one of the following: a flexible algorithm identifier, a calculation type identifier, or a metric type identifier.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint, and the affinity attribute constraint is used to indicate a link that needs to be satisfied to transmit the packet Attributes.
  • the first message is an ISIS message or an OSPF message.
  • yet another device for determining a path including a processor, which is coupled to a memory and can be used to execute instructions in the memory, so as to realize any possible implementation manner of the first aspect or the second aspect above method in .
  • the apparatus further includes a memory.
  • the apparatus further includes a communication interface to which the processor is coupled.
  • the device for determining a path is a routing device
  • the communication interface may be a transceiver, or an input/output interface.
  • the device for determining the path is a chip configured in the routing device.
  • the communication interface may be an input/output interface.
  • a processor including: an input circuit, an output circuit, and a processing circuit.
  • the processing circuit is configured to receive the signal through the input circuit and transmit the signal through the output circuit, so that the processor executes the method in any one of the possible implementation manners of the first aspect or the second aspect.
  • the above-mentioned processor may be a chip
  • the input circuit may be an input pin
  • the output circuit may be an output pin
  • the processing circuit may be a transistor, a gate circuit, a flip-flop, and various logic circuits.
  • the input signal received by the input circuit may be received and input by, for example, but not limited to, a receiver
  • the signal output by the output circuit may be, for example, but not limited to, output to and transmitted by a transmitter
  • the circuit can be the same circuit that acts as an input circuit and an output circuit at different times.
  • the embodiments of the present application do not limit the specific implementation manners of the processor and various circuits.
  • a processing apparatus including a processor and a memory.
  • the processor is configured to read the instructions stored in the memory, and can receive signals through the receiver and transmit signals through the transmitter, so as to execute the method in any possible implementation manner of the first aspect or the second aspect.
  • processors there are one or more processors and one or more memories.
  • the memory may be integrated with the processor, or the memory may be provided separately from the processor.
  • the memory can be a non-transitory memory, such as a read only memory (ROM), which can be integrated with the processor on the same chip, or can be separately set in different On the chip, the embodiment of the present application does not limit the type of the memory and the setting manner of the memory and the processor.
  • ROM read only memory
  • the relevant data interaction process such as sending indication information, may be a process of outputting indication information from the processor, and receiving capability information may be a process of receiving input capability information by the processor.
  • data output from the processing can be output to a transmitter, and input data received by the processor can be from a receiver.
  • the transmitter and the receiver may be collectively referred to as a transceiver.
  • the processing device in the above seventh aspect may be a chip, and the processor may be implemented by hardware or software.
  • the processor When implemented by hardware, the processor may be a logic circuit, an integrated circuit, or the like; when implemented by software, the processor may be a logic circuit or an integrated circuit.
  • the processor can be a general-purpose processor, which is realized by reading software codes stored in a memory, and the memory can be integrated in the processor or located outside the processor and exist independently.
  • a system for determining a path includes a first node and a third node, the first node executes the method in any possible implementation manner of the above-mentioned first aspect, and the third node executes the above-mentioned first node.
  • the method in any possible implementation manner of the second aspect.
  • a computer program product includes: a computer program (also referred to as code, or instruction), which, when the computer program is executed, causes the computer to execute any one of the first aspect or the second aspect. method in one possible implementation.
  • a computer program also referred to as code, or instruction
  • a computer-readable storage medium stores a computer program (also referred to as code, or instruction), which, when executed on a computer, causes the computer to execute the above-mentioned first aspect or the method in any possible implementation manner of the second aspect.
  • a computer program also referred to as code, or instruction
  • Fig. 1 is a topological schematic diagram of a multi-node network
  • FIG. 2 is a schematic flowchart of a method for determining a path provided by an embodiment of the present application
  • FIG. 3 is a schematic flowchart of another method for determining a path provided by an embodiment of the present application.
  • FIG. 4 is a schematic structural diagram of an ISIS message provided by an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of an OSPF message provided by an embodiment of the present application.
  • FIG. 6 is a schematic diagram of a sub-TLV for advertising remaining bandwidth provided by an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a network topology based on a flexible algorithm provided by an embodiment of the present application.
  • FIG. 8 is a schematic flowchart of still another method for determining a path provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of transmission of FAD information between different ISIS areas according to an embodiment of the present application.
  • FIG. 10 is a schematic block diagram of an apparatus for determining a path provided by an embodiment of the present application.
  • FIG. 11 is a schematic block diagram of another apparatus for determining a path provided by an embodiment of the present application.
  • FIG. 12 is a schematic block diagram of still another apparatus for determining a path provided by an embodiment of the present application.
  • FIG. 13 is a schematic block diagram of another apparatus for determining a path provided by an embodiment of the present application.
  • FIG. 14 is a schematic block diagram of a system for determining a path provided by an embodiment of the present application.
  • SPF algorithm is the basis of the Open Shortest Path First OSPF routing protocol. Each router can be used as a root (ROOT) to calculate the distance to each destination router. Each router can be calculated according to a unified database. The topology diagram of the outbound routing domain, which is also called the shortest path tree.
  • FAD includes metric-type, calculation-type and description topology
  • a set of constraints (describe a set of constraints on the topology), in this embodiment of the present application, the set of describing topology constraints may also be referred to as constraints.
  • routers can be configured with a numeric identifier associated with an FAD.
  • a router can extend a set of type-length-value (TLV) to carry the FAD information of Flex-Algo, which is called FAD TLV.
  • TLV type-length-value
  • the FAD TLV includes multiple sub-TLVs (sub-TLVs), and the constraints can be described in the sub-TLVs field.
  • the digital identifiers 0 to 255 respectively represent the following meanings:
  • Numeric identifier 0 used to identify the SPF algorithm based on the link cost value, which allows any node to cover the SPF path with a different path according to its local policy.
  • algorithm 0 the SPF algorithm based on the link cost value is referred to as algorithm 0 below.
  • Numeric identifier 1 used to identify the strict SPF algorithm.
  • the strict SPF algorithm is hereinafter referred to as Algorithm 1.
  • the traditional IGP algorithm can use the SPF algorithm to calculate the shortest path to the destination address according to the cost of the link.
  • This method is based on the cost value of the link and cannot meet the different needs of users. For example, the user expects to be forwarded according to the path with the smallest delay, or to exclude some links from forwarding.
  • path calculation needs to be performed according to the latency.
  • the cost of some links is relatively high, and the user wishes to consider the cost factor, so the route with high cost needs to be excluded when calculating the path.
  • the SPF algorithm based on the link cost value is fixed and cannot be adjusted by users, so it is not convenient for users to calculate the optimal path according to their own needs.
  • Flex-Algo allows users to customize the algorithm of the IGP algorithm to meet different business needs, based on the characteristics of Flex-Algo, IGP can automatically calculate paths to meet different needs according to the cost, delay, and TE constraints of the link, flexibly Fulfill the needs of traffic engineering.
  • the calculation rules of Flex-Algo are generally represented by a triple, that is, the measurement type, the calculation type and the constraint condition.
  • the metric type represents the link index constraint (eg, the delay indicator)
  • the calculation type represents the calculation algorithm constraint (eg, using the SPF algorithm)
  • the constraint condition represents whether certain links are included/excluded during path calculation.
  • the user can define the Flex-Algo 128 as: (1) metric type: delay; (2) calculation type: SPF; (3) constraint: exclude link x.
  • FIG. 1 is a schematic topology diagram of a multi-node network 100 .
  • Network 100 includes Node 0, Node 9, Node 1, Node 2, Node 3, Node 4, Node 5, Node 6, Node 7, and Node 8.
  • Each node in Figure 1 supports the function of calculating paths based on flexible algorithms. Assuming that a path from node 0 to node 9 needs to be calculated, in network 100, nodes starting from node 0 using the same Flex-Algo can calculate a path from node 0 to node 9 that satisfies the algorithm definition according to the FAD information.
  • node 0 and node 9 can support Flex-Algo 128 and Flex-Algo 129 at the same time, and the IGP protocol can advertise the definitions of Flex-Algo 128 and Flex-Algo 129 through FAD, so that nodes in the whole network can perceive node 0 and node 9 Algorithms used and their definitions.
  • Nodes 5 to 8 use Flex-Algo 129, and the IGP protocol can advertise that nodes 5 to 8 use Flex-Algo 129 through FAD TLV.
  • each node can also support the most basic algorithm 0, which is the SPF algorithm based on the link cost value.
  • the node 9 is configured with the network segment routing identifier (referred to as SRv6 locator) of the SR for forwarding IPv6 data packets on the data plane of the Internet Protocol Version 6 (IPv6) to perform communication with Flex-Algo.
  • IPv6 locator the network segment routing identifier of the SR for forwarding IPv6 data packets on the data plane of the Internet Protocol Version 6 (IPv6) to perform communication with Flex-Algo.
  • IPv6 locator the network segment routing identifier of the SR for forwarding IPv6 data packets on the data plane of the Internet Protocol Version 6 (IPv6) to perform communication with Flex-Algo.
  • IPv6 locator the network segment routing identifier of the SR for forwarding IPv6 data packets on the data plane of the Internet Protocol Version 6 (IPv6) to perform communication with Flex-Algo.
  • IPv6 locator the network segment routing identifier of the SR for forwarding IPv6 data packets on the data plane of the Internet Protocol Version 6 (IP
  • nodes can also be configured with SRv6 locator to associate with Flex-Algo, which is not limited in this embodiment of the present application.
  • node 0 In the process of calculating paths based on the network 100, node 0 advertises support for algorithm 0, Flex-Algo 128 and Flex-Algo 129 to other nodes, and node 9 advertises support for algorithm 0, Flex-Algo 128 and Flex-Algo 129 to other nodes.
  • Node 1, Node 2, Node 3, and Node 4 advertise support for Algorithm 0 and Flex-Algo 128 to other nodes, and Node 5, Node 6, Node 7, and Node 8 advertise support for Algorithm 0 and Flex-Algo 129 to other nodes.
  • Flex-Algo 128 is defined as: (1) metric type: delay; (2) calculation type: SPF; (3) constraint: exclude the link composed of node 5 and node 6.
  • Flex-Algo 129 is defined as: (1) Metric Type: TE; (2) Calculation Type: SPF; (3) Constraint: Exclude the link consisting of Node 1 and Node 2.
  • Flex-Algo 128 and Flex-Algo 129 can logically divide network 100 into sub-network topology 110 and sub-network topology 120, where sub-network topology 110 includes nodes that support Flex-Algo 128, and sub-network topology 120 includes nodes that support Flex-Algo 120 129 nodes.
  • sub-network topology 110 includes nodes that support Flex-Algo 128, and sub-network topology 120 includes nodes that support Flex-Algo 120 129 nodes.
  • FIG. 1 if Node 1, Node 2, Node 3, and Node 4 use Flex-Algo 128, then Node 1, Node 2, Node 3, and Node 4 can belong to the sub-network topology 110. If Node 5, Node 6, Node 7, and Node 8 use Flex-Algo 129, then Node 5, Node 6, Node 7, and Node 8 can belong to sub-network topology 120.
  • node 0 uses Flex-Algo 128, and node 0 can flood the entire network with the configured FAD information of Flex-Algo 128, so that each node in sub-network topology 110 learns the FAD information of Flex-Algo 128, so that Nodes in the sub-network topology 110 that are not configured with corresponding FAD information may also follow the FAD information calculation path of the Flex-Algo 128.
  • the nodes in the finalized target path belong to the same sub-network topology.
  • any node in the network 100 can also flood the entire network with the FAD information of the Flex-Algo configured by itself, so that nodes with the same Flex-Algo numerical identifier can follow the same algorithm definition to calculate a value that satisfies the The optimal path for service requirements, which is not limited in this embodiment of the present application.
  • node 1 to node 8 use algorithm 0, and the target path calculated by node 0 may include any node in network 100, which is not limited by Flex-Algo.
  • the path can be calculated based on the IGP cost value, TE metric, or delay.
  • the possible calculated path is node 0->node 5->node 6->node 8->node 9.
  • the traffic that can be carried on the link of node 5->node 6 is 1G
  • the traffic that can be carried on the link of node 6->node 8 is also 1G, which cannot be satisfied by these two links.
  • the path calculation requirement of node 0 is to carry 10G traffic. Therefore, traffic congestion due to insufficient bandwidth may occur on the two links of node 5->node 6 and node 6->node 8, which in turn leads to the carried service traffic. Packet loss or interruption.
  • the embodiments of the present application provide a method and device for determining a path, Flex-Algo configuration policies can be used to calculate paths and flexibly constrain link bandwidth, which helps to avoid traffic congestion caused by insufficient bandwidth and improve service damage.
  • At least one means one or more, and “plurality” means two or more.
  • And/or which describes the association relationship of the associated objects, indicates that there can be three kinds of relationships, for example, A and/or B, which can indicate: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A, B can be singular or plural.
  • the character “/” generally indicates that the associated objects are an “or” relationship.
  • At least one item(s) below” or similar expressions thereof refer to any combination of these items, including any combination of single item(s) or plural items(s).
  • At least one (a) of a, b and c may represent: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c, wherein a, b, c can be single or multiple.
  • SRv6 segment routing
  • MPLS multi-protocol label switching
  • FIG. 2 is a schematic flowchart of a method 200 for determining a path provided by an embodiment of the present application.
  • the method 200 may be applied to the network 100 shown in FIG. 1 , and the steps and/or processes of the method 200 may be executed by a routing device , exemplarily, the routing device may be any device with a function of calculating routing, such as a router or a switch, which is not limited in this embodiment of the present application.
  • Method 200 includes the following steps:
  • a first node of the plurality of nodes determines a bandwidth constraint condition, where the bandwidth constraint condition is used to represent a bandwidth constraint condition that needs to be satisfied when a packet is transmitted based on the target flexible algorithm.
  • the above-mentioned first node may be the node 0 in the network 100 .
  • the first node determines, based on the target flexibility algorithm, at least one target path to a second node among the plurality of nodes, where the target path satisfies the bandwidth constraint condition.
  • the second node may be the middle node 9 of the network 100 .
  • the bandwidth constraints may be determined according to different bandwidth requirements of different services.
  • the bandwidth constraint condition is the minimum bandwidth required for transmitting packets.
  • the first node may also determine the target path jointly with the target flexible algorithm based on other conditions.
  • other conditions may be neighbor information, a routing table, or the remaining bandwidth of a link, which is not limited in this embodiment of the present application.
  • the first node may determine at least one target path.
  • a multi-path transmission strategy such as load sharing, dual transmission and selective reception, or active/standby transmission may be used to transmit service traffic.
  • the first node may calculate at least one target path to the second node, and the target path satisfies a bandwidth constraint condition. In this way, based on the bandwidth as a constraint of Flex-Algo path calculation, a path that satisfies the bandwidth constraint can be calculated, avoiding traffic congestion caused by insufficient bandwidth.
  • FIG. 3 is a schematic flowchart of another method 300 for determining a path provided by an embodiment of the present application.
  • the method 300 can be applied to the network 100 shown in FIG. 1, and the method 300 includes the following steps:
  • a third node in the plurality of nodes sends a first packet to other nodes in the network, where a first sub-TLV field of the first packet includes a bandwidth constraint, where the bandwidth constraint is used to indicate that the target-based flexible algorithm is transmitted Bandwidth constraints that need to be met when packets are sent.
  • the first node receives the first packet.
  • the first node determines a bandwidth constraint condition based on the first packet.
  • the first node determines at least one target path to the destination node based on the bandwidth constraint condition.
  • the first node may be the node 0 in the network 100
  • the third node may be the node in the network 100 except the node. 0, which is not limited in this embodiment of the present application.
  • the first node does not know the bandwidth constraint, but other third nodes in the network that are configured or have obtained the bandwidth constraint can send the first packet to the first node to announce the bandwidth constraint condition.
  • the third node may determine the bandwidth constraint according to factors such as the data type and size of the service, configure the corresponding FAD information, and send the bandwidth constraint and corresponding information to other nodes (including the first node) in the network.
  • the first packet of FAD information may be determined according to factors such as the data type and size of the service.
  • the first node can not only act as a receiver to receive the first message from other nodes, but also act as a transmitter to perform steps similar to those of the third node to send the first message to other nodes in the network.
  • the embodiments of the present application do not limit this.
  • the first sub-TLV field of the first packet includes the bandwidth constraint, and the first packet includes the definition FAD of the flexible algorithm.
  • the bandwidth constraint condition may be carried in the first sub-TLV field of the first packet, where the first sub-TLV is one of multiple sub-TLVs of the FAD TLV.
  • the first packet may be an intermediate system-to-intermediate system ISIS packet or an OSPF packet.
  • the first message may also include other sub-TLV fields, the first sub-TLV and other sub-TLVs belong to a parallel relationship, and placing the bandwidth constraint in the first sub-TLV field is convenient for the first node to perform this field. Parse for bandwidth constraints.
  • the flexible algorithm definition FAD includes at least one of the following: a flexible algorithm identifier, a calculation type identifier, or a metric type identifier.
  • the calculation type identifier includes an SPF algorithm identifier or a strict SPF algorithm identifier.
  • the strict SPF algorithm does not allow any node to change the SPF path calculated by the strict SPF algorithm according to its local policy, which is different from the SPF algorithm.
  • the metric type identifier includes one of the following: an identifier of a link delay rule, an identifier of an interior gateway protocol IGP overhead rule, an identifier of a traffic engineering TE rule, or an identifier of a link bandwidth rule.
  • the link delay rule indicates that the path calculation is performed based on the minimum delay rule when calculating the path.
  • the IGP cost rule indicates that the path is calculated based on the minimum cost rule when calculating the path.
  • the traffic engineering TE rule indicates that the path is calculated based on the TE shortest path during path calculation.
  • the link bandwidth rule indicates that the route is calculated based on the bandwidth requirement when calculating the route.
  • the following describes the FAD TLV structure of the ISIS packet.
  • FIG. 4 is a schematic structural diagram of an ISIS message 400 provided by an embodiment of the present application. As shown in Figure 4a, the FAD TLV structure of an ISIS message includes the following fields:
  • Type field used to describe the type of ISIS message
  • Length field used to describe the length of the ISIS message
  • Flex-Algo field a numerical identifier used to describe Flex-Algo
  • Metric-type field used to describe the metric type identifier on which the Flex-Algo calculation is based
  • Calculation-type field used to describe the calculation type identifier on which the Flex-Algo calculation is based;
  • Priority field used to describe the priority identifier of the service traffic carried by the ISIS message
  • FAD includes metric-type, calculation-type, and a set of constraints on the topology (describe a set of constraints on the topology), which is located in Figure 4.
  • the sub-TLVs field, the sub-TLVs field includes a plurality of different sub-TLV fields, and different sub-TLV fields may describe different topology constraints (or may be referred to as link constraints).
  • the bandwidth constraint condition may also be referred to as a constraint bandwidth (constraint bandwidth).
  • the first sub-TLV shown in FIG. 4b is one of the sub-TLVs (sub-TLVs) in FIG. 4a, and the sub-TLVs (sub-TLVs) in FIG. 4a may also include other multiple sub-TLVs, which are implemented in this application. The example does not limit this.
  • the first sub-TLV includes a type (type) field, a length (length) field, and a constraint bandwidth (constraint bandwidth) field.
  • the type field is used to describe the type of the first sub-TLV;
  • the length field is used to describe the length of the value;
  • the constraint bandwidth field is used to describe the minimum bandwidth value that the calculated path needs to satisfy. If the calculated path bandwidth is less than the constrained bandwidth, the path needs to be excluded.
  • the first sub-TLV in the embodiment of the present application is one of multiple sub-TLVs (sub-TLVs) of the FAD TLV, and the bandwidth constraint is the topology constraint located in the first sub-TLV field.
  • the type of the first sub-TLV may be a sub-TLV type to be defined (to be defined, TBD) with a custom identifier of 7.
  • the length of the value field may be 4 bytes.
  • FIG. 5 is a schematic structural diagram of an OSPF message 500 provided by an embodiment of the present application.
  • the FAD TLV structure of the OSPF message is similar to the FAD TLV structure of the ISIS message, and details are not repeated here.
  • S202 includes: the first node determines a plurality of candidate paths based on at least one of the identifier of the flexible algorithm, the metric type identifier or the computation type identifier; the first node determines multiple candidate paths based on the bandwidth Constraints, at least one target path to the second node is determined from the multiple candidate paths.
  • the first node in the process of using Flex-Algo to calculate the path, may first base on the information in the FAD TLV, such as at least one of the identification of the flexible algorithm, the identification of the metric type, or the identification of the calculation type. In this way, multiple candidate paths are determined. Further, the first node may consider the constraints in the FAD sub-TLV, and exclude the paths that do not meet the bandwidth constraints among the multiple candidate paths, so as to determine at least one target path. In this way, a path that satisfies the bandwidth constraint can be determined, which is beneficial to avoid traffic congestion caused by insufficient bandwidth.
  • the FAD TLV structure of the first message may further include a second sub-TLV field, where the second sub-TLV field carries an affinity attribute constraint, and the affinity attribute constraint is used to indicate the transmission message Link constraints that need to be met.
  • the first packet further includes an affinity attribute constraint, which can further control the selection of paths, determine target paths that meet different constraints, and make the target paths more available.
  • the first packet may use the second sub-TLV field to constrain the link attribute of the path to be calculated, so as to meet different link requirements of different services.
  • the second sub-TLV in the embodiment of the present application is one of multiple sub-TLVs (sub-TLVs) of the FAD TLV, and the affinity attribute constraint is the topology constraint (or can be referred to as the topology constraint located in the second sub-TLV field) link constraints).
  • the method 200 further includes: the first node receives data from the first node from the first node.
  • S202 includes: the first node based on the target flexible algorithm and the adjacent nodes in the plurality of nodes. The remaining bandwidth between the at least one target path to the second node of the plurality of nodes is determined.
  • the first node needs to compare the remaining bandwidth of the link in the candidate path with the bandwidth constraint when calculating the path, so the first node needs to obtain the remaining bandwidth of each link in the candidate path.
  • the first node may receive a second packet from a neighbor node, where the second packet includes remaining bandwidth information required by the first node to calculate the path.
  • the second message is an ISIS message or an OSPF message.
  • FIG. 6 is a schematic diagram of a sub-TLV 600 for advertising remaining bandwidth provided by an embodiment of the present application.
  • the sub-TLV 600 includes: a type (type) field, a length (length) field, and a residual bandwidth (residual bandwidth) field.
  • the type field is used to describe the type of the sub-TLV;
  • the length field is used to describe the length of the sub-TLV;
  • the remaining bandwidth field is used to describe the actual remaining bandwidth value.
  • the remaining bandwidth may be advertised externally by carrying the above-mentioned sub-TLV 600 in a link state packet (link state packet, LSP).
  • link state packet link state packet
  • the first node acquires the remaining bandwidth information in the second packet, and determines at least one target path based on the remaining bandwidth information and the target flexible algorithm.
  • FIG. 7 is a schematic diagram of a network topology 700 based on a flexible algorithm provided by an embodiment of the present application.
  • Network topology 700 is another network different from network 100.
  • Network topology 700 includes node R1, node R2, node R3 and node R4, all of which support flexible algorithms. R1 needs to calculate a path to R4.
  • the same FAD information of Flex-Algo can be configured for each node in network topology 700, and the FAD information of Flex-Algo configured for each node is as follows: the numerical identifier of Flex-Algo is 128; the metric type identifier is 0, Indicates that the path is calculated based on the IGP cost value; the calculation type identifier is 0, indicating that the SPF algorithm is used to calculate the path; the bandwidth constraint is: the link bandwidth is not less than 1G.
  • the remaining bandwidth of the R1->R2 link is 0.5G, and the IGP overhead value is 10; the remaining bandwidth of the R1->R3 link is 2G, and the IGP overhead value is 20; the remaining bandwidth of the R2->R4 link is 20.
  • the bandwidth is 0.5G, and the IGP overhead value is 10; the remaining bandwidth of the R3->R4 link is 2G, and the IGP overhead value is 20.
  • FIG. 8 is a schematic flowchart of still another method 800 for determining a path provided by an embodiment of the present application, which is applied to the network 700, and the method 800 includes the following steps:
  • each node enables ISIS, and establishes a neighbor relationship.
  • the FAD information of the Flex-Algo is configured on each node.
  • the user can first configure the FAD information of Flex-Algo that meets the business requirements for one or more nodes.
  • the node that has been configured with the FAD information of Flex-Algo can flood other nodes to notify other nodes of a certain Flex-Algo.
  • the configuration information of Algo enables nodes with the same Flex-Algo digital identifier in the network to configure unified FAD information and calculate paths with consistent results.
  • the ISIS component collects the remaining bandwidth information on the link and performs network-wide announcement.
  • the ISIS component periodically collects the remaining bandwidth on the link from the interface management component according to a preset period (for example, it may be 5 minutes), and uses a unidirectional remaining bandwidth sub-TLV (sub-TLV as shown in FIG. Remaining bandwidth advertisement.
  • a preset period for example, it may be 5 minutes
  • sub-TLV unidirectional remaining bandwidth sub-TLV
  • the remaining bandwidth advertisement may be performed based on the unidirectional residual bandwidth sub-TLV (unidirectional residual bandwidth sub-TLV, URB sub-TLV) described in the Request for Comments (RFC) 8750 document.
  • unidirectional residual bandwidth sub-TLV unidirectional residual bandwidth sub-TLV, URB sub-TLV
  • R1 calculates the route to R4 according to the configured FAD information of the Flex-Algo, and determines the target path.
  • R1 configures the FAD information of Flex-Algo according to S802, which can be the FAD information of Flex-Algo required by the user to configure services for R1, or it can be R1 from other Flex-Algo nodes that have been configured with the same numerical identifier Get FAD information here.
  • each node Since the bandwidth constraint is configured in the FAD information, each node is notified that it needs to meet the minimum 1G bandwidth constraint when using Flex-Algo 128 for path calculation.
  • the ISIS component of the node R1 when the ISIS component of the node R1 calculates the path according to the calculation type (eg, SPF algorithm) in the FAD information, it may first perform path calculation according to the metric type (eg, IGP cost value).
  • the metric type eg, IGP cost value
  • the IGP cost of the path R1->R2->R4 is the smallest.
  • the maximum traffic that this path can carry is 0.5G, which does not meet the bandwidth constraints, R1 excludes this path and re-runs the path.
  • the calculated target path is R1->R3->R4. It can be seen from Figure 7 that the minimum remaining bandwidth on this path is 2G, which can meet the 1G service requirement without causing service damage.
  • the ISIS component of the node R1 can first exclude the link according to the bandwidth constraint condition in the FAD information, and then calculate the target path according to the calculation type and the metric type.
  • the remaining bandwidth on the link R1->R2 is 0.5G
  • the remaining bandwidth on the link R2->R4 is 0.5G
  • the node R1 can first connect the link R1->R2 and the link R2->R4 Excluded, the remaining link R1->R3 and link R3->R4 satisfy the 1G bandwidth constraint, so the calculated target path is R1->R3->R4.
  • the remaining bandwidth changes dynamically, in the period of collecting the remaining bandwidth, the remaining bandwidth of a certain link on the target path that may be collected cannot meet the bandwidth constraint condition.
  • R1 compares the remaining bandwidth collected in the next collection period with the bandwidth constraints, and if R1 finds that the collected remaining bandwidth of the links on the target path cannot meet the bandwidth constraints, it triggers R1 to recalculate the path. , so as to re-determine at least one path that meets the bandwidth requirement of the service.
  • the first node and the second node are in different processes of the same routing protocol, and the routing protocol includes ISIS and OSPF.
  • the FAD information between the first node and the second node described above may be transmitted between the same ISIS process or between different ISIS processes.
  • the ISIS process may also be referred to as an ISIS area, that is, FAD information may be transmitted between the same or different ISIS areas, so as to provide a cross-domain path for nodes belonging to different areas to achieve cross-border services. During domain transmission, it can also ensure that the cross-domain path meets the bandwidth requirements of the service.
  • FIG. 9 is a schematic diagram of transmission of FAD information between different ISIS areas according to an embodiment of the present application.
  • ISIS adopts a two-level hierarchical structure of backbone area (or called Level-2 area) and non-backbone area (or called Level-1 area) in the autonomous system as an example to analyze FAD information.
  • the cross-domain transfer is described.
  • Level-1 routers can be deployed in non-backbone areas, and Level-2 routers can be deployed in backbone areas.
  • Level-1-2 routers can belong to both Level-1 and Level-2 areas.
  • Level-1 routers need to pass Level-1 -1-2 routers are connected to routers in the Level-2 area.
  • ISIS or OSPF may also have other area structures, which are not limited in this embodiment of the present application.
  • R1 is a Level-1 router
  • R2 is a Level-1-2 router
  • R3 is a Level-2 router.
  • R1 in the ISIS Level-1 area can transmit FAD information to the ISIS Level-2 area through R2.
  • FIG. 10 shows a schematic block diagram of an apparatus 1000 for determining a path provided by an embodiment of the present application.
  • the apparatus 1000 includes: a determination module 1010 and a processing module 1020 .
  • the apparatus 1000 may be specifically the first node in the foregoing embodiment, or the function of the first node in the foregoing embodiment may be integrated in the apparatus 1000 .
  • the above functions can be implemented by hardware, or by executing corresponding software by hardware.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the apparatus 1000 may be configured to execute each process and/or step corresponding to the first node in the foregoing method embodiments.
  • the first node may be the node 0 in the network 100 .
  • the first node may be the node 0 in the network 700 .
  • the first node may be node R1 in FIG. 9 .
  • the determining module 1010 is configured to: determine a bandwidth constraint, where the bandwidth constraint is used to represent a bandwidth constraint that needs to be satisfied when transmitting a message based on the target flexible algorithm; the processing module 1020 is configured to determine, based on the target flexible algorithm, the number of arrivals At least one target path of the second node among the nodes, the target path satisfies the bandwidth constraint condition.
  • the determination module 1010 can perform S201 in the above method 200
  • the processing module 1020 can perform S202 in the above method 200 .
  • the apparatus 1000 further includes a receiving module 1020, configured to receive a first packet from other nodes in the network, where the first packet includes the bandwidth constraint condition.
  • a receiving module 1020 configured to receive a first packet from other nodes in the network, where the first packet includes the bandwidth constraint condition.
  • the receiving module 1020 may be a communication interface, such as a transceiver interface.
  • the first subtype length value TLV field of the first packet includes the bandwidth constraint, and the first packet includes the definition FAD of the flexible algorithm.
  • the FAD includes at least one of the following: a flexible algorithm identification, a calculation type identification or a metric type identification; the processing module 1020 is used for: based on the flexible algorithm identification, the measurement type identification or the calculation type identification At least one of the multiple candidate paths is determined; and, based on the bandwidth constraint, at least one target path to the second node is determined from the multiple candidate paths.
  • the calculation type identifier includes an SPF algorithm identifier or a strict SPF algorithm identifier.
  • the metric type identifier includes one of the following: an identifier of a link delay rule, an identifier of an interior gateway protocol IGP overhead rule, an identifier of a traffic engineering TE rule, or an identifier of a link bandwidth rule.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint
  • the affinity attribute constraint is used to indicate a link attribute that needs to be satisfied by the transmission packet, and the target path satisfies the bandwidth constraint and The affinity property constraints.
  • the first message is an ISIS message or an OSPF message.
  • the receiving module 1020 is configured to: receive a second packet from a neighbor node of the apparatus, the The second packet carries the remaining bandwidth between adjacent nodes in the plurality of nodes; the processing module 1020 is configured to: determine, based on the target flexible algorithm and the remaining bandwidth between adjacent nodes in the plurality of nodes, to determine whether to reach the plurality of nodes. at least one target path of the second node of .
  • the second message is an ISIS message or an OSPF message.
  • the apparatus and the second node are in different processes of the same routing protocol, and the routing protocol includes ISIS and OSPF.
  • FIG. 11 shows a schematic block diagram of another apparatus 1100 for determining a path provided by an embodiment of the present application.
  • the apparatus 1100 includes: a determining module 1110 and a sending module 1120 .
  • the apparatus 1100 may be specifically the third node in the foregoing embodiment, or the functions of the third node in the foregoing embodiment may be integrated into the apparatus 1100.
  • the above functions can be implemented by hardware, or by executing corresponding software by hardware.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the apparatus 1100 may be configured to execute each process and/or step corresponding to the third node in the foregoing method embodiments.
  • the first node may be node 0 in network 100
  • the third node may be node 0 in network 100 excluding node 0 . one of the other nodes.
  • the first node may be node 0 in network 700
  • the third node may be node 0 in network 700 except node 0. one of the other nodes.
  • the first node may be the node R1 in FIG. 9
  • the third node may be the node R1 in FIG. one of the other nodes.
  • the determining module 1110 is used for determining the bandwidth constraint, the bandwidth constraint is used to represent the bandwidth constraint that needs to be satisfied when transmitting the message based on the target flexible algorithm;
  • the sending module 1120 is used for: sending the first bandwidth to other nodes in the network packet, the first sub-TLV field of the first packet includes bandwidth constraints.
  • the sending module 1120 may perform S301 in the above method 300 .
  • the above-mentioned sending module 1120 may be a communication interface, such as a transceiver interface.
  • the sending module 1120 is configured to: send a first packet to other nodes in the network, where the first packet includes the bandwidth constraint, and the first subtype length value TLV field of the first packet includes the bandwidth Constraints, the first message includes the definition FAD of the flexible algorithm.
  • the FAD includes at least one of the following: an identification of a flexible algorithm, a calculation type identification or a metric type identification.
  • the second sub-TLV field of the first packet includes an affinity attribute constraint, where the affinity attribute constraint is used to indicate a link attribute that needs to be satisfied by the transmission packet.
  • the first message is an ISIS message or an OSPF message.
  • module as used herein may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor for executing one or more software or firmware programs (eg, a shared processor, a dedicated processor, or a group of processors, etc.) and memory, merge logic, and/or other suitable components to support the described functions.
  • ASIC application specific integrated circuit
  • the apparatus 1000 and the apparatus 1100 may also be a chip or a system of chips, such as a system on chip (system on chip, SoC).
  • the sending module 1120 may be a transceiver circuit of the chip, which is not limited herein.
  • the foregoing apparatus 1000 and/or apparatus 1100 may be implemented by hardware, or may be implemented by executing corresponding software in hardware.
  • FIG. 12 shows a schematic block diagram of still another apparatus 1200 for determining a path provided by an embodiment of the present application.
  • the apparatus 1200 includes a processor 1210 , a transceiver 1220 and a memory 1230 .
  • the processor 1210, the transceiver 1220 and the memory 1230 communicate with each other through an internal connection path, the memory 1230 is used to store instructions, and the processor 1210 is used to execute the instructions stored in the memory 1230 to control the transceiver 1220 to send signals and / or receive signals.
  • the apparatus 1200 may be specifically the first node or the third node in the foregoing embodiments, or the functions of the first node or the third node in the foregoing embodiments may be integrated in the apparatus 1200, and the apparatus 1200 may be used to execute the foregoing Each step and/or process corresponding to the first node or the third node in the method embodiment.
  • the memory 1230 may include read-only memory and random access memory and provide instructions and data to the processor.
  • a portion of the memory may also include non-volatile random access memory.
  • the memory may also store device type information.
  • the processor 1210 may be configured to execute the instructions stored in the memory, and when the processor executes the instructions, the processor may execute various steps and/or processes corresponding to the first node or the third node in the foregoing method embodiments.
  • the processor 1210 may be a central processing unit (central processing unit, CPU), and the processor may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs) ), field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGA field programmable gate array
  • a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • FIG. 13 shows a schematic block diagram of another apparatus 1300 for determining a path provided by an embodiment of the present application.
  • the apparatus 1300 and the apparatus 1200 are schematic diagrams of two parallel apparatuses. Similar to the apparatus 1200, the apparatus 1300 may be specifically the first node or the third node in the foregoing embodiment, or the first node or the third node in the foregoing embodiment.
  • the functions of the three nodes may be integrated in the apparatus 1300, and any one of the apparatus 1300 or the apparatus 1200 may be used to execute the steps and/or processes corresponding to the first node or the third node in the foregoing method embodiments. There is no restriction on this.
  • the apparatus 1300 includes a main control board and an interface board, the main control board includes a processor 1310 and a memory 1320 , and the interface board includes a processor 1330 , a memory 1340 and an interface card 1350 .
  • the main control board processor 1310 may call the program instructions stored in the main control board memory 1320 to implement the device 1000 and/or the device 1100 and perform operations such as message generation.
  • the interface board processor 1330 can call the program instructions stored in the interface board memory 1340 to implement the devices 1000 and/or 1100 and perform operations such as sending messages through the interface card 1350, and when the processor executes the instructions, the processor can execute the above-mentioned operations.
  • memory 1320 and/or memory 1340 may include read-only memory and random access memory and provide instructions and data to the processor.
  • a portion of the memory may also include non-volatile random access memory.
  • the memory may also store device type information.
  • FIG. 14 is a schematic block diagram of a system 1400 for determining a path provided by an embodiment of the present application. As shown in FIG. 14 , the system 1400 includes a first node 1410 and a third node 1420 .
  • the third node 1420 is configured to: send a first packet to the first node 1410, where the first sub-TLV field of the first packet includes a bandwidth constraint, and the bandwidth constraint is used to indicate that the packet is transmitted based on the target flexible algorithm bandwidth constraints that need to be met.
  • the first node 1410 is configured to: receive the first packet from the third node 1420, and determine a bandwidth constraint condition based on the first packet; and, based on the bandwidth constraint condition, determine at least one target path to the destination node.
  • first node 1410 and the third node may also perform the steps and/or processes related to the first node and the third node described in the foregoing embodiments, which will not be repeated here.
  • the disclosed system, apparatus and method may be implemented in other manners.
  • the apparatus embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium.
  • the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

Landscapes

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

Abstract

La présente demande concerne un procédé et un appareil de détermination de chemin, dans lesquels un chemin peut être calculé sur la base d'une politique de configuration Flex-Algo, et la bande passante de liaison peut être limitée de manière flexible, ce qui contribue à empêcher une congestion de trafic provoquée par une bande passante insuffisante, atténuant ainsi la situation d'altération de service. Le procédé comprend les étapes suivantes : un premier nœud parmi de multiples nœuds détermine une condition de contrainte de bande passante, la condition de contrainte de bande passante étant utilisée pour représenter la condition de contrainte de bande passante qui doit être satisfaite lors de la transmission de messages sur la base d'un algorithme flexible cible ; et le premier nœud détermine, sur la base de l'algorithme flexible cible, au moins un chemin cible qui arrive au niveau d'un second nœud parmi les multiples nœuds, le chemin cible satisfaisant à la condition de contrainte de bande passante.
PCT/CN2022/083172 2021-04-09 2022-03-25 Procédé et appareil de détermination de chemin WO2022213830A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110384043.4A CN115208809A (zh) 2021-04-09 2021-04-09 确定路径的方法和装置
CN202110384043.4 2021-04-09

Publications (1)

Publication Number Publication Date
WO2022213830A1 true WO2022213830A1 (fr) 2022-10-13

Family

ID=83545165

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/083172 WO2022213830A1 (fr) 2021-04-09 2022-03-25 Procédé et appareil de détermination de chemin

Country Status (2)

Country Link
CN (1) CN115208809A (fr)
WO (1) WO2022213830A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109831382A (zh) * 2019-02-13 2019-05-31 华为技术有限公司 一种路径计算方法、装置及设备
CN111464441A (zh) * 2019-01-21 2020-07-28 华为技术有限公司 一种通信方法及装置
CN111464440A (zh) * 2019-01-21 2020-07-28 华为技术有限公司 一种通信方法及装置
US20210083940A1 (en) * 2018-09-25 2021-03-18 Zte Corporation Method and apparatus for creating network slices

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210083940A1 (en) * 2018-09-25 2021-03-18 Zte Corporation Method and apparatus for creating network slices
CN111464441A (zh) * 2019-01-21 2020-07-28 华为技术有限公司 一种通信方法及装置
CN111464440A (zh) * 2019-01-21 2020-07-28 华为技术有限公司 一种通信方法及装置
CN109831382A (zh) * 2019-02-13 2019-05-31 华为技术有限公司 一种路径计算方法、装置及设备
CN112054960A (zh) * 2019-02-13 2020-12-08 华为技术有限公司 一种路径计算方法、装置及设备

Also Published As

Publication number Publication date
CN115208809A (zh) 2022-10-18

Similar Documents

Publication Publication Date Title
US11431611B2 (en) Computing forwarding paths based on notification packet delays
WO2021063232A1 (fr) Procédé, appareil et système d'établissement d'élément de table d'acheminement bier
US7319700B1 (en) Communicating constraint information for determining a path subject to such constraints
KR20210092304A (ko) 패킷 처리 방법 및 장치, 기기, 그리고 시스템
EP1104963A1 (fr) Procédé et appareil d' échange d' informations de routage dans un réseau à commutation de paquets
CN113347091B (zh) 灵活算法感知边界网关协议前缀分段路由标识符
KR101629533B1 (ko) 브로드캐스트 네트워크에 대한 ｌｄｐ ｉｇｐ 동기화
CN110611616A (zh) 一种基于Radius服务器的流量调度方法、系统、设备和介质
US20220224631A1 (en) Routing Control Method and Apparatus
US20230353479A1 (en) Edge Computing Data and Service Discovery Using an Interior Gateway Protocol (IGP)
WO2022213830A1 (fr) Procédé et appareil de détermination de chemin
WO2023036087A1 (fr) Procédé d'annonce de routage, procédé d'établissement de chemin, procédé de transmission de données de service et routeur de bordure de système autonome
CN115208829A (zh) 报文处理的方法及网络设备
WO2023160124A1 (fr) Procédé et appareil de détermination de trajet
WO2022267083A1 (fr) Procédés et appareil de détermination de trajet
US20230179515A1 (en) Routing protocol broadcast link extensions
WO2023098703A1 (fr) Procédé de notification de trajet, procédé de génération de combinaison d'algorithmes de topologie, procédé de calcul de trajet, procédé de transmission de données, dispositif électronique, et support de stockage lisible par ordinateur
CN113691446B (zh) 一种报文发送的方法和装置
WO2022262564A1 (fr) Procédé, appareil et système de traitement d'informations
CN113852553B (zh) 流量调度方法及系统、sdn控制器
CN103004149B (zh) 用于在网络中确定等值路径的方法、网络装置和系统
US20220255838A1 (en) A Method and a Device for Routing Traffic Along an IGP Shortcut Path
CN109729006B (zh) 一种报文处理方法和装置、计算机可读存储介质
CN115118651A (zh) 用于获取路径的方法和装置
CN117014356A (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: 22783897

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: 22783897

Country of ref document: EP

Kind code of ref document: A1