WO2022267083A1

WO2022267083A1 - Path determination methods and apparatus

Info

Publication number: WO2022267083A1
Application number: PCT/CN2021/103300
Authority: WO
Inventors: 孟凡博; 徐国其; 李臣习; 方晟; 郑娟
Original assignee: 华为技术有限公司
Priority date: 2021-06-22
Filing date: 2021-06-29
Publication date: 2022-12-29
Also published as: CN115514640A

Abstract

Path determination methods (300, 400) and an apparatus (1000), which can support Flex-Algo path calculations based on the packet loss rate of a link, which is beneficial for improving the quality of service of the link. A path determination method (300) comprises: a first node among a plurality of nodes receives information of a target flexible algorithm, the information of the target flexible algorithm comprising an identifier for indicating the packet loss rate of a link (S301); and the first node, on the basis of the target flexible algorithm, determines at least one target path to a second node among the plurality of nodes, the target path being a path that has the smallest sum of link packet loss rates among a plurality of candidate paths (S302).

Description

Method and device for determining a path

This application claims the priority of the Chinese patent application with the application number 202110691370.4 and the application title "Method and Device for Determining Path" submitted to the China Patent Office on June 22, 2021, the entire contents of which are incorporated by reference in this application.

technical field

The present application relates to the field of network technologies, and more specifically, to a method and device for determining a path.

Background technique

The traditional interior gateway protocol (interior gateway protocol, IGP) can calculate the shortest path to the destination address according to the cost value of the link and the shortest path first (shortest path first, SPF) algorithm. However, the SPF algorithm based on the cost value of the link is fixed and cannot be adjusted by the user, making it inconvenient to calculate the optimal path according to their own needs.

For example, the link packet loss rate is an important factor affecting link service quality. If the IGP ignores the link packet loss rate when calculating paths based on SPF, it may obtain a path with a high link packet loss rate, which will affect the link quality. service quality level, thus affecting the service experience of users.

Contents of the invention

The present application provides a method and device for determining a path, which can support Flex-Algo path calculation based on the link packet loss rate, and is beneficial to improve the service quality of the link.

In a first aspect, a method for determining a path is provided, which is applied to a network including a plurality of nodes, including: a first node among the plurality of nodes receives information of a target flexible algorithm, and the information of the target flexible algorithm includes information for indicating a link The indicator of the path packet loss rate. 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 is a path with the smallest sum of link packet loss rates among the plurality of candidate paths.

In the embodiment of the present application, a metric type based on the link packet loss rate can be added, and the first node can calculate the target that meets the link packet loss rate requirement based on the link packet loss rate in the information of the target flexible algorithm. The path is conducive to improving the link quality of service level, thereby improving the user's service experience.

With reference to the first aspect, in some implementations of the first aspect, the sum of the first packet loss rate weights of at least one link of the target path is the smallest among multiple candidate paths, and the first packet loss rate weight The value is determined according to the link packet loss rate.

In the embodiment of the present application, the first node may consider the packet loss rate weight corresponding to the link packet loss rate when calculating the path, and determine the target path that meets the service requirement according to the packet loss rate weight.

With reference to the first aspect, in some implementation manners of the first aspect, the first packet loss rate weight is greater than 0, and the first packet loss rate weight increases as the link packet loss rate increases.

In the embodiment of the present application, since the current link packet loss rate on the routing interface ranges from 0.000003% to 50.331642%, the corresponding packet loss rate weight ranges from 1 to 16777214. For the case where the packet loss rate is 0, the corresponding packet loss rate weight is 0. When the link packet loss rate on each link in the network is 0, the packet loss rate weights corresponding to the link packet loss rate from each node to other nodes are all 0. A loop problem may occur when the packet rate is calculated for the metric type. Therefore, when the link packet loss rate is 0, the corresponding packet loss rate weight can be set to a value greater than 0, and the packet loss rate weight increases with the increase of the link packet loss rate, which can also achieve the distinction The purpose of different link packet loss rates.

In combination with the first aspect, in some implementations of the first aspect, the link packet loss rate of 0 corresponds to the first packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the first packet loss rate weight value is 2, and 0.000003% is the basic measurement unit of link packet loss rate.

In the embodiment of this application, the packet loss rate weight value of 1 can be reserved for the case where there is no link packet loss rate (that is, the link packet loss rate is 0), and the link packet loss rate is 0.000003% corresponding to the packet loss The rate weight is incremented to 2, and so on. In this way, loop problems will not occur when the link packet loss rate is 0, and different link packet loss rates can be distinguished.

With reference to the first aspect, in some implementation manners of the first aspect, receiving the information of the target flexible algorithm by the first node among the multiple nodes includes: the first node receiving the first message from other nodes in the network, The first packet includes information about the target flexible algorithm, and the information about the target flexible algorithm includes a flexible algorithm definition (flexible algorithm definition, FAD) of the target flexible algorithm.

In this embodiment of the application, the first node can flood the target flexible algorithm information through the first message, so that the entire network can build a topology based on Flex-Algo, and each node in the network can generate a topology based on Flex-Algo routing information.

With reference to the first aspect, in some implementations of the first aspect, the first node receives a second packet from other nodes in the network, where the second packet includes a second packet loss rate weight of at least one link ; The first node determines the first packet loss rate weight based on the second message.

In this embodiment of the present application, the first node may receive a second packet loss rate weight issued by other nodes in the network, and the second packet loss rate weight may be carried in the second message.

With reference to the first aspect, in some implementation manners of the first aspect, the second packet loss rate weight is located in the first subtype length value TLV field of the second packet.

In this embodiment of the present application, the second packet loss rate weight may be carried in the sub-TLV of the second packet. Exemplarily, the second packet loss rate weight may be published through one of the sub-TLVs (sub-sub TLVs) of the No. 16 sub-TLV of the ISIS message.

With reference to the first aspect, in some implementation manners of the first aspect, the first node determines the first packet loss rate weight based on the second message, including: the first node adds the second packet loss rate weight to The value after 1 is determined as the first packet loss rate weight.

In this embodiment of the application, the second packet loss rate weight value received by the first node is determined according to the corresponding relationship between the link packet loss rate on the current interface and the packet loss rate weight value. The packet loss rate weight of the link is 0, resulting in a loop. Therefore, after receiving the second packet loss rate weight, the first node can determine the value obtained by adding 1 to the second packet loss rate weight. The first packet loss rate weight is the first packet loss rate weight, and the IGP can calculate a target path that satisfies the requirement according to the first packet loss rate weight when calculating the path.

With reference to the first aspect, in some implementation manners of the first aspect, the first node determines the first packet loss rate weight based on the second message, including: the first node determines the second packet loss rate weight is the first packet loss rate weight.

In this embodiment of the application, when other nodes in the network send the second message, the original packet loss rate weight determined according to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface has been added to 1 to obtain the second packet loss rate weight, so the first node can determine the second packet loss rate weight as the first packet loss rate weight.

With reference to the first aspect, in some implementation manners of the first aspect, the information of the target flexible algorithm further includes an identification of a calculation type; the first node determines, based on the target flexible algorithm, the At least one target path, comprising: the first node determines at least one target path to the second node from multiple candidate paths based on at least one of the target flexible algorithm, the link packet loss rate, or the calculation type .

In the second aspect, a method for determining a path is provided, which is applied to a network including multiple nodes, including: a third node among the multiple nodes sends information of a target flexible algorithm to other nodes in the network, and the target flexible algorithm The information includes an identifier for indicating the link packet loss rate, and the information of the target flexible algorithm is used by other nodes in the network to determine at least one target path based on the target flexible algorithm.

