WO2020010999A1 - Method and apparatus for obtaining information of forwarding path of data packet in segment routing - Google Patents

Abstract

The present application provides a method and apparatus for obtaining information of a forwarding path of a data packet in segment routing. In the method and apparatus, when a first path instructed by multiple path identifications in initial information is the unique shortest path between an initial node of the first path and an end node of the first path, a node-SID of the end node of the first path can be used for replacing the multiple path identifications to instruct the first path, so that the number of the path identifications can be reduced, and thus transmission efficiency of the data packet can be improved, and the performance of a communication network is finally improved.

Description

Method and device for obtaining information of forwarding path of data packet in segment routing

This application requires the priority of a Chinese patent application submitted on July 9, 2018, with the State Intellectual Property Office of China, application number 201810744644.X, and application name "Method and Device for Obtaining Information on the Forwarding Path of Data Packets in Segment Routing" Rights, the entire contents of which are incorporated herein by reference.

Technical field

This application relates to the field of communications, and more specifically, to a method and apparatus for obtaining information about a forwarding path of a data packet in segment routing (SR).

Background technique

SR is a source routing mechanism. If the SR tunnel is long, such as segment routing (Internet protocol versioning (SRv6)) deployed on the Internet Protocol data plane in the sixth version, then the length of the identification (ID) list used to indicate the path the data packet passes through It will be long. A too long ID list will reduce the transmission efficiency of the data packets, and ultimately reduce the performance of the communication network.

Summary of the invention

The application provides a method and a device for obtaining information of a forwarding path of a data packet in segment routing, which is beneficial to reducing the length of an identification list used to indicate a path that a data packet passes through, thereby improving transmission efficiency of a data packet, and ultimately improving a communication network. Performance.

In a first aspect, the present application provides a method for obtaining information about a forwarding path of a data packet in a segment route. The method includes: obtaining initial information of a forwarding path of a data packet, where the initial information includes multiple path identifiers; The initial information generates target information of a forwarding path of the data packet, the target path information includes one or more node segment identifiers, and at least one node segment identifier in the target information corresponds to a plurality of the initial information. Path identifier, the first path indicated by the multiple path identifiers in the initial information corresponding to the node segment identifier in the target information is the start node of the first path in the segment route to the first The only shortest path between the end nodes of a path, and each node segment identifier in the target information corresponding to multiple path identifiers in the initial information is indicated by all path identifiers corresponding to each node segment identifier Node segment ID of the end node of the path.

In this method, when the first path indicated by the multiple path identifiers in the initial information is the only shortest path between the start node of the first path and the end node of the first path, the first path may be used. The node segment ID (SID) of the end node is used to replace the multiple path identifiers to indicate the first path, so that the number of path identifiers can be reduced, thereby improving the transmission efficiency of data packets, and ultimately improving the communication network. performance.

In addition, reducing the number of path identifiers can also reduce the number of times that the ingress node that forwards the data packet inserts the path identifier, thereby improving the processing performance of the ingress node, and then improving the performance of the communication network.

With reference to the first aspect, in a first possible implementation manner, the generating target information of a forwarding path of the data packet according to the initial information includes: Step 1: obtaining a node list of the forwarding path of the data packet Taking the i-th node in the node list as the starting node and the j-th node in the node list as the ending node, i has a value of 1 and j has a value of the length of the node list Value, go to step two; step two, determine whether the start node and the end node are the same node; if so, end execution, otherwise go to step three; step three, determine the start node and the end Whether the node is an adjacent node in the node list; if so, step 4 is performed, otherwise step 5 is performed; step 4 is to record in the target information the adjacent segment between the starting node and the ending node Indicates that the value of i is updated to be equal to the value of j, and then, the value of j is updated to be equal to the length value of the node list, and then the i-th node in the node list is used as the start Section Point, use the jth node in the node list as the ending node, and perform step 2 again; step five, determine all nodes in the node list from the starting node to the ending node Whether the path indicated in the sequence is the only shortest path between the start node and the end node in the segment route. If yes, go to step 6; otherwise, go to step 7; The node segment identifier of the ending node is recorded in the target information, the value of i is updated to be equal to the value of j, and then, the value of j is updated to be equal to the length value of the node list, and then the node list is updated. The i-th node in the node is used as the starting node, the j-th node in the node list is used as the ending node, and step 2 is performed again; in step 7, the value of j is updated to j-1, and The j-th node in the node list is used as the ending node, and step 2 is performed again.

With reference to the first aspect, in a second possible implementation manner, the generating target information of the forwarding path of the data packet according to the initial information includes: Step 1: obtaining a node list of the forwarding path of the data packet Taking the i-th node in the node list as the starting node and the j-th node in the node list as the ending node, i has a value of 1 and j has a value of the length of the node list Value, go to step two; step two, determine whether the start node and the end node are the same node; if so, end the execution, otherwise go to step three; step three, determine that the node list starts from the Whether the path indicated when all nodes between the start node and the end node are arranged in order is the only shortest path between the start node and the end node in the segment route, and if so, step four is performed. Otherwise, step 5 is performed; step 4 is to record the node segment identifier of the end node in the target information, the value of i is updated to be equal to the value of j, and then, the value of j is updated to be equal to The lengths of the node lists are equal, then the i-th node in the node list is used as the starting node, the j-th node in the node list is used as the ending node, and step 2 is performed again; In step five, the value of j is updated to j-1, the jth node in the node list is used as the ending node, and step two is performed again.

With reference to the first aspect, in a third possible implementation manner, the generating target information of the forwarding path of the data packet according to the initial information includes: Step 1: obtaining a node list of the forwarding path of the data packet Taking the i-th node in the node list as the starting node and the j-th node in the node list as the ending node, setting the temporary ending node to be an empty node, the value of i is 1, and the value of j is If i + 1, go to step two; step two, determine whether the ending node is the last node in the node list; if so, go to step ten; otherwise, go to step three; step three, determine the node list Whether the path indicated by all the nodes from the start node to the end node in order is the only shortest path between the start node and the end node in the segment route, and if so, then Perform step four, otherwise perform step five; step four, update the temporary end node to the end node, update the value of j to j + 1, and use the jth node in the node list as The end node, and perform step two again; step five, determine whether the temporary end node is empty, if not, perform step six, otherwise perform step seven; step six, determine whether the temporary end node is the If it is a neighboring node of the starting node, go to step 8; otherwise, go to step 9; Step 7: record in the target information an adjacent segment indicating the path between the starting node and the ending node Indicates that the value of i is updated to be equal to the value of j, and then the value of j is updated to j + 1, and then the i-th node in the node list is used as the starting node, and the node is The j-th node in the list is used as the end node, and step 2 is performed again; step 8: record the adjacent segment identifier of the path between the start node and the temporary end node in the target information, i of The value is updated to be equal to j-1. After that, the value of j is updated to j. The i-th node in the node list is used as the starting node, and the j-th node in the node list is used as the End node, place the pro The end node is left blank, and step 2 is performed again. In step 9, the node segment identifier of the temporary end node is recorded in the target information, and the value of i is updated to be equal to j-1. After that, the value of j is updated. Is j, the i-th node in the node list is used as the starting node, the j-th node in the node list is used as the ending node, the temporary ending node is left blank, and step 2 is performed again Step 10: determine whether the starting node is the penultimate node in the node list, if not, perform Step 11; otherwise, perform Step 12; Step 11: record in the target information The node segment identifier corresponding to the ending node and the execution is terminated; step twelve, recording in the target information an adjacent segment identifier for indicating a path between the starting node and the ending node, and ending the execution .