In the embodiment of the present application, the third node may serve as a sending end and may send the information of the target flexible algorithm to other nodes in the network (including the above-mentioned first node). It should be understood that the first node may also be the same node as the third node, that is, the above-mentioned first node may perform the same steps as the third node, and send information about the target flexible algorithm to other nodes in the network. One node is the sending end, and the third node can receive the target flexible algorithm information as the receiving end.

With reference to the second aspect, in some implementations of the second aspect, the third node among the multiple nodes sends information about the target flexible algorithm to other nodes in the network, including: the third node sends the information of the target flexible algorithm to other nodes in the network A message, where the first message includes information about the target flexible algorithm.

With reference to the second aspect, in some implementation manners of the second aspect, the third node sends a second message to other nodes in the network, where the second message includes a second packet loss rate weight of at least one link, The second packet loss rate weight is located in the first subtype length value TLV field of the second packet.

With reference to the second aspect, in some implementation manners of the second aspect, before the third node sends the second message to other nodes in the network, it further includes: the third node corresponds to the original link packet loss rate A value obtained by adding 1 to the packet loss rate weight is determined as the second packet loss rate weight.

In this embodiment of the application, the third node may determine the value obtained by adding 1 to the original packet loss rate weight determined according to the corresponding relationship between the link packet loss rate on the current interface and the packet loss rate weight value as the second loss rate weight. Packet rate weight.

With reference to the second aspect, in some implementation manners of the second aspect, the second packet loss rate weight is greater than 0, and the second packet loss rate weight increases as the link packet loss rate increases.

In combination with the second aspect, in some implementations of the second aspect, the link packet loss rate of 0 corresponds to the second packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the second packet loss rate weight value is 2, and 0.000003% is the basic measurement unit of link packet loss rate.

In a third aspect, a device for determining a path is provided, including: a receiving module, configured to receive information of a target flexible algorithm, where the information of the target flexible algorithm includes an identifier for indicating a packet loss rate of a link; a determining module, configured to Based on the target flexible algorithm, at least one target path to the second node among the plurality of nodes is determined, and the target path is the path with the minimum sum of packet loss rates of the links among the plurality of candidate paths.

With reference to the third aspect, in some implementations of the third aspect, the sum of the first packet loss rate weights of at least one link of the target path is the smallest among multiple candidate paths, and the first packet loss rate weight The value is determined according to the link packet loss rate.

With reference to the third aspect, in some implementation manners of the third aspect, the first packet loss rate weight is greater than 0, and the first packet loss rate weight increases as the link packet loss rate increases.

In combination with the third aspect, in some implementations of the third aspect, the link packet loss rate of 0 corresponds to the first packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the first packet loss rate weight value is 2, and 0.000003% is the basic measurement unit of link packet loss rate.

With reference to the third aspect, in some implementations of the third aspect, the receiving module is configured to: receive a first message from other nodes in the network, the first message includes information about the target flexible algorithm, and the target flexible The algorithm information includes a flexible algorithm definition (FAD) of the target flexible algorithm.

With reference to the third aspect, in some implementations of the third aspect, the receiving module is configured to: receive a second message from other nodes in the network, where the second message includes a second packet loss rate of at least one link Weight; the determining module is configured to: determine the first packet loss rate weight based on the second packet.

With reference to the third aspect, in some implementation manners of the third aspect, the second packet loss rate weight is located in the first subtype length value TLV field of the second packet.

With reference to the third aspect, in some implementation manners of the third aspect, the determining module is configured to: determine a value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.

With reference to the third aspect, in some implementation manners of the third aspect, the determining module is configured to: determine the second packet loss rate weight as the first packet loss rate weight.

In conjunction with the third aspect, in some implementations of the third aspect, the information of the target flexible algorithm also includes an identification of a calculation type; the determining module is configured to: based on the target flexible algorithm, the link packet loss rate or the calculation type In at least one of the plurality of candidate paths, at least one target path to the second node is determined.

In a fourth aspect, another device for determining a path is provided, including: a determining module, configured to determine information of a target flexible algorithm, the information of the target flexible algorithm includes an identifier for indicating a link packet loss rate, and the target flexible algorithm The information is used by other nodes in the network to determine at least one target path based on the target flexible algorithm; the sending module is used to send the information of the target flexible algorithm to other nodes in the network.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the sending module is configured to: send a first message to other nodes in the network, where the first message includes information about the target flexible algorithm.

With reference to the fourth aspect, in some implementations of the fourth aspect, the sending module is configured to: send a second message to other nodes in the network, where the second message includes a second packet loss rate weight of at least one link value, the second packet loss rate weight is located in the first subtype length value TLV field of the second packet.

In conjunction with the fourth aspect, in some implementations of the fourth aspect, the determining module is configured to: determine the value obtained by adding 1 to the original packet loss rate weight corresponding to the link packet loss rate as the second packet loss rate weight value.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the second packet loss rate weight is greater than 0, and the second packet loss rate weight increases as the link packet loss rate increases.

In combination with the fourth aspect, in some implementations of the fourth aspect, the link packet loss rate of 0 corresponds to the second packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the second packet loss rate weight value is 2, and 0.000003% is the basic measurement unit of link packet loss rate.

In the fifth aspect, there is provided another device for determining a path, including a processor, the processor is coupled with a memory, and can be used to execute instructions in the memory, so as to realize any possible implementation manner in the first aspect or the second aspect above method in . Optionally, the device further includes a memory. Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

In an implementation manner, the device for determining a path is a routing device, and when the device for determining a route is a routing device, the communication interface may be a transceiver, or an input/output interface.

In another implementation manner, the device for determining the path is a chip configured in the routing device. When the device for determining the path is a chip configured in the routing device, the communication interface may be an input/output interface.

In a sixth aspect, a processor is provided, including: an input circuit, an output circuit, and a processing circuit. The processing circuit is configured to receive a signal through the input circuit and transmit a signal through the output circuit, so that the processor executes the method in any possible implementation manner of the first aspect or the second aspect above.

In a specific implementation process, the above-mentioned processor can be a chip, the input circuit can be an input pin, the output circuit can be an output pin, and the processing circuit can 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, the receiver, the output signal of the output circuit may be, for example but not limited to, output to the transmitter and transmitted by the transmitter, and the input circuit and the output The circuit may be the same circuit, which is used as an input circuit and an output circuit respectively at different times. The embodiment of the present application does not limit the specific implementation manners of the processor and various circuits.

In a seventh aspect, a processing device is provided, including a processor and a memory. The processor is used to read instructions stored in the memory, and may 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 above.

Optionally, there are one or more processors, and one or more memories.

Optionally, the memory may be integrated with the processor, or the memory may be separated from the processor.

In the specific implementation process, the memory can be a non-transitory (non-transitory) memory, such as a read-only memory (read only memory, ROM), which can be integrated with the processor on the same chip, or can be respectively arranged in different On the chip, the embodiment of the present application does not limit the type of the memory and the configuration of the memory and the processor.

It should be understood that a related data interaction process such as sending indication information may be a process of outputting indication information from a processor, and receiving capability information may be a process of receiving input capability information from a processor. In particular, processed output data may be output to the transmitter, and input data received by the processor may be from the receiver. Wherein, the transmitter and the receiver may be collectively referred to as a transceiver.

The processing device in the seventh aspect above can be a chip, and the processor can be implemented by hardware or by software. When implemented by hardware, the processor can be a logic circuit, an integrated circuit, etc.; when implemented by software When implemented, the processor may be a general-purpose processor, which is realized by reading the software code stored in the memory, and the memory may be integrated in the processor, or it may be located outside the processor and exist independently.

In an eighth aspect, there is provided a system for determining a path, the system includes a first node and a third node, the first node executes the method in any possible implementation manner of the above first aspect, and the third node executes the above first node The method in any one of the possible implementations of the two aspects.

In a ninth aspect, a computer program product is provided, and the computer program product includes: a computer program (also referred to as code, or an instruction), which, when the computer program is run, causes the computer to execute any one of the above-mentioned first aspect or the second aspect. method in one possible implementation.

In a tenth aspect, a computer-readable storage medium is provided, the computer-readable storage medium stores a computer program (also referred to as code, or instruction), and when it is run on a computer, it causes the computer to perform the above-mentioned first aspect. Or the method in any possible implementation manner in the second aspect.

Description of drawings

FIG. 1 is a schematic structural diagram of an ISIS message;

Fig. 2 is a schematic topology diagram of a multi-node network;

FIG. 3 is a schematic flowchart of a method for determining a path provided in an embodiment of the present application;

FIG. 4 is a schematic flowchart of another method for determining a path provided in an embodiment of the present application;

FIG. 5 is a schematic topology diagram of a multi-node network provided by an embodiment of the present application;

FIG. 6 is a schematic topology diagram of another multi-node network provided by an embodiment of the present application;

FIG. 7 is a schematic topology diagram of yet another multi-node network provided by an embodiment of the present application;

FIG. 8 is a schematic diagram of a sub-TLV for notifying packet loss rate weights provided by an embodiment of the present application;

FIG. 9 is a schematic block diagram of a device for determining a path provided in an embodiment of the present application;

FIG. 10 is a schematic block diagram of another device for determining a path provided by an embodiment of the present application;

Fig. 11 is a schematic block diagram of another device for determining a path provided by an embodiment of the present application;

Fig. 12 is a schematic block diagram of a system for determining a path provided by an embodiment of the present application.

detailed description

The technical solution in this application will be described below with reference to the accompanying drawings.

For ease of understanding, terms involved in the embodiments of the present application are briefly introduced first.

1. Flexible Algorithm (Flex-Algo): Flex-Algo provides a strategy similar to traffic engineering (TE), which achieves the same effect as TE by enabling the IGP to calculate the shortest path with constraints. Flex-Algo allows users to introduce durian into a customized network topology, and enrich the path calculation capability of IGP by customizing flexible algorithm definition (FAD), so as to achieve the purpose of traffic engineering.

IGP can build a Flex-Algo-based topology by flooding FAD, node Flex-Algo algorithm participation capabilities, and link TE attribute information. Based on the topology built by Flex-Algo Hou, the routing information to reach the routing identifier (locator) of the network segment is generated.

2. Flexible Algorithm Definition (FAD): According to the description of FAD in draft standard draft-ietf-lsr-flex-algo-14, FAD includes metric-type, calculation-type and description topology A set of constraints (describe a set of constraints on the topology). It should be understood that the router may also be configured with a digital identifier associated with one FAD, and the numbers 128-255 may be used to identify different Flex-Algos.

The router can extend a set of type-length-value (TLV) to carry the FAD information of Flex-Algo, which is called FAD TLV. The FAD TLV is used to notify the specific calculation rules of a certain Flex-Algo. The FAD TLV Includes multiple sub-TLVs (sub-TLVs).

Fig. 1 is a schematic structural diagram of an intermediate system to intermediate system (intermediate system to intermediate system, ISIS) message. As shown in Fig. 1, the FAD TLV structure of the ISIS message includes the following fields:

(1) type (type) field: used to describe the type of ISIS message;

(2) length (length) field: used to describe the length of the ISIS message;

(3) Flex-Algo field: used to describe the digital identifier of Flex-Algo;

(4) Metric type (metric-type) field: used to describe the metric type identification based on the route calculation of Flex-Algo;

(5) Calculation type (calculation-type) field: used to describe the calculation type identifier based on the route calculation of Flex-Algo;

(6) Priority (priority) field: used to describe the priority identification of the service traffic carried by the ISIS message;

(7) Sub-TLV (sub-TLVs) field.

3. Metric-type: Existing metric types include link cost (IGP cost), delay, and traffic engineering (traffic engineering, TE) rules. Flex-Algo can be based on one of the various metric types. There are different kinds of metric rules to calculate paths that meet different requirements.

The following is the description of the metric type (metric-type) in the current draft standard draft-ietf-lsr-flex-algo-14:

Metric-Type: Type of metric to be used during the calculation.

Following values are defined:

0: IGP Metric

1: Min Unidirectional Link Delay as defined in [RFC7810].

2: TE default metric as defined in [RFC5305].

Among them, Request for Comments (RFC) is a series of standard documents arranged by number, which collect a large amount of Internet-related information. The RFC standard document also adds many topics within the standard, such as new protocols for the Internet and all records of development.

As can be seen from the above description, different metric types have different identifiers, and the identifiers range from 0 to 255. The current standard draft draft-ietf-lsr-flex-algo-14 stipulates that 0 is used to identify IGP cost, and 1 is used when identifying Extended, 2 is used to identify the TE rule, and the following 3 to 255 are the identification of the reserved metric type.

4. SPF algorithm: The SPF algorithm is the basis of the open shortest path first OSPF routing protocol. Each router can be used as the root (ROOT) to calculate the distance to each destination router. Each router can be calculated according to a unified database. A topology diagram of the outgoing routing domain, which is also called a shortest path tree.

5. Link overhead value (cost): In the OSPF routing protocol, the trunk length of the shortest path tree, that is, the distance from the OSPF router to each destination router, is called the cost of OSPF, and its algorithm is: cost=100× (10)^6/link bandwidth.

As can be seen from the above introduction, FAD includes metric-type, calculation-type, and a set of describing topological constraints (describe a set of constraints on the topology). Users can customize FAD to enrich the path calculation of IGP. capacity, so as to achieve the purpose of traffic engineering.

The traditional IGP algorithm can calculate the shortest path to the destination address based on the link cost value and the SPF algorithm. This method is based on the link overhead value, which cannot meet the different needs of users. For example, users expect to forward along the path with the smallest delay, or exclude some links from forwarding. Exemplarily, since the field of automatic driving requires a network with extremely low delay, it is necessary to perform path calculation according to the delay. Exemplarily, some links have relatively high costs, and the user wishes to consider the factor of costs, so the paths with relatively high costs need to be excluded when calculating the paths. 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.

Because Flex-Algo allows users to customize the algorithm of the IGP algorithm to meet different service requirements, based on the characteristics of Flex-Algo, IGP can automatically calculate paths that meet different requirements according to link cost, delay, and TE constraints, flexibly Meet the needs of traffic engineering.

As can be seen from the above, the calculation rules of Flex-Algo are generally represented by a triplet, that is, measurement type, calculation type and constraint. Wherein, the measurement type represents link index constraints (for example, delay index), the calculation type represents calculation algorithm constraints (for example, SPF algorithm is used), and the constraint conditions represent whether to include/exclude some links when calculating paths.

Exemplarily, the user can define Flex-Algo 128 as: (1) measurement type: delay; (2) calculation type: SPF; (3) constraint condition: exclude link x.

FIG. 2 is a schematic topology diagram of a multi-node network 200 . Network 200 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 FIG. 2 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 the network 200, 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.

Among them, Node 0 and Node 9 can support Flex-Algo 128 and Flex-Algo 129 at the same time, and the IGP protocol can notify the definition of Flex-Algo 128 and Flex-Algo 129 through the FAD TLV, so that all nodes in the network can perceive Node 0 and Flex-Algo 129 Algorithm and algorithm definition used by node 9.