With reference to the first aspect, in a fourth possible implementation manner, the generating target information of the forwarding path of the data packet according to the initial information includes: Step 1: obtaining a node list of the forwarding path of the data packet Taking the i-th node in the node list as the starting node and the j-th node in the node list as the ending node, setting the temporary ending node to be an empty node, the value of i is 1, and the value of j is If i + 1, go to step two; step two, determine whether the ending node is the last node in the node list; if so, go to step eight, otherwise go to step three; step three, determine the node list Whether the path indicated by all the nodes from the start node to the end node in order is the only shortest path between the start node and the end node in the segment route, and if so, then Perform step four, otherwise perform step five; step four, update the temporary end node to the end node, update the value of j to j + 1, and use the jth node in the node list as The end node, and perform step two again; step five, determine whether the temporary end node is empty, if not, perform step six, otherwise perform step seven; step six, record the temporary node in the target information The node segment identifier of the ending node. The value of i is updated to be equal to j-1. After that, the value of j is updated to j. The i-th node in the node list is used as the starting node, and the node is The j-th node in the list is used as the ending node, and the temporary ending node is left blank, and step 2 is performed again; step 7 is recorded in the target information for indicating the starting node to the ending node. The identifier of the adjacent segment of the path. The value of i is updated to be equal to the value of j. After that, the value of j is updated to j + 1, and the i-th node in the node list is used as the starting point. The starting node, using the jth node in the node list as the ending node, and performing step two again; step eight, determining whether the starting node is the penultimate node in the node list, if not , Go to step nine, no Step 10 is performed; Step 9 is to record the node segment identifier of the ending node in the target information and the execution is terminated; Step 10 is to record the instruction for instructing the starting node to all the nodes in the target information. The identification of the adjacent segment of the path between the end nodes is described, and the execution ends.

With reference to the first aspect or any one of the first to fourth possible implementation manners, in a fifth possible implementation manner, the initial information is an adjacent segment identifier list, that is, the path identifier in the initial information is an adjacent segment identifier.

With reference to the first aspect or any one of the first to fifth possible implementation manners, in a sixth possible implementation manner, the method is executed by an ingress node of a forwarding path of a data packet.

The method further includes: sending a data packet according to the target information, and the data includes the target information.

With reference to the first aspect or any one of the first to fifth possible implementation manners, in a seventh possible implementation manner, the method further includes: the controller sends target information to an ingress node of a forwarding path of the data packet, In order to facilitate the ingress node to send a data packet including the target information according to the target information.

In a second aspect, an apparatus for obtaining information about a forwarding path of a data packet in a segment route is provided, and the apparatus includes a module for executing the method in the first aspect or any one of the possible implementation manners of the first aspect.

According to a third aspect, a device for obtaining information about a forwarding path of a data packet in a segment route is provided. The device includes a processor, and the processor is configured to execute a program. When the processor executes the program, the first aspect or the first aspect is implemented. Method in any possible implementation.

Optionally, the device may further include a memory. The memory is used to store programs executed by the processor.

Optionally, the apparatus may further include a receiver. The receiver is used to receive information from other equipment or devices.

Optionally, the apparatus may further include a transmitter. Used to send information to other devices or devices.

An example of the device is a network node or a network controller.

According to a fourth aspect, a computer-readable storage medium is provided, where the computer-readable storage medium stores program code for execution by a communication device or a communication device, and the program code includes a method for implementing the first aspect or any one of the first aspect Instructions for possible implementations of methods.

According to a fifth aspect, a chip is provided. The chip includes a processor and a communication interface. The communication interface is used to travel with external devices. The processor is used to implement the first aspect or any possible implementation manner of the first aspect. Methods.

Optionally, the chip may further include a memory, and the memory stores instructions. The processor is configured to execute the instructions stored in the memory. When the instructions are executed, the processor is configured to implement the first aspect or any one of the first aspect. Methods in possible implementations.

Alternatively, the chip may be integrated on a network node or a network controller.

In a sixth aspect, an embodiment of the present application provides a computer program product containing instructions, which when executed on a computer, causes the computer to execute the method described in the first aspect.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic architecture diagram of a communication system to which the methods and devices of the embodiments of the present application can be applied;

2 is an exemplary flowchart of a method for obtaining information about a forwarding path of a data packet according to an embodiment of the present application;

3 is an exemplary flowchart of a method for obtaining information about a forwarding path of a data packet according to another embodiment of the present application;

4 is an exemplary flowchart of a method for obtaining information about a forwarding path of a data packet according to another embodiment of the present application;

5 is an exemplary flowchart of a method for obtaining information about a forwarding path of a data packet according to another embodiment of the present application;

6 is an exemplary flowchart of a method for obtaining information about a forwarding path of a data packet according to another embodiment of the present application;

7 is an exemplary structural diagram of an apparatus for acquiring information about a forwarding path of a data packet according to an embodiment of the present application;

FIG. 8 is an exemplary structural diagram of an apparatus for acquiring information about a forwarding path of a data packet according to another embodiment of the present application.

detailed description

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

A schematic architecture diagram of a communication system to which the methods and apparatuses of the embodiments of the present application can be applied is shown in FIG. 1. It should be understood that FIG. 1 is only an example. The communication system to which the methods and devices of the embodiments of the present application can be applied may include the number of nodes and the connection relationship between the nodes. The connection mode between the nodes may be Wired or wireless.

In the communication system shown in FIG. 1, a multiprotocol label switching (MPLS) data plane can be applied, and a sixth version of an Internet protocol (IP), which is referred to as IPv6, can also be applied.

The nodes included in the communication system to which the methods and apparatuses of the embodiments of the present application can be applied, for example, any one of node A, node B, node C, node D, node N, node O, node P, and node Z may be a router. Switch, or any network device capable of supporting SR.

In the network structure shown in Figure 1, the network controller can calculate the path that the data packet will take. The path information of the path that the data packet passes through can be indicated by the IP address or SID of the nodes on the path.

It should be understood that, in this application, a forwarding path of a data packet may be referred to as a tunnel of the data packet. A collection of data packets can be called a data stream.

In SR, there are three types of SIDs: prefix-SID, node-SID, and adjacency-SID.

Among them, adjacency-SID (adj-SID) can be used to forward a data packet to a corresponding neighboring node through a designated link. Therefore, in the scenario where the SR-TE needs to implement data packet forwarding according to the specified path, the SIDs in the SID list (list) are all adj-SIDs.