Nodes 1 to 4 use Flex-Algo 128, and the IGP protocol can notify nodes 1 to 4 to use Flex-Algo 128 through the FAD TLV.

Nodes 5 to 8 use Flex-Algo 129, and the IGP protocol can notify nodes 5 to 8 to use Flex-Algo 129 through the FAD TLV.

In addition to Flex-Algo 128 and Flex-Algo 129, each node can also support the most basic algorithm 0, which is the SPF algorithm based on the link cost value.

In Fig. 2, exemplarily, the node 9 is configured with the network segment routing identifier (referred to as SRv6locator) of the SR of the Internet protocol version 6 (internet protocol version 6, IPv6) data plane forwarding the IPv6 data packet to associate with the Flex-Algo , other nodes in the network can calculate the route to the network segment corresponding to this SRv6locator based on Flex-Algo. Finally, different network segment routes represent paths calculated based on different algorithms, which can meet the diversified needs of the business.

It should be understood that other nodes may also configure the SRv6locator to associate with the Flex-Algo, which is not limited in this embodiment of the present application.

During the path calculation based on the network 200, node 0 notifies other nodes of supported algorithm 0, Flex-Algo 128, and Flex-Algo 129, and node 9 notifies other nodes of supported algorithm 0, Flex-Algo 128, and Flex-Algo 129. Node 1, Node 2, Node 3, and Node 4 notify other nodes of supported algorithm 0 and Flex-Algo 128, and Node 5, Node 6, Node 7, and Node 8 notify other nodes of supported algorithm 0 and Flex-Algo 129.

Exemplarily, the definition of Flex-Algo 128 is: (1) measurement type: delay; (2) calculation type: SPF; (3) constraint condition: exclude the link composed of

nodes

5 and 6.

Exemplarily, the definition of Flex-Algo 129 is: (1) Metric type: TE; (2) Calculation type: SPF; (3) Constraint condition: exclude the link composed of node 1 and node 2.

It should be understood that Flex-Algo 128 and Flex-Algo 129 can logically divide network 200 into sub-network topology 210 and sub-network topology 220, sub-network topology 210 includes nodes supporting Flex-Algo 128, and sub-network topology 220 includes nodes supporting Flex-Algo 129 nodes. In FIG. 2 , if Node 1 , Node 2 , Node 3 , and Node 4 use Flex-Algo128, then Node 1 , Node 2 , Node 3 , and Node 4 can belong to the subnetwork topology 210 . 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 the subnetwork topology 220.

Exemplarily, node 0 uses Flex-Algo 128, and node 0 can flood the entire network with the FAD information of the configured Flex-Algo 128, so that each node in the subnetwork topology 210 learns the FAD information of Flex-Algo 128, like this Nodes in the sub-network topology 210 that are not configured with corresponding FAD information can also follow the FAD information calculation path of the Flex-Algo 128. The nodes in the final determined target path belong to the same subnetwork topology.

It should be understood that any node in the network 200 can also flood the FAD information of the Flex-Algo configured by itself in the whole network, so that nodes with the same Flex-Algo digital identifier can follow the same algorithm definition to calculate satisfying The optimal path required by the business is not limited in this embodiment of the present application.

Exemplarily, nodes 1 to 8 use Algorithm 0, and the target path calculated by node 0 may include any node in the network 200, which is not limited by Flex-Algo.

It should be understood that the nodes in the network 200 may also be flexible algorithm nodes supporting Flex-Algo 130, Flex-Algo 131..., which is not limited in this embodiment of the present application.

Based on the above description, the current draft standard draft-ietf-lsr-flex-algo-14 only supports Flex-Algo path calculation based on link cost (cost), delay or TE, and does not support link loss based Flex-Algo path calculation of packet rate (also called interface packet loss rate).

In view of the fact that the impact of the link packet loss rate on the target path is not considered when using Flex-Algo path calculation, the calculated Flex-Algo path has a link packet loss rate that is too large, which may affect the user's service experience. The embodiment of the present application provides a method and device for determining a path. By adding a measurement type based on the link packet loss rate, the path is calculated according to the Flex-Algo configuration strategy, which is beneficial to avoid the problem caused by the excessive link packet loss rate. service damage, thereby improving the link quality of service.

Before introducing the method and device for determining a path provided by the embodiment of the present application, the following points are explained first.

First, in the embodiments shown below, various terms and English abbreviations, such as link packet loss rate, packet loss rate weight, Flex-Algo, metric type, etc., are all exemplary given for the convenience of description By way of example, this application should not be construed in any way. This application does not exclude the possibility of defining other terms that can achieve the same or similar functions in existing or future agreements.

Second, the first, second and various numbers in the embodiments shown below are only for convenience of description, and are not used to limit the scope of the embodiments of the present application. For example, different nodes are distinguished, different packet loss rate weights are distinguished, and the like.

Third, "at least one" means one or more, and "multiple" means two or more. "And/or" describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural. The character "/" generally indicates that the contextual objects are an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (one) 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.

It should be understood that the method for determining the path provided by the present application can be applied to SRv6 scenarios, and can also be applied to segment routing (segment routing, SR) using a multi-protocol label switching (multi-protocol label switching, MPLS) data plane to forward MPLS packets. ) scenario, referred to as SR-MPLS scenario for short, may also be applied to other scenarios, which is not limited in this embodiment of the present application.

A method for determining a path provided by an embodiment of the present application is described in detail below with reference to FIG. 3 .

FIG. 3 is a schematic flow chart of a method 300 for determining a path provided by an embodiment of the present application. The method 300 can be applied to the network 200 shown in FIG. 2 , and the steps and/or processes of the method 300 can be performed by the first node implement. Method 300 includes the following steps:

S301. A first node among multiple nodes receives information about a target flexible algorithm, where the information about the target flexible algorithm includes an identifier for indicating a link packet loss rate.

Exemplarily, if a path from node 0 to node 9 in the network 200 needs to be determined, the above-mentioned first node may be node 0 in the network 200 .

S302. Based on the target flexible algorithm, the first node determines at least one target path to the second node among the multiple nodes, where the target path is a path with the smallest sum of packet loss rates of the link among the multiple candidate paths.

Exemplarily, if a path from node 0 to node 9 (destination node) in the network 200 needs to be determined, the above-mentioned second node may be node 9 in the network 200 .

For example, if a path from node 0 to node 9 in the network 200 needs to be determined, the first node may be node 0 in the network 200 , and the second node may be node 9 in the network 200 .

Exemplarily, 255 may be selected from the reserved metric type identifiers (3-255) as the identifier of the link packet loss rate.

In S302, on the basis of determining at least one target path based on the target flexible algorithm, the first node may also determine a target path jointly with the target flexible algorithm based on other conditions. Exemplarily, other conditions may be neighbor information, a routing table, or remaining link bandwidth, which is not limited in this embodiment of the present application.

In this embodiment of the present application, the first node may determine at least one target path. Exemplarily, if the first node determines two target paths that meet the path calculation requirements at the same time, multi-path transmission strategies such as load sharing, dual transmission and selective reception, or active and standby can be used to transmit service data.

In the embodiment of this application, in scenarios where the packet loss rate is strictly required for games, live video, etc., a new measurement type based on the link packet loss rate can be added to calculate the target that meets the link packet loss rate requirements. The path is conducive to improving the link quality service level, thereby improving the user's service experience.

As an optional embodiment, S301 includes: the first node receives a first packet from other nodes in the network, the first packet includes information about the target flexibility algorithm, and the information about the target flexibility algorithm includes the target flexibility Algorithm FAD.

Exemplarily, the first message may be an ISIS message. It can be known from the above terminology introduction that the FAD TLV of the ISIS message includes a metric type field, and the metric type field may carry an identifier for indicating the metric type. In the embodiment of the present application, the metric type field carries the identifier of the packet loss rate of the link.

FIG. 4 is a schematic flowchart of another method 400 for determining a path provided by an embodiment of the present application. The method 400 can be applied to the network 200 shown in FIG. 2, and the method 400 includes the following steps:

S401. A third node among the multiple nodes sends a first packet to other nodes in the network.

The first message includes the information of the flexible algorithm, the information of the target flexible algorithm includes FAD, and the identifier for indicating the packet loss rate of the link is located in the metric type field of the FAD. Correspondingly, the first node receives the first packet.

S402. The first node determines information about the target flexible algorithm based on the first packet.

S403. Based on the flexible algorithm, the first node determines at least one target path to the destination node.

Exemplarily, the above-mentioned first node, second node, and third node may be a routing device, and the routing device may be any device capable of calculating routing functions, such as a router or a switch, which is not limited in this embodiment of the present application.

Exemplarily, if it is necessary to determine a path from node 0 to node 9 (destination node) in the network 200, the above-mentioned first node may be node 0 in the network 200, and the third node may be the node 0 in the network 200 except Any node, which is not limited in this embodiment of the present application.

In this embodiment of the application, the first node does not know the information of the flexible algorithm, but other third nodes in the network that have configured or obtained the information of the flexible algorithm can send the first message to the first node, and the first The information of the flexible algorithm is carried in the message to notify other nodes of the path calculation rules.

It should be understood that the first node can not only serve as a receiving end to receive first messages from other nodes, but also can serve as a sending end to perform steps similar to those of the third node and send the first message to other nodes in the network. This is not limited by the embodiments of the present application.

After extending the standard draft draft-ietf-lsr-flex-algo-14 and adding the Flex-Algo path calculation metric type based on the link packet loss rate, IGP can calculate the path that meets the requirements according to the link packet loss rate.

The link packet loss rate on the current routing interface ranges from 0.000003% to 50.331642%, and the corresponding packet loss rate weight ranges from 1 to 16777214. For the case where the packet loss rate is 0, the corresponding packet loss rate weight is 0. Among them, 0.000003% is the basic measurement unit of link packet loss rate.

For example, on the current interface, a link packet loss rate of 0.000003% corresponds to a packet loss rate weight of 1, 0.000006% corresponds to a packet loss rate weight of 2, 0.000009% corresponds to a packet loss rate weight of 3, and so on , which will not be repeated here.

It should be understood that in this embodiment of the present application, the packet loss rate weight corresponding to the link packet loss rate on the current interface may be referred to as the original packet loss rate weight.

FIG. 5 is a schematic topology diagram of a multi-node network 500 provided by an embodiment of the present application. Based on the sub-network topology 210 of the network 200, the network 500 adds a description of the packet loss rate weight of each node. Exemplarily, each node in network 500 supports Flex-Algo 128.

In the network 500, there may be no packet loss on the routing interfaces of all nodes, that is, the link packet loss rate on each link is 0. In this case, the links from each node to other nodes The weight of the packet loss rate corresponding to the packet loss rate is 0. When IGP calculates the path based on SPF, it will consider that the entire network topology is equal-cost multipath (ECMP). Therefore, IGP uses the link packet loss rate A loop problem occurs when calculating the path of route 3::/64 or route 4::/64 for the metric type, so that the destination path to the destination node cannot be determined.

It should be understood that when calculating the path based on the link packet loss rate metric type, it is necessary to consider the sum of the packet loss rate weights of multiple candidate paths, and finally calculate the first packet loss rate weight (loss) of the target path. and is the path with the smallest sum of packet loss rate weights among multiple candidate paths.

As an optional embodiment, the first packet loss rate weight is greater than 0, and the first packet loss rate weight increases as the link packet loss rate increases.

It should be understood that the foregoing first packet loss rate weight may refer to a packet loss rate weight corresponding to the link packet loss rate of at least one link in the network 500 .

In order to avoid the loop problem, the packet loss rate weight corresponding to the link packet loss rate of 0 can be set to 1. FIG. 6 is a schematic topology diagram of another multi-node network 600 provided by an embodiment of the present application. Compared with the network 500, in the network 600, when the link has no packet loss rate, that is, when the link packet loss rate is 0, its corresponding packet loss rate weight is 1.

When the SPF algorithm is used as the calculation type and the link packet loss rate is used to calculate the path, due to the difference between the packet loss rate weights of the path node 0->node 1->node 3->node 4->node 9 The sum is 4, the sum of the packet loss rate weights of the path node 0->node 1->node 2->node 4->node 9 is 4, and node 0->node 1->node 4->node 9 The sum of the packet loss rate weights of this path is 3, which is the path with the smallest sum of packet loss rate weights among the three paths, so it can be determined that the route to 4::/64 is node 0->node 1- > Node 4 -> Node 9, so that there will be no loop problem.

As can be seen from the above description, when the link packet loss rate on the current interface is 0.000003%, the corresponding packet loss rate weight is 1. If the link packet loss rate is 0, the corresponding packet loss rate weight is set to 1. Then the link packet loss rate of 0.000003% and 0 correspond to a packet loss rate weight of 1, which may cause the node to be unable to distinguish between the link packet loss rate of 0.000003% and the case of no packet loss rate.

As an optional embodiment, the link packet loss rate of 0 corresponds to the first packet loss rate weight value of 1, the link packet loss rate of 0.000003% corresponds to the first packet loss rate weight value of 2, and 0.000003% is The basic measurement unit of the packet loss rate of the link.

In the embodiment of this application, it may be considered to set the weight of the packet loss rate corresponding to the link packet loss rate of 0 to 1, and increase the weight of the packet loss rate corresponding to the link packet loss rate of 0.000003%, that is, set it to 2 , the weight of the packet loss rate corresponding to the link packet loss rate of 0.000003% continues to increase backwards, that is, it is set to 3, and the weight of the packet loss rate corresponding to the subsequent link packet loss rate is analogously increased continuously.

In the embodiment of the present application, by setting the weight of the packet loss rate corresponding to the link packet loss rate of 0 to 1, it is beneficial to avoid the loop problem. Add 1 to the weight of the original packet loss rate by adding 1 to the packet loss rate weight corresponding to the link packet loss rate of 0.000003% and the link packet loss rate greater than 0.000003%, so that different link packet loss rates can be distinguished.

FIG. 7 is a schematic topology diagram of yet another multi-node network 700 provided by an embodiment of the present application. Compared with the network 600, there are links in the network 700 whose link packet loss rate is not 0.

Exemplarily, in the network 700, the five links of node 0->node 1, node 1->node 2, node 1->node 3, node 2->node 4 and node 4->node 9 The packet loss rate is 0, and the corresponding packet loss rate weight is 1; the link packet loss rate of the two links node 1->node 4 and node 3->node 4 is 0.000006%, and the corresponding The weight of the packet loss rate is 3.

When the SPF algorithm is used as the calculation type and the link packet loss rate is used to calculate the path, due to the difference between the packet loss rate weights of the path node 0->node 1->node 3->node 4->node 9 The sum is 6, the sum of the packet loss rate weights of the path node 0->node 1->node 4->node 9 is 5, and node 0->node 1->node 2->node 4->node 9 The sum of the packet loss rate weights of this path is 4, which is the path with the smallest sum of packet loss rate weights among the three paths, so it can be determined that the route to 4::/64 is node 0->node 1- > Node 4 -> Node 9.

As an optional embodiment, the third node sends a second packet to other nodes in the network, where the second packet includes a second packet loss rate weight of at least one link.