For example, in the network structure shown in FIG. 1, taking MPLS as an example, if the forwarding path of the data packet is A-> B-> C-> O-> P-> Z, and the connection between node A and node B is adj-SID is 9101, adj-SID between node B and node C is 9105, adj-SID between node C and node O is 9107, adj-SID between node O and node P is 9103, node P When the adj-SID between the node and the node Z is 9105, the SID list of the data packet may include {9101, 9105, 9107, 9103, 9105} in order.

As the ingress node of the forwarding path of the data packet, node A can obtain the above SID list and then send a data packet to node B according to 9101 in the SID list. The data packet contains the SID list {9105,9107 , 9103,9105}; After receiving the data packet from node A, node B can send a data packet to node C according to 9105 in the SID list {9105,9107,9103,9105}, which includes the SID list { 9107,9103,9105}; after receiving the data packet sent by node B, node C can send a data packet to node O according to the SID list {9107,9103,9105}, which includes the SID list {9103,9105}; After receiving the data packet sent by node C, node O can send a data packet to node P according to the SID list {9103,9105}, which includes the SID list {9105}; after node P receives the data packet from node O, A data packet can be sent to node Z according to the SID list {9105}.

The above only uses the information of the forwarding path of the data packet as the adjacent SID list, that is, the forwarding path identifier (or label) of the data packet is used as an example of the adjacent SID to introduce the process of forwarding the data packet according to the path information. When the information of the forwarding path of the data packet includes other path identifiers, the data packet forwarding process is similar.

It can be seen from the above process that if the network size is large and the SR-tunnel is long, then the information of the forwarding path of the data packet (such as the SID list) will be very long. Too long path information will reduce the transmission efficiency between nodes and affect the transmission performance of the network.

In order to reduce the length of the information of the forwarding path of the data packet, in order to improve the transmission efficiency between nodes, and thereby improve the transmission performance of the network, the present application proposes a new method for obtaining the information of the forwarding path of the data packet in the SR.

FIG. 2 is a schematic flowchart of a method for acquiring information about a forwarding path of a data packet in an SR according to an embodiment of the present application. It should be understood that steps or operations of the communication method are shown in FIG. 2, but these steps or operations are merely examples, and the embodiments of the present application may also perform other operations or a modification of each operation in FIG. 2.

S201. Acquire initial information of a forwarding path of a data packet, where the initial information includes multiple path identifiers.

For example, according to the restriction conditions, it is calculated which nodes the path that the data packet passes through, and the identifiers of these nodes (such as the IP address of the node, the SID of the node, or other identifiers) are used as the path identifier to form the initial information of the forwarding path of the data packet. In other words, the initial information composed of the identifiers of these nodes may indicate the forwarding path of the data packet.

For another example, according to the constraint conditions, it is calculated which nodes the path that the data packet passes through, and the adj-SID between these nodes is used as the path identifier to form the initial information of the forwarding path of the data packet. In other words, the initial information composed by the adj-SID between these nodes can indicate the forwarding path of the data packet.

For example, in SR-TE, it is possible to calculate which nodes are included in the path that a data packet passes according to constraints such as bandwidth requirements or delay requirements.

For example, in SR-MPLS, the initial information may be an adj-ID list. Taking the path described in FIG. 1 as an example, the initial information may be {9101, 9105, 9107, 9103, 9105}.

In SR-MPLS, the initial information may also be a list of IP addresses. Taking the path described in FIG. 1 as an example, the initial information may be {IP address A, IP address B, IP address C, IP address O, IP address P, IP address Z).

As another example, in SRv6, the initial information may be a SRv6SID list, and the SID in the list is an IPv6 address declared as a SID. Taking the path described in FIG. 1 as an example, the initial information may be {A :: 12, B :: 23, C :: 34, O :: 45, P :: 56, Z :: 67}.

S202. Generate target information of the forwarding path of the data packet according to the initial information. The target information includes one or more node segment identifiers. At least one node segment identifier in the target information corresponds to multiple path identifiers in the initial information. The initial information The first path indicated by the multiple path identifiers corresponding to the node segment identifier in the target information is the only shortest path between the start node of the first path in the segment route and the end node of the first path. Each node segment identifier of a plurality of path identifiers in the initial information is a node segment identifier of an end node of the first path indicated by all path identifiers corresponding to each node segment identifier.

The path indicated by the target information is the same as the path indicated by the initial information. In MPLS, a form of node segment identification is a label; in SRv6, a form of realization of a node segment identification is an IPv6 address declared as a SID.

In this method, when the first path indicated by the multiple path identifiers in the initial information is the only shortest path between the start node of the first path and the end node of the first path, the first path may be used. The node-SID of the end node is used instead of the multiple path identifiers to indicate the first path; otherwise, the adj-SID between the start node and the end node of the first path may be used to indicate the first path. In this way, the node-SID of the end node of the first path and / or the adj-SID between the start node and the end node of the first path constitute the target information.

In this way, the number of path identifiers can be reduced, thereby improving the transmission efficiency of data packets, and ultimately improving the performance of the communication network.

For example, when the initial SID list of the data packet includes {9101,9105,9107,9103,9105}, if the first two SIDs, that is, the paths “A-> B-> C” jointly indicated by “9101” and “9105” are The only shortest path between node A and node C. Since "9101" and "9105" as a whole are the first SID in the initial SID list of the packet, the first SID in the destination SID list of the packet can be SID of node C.

For another example, if the last two SIDs in the initial SID list of the data packet, that is, the path "O-> P-> Z" indicated by "9103" and "9105" are the only shortest path between node O and node Z Since "9103" and "9105" as a whole are the fourth SID in the initial SID list of the data packet, the fourth SID in the target SID list of the data packet may be the SID of node Z.

The target information of the forwarding path of the data packet can be determined through multiple implementations according to the initial information of the forwarding path of the data packet.

An implementation manner of determining target information of a forwarding path of a data packet according to initial information of the forwarding path of a data packet is shown in FIG. 3.

S301: Obtain a node list corresponding to a forwarding path of a data packet, use a first node in the node list as a starting node, use a last node in the node list as an ending node, and obtain an empty list as a temporary path information list.

S302. Determine whether the start node and the end node are the same node. If yes, perform S308; otherwise, perform S303.

S303: Determine whether the start node and the end node are adjacent nodes in the node list. If yes, perform S304; otherwise, perform S305.

S304. Record the identifier of the adjacent segment between the start node and the end node in the target information, use the end node as the new start node, use the last node in the node list as the new end node, and execute S302 again.

S305: Determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the only shortest path between the start node and the end node in the SR. If yes, perform S306, otherwise Execute S307.

S306. The node segment identifier corresponding to the ending node is added to the temporary path information list, the ending node is used as a new starting node, the last node in the node list is used as a new ending node, and S302 is performed again.

S307. Use the first node before the ending node in the node list as the new ending node, and re-execute S302.

S308. Use the temporary path information list as the target information.

In the following, the initial information is an adj-SID list used to indicate the path that a data packet passes through. The adj-SID list includes multiple adj-SIDs as an example, and a pseudo-code implementation for generating target information based on the initial information in this application is introduced. the way. Executing this pseudo code can implement the method shown in FIG. 3.