As an optional embodiment, the method 300 further includes: the first node receives a second packet from other nodes in the network, where the second packet includes a second packet loss rate weight value of at least one link; the first The node determines the first packet loss rate weight based on the second packet.

In the embodiment of the present application, since it is necessary to obtain the packet loss rate weight value when using the Flex-Algo based on the link packet loss rate to calculate the path, the third node in the network 700 can send the second packet loss rate to the first node. The second message of the weight, through which the first node can receive the second packet loss rate weight published by other nodes.

Two methods for determining the weight of the first packet loss rate are introduced below:

1. The sending end (third node) adds 1 to the original packet loss rate weight to obtain the second packet loss rate weight, and publishes the second packet loss rate weight, and the receiving end (first node) The second packet loss rate weight is determined as the first packet loss rate weight.

As an optional embodiment, before the third node sends the second message to other nodes in the network, the third node determines the original packet loss rate weight corresponding to the link packet loss rate plus 1 as the value The second packet loss rate weight. The first node determining the first packet loss rate weight based on the second packet includes: the first node determining the second packet loss rate weight as the first packet loss rate weight.

In the embodiment of the present application, the third node is the sending end that sends the packet loss rate weight, and the first node is the receiving end that receives the packet loss rate weight. Before the third node sends the second packet loss rate weight to other nodes through the second message, it needs to determine the second packet loss rate weight. The third node may add 1 to the original packet loss rate weight corresponding to the link packet loss rate to obtain a second packet loss rate weight, and then send the second packet loss rate weight through the second message. Correspondingly, the first node receives the second packet, obtains the second packet loss rate weight in the second packet, and determines the second packet loss rate weight as the first packet loss rate weight.

For example, if the third node is node 3 in the network 700, and the first node is node 0 in the network 700, node 3 can obtain the link packet loss of the link node 3 -> node 1 by subscribing to the interface information The link packet loss rate of this link is 0. According to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, the packet loss rate of the link is 0 and the packet loss rate weight is 0. That is, the original packet loss rate weight is 0, and the third node can determine the value obtained by adding 1 to the original packet loss rate weight as the second packet loss rate weight, that is, the second packet loss rate weight of this link is 1. Node 3 may publish the second packet loss rate weight of the link node 3->node 1 through the second message.

Correspondingly, since the sending end (i.e. the third node) has determined the value of the original packet loss rate weight plus 1 as the second packet loss rate weight value, the receiving end (i.e. the first node) receives the second packet loss rate weight In this paper, the second packet loss rate weight can be determined as the first packet loss rate weight, that is, the first packet loss rate weight of the link is 1, and the first packet loss rate weight is used for the first node Identify at least one target path.

For example, if the third node is node 3 in the network 700, and the first node is node 0 in the network 700, node 3 can obtain the link packet loss of the link node 3 -> node 4 by subscribing to the interface information The link packet loss rate of this link is 0.000006%. According to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, the link packet loss rate of 0.000006% corresponds to the packet loss rate weight of 2, that is, the original packet loss rate weight is 2, and the third node can determine the value obtained by adding 1 to the original packet loss rate weight as the second packet loss rate weight, that is, the second packet loss rate weight of the link If the value is 3, the node 3 may publish the second packet loss rate weight of the link node 3->node 4 through the second message.

Correspondingly, since the sending end (i.e. the third node) has determined the value of the original packet loss rate weight plus 1 as the second packet loss rate weight value, the receiving end (i.e. the first node) receives the second packet loss rate weight In this paper, the second packet loss rate weight can be determined as the first packet loss rate weight, that is, the first packet loss rate weight of the link is 3, and the first packet loss rate weight is used for the first node Identify at least one target path.

2. The sending end (third node) does not process the original packet loss rate weight, but directly determines the original packet loss rate weight as the second packet loss rate weight, and publishes the second packet loss rate weight, The receiving end (first node) determines the value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.

As an optional embodiment, before the third node sends the second message to other nodes in the network, the third node determines the original packet loss rate weight corresponding to the link packet loss rate as the second packet loss rate weight. The first node determining the first packet loss rate weight based on the second packet includes: determining, by the first node, a value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.

In this embodiment of the application, the third node may determine the original packet loss rate weight corresponding to the original link packet loss rate as the second packet loss rate weight, and then use the second packet loss rate weight The value is sent out. Correspondingly, the first node receives the second message, and obtains the second packet loss rate weight in the second message, and determines the value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.

For example, if the third node is node 3 in the network 700, and the first node is node 0 in the network 700, node 3 can obtain the link packet loss of the link node 3 -> node 1 by subscribing to the interface information The link packet loss rate of this link is 0. According to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, the packet loss rate of the link is 0 and the packet loss rate weight is 0. That is, the original packet loss rate weight is 0, and the third node can determine the original packet loss rate weight as the second packet loss rate weight, that is, the second packet loss rate weight of this link is 0, and node 3 can The second packet loss rate weight of the link node 3->node 1 is published externally through the second message.

Correspondingly, since the sending end (that is, the third node) still publishes the packet loss rate weight according to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, that is, the second packet loss rate in the second message The rate weight is 0, so after receiving the second message, the receiving end (i.e., the first node) can determine the value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight, that is, the The first packet loss rate weight of each link is 1, and the first packet loss rate weight is used by the first node to determine at least one target path.

For example, if the third node is node 3 in the network 700, and the first node is node 0 in the network 700, node 3 can obtain the link packet loss of the link node 3 -> node 4 by subscribing to the interface information The link packet loss rate of this link is 0.000006%. According to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, the link packet loss rate of 0.000006% corresponds to the packet loss rate weight of 2, that is, the original packet loss rate weight is 2, and the third node can determine the original packet loss rate weight as the second packet loss rate weight, that is, the second packet loss rate weight of this link is 2, and the node 3. The second packet loss rate weight value of the link node 3->node 4 may be released externally through the second message.

Correspondingly, since the sending end (that is, the third node) still publishes the packet loss rate weight according to the corresponding relationship between the link packet loss rate and the packet loss rate weight on the current interface, that is, the second packet loss rate in the second message The rate weight is 2, so after receiving the second message, the receiving end (that is, the first node) can determine the value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight, that is, the The first packet loss rate weight of each link is 3, and the first packet loss rate weight is used by the first node to determine at least one target path.

As an optional embodiment, in the case of using the first method for determining the weight of the first packet loss rate, the second weight of the packet loss rate is greater than 0, and the second weight of the packet loss rate increases with the The packet loss rate of the link increases.

As an optional embodiment, in the case of using the first method for determining the weight of the first packet loss rate, the link packet loss rate of 0 corresponds to the second packet loss rate weight of 1, and the link The link packet loss rate of 0.000003% corresponds to the second packet loss rate weight value of 2, and 0.000003% is the basic measurement unit of the link packet loss rate.

As an optional embodiment, the second packet loss rate weight is located in the first sub-TLV field of the second packet.

Exemplarily, the second message may be an ISIS message, and the first sub-TLV may be the No. 16 sub-TLV of the ISIS message. Since the No. 16 sub-TLV is a sub-TLV describing link attributes, the lost The packet rate weight is packaged as a sub-TLV (sub-sub-TLV) of the 16th sub-TLV for publishing.

It should be understood that the ISIS message may also include other sub-TLV fields, and the No. 16 sub-TLV belongs to a parallel relationship with other sub-TLVs, and the third node publishes the packet loss rate weight as a sub-TLV of the No. 16 sub-TLV to facilitate the No. 16 sub-TLV A node parses the field to obtain link attribute information.