In this pseudo code, strict [] represents the node list corresponding to the path identified by the initial information, loose [] represents the temporary path information list, node represents the starting node, last represents the ending node, and SPT (node, last) represents the starting point in the SR. The shortest path from the start node to the end node, adj_sid (node, last) means get the adj-SID from node to last in the adj-SID list, and loose.add (adj_sid (node, last)) means the adj-SID list The adj-SID from node to last is added to loose, and node_sid (node) means to get the node-SID of node.

Taking the SR shown in FIG. 1 as an example, the initial information of the data packet forwarding path includes {9101, 9105, 9107, 9103, 9105}, and the target information that can be obtained according to the method shown in FIG. 3 or the above pseudo code can include { SID of node C, 9107, SID of node Z}.

Another implementation manner of determining target information of the forwarding path of the data packet according to the initial information of the forwarding path of the data packet is shown in FIG. 4.

S401: Obtain a node list corresponding to a forwarding path of a data packet, use a first node in the node list as a starting node, use a last node in the node list as an ending node, and obtain an empty list as a temporary path information list.

S402. Determine whether the start node and the end node are the same node. If yes, perform S406; otherwise, perform S403.

S403. Determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the only shortest path between the start node and the end node in the SR. If yes, execute S404, otherwise Execute S405.

S404. Add the node segment identifier corresponding to the ending node to the temporary path information list, use the ending node as a new starting node, use the last node in the node list as a new ending node, and execute S402 again.

S405. Use the first node before the ending node in the node list as the new ending node, and re-execute S402.

S406. Use the temporary path information list as the target information.

In the following, the initial information is an adj-SID list used to indicate the path that a data packet passes through. The adj-SID list includes multiple adj-SIDs as an example, and a pseudo-code implementation for generating target information based on the initial information in this application is introduced. the way. Executing this pseudo code can implement the method shown in FIG. 4.

In this pseudo code, strict [] represents the node list corresponding to the path identified by the initial information, loose [] represents the temporary path information list, node represents the starting node, last represents the ending node, and SPT (node, last) represents the starting point in the SR. The shortest path from the start node to the end node, adj_sid (node, last) means get the adj-SID from node to last in the adj-SID list, and loose.add (adj_sid (node, last)) means the adj-SID list The adj-SID from node to last is added to loose, and node_sid (node) means to get the node-SID of node.

Taking the SR shown in FIG. 1 as an example, the initial information of the data packet forwarding path includes {9101, 9105, 9107, 9103, 9105}. According to the method shown in FIG. 4 or the above pseudo code, the target information that can be obtained can include { SID of node C, SID of node O, SID of node Z}.

It should be understood that using the temporary path information list in the methods shown in FIG. 3 and FIG. 4 is only an example, and the target information may also be obtained without using the temporary path information list.

Another implementation manner of determining target information of the forwarding path of the data packet according to the initial information of the forwarding path of the data packet is shown in FIG. 5.

S501. Obtain a node list corresponding to the path identified by the initial information, use the first node in the node list as the starting node, use the first node in the node list after the starting node as the ending node, and use the empty list as the temporary node. Path information list, with empty nodes as temporary ending nodes.

S502. Determine whether the ending node is the last node in the node list. If so, execute S510, otherwise execute S503.

S503. Determine whether the path indicated by all nodes in the node list from the start node to the end node is the only shortest path between the start node and the end node in the SR. If yes, execute S504, otherwise execute S505.

In step S504, the ending node is used as a temporary ending node, the first node after the ending node in the node list is used as a new ending node, and step S502 is performed.

S505. Determine whether the temporarily ending node is empty. If not, execute S506; otherwise, execute S507.

S506. Determine whether the temporarily ending node is a neighboring node of the starting node. If so, execute S508, otherwise execute S509.

S507. Add an adjacent segment identifier indicating a path between the start node and the end node to the temporary path information list, use the end node as a new start node, and use the first node after the end node in the node list as the first node. The new end node, and execute S502.

S508. Add an adjacent segment identifier indicating a path between the start node and the temporary end node to the temporary path information list, use the temporary end node as a new start node, empty the temporary end node, and execute S502. .

S509. Add the node segment identifier corresponding to the temporary end node to the temporary path information list, use the temporary end node as a new starting node, empty the temporary end node, and execute S502.

S510. Determine whether the starting node is the penultimate node in the node list. If not, execute S511, otherwise execute S512.

S511. Add the node segment identifier corresponding to the ending node to the temporary path information list, and execute S513.

S512: Add an adjacent segment identifier used to indicate a path between the start node and the end node to the temporary path information, and execute S513.

S513. Use the temporary path information list as the target information.

In the following, the initial information is an adj-SID list used to indicate the path that a data packet passes through. The adj-SID list includes multiple adj-SIDs as an example, and a pseudo-code implementation for generating target information based on the initial information in this application is introduced. the way. Executing this pseudo code can implement the method shown in FIG. 5.

In this pseudo code, strict [] represents the node list corresponding to the path identified by the initial information, loose [] represents the temporary path information list, node represents the starting node, TEN represents the temporary ending node, next represents the ending node, and adj_SID (node, next ) Means to get the adj-SID from node to next in the adj-SID list, and loose.add (adj_SID (node, TENT)) means to add the adj-SID from node to TENT in the adj-SID list to loose, node_SID (TENT) means get the node-SID of TENT, and loose.add (node_SID (next)) means add the next node-SID to loose.

Taking the SR shown in FIG. 1 as an example, the initial information of the data packet forwarding path includes {9101, 9105, 9107, 9103, 9105}. According to the method shown in FIG. 5 or the above pseudo code, the target information can include { SID of node C, 9107, SID of node Z}.

Another implementation manner of determining target information of the forwarding path of the data packet according to the initial information of the forwarding path of the data packet is shown in FIG. 6.

S601. Obtain a node list corresponding to the path identified by the initial information, use the first node in the node list as the starting node, use the first node in the node list after the starting node as the ending node, and use the empty list as the temporary node. Path information list, with empty nodes as temporary ending nodes.

S602. Determine whether the ending node is the last node in the node list, and if so, execute S608, otherwise execute S603.

S603. Determine whether the path indicated by all nodes in the node list from the start node to the end node in order is the only shortest path between the start node and the end node in the SR. If yes, execute S604, otherwise execute S605.

In step S604, the ending node is used as a temporary ending node, the first node after the ending node in the node list is used as a new ending node, and step S602 is performed.

S605: Determine whether the temporarily ending node is empty. If not, execute S606; otherwise, execute S607.

S606. Add the node segment identifier corresponding to the temporary end node to the temporary path information list, use the temporary end node as a new starting node, leave the temporary end node empty, and execute S602.

S607. Add an adjacent segment identifier indicating a path between the start node and the end node to the temporary path information list, use the end node as a new start node, and use the first node after the end node in the node list as the first node. The new end node, and execute S602.

S608. Determine whether the starting node is the penultimate node in the node list. If not, execute S609, otherwise execute S610.

S609. Add the node segment identifier corresponding to the ending node to the temporary path information list, and execute S611.

S610. Add an adjacent segment identifier indicating a path between the start node and the end node to the temporary path information, and execute S611.

S611. Use the temporary path information list as the target information.

In the following, the initial information is an adj-SID list for indicating the path that the data packet passes through. The adj-SID list includes multiple adj-SIDs as an example, and a pseudo-code implementation for generating target information based on the initial information in this application is introduced. the way. Executing this pseudo code can implement the method shown in FIG. 6.

In this pseudo code, strict [] represents the node list corresponding to the path identified by the initial information, loose [] represents the temporary path information list, node represents the starting node, TEN represents the temporary ending node, next represents the ending node, and adj_SID (node, next ) Means to get the adj-SID from node to next in the adj-SID list, and loose.add (adj_SID (node, TENT)) means to add the adj-SID from node to TENT in the adj-SID list to loose, node_SID (TENT) means get the node-SID of TENT, and loose.add (node_SID (next)) means add the next node-SID to loose.

Taking the SR shown in FIG. 1 as an example, the initial information of the forwarding path of the data packet includes {9101, 9105, 9107, 9103, 9105}, and the target information that can be obtained according to the method shown in FIG. 6 or the above pseudo code can include { SID of node C, SID of node O, SID of node Z}.

It should be understood that the use of the temporary path information list and / or the temporary end node in the methods shown in FIG. 5 and FIG. 6 is only an example, and the target information may also be obtained without using the temporary path information list and / or the temporary end node.

In the embodiment of the present application, optionally, the methods in FIG. 2 to FIG. 6 may be executed by an ingress node of a path through which a data packet passes, or may be executed by a controller in a network.

It should be understood that the method shown in FIG. 3 to FIG. 6 is only an example, and a method obtained by transforming or improving the steps in the method shown in any of FIG. 3 to FIG. 6 also belongs to the protection scope of the present application. .

If the methods in FIG. 2 to FIG. 6 are executed by the ingress node of the path that the data packet passes through, the method in the embodiment of the present application may further include: the ingress node sends the data packet according to the target information, and the data packet includes Target information. If the methods in FIG. 2 to FIG. 6 are executed by a controller in a network, the method in the embodiment of the present application may further include: the controller sends target information to an ingress node of a path through which the data packet passes, Then the ingress node sends a data packet according to the target information, and the target information in the data packet. The controller may be a path computing client (PCE), or another server running the algorithm.

The following uses "A-> B-> C-> O-> P-> Z" shown in FIG. 1 as the data packet forwarding path, and uses the method shown in FIG. 3 as an example to introduce the data obtained according to the method of the present application. The process of sending data packets to target information. It can be known from this process that forwarding the data packet according to the target information obtained by the method of the present application can reduce the length of the information of the forwarding path of the data packet between nodes, thereby improving communication efficiency.