FIG. 8 is a schematic diagram of a sub-TLV 800 for notifying packet loss rate weights provided by an embodiment of the present application. As shown in FIG. 8, the sub-TLV 800 includes: a type (type) field, a length (length) field, and a packet loss rate weight field. Wherein, 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 packet loss rate weight field is used to describe the packet loss rate weight of the link.

Exemplarily, the above-mentioned sub-TLV 800 may be used to advertise the packet loss rate weight to the outside world through a link state packet (link state packet, LSP).

Exemplarily, the sub-TLV 800 may be the above-mentioned No. 16 sub-TLV. The following is the description of RFC 8919 in draft-ietf-lsr-flex-algo-14 for sub-TLV 16:

A new sub-TLV for TLVs 22, 23, 25, 141, 222, and 223 is defined that supports specification of the applications and application-specific attribute values.

Type: 16

Length: Variable (1 octet)

Value:

Application Identifier Bit Mask(as defined in Section 4.1)

Link attribute sub-sub TLVs—format matches the existing

Formats defined in [RFC5305], [RFC7308], and [RFC8570]

The TE attribute of the routing interface carries link packet loss rate information. When the link packet loss rate meets the release conditions, nodes in the network can publish the packet loss rate weight corresponding to the link packet loss rate. The release conditions can include the following two Two types: first, the enable switch configured on the interface is turned on to publish the packet loss rate weight to the outside world; second, when the interface detects the link packet loss rate on the link, it can publish the packet loss rate weight to the outside world.

It should be understood that the link packet loss rate published by nodes in the network has directionality. For example, node 1 in the network 700 publishes the packet loss rate of the link node 1->node 2, and node 2 publishes the packet loss rate of node 2-> The packet loss rate of the link of node 1.

As an optional embodiment, the information of the target flexible algorithm further includes an identification of a calculation type; based on the target flexible algorithm, the first node determines at least one target path to the second node among the plurality of nodes, including: the first The node determines at least one target path to the second node from multiple candidate paths based on at least one of the target flexible algorithm, the link packet loss rate, or the calculation type.

In this embodiment of the application, after the first node obtains the packet loss rate weight corresponding to the link packet loss rate and the information of the flexible algorithm, it may base on the packet loss rate weight corresponding to the link packet loss rate, the target flexible algorithm or At least one of the calculation types determines at least one target path.

It should be understood that the sequence numbers of the above processes do not mean the order of execution, and the execution order of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

The method for determining a route according to the embodiment of the present application is described in detail above with reference to FIGS. 1 to 8 . The apparatus for determining a route according to the embodiment of the present application will be described in detail below in conjunction with FIGS. 9 to 11 .

FIG. 9 shows a schematic block diagram of an apparatus 900 for determining a path provided by an embodiment of the present application. The apparatus 900 includes: a receiving module 910 and a determining module 920 .

In an optional example, those skilled in the art may understand that the apparatus 900 may specifically be the first node in the above embodiment, or the function of the first node in the above embodiment may be integrated in the apparatus 900 . The above functions can be implemented by hardware, or can be implemented by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions. The apparatus 900 may be configured to execute various processes and/or steps corresponding to the first node in the foregoing method embodiments.

Exemplarily, if a path from node 0 to node 9 (destination node) in the network 200 needs to be determined, the first node may be node 0 in the network 200 .

Exemplarily, if a path from node 0 to node 9 (destination node) in the network 500 needs to be determined, the first node may be node 0 in the network 500 .

Exemplarily, if a path from node 1 to node 9 (destination node) in the network 600 needs to be determined, the first node may be node 1 in the network 600 .

Exemplarily, if a path from node 2 to node 9 (destination node) in the network 700 needs to be determined, the first node may be node 2 in the network 700 .

Wherein, the receiving module 910 is configured to: receive the information of the target flexible algorithm, and the information of the target flexible algorithm includes an identifier for indicating the packet loss rate of the link; the determining module 920 is configured to: based on the target flexible algorithm, determine At least one target path of the second node, where the target path is the path with the smallest sum of packet loss rates of the link among multiple candidate paths.

Exemplarily, the receiving module 910 may be a communication interface, such as a transceiver interface.

It should be understood that the receiving module 910 may perform S301 in the above method 300, and the determining module 920 may perform S302 in the above method 300.

Optionally, the sum of the first packet loss rate weights of at least one link of the target path is the smallest among multiple candidate paths, and the first packet loss rate weight is determined according to the link packet loss rate.

Optionally, the first packet loss rate weight is greater than 0, and the first packet loss rate weight increases as the link packet loss rate increases.

Optionally, the link packet loss rate of 0 corresponds to the weight of the first packet loss rate of 1, the link packet loss rate of 0.000003% corresponds to the weight of the first packet loss rate of 2, and 0.000003% is the weight of the link packet loss rate Base unit of measure.

Optionally, the receiving module 910 is configured to: receive a first packet from other nodes in the network, where the first packet includes information about the target flexible algorithm, and the information about the target flexible algorithm includes the FAD of the target flexible algorithm.

Optionally, the receiving module 910 is configured to: receive a second packet from other nodes in the network, where the second packet includes a second packet loss rate weight of at least one link; the determining module 920 is configured to: based on the For the second packet, determine the weight of the first packet loss rate.

Optionally, the second packet loss rate weight is located in the first subtype length value TLV field of the second packet.

Optionally, the determining module 920 is configured to: determine a value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.

Optionally, the determining module 920 is configured to: determine the second packet loss rate weight as the first packet loss rate weight.

Optionally, the information of the target flexible algorithm also includes an identification of a calculation type; the determining module 920 is configured to: based on at least one of the target flexible algorithm, the link packet loss rate, or the calculation type, from multiple candidate paths Determine at least one target path to the second node.

FIG. 10 shows a schematic block diagram of another apparatus 1000 for determining a path provided by an embodiment of the present application. The apparatus 1000 includes: a determining module 1010 and a sending module 1020 .

In an optional example, those skilled in the art may understand that the apparatus 1000 may specifically be the third node in the above embodiment, or the function of the third node in the above embodiment may be integrated in the apparatus 1000 .

The above functions can be implemented by hardware, or can be implemented 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 various processes and/or steps corresponding to the third node in the foregoing method embodiments.

Exemplarily, if it is necessary to determine a path from node 0 to node 9 (destination node) in the network 200, the first node may be node 0 in the network 200, and the third node may be the node 0 in the network 200 except one of the other nodes.

Exemplarily, if it is necessary to determine a path from node 0 to node 9 (destination node) in the network 500, the first node may be node 0 in the network 500, and the third node may be the node 0 in the network 500 except one of the other nodes.

Exemplarily, if it is necessary to determine a path from node 1 to node 9 (destination node) in the network 600, the first node may be node 1 in the network 600, and the third node may be the node 1 in the network 600 except one of the other nodes.

Exemplarily, if it is necessary to determine a path from node 2 to node 9 (destination node) in the network 700, the first node may be node 2 in the network 700, and the third node may be the node 2 in the network 700 except one of the other nodes.

Wherein, the determination module 1010 is used to: determine the information of the target flexible algorithm, the information of the target flexible algorithm includes an identifier for indicating the packet loss rate of the link, and the information of the target flexible algorithm is used by other nodes in the network to flexibly based on the target algorithm, to determine at least one target path; the sending module 1020 is configured to: send the information of the target flexible algorithm to other nodes in the network.

Exemplarily, the sending module 1020 may be a communication interface, such as a transceiver interface.

It should be understood that the sending module 1020 may execute S401 in the foregoing method 400.

Optionally, the sending module 1020 is configured to: send a first packet to other nodes in the network, where the first packet includes information about the target flexible algorithm.