For example, node A obtains the initial information as the adj-ID list {9101,9105,9107,9103,9105} or the IP address list {IP addressA, IP addressB, IP addressC, IP addressO, IP addressP, IP address Z}, the target information can be {C's Node-SID, CO's adj-SID, and Z's Node-SID}. Assuming that the Node-SID of C is 1003 and the Node-SID of Z is 1008, the target information is {1003,9107,1008}.

Node A can look up the forwarding table on node A to find out that the next hop is node B according to the Node-SID of C, and send a data packet to node B. The data packet carries path information, which is {C's NodeID, CO's adj-ID and Z's Node ID}. After receiving a data packet from node A, node B queries the forwarding table on node B, learns that the next hop is node C, and sends a data packet to node C. The data packet carries path information. At this time, the path information can be {C's NodeID, CO's adj-ID and Z's Node ID}, or {CO's adj-ID and Z's Node ID}. After receiving the data packet from node B, node C queries the forwarding table of node C according to "adj-IDC of CO", finds the next hop is node O, and sends a data packet to node O. The data packet includes path information. The path information is {Z Node ID}. After node O receives a data packet from node C, it queries the forwarding table on node O, determines that the next hop is node P, and sends a data packet to node P. The data packet includes path information, and the path information is {Z's Node ID }. After node P receives a data packet from node O, it queries the forwarding table on node P, determines that the next hop is node Z, and sends a data packet to node Z.

For example, the initial information is a list of SRv6SIDs, and the SIDs in the list are IPv6 addresses declared as SIDs. For example, the initial information is {A :: 12, B :: 23, C :: 34, O :: 45, P :: 56 , Z :: 67}, after processing according to the method shown in FIG. 3 or after running the above pseudo code, the target information can be {C's NodeID, CO's adj-ID, and Z's Node ID}. For example, the target information can be {C :: 1, C :: 34, Z :: 1}.

Then, node A sends a data packet to node B according to C :: 1, the data packet includes path information, and the path information includes {C :: 1, C :: 34, Z :: 1}. The subsequent forwarding process follows the SRv6 forwarding process. For brevity, we will not repeat them here.

The methods in FIGS. 3 to 6 can make the target information use the corresponding node-SID to indicate all the path identifiers corresponding to the unique shortest path in the initial information, thereby minimizing the number of path identifiers in the target information. , That is, reduce the length of the target information.

Of course, when the method in the embodiment of the present application is executed, the maximum length that the target information can be accepted may also be determined according to requirements, and then the target information is determined according to the maximum length. The maximum length that the target information can be accepted can be determined by the maximum insertion capacity of the path identifier (or label) of the controller or the ingress node.

For example, when part of the path identifier in the initial information can be replaced by the corresponding node-SID in the target information, and the number of path identifiers in the target information is less than or equal to the maximum insertion capacity of the controller or the ingress node, it can be omitted. Then continue to detect whether the initial information has a path identifier, which can be indicated by the corresponding node-SID.

It can be seen from the foregoing analysis that the method in the embodiment of the present application reduces the number of path identifiers indicating the forwarding path of the data packet, and also reduces the number of insertions of the controller or the ingress node, thereby improving the performance of the controller or the ingress node.

FIG. 7 is a schematic block diagram of an apparatus 700 for acquiring information about a forwarding path of a data packet according to an embodiment of the present application. It should be understood that the apparatus 700 is only an example. The device in the embodiment of the present application may further include other modules or units, or include modules similar in function to each module in FIG. 7, or not all modules in FIG. 7.

The obtaining module 710 is configured to obtain initial information of a forwarding path of a data packet, where the initial information includes multiple path identifiers.

A generating module 720 is configured to generate target information of a forwarding path of the data packet according to the initial information, where the target path information includes one or more node segment identifiers, and at least one node segment identifier in the target information corresponds to Multiple path identifiers in the initial information, and the first path indicated by the multiple path identifiers in the initial information corresponding to the node segment identifier in the target information is the first path in the segment route The only shortest path between the start node and the end node of the first path, and each node segment identifier in the target information corresponding to multiple path identifiers in the initial information is the each node segment identifier The node segment identifiers of the end nodes of the paths indicated by the corresponding all path identifiers.

Optionally, the generating module is specifically configured to perform the following steps: Step 1. Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and use the node The j-th node in the list is used as the end node. The value of i is 1. The value of j is the length of the node list. Go to step 2. Step 2. Determine whether the start node and the end node are It is the same node, if it is, the execution is terminated, otherwise step 3 is performed; step 3, it is determined whether the starting node and the ending node are adjacent nodes in the node list, and if so, step 4 is performed, otherwise Perform step five; step four, record the identifier of the adjacent segment between the start node and the end node in the target information, update the value of i to be equal to the value of j, and then, the value of j Update to be equal to the length value of the node list, then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and restart Execution step Step two; Step five, determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the start node to the The only shortest path between the end nodes is described, if yes, step 6 is performed, otherwise step 7 is performed; step 6, the node segment identifier of the end node is recorded in the target information, and the value of i is updated to be the same as j After the values are equal, the value of j is updated to be equal to the length value of the node list, and then the i-th node in the node list is used as the starting node, and the j-th node in the node list is used. And the second node is used as the end node, and step 2 is performed again; in step 7, the value of j is updated to j-1, the jth node in the node list is used as the end node, and step 2 is performed again.

Optionally, the generating module is specifically configured to perform the following steps: Step 1. Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and use the node The j-th node in the list is used as the end node. The value of i is 1. The value of j is the length of the node list. Go to step 2. Step 2. Determine whether the start node and the end node are It is the same node, if so, the execution is terminated, otherwise step 3 is performed; step 3, it is judged whether the path indicated when all nodes in the node list from the starting node to the ending node are arranged in order Is the only shortest path between the start node and the end node in the segment route; if it is, step 4 is performed; otherwise, step 5 is performed; step 4 is recorded in the target information of the end node Node segment identifier. The value of i is updated to be equal to the value of j. After that, the value of j is updated to be equal to the length of the node list, and the i-th node in the node list is used as the The starting node, using the jth node in the node list as the ending node, and performing step 2 again; step five, the value of j is updated to j-1, and the jth node in the node list is updated As the end node, perform step two again.

Optionally, the generating module is specifically configured to perform the following steps: Step 1. Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and use the node The j-th node in the list is used as the end node, and the temporary end node is set to be an empty node. The value of i is 1 and the value of j is i + 1, and step two is performed. Step two is to determine whether the end node is the The last node in the node list, if yes, go to step ten, otherwise go to step three; step three, judge that all nodes in the node list from the starting node to the ending node are arranged in order Whether the path is the only shortest path between the start node and the end node in the segment route, if yes, go to step four, otherwise go to step five; step four, update the temporary end node to all The end node is updated, the value of j is updated to j + 1, and then the jth node in the node list is used as the end node, and step 2 is performed again; step 5 is to determine the temporary end node Whether it is empty, if not, go to step 6, otherwise go to step 7; step 6, determine whether the temporary ending node is a neighboring node of the starting node; if so, go to step 8; otherwise, go to step 9; Step 7. Record the identifier of the adjacent segment indicating the path between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j The value is updated to j + 1, then the i-th node in the node list is used as the starting node, the j-th node in the node list is used as the ending node, and step 2 is performed again; step 8 , Record the identifier of the adjacent segment of the path between the starting node and the temporary ending node in the target information, the value of i is updated to be equal to j-1, and then the value of j is updated to j, Use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, leave the temporary ending node empty, and perform step two again; step nine Recorded in the target information The node segment identifier of the temporary ending node. The value of i is updated to be equal to j-1. After that, the value of j is updated to j, and the i-th node in the node list is used as the starting node. The jth node in the node list is used as the ending node, and the temporary ending node is left blank, and step 2 is performed again; step 10 is determining whether the starting node is the second to last in the node list If not, perform step 11; otherwise, perform step 12; step 11: record the node segment identifier corresponding to the ending node in the target information and end execution; step 12: The target information records an adjacent segment identifier used to indicate a path between the start node and the end node, and ends execution.

Optionally, the generating module is specifically configured to perform the following steps: generating target information of the forwarding path of the data packet according to the initial information includes: step one, obtaining a node list of the forwarding path of the data packet Taking the i-th node in the node list as the starting node and the j-th node in the node list as the ending node, setting the temporary ending node to be an empty node, the value of i is 1, and the value of j is If i + 1, go to step two; step two, determine whether the ending node is the last node in the node list; if so, go to step eight, otherwise go to step three; step three, determine the node list Whether the path indicated by all the nodes from the start node to the end node in order is the only shortest path between the start node and the end node in the segment route, and if so, then Perform step four, otherwise perform step five; step four, update the temporary end node to the end node, update the value of j to j + 1, and then update the jth node in the node list as For the end node, and step 2 is performed again; step 5 is to determine whether the temporary end node is empty; if not, step 6 is performed, otherwise step 7 is performed; step 6 is to record the target information in the target information The node segment identifier of the temporarily ending node. The value of i is updated to be equal to j-1. After that, the value of j is updated to j. The i-th node in the node list is used as the starting node. The j-th node in the node list is used as the ending node, and the temporary ending node is left blank, and step 2 is performed again; step 7 is recorded in the target information for indicating the starting node to the ending The identifier of the adjacent segment of the path between the nodes, the value of i is updated to be equal to the value of j, and then, the value of j is updated to j + 1, and the i-th node in the node list is used as the The starting node, using the jth node in the node list as the ending node, and performing step 2 again; step eight, determining whether the starting node is the penultimate node in the node list. If not, go to step 9. Otherwise, perform step ten; step nine, record the node segment identifier of the ending node in the target information, and end the execution; step ten, record the instruction for instructing the starting node to all nodes in the target information. The identification of the adjacent segment of the path between the end nodes is described, and the execution ends.

Optionally, the initial information is an adjacent segment identifier list, and the path identifier in the initial information is an adjacent segment identifier.

Optionally, the apparatus 700 is an ingress node of a forwarding path of the data packet. The device 700 further includes a sending module 730, configured to send a data packet according to the target information, where the data packet includes the target information.

Optionally, the device 700 is a controller of the segment routing. The apparatus 700 further includes a sending module 730, configured to send the target information to an ingress node of a forwarding path of the data packet.

The apparatus 700 may be configured to execute the steps of the methods described in FIG. 2 to FIG. 6. For brevity, details are not described herein again.

FIG. 8 is a schematic structural diagram of an apparatus for acquiring information about a forwarding path of a data packet according to another embodiment of the present application. It should be understood that the device 800 shown in FIG. 8 is merely an example, and the device in the embodiment of the present application may further include other modules or units, or include modules similar in function to each module in FIG. 8.

The apparatus 800 may include one or more processors 810, one or more memories 820, a receiver 830, and a transmitter 840. The receiver 830 and the transmitter 840 may be integrated together and called a transceiver. The memory 820 is configured to store a program code executed by the processor 810. The processor 810 may be integrated with a memory 820, or the processor 810 is coupled to one or more memories 820, and is configured to fetch instructions in the memory 820.

The processor 810 may be used to implement operations or steps that can be implemented by the obtaining module 710 and the generating module 720 in FIG. 7, and the transmitter 840 may be used to implement operations or steps that can be implemented by the sending module 730 in FIG. 7.

Those of ordinary skill in the art may realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. A professional technician can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments, and are not 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 schematic. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, which may be 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, may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objective 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, or each of the units may exist separately physically, or two or more units may be integrated into one unit.

It should be understood that the processor in the embodiment of the present application may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSPs), and application-specific integrated circuits. (application specific integrated circuit, ASIC), ready-made programmable gate array (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.

When the functions are implemented in the form of software functional 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 a part that contributes to the existing technology or a part of the technical solution can be embodied in the form of a software product. 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 perform all or part of the steps of the method described in the embodiments of the present application. The aforementioned storage media include: U disks, mobile hard disks, read-only memories (ROM), random access memories (RAM), magnetic disks or optical disks, and other media that can store program codes .

The above are only specific embodiments of the present invention, but the scope of protection of the present invention is not limited to this. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present invention. It should be covered by the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (18)

A method for obtaining information of a forwarding path of a data packet in a segment route, which is characterized in that it includes: Acquiring initial information of a forwarding path of a data packet, where the initial information includes multiple path identifiers; Generating target information of a forwarding path of the data packet according to the initial information, the target path information including one or more node segment identifiers, and at least one node segment identifier in the target information corresponding to the initial information Multiple path identifiers, and the first path indicated by the multiple path identifiers in the initial information corresponding to the node segment identifier in the target information is the start node of the first path in the segment route to the The only shortest path between the end nodes of the first path, and each node segment identifier in the target information corresponding to multiple path identifiers in the initial information is identified by all path identifiers corresponding to each node segment identifier. Node segment ID of the end node of the indicated path. The method according to claim 1, wherein the generating target information of a forwarding path of the data packet according to the initial information comprises: Step 1: Obtain a node list of the forwarding path of the data packet, use the i-th node in the node list as the starting node, and the j-th node in the node list as the ending node, and the value of i Is 1, the value of j is the length of the node list, and step 2 is performed; Step 2: determine whether the starting node and the ending node are the same node; if yes, terminate the execution; otherwise, execute step 3; In step three, it is determined whether the starting node and the ending node are adjacent nodes in the node list, and if so, step 4 is performed, otherwise step 5 is performed; Step 4: Record the identifier of the adjacent segment between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j is updated to match the value of The lengths of the node lists are equal, then the i-th node in the node list is used as the starting node, the j-th node in the node list is used as the ending node, and step 2 is performed again; Step five, determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the start node to the end node in the segment route The only shortest path between them, if yes, go to step 6, otherwise go to step 7; Step 6. Record the node segment identifier of the ending node in the target information, update the value of i to be equal to the value of j, and then update the value of j to be equal to the length value of the node list. Then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step 2 again; In step 7, the value of j is updated to j-1, the jth node in the node list is used as the ending node, and step 2 is performed again. The method according to claim 1, wherein the generating target information of a forwarding path of the data packet according to the initial information comprises: Step 1: Obtain a node list of the forwarding path of the data packet, use the i-th node in the node list as the starting node, and the j-th node in the node list as the ending node, and the value of i Is 1, the value of j is the length of the node list, and step 2 is performed; Step 2: determine whether the starting node and the ending node are the same node; if yes, terminate the execution; otherwise, execute step 3; Step 3: Determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the start node to the end node in the segment route The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: record the node segment identifier of the ending node in the target information, update the value of i to be equal to the value of j, and then update the value of j to be equal to the length value of the node list, Then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step 2 again; In step five, the value of j is updated to j-1, the jth node in the node list is used as the ending node, and step two is performed again. The method according to claim 1, wherein the generating target information of a forwarding path of the data packet according to the initial information comprises: Step 1: Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and a j-th node in the node list as an ending node, and set a temporary ending node as For empty nodes, the value of i is 1 and the value of j is i + 1. Go to step 2. Step 2: determine whether the ending node is the last node in the node list, and if so, perform step 10; otherwise, perform step 3; Step 3: Determine whether the path indicated by all the nodes in the node list from the start node to the end node is in order from the start node to the end node in the segment route. The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: update the temporary ending node to the ending node, and update the value of j to j + 1, then use the jth node in the node list as the ending node, and perform step two again; Step five: determine whether the temporary end node is empty; if not, perform step six; otherwise, perform step seven; In step 6, it is determined whether the temporary ending node is a neighboring node of the starting node, and if so, step 8 is performed, otherwise step 9 is performed; Step 7. Record the identifier of the adjacent segment indicating the path between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j Update the value to j + 1, then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step two again; Step 8. Record the identifier of the adjacent segment of the path between the start node and the temporary end node in the target information, and the value of i is updated to be equal to j-1, and then the value of j is updated to j. Use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, empty the temporary ending node, and perform step 2 again; Step Nine, record the node segment identifier of the temporary ending node in the target information, update the value of i to be equal to j-1, and then update the value of j to j, and update the i-th node in the node list. Three nodes as the starting node, the j-th node in the node list as the ending node, leaving the temporary ending node empty, and performing step two again; Step 10: Determine whether the starting node is the penultimate node in the node list, and if not, perform Step 11; otherwise, perform Step 12; Step 11: Record the node segment identifier corresponding to the ending node in the target information and end execution; In step twelve, an identifier of an adjacent segment indicating a path between the start node and the end node is recorded in the target information, and execution is terminated. The method according to claim 1, wherein the generating target information of a forwarding path of the data packet according to the initial information comprises: Step 1: Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and a j-th node in the node list as an ending node, and set a temporary ending node as For empty nodes, the value of i is 1 and the value of j is i + 1. Go to step 2. Step 2: determine whether the ending node is the last node in the node list, and if so, perform step 8; otherwise, perform step 3; Step 3: Determine whether the path indicated by all the nodes in the node list from the start node to the end node is in order from the start node to the end node in the segment route. The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: update the temporary ending node to the ending node, and update the value of j to j + 1, then use the jth node in the node list as the ending node, and perform step two again; Step five: determine whether the temporary end node is empty; if not, perform step six; otherwise, perform step seven; Step 6: Record the node segment identifier of the temporary ending node in the target information, update the value of i to be equal to j-1, and then update the value of j to j, and update the i-th node in the node list. Three nodes as the starting node, the j-th node in the node list as the ending node, leaving the temporary ending node empty, and performing step two again; Step 7. Record the identifier of the adjacent segment indicating the path between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j Update the value to j + 1, then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step two again; Step 8. Determine whether the starting node is the penultimate node in the node list, and if not, perform step 9; otherwise, perform step 10; Step Nine: record the node segment identifier of the ending node in the target information, and end execution; Step 10: Record the adjacent segment identifier used to indicate the path between the start node and the end node in the target information, and end execution. The method according to any one of claims 1 to 5, wherein the initial information is an adjacent segment identifier list, and the path identifier in the initial information is an adjacent segment identifier. The method according to any one of claims 1 to 6, wherein the method is performed by an ingress node of a forwarding path of the data packet; The method further includes: Sending the data packet according to the target information, and the data packet includes the target information. The method according to any one of claims 1 to 6, wherein the method further comprises: The controller sends the target information to an ingress node of a forwarding path of the data packet. A device for obtaining information about a forwarding path of a data packet in a segment route, which is characterized in that it includes: An obtaining module, configured to obtain initial information of a forwarding path of a data packet, where the initial information includes multiple path identifiers; A generating module, configured to generate target information of a forwarding path of the data packet according to the initial information, the target path information includes one or more node segment identifiers, and at least one node segment identifier in the target information corresponds to the The plurality of path identifiers in the initial information, and the first path indicated by the plurality of path identifiers corresponding to the node segment identifier in the target information is the starting point of the first path in the segment route The only shortest path between the start node and the end node of the first path, and each node segment identifier in the target information corresponding to multiple path identifiers in the initial information corresponds to each node segment identifier The node segment ID of the end node of the path indicated by all path IDs. The apparatus according to claim 9, wherein the generating module is specifically configured to perform the following steps: Step 1: Obtain a node list of the forwarding path of the data packet, use the i-th node in the node list as the starting node, and the j-th node in the node list as the ending node, and the value of i Is 1, the value of j is the length of the node list, and step 2 is performed; Step 2: determine whether the starting node and the ending node are the same node; if yes, terminate the execution; otherwise, execute step 3; In step three, it is determined whether the starting node and the ending node are adjacent nodes in the node list, and if so, step 4 is performed, otherwise step 5 is performed; Step 4: Record the identifier of the adjacent segment between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j is updated to match the value of The lengths of the node lists are equal, then the i-th node in the node list is used as the starting node, the j-th node in the node list is used as the ending node, and step 2 is performed again; Step five, determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the start node to the end node in the segment route The only shortest path between them, if yes, go to step 6, otherwise go to step 7; Step 6. Record the node segment identifier of the ending node in the target information, update the value of i to be equal to the value of j, and then update the value of j to be equal to the length value of the node list. Then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step 2 again; In step 7, the value of j is updated to j-1, the jth node in the node list is used as the ending node, and step 2 is performed again. The apparatus according to claim 9, wherein the generating module is specifically configured to perform the following steps: Step 1: Obtain a node list of the forwarding path of the data packet, use the i-th node in the node list as the starting node, and the j-th node in the node list as the ending node, and the value of i Is 1, the value of j is the length of the node list, and step 2 is performed; Step 2: determine whether the starting node and the ending node are the same node; if yes, terminate the execution; otherwise, execute step 3; Step 3: Determine whether the path indicated when all nodes in the node list from the start node to the end node are arranged in order is the start node to the end node in the segment route The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: record the node segment identifier of the ending node in the target information, update the value of i to be equal to the value of j, and then update the value of j to be equal to the length value of the node list, Then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step 2 again; In step five, the value of j is updated to j-1, the jth node in the node list is used as the ending node, and step two is performed again. The apparatus according to claim 9, wherein the generating module is specifically configured to perform the following steps: Step 1: Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and a j-th node in the node list as an ending node, and set a temporary ending node as For empty nodes, the value of i is 1 and the value of j is i + 1. Go to step 2. Step 2: determine whether the ending node is the last node in the node list, and if so, perform step 10; otherwise, perform step 3; Step 3: Determine whether the path indicated by all the nodes in the node list from the start node to the end node is in order from the start node to the end node in the segment route. The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: update the temporary ending node to the ending node, and update the value of j to j + 1, then use the jth node in the node list as the ending node, and perform step two again; Step five: determine whether the temporary end node is empty; if not, perform step six; otherwise, perform step seven; In step 6, it is determined whether the temporary ending node is a neighboring node of the starting node, and if so, step 8 is performed, otherwise step 9 is performed; Step 7. Record the identifier of the adjacent segment indicating the path between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j Update the value to j + 1, then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step two again; Step 8. Record the identifier of the adjacent segment of the path between the start node and the temporary end node in the target information, and the value of i is updated to be equal to j-1, and then the value of j is updated to j. Use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, empty the temporary ending node, and perform step 2 again; Step Nine, record the node segment identifier of the temporary ending node in the target information, update the value of i to be equal to j-1, and then update the value of j to j, and update the i-th node in the node list. Three nodes as the starting node, the j-th node in the node list as the ending node, leaving the temporary ending node empty, and performing step two again; Step 10: Determine whether the starting node is the penultimate node in the node list, and if not, perform Step 11; otherwise, perform Step 12; Step 11: Record the node segment identifier corresponding to the ending node in the target information and end execution; In step twelve, an identifier of an adjacent segment indicating a path between the start node and the end node is recorded in the target information, and execution is terminated. The apparatus according to claim 9, wherein the generating module is specifically configured to perform the following steps: Step 1: Obtain a node list of a forwarding path of the data packet, use an i-th node in the node list as a starting node, and a j-th node in the node list as an ending node, and set a temporary ending node as For empty nodes, the value of i is 1 and the value of j is i + 1. Go to step 2. Step 2: determine whether the ending node is the last node in the node list, and if so, perform step 8; otherwise, perform step 3; Step 3: Determine whether the path indicated by all the nodes in the node list from the start node to the end node is in order from the start node to the end node in the segment route. The only shortest path between them, if yes, go to step 4, otherwise go to step 5; Step four: update the temporary ending node to the ending node, and update the value of j to j + 1, then use the jth node in the node list as the ending node, and perform step two again; Step five: determine whether the temporary end node is empty; if not, perform step six; otherwise, perform step seven; Step 6: Record the node segment identifier of the temporary ending node in the target information, update the value of i to be equal to j-1, and then update the value of j to j, and update the i-th node in the node list. Three nodes as the starting node, the j-th node in the node list as the ending node, leaving the temporary ending node empty, and performing step two again; Step 7. Record the identifier of the adjacent segment indicating the path between the start node and the end node in the target information, and the value of i is updated to be equal to the value of j. After that, the value of j Update the value to j + 1, then use the i-th node in the node list as the starting node, the j-th node in the node list as the ending node, and perform step two again; Step 8. Determine whether the starting node is the penultimate node in the node list, and if not, perform step 9; otherwise, perform step 10; Step Nine: record the node segment identifier of the ending node in the target information, and end execution; Step 10: Record the adjacent segment identifier used to indicate the path between the start node and the end node in the target information, and end execution. The device according to any one of claims 9 to 13, wherein the initial information is an adjacent segment identifier list, and the path identifier in the initial information is an adjacent segment identifier. The device according to any one of claims 9 to 14, wherein the device is an ingress node of a forwarding path of the data packet; The device further includes a sending module, configured to send the data packet according to the target information, where the data packet includes the target information. The device according to any one of claims 9 to 14, wherein the device is a controller of the segment routing; The device further includes a sending module, configured to send the target information to an ingress node of a forwarding path of the data packet. A computer-readable storage medium, characterized in that a program is stored on the computer-readable storage medium, and when the program runs, the method according to any one of claims 1 to 8 is implemented. A device for obtaining information about a forwarding path of a data packet in a segment route, which is characterized in that it includes: Program instruction-related hardware for performing the method of any one of claims 1 to 8.

Images