Optionally, the sending module 1020 is configured to: send a second message to other nodes in the network, where the second message includes a second packet loss rate weight of at least one link, where the second packet loss rate weight is located at The first subtype length value TLV field of the second packet.

Optionally, the determining module 1010 is configured to: determine a value obtained by adding 1 to the original packet loss rate weight corresponding to the link packet loss rate as the second packet loss rate weight.

Optionally, the second packet loss rate weight is greater than 0, and the second packet loss rate weight increases as the link packet loss rate increases.

Optionally, a link packet loss rate of 0 corresponds to a second packet loss rate weight of 1, a link packet loss rate of 0.000003% corresponds to a second packet loss rate weight of 2, and 0.000003% is the link packet loss rate Base unit of measure.

It should be understood that the device 900 and the device 1000 here are embodied in the form of functional modules. The term "module" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor, or a group processor, etc.) and memory, incorporated logic, and/or other suitable components to support the described functionality.

In the embodiment of the present application, the device 900 and the device 1000 may also be a chip or a chip system, for example: a system on chip (system on chip, SoC). Correspondingly, the receiving module 910 may be a transceiver circuit of the chip, which is not limited here.

The foregoing apparatus 900 and/or apparatus 1000 may be implemented by hardware, or may be implemented by executing corresponding software on hardware, which is not limited in this embodiment of the present application. The hardware structure of the embodiment of the present application is introduced below with reference to FIG. 11 .

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 processor 1110 , a transceiver 1120 and a memory 1130 . Wherein, the processor 1110, the transceiver 1120 and the memory 1130 communicate with each other through an internal connection path, the memory 1130 is used to store instructions, and the processor 1110 is used to execute the instructions stored in the memory 1130 to control the transceiver 1120 to send signals and /or to receive a signal.

It should be understood that the device 1100 may specifically be the first node or the third node in the above embodiment, or the functions of the first node or the third node in the above embodiment may be integrated in the device 1100, and the device 1100 may be used to perform the above Each step and/or process corresponding to the first node or the third node in the method embodiment.

Optionally, the memory 1130 may include read-only memory and random-access memory, and provides instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor 1110 may be configured to execute 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 above method embodiments.

It should be understood that in the embodiment of the present application, the processor 1110 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. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.

Fig. 12 is a schematic block diagram of a system 1200 for determining a route provided by an embodiment of the present application. As shown in FIG. 12 , the system 1200 includes a first node 1210 and a third node 1220 .

Wherein, the third node 1220 is used to: send the first message to other nodes in the network, the first message includes the information of the flexible algorithm, the information of the target flexible algorithm includes FAD, which is used to indicate the link packet loss rate The identifier is located in the Metric Type field of the FAD.

The first node 1210 is configured to: receive the first message from the third node 1220, and determine the information of the target flexible algorithm based on the first message; and, based on the flexible algorithm, determine at least one target path to the destination node .

It should be understood that the first node 1210 and the third node 1220 may also execute 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.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

Those skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or May be integrated into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.

If the functions described above are realized in the form of software function units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) 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 (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disc and other media that can store program codes. .

The above is only a specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the application. Should be covered within the protection scope of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims

A method of determining a path, characterized in that it is applied to a network comprising a plurality of nodes, comprising:

The first node among the plurality of nodes receives information of a target flexible algorithm, where the information of the target flexible algorithm includes an identifier for indicating a link packet loss rate;

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 is that the sum of the packet loss rates of the links among the plurality of candidate paths is the smallest path of.
The method according to claim 1, wherein the sum of the first packet loss rate weights of at least one link of the target path is the smallest among the plurality of candidate paths, and the first packet loss rate The weight is determined according to the link packet loss rate.
The method according to claim 2, wherein the first packet loss rate weight is greater than 0, and the first packet loss rate weight increases as the link packet loss rate increases.
The method according to claim 2 or 3, wherein the link packet loss rate of 0 corresponds to the first packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the The weight of the first packet loss rate is 2, and 0.000003% is the basic measurement unit of the link packet loss rate.
The method according to any one of claims 1-4, wherein the first node among the plurality of nodes receives the information of the target flexible algorithm, comprising:

The first node receives a first packet from other nodes in the network, the first packet includes information of the target flexible algorithm, and the information of the target flexible algorithm includes flexibility of the target flexible algorithm Algorithms define FAD.
The method according to any one of claims 2-4, wherein the method further comprises:

The first node receives a second message from other nodes in the network, the second message includes a second packet loss rate weight of at least one link;

The first node determines the first packet loss rate weight based on the second packet.
The method according to claim 6, wherein the second packet loss rate weight is located in the first subtype length value TLV field of the second packet.
The method according to claim 6 or 7, wherein the first node determines the first packet loss rate weight based on the second message, comprising:

The first node determines a value obtained by adding 1 to the second packet loss rate weight as the first packet loss rate weight.
The method according to claim 6 or 7, wherein the first node determines the first packet loss rate weight based on the second message, comprising:

The first node determines the second packet loss rate weight as the first packet loss rate weight.
The method according to any one of claims 1-9, wherein the information of the target flexible algorithm further includes an identification of a calculation type;

The first node determines at least one target path to the second node among the plurality of nodes based on the target flexible algorithm, including:

The first node determines, from the multiple candidate paths, the at least one path to the second node based on at least one of the target flexible algorithm, the link packet loss rate, or the calculation type. Target path.
A method of determining a path, characterized in that it is applied to a network comprising a plurality of nodes, comprising:

A third node among the plurality of nodes sends information about a target flexible algorithm to other nodes in the network, where the information about the target flexible algorithm includes an identifier for indicating a packet loss rate of a link, and the information about the target flexible algorithm Information is used by other nodes in the network to determine at least one destination path based on the destination flexibility algorithm.
The method according to claim 11, wherein the third node among the plurality of nodes sends the information of the target flexible algorithm to other nodes in the network, comprising:

The third node sends a first packet to other nodes in the network, where the first packet includes information of the target flexible algorithm.
The method according to claim 11 or 12, characterized in that the method further comprises:

The third node sends a second message to other nodes in the network, the second message includes a second packet loss rate weight of at least one link, and the second packet loss rate weight is located at the The first subtype length value TLV field of the second packet.
The method according to claim 13, wherein before the third node sends the second message to other nodes in the network, the method further comprises:

The third node determines a value obtained by adding 1 to the original packet loss rate weight corresponding to the link packet loss rate as the second packet loss rate weight.
The method according to claim 14, wherein the second packet loss rate weight is greater than 0, and the second packet loss rate weight increases as the link packet loss rate increases.
The method according to claim 14 or 15, wherein the link packet loss rate of 0 corresponds to the second packet loss rate weight value of 1, and the link packet loss rate of 0.000003% corresponds to the The weight of the second packet loss rate is 2, and 0.000003% is the basic measurement unit of the link packet loss rate.
A device for determining a path, characterized in that it includes a processor, a communication interface and a memory, the memory is used to store program codes, and the processor is used to call the program codes in the memory so that the device executes the The method described in any one of claims 1-10.
A device for determining a path, characterized in that it includes a processor, a communication interface and a memory, the memory is used to store program codes, and the processor is used to call the program codes in the memory so that the device executes the The method of any one of claims 11-16.
A system for determining a path, characterized by comprising a first node and a third node, the first node is used to execute the method according to any one of claims 1-10, and the third node is used to Performing the method as described in any one of claims 11-16.
A computer-readable storage medium, characterized by being used for storing a computer program, the computer program comprising instructions for implementing the method according to any one of claims 1-16.