A tunnel establishment method, device and system

Abstract

The present application discloses a tunnel establishment method, device and system to solve the problem of RSVP-TE tunnel adhesion or traversal through SR-TE tunnel in the prior art. The method includes: a first network device receives a first request message sent by a previous-hop network device, the first request message is used to request to obtain the RSVP-TE label of the first network device, the first network device supports RSVP-TE and SR-TE, and the previous-hop network device supports RSVP-TE; when the first network device determines that at least one network device in the downstream network device of the first network device on the path of the tunnel to be established supports SR-TE, an SR-TE tunnel is established from the first network device to a second network device in at least one network device, and a tunnel identifier for identifying the SR-TE tunnel is generated, and the first network device sends a first response message to the previous-hop network device, and the first response message includes the tunnel identifier.

Description

[0001] This application is a divisional application. The application number of the original application is 201810405028.1, and the original application date is April 28, 2018. The entire contents of the original application are incorporated into this application by reference. Technical Field

[0002] The present application relates to the field of communication technology, and in particular to a tunnel establishment method, device and system. Background Art

[0003] Resource reservation protocol-traffic engineer (RSVP-TE) is a multiprotocol label switching (MPLS)-TE tunnel technology that uses RSVP. After the ingress node at the entrance of the tunnel completes the path calculation based on the constrained shortest path forwarding (CSPF) routing protocol, the ingress node of the tunnel generates a path message carrying label request information and sends it to the egress node at the end of the tunnel hop by hop along the path calculated by the CSPF routing protocol. Each node obtains the label of the next hop node from the next hop node; when forwarding messages, the messages are forwarded based on the label of the next hop node.

[0004] Segment routing-traffic engineering (SR-TE) is a new MPLS TE tunnel technology that uses the interior gateway protocol (IGP) or border gateway protocol (BGP) as control signaling. The controller is responsible for calculating the forwarding path of the tunnel and sending the label stack that strictly corresponds to the path to the forwarder. At the head end node of the SR-TE tunnel, the forwarder can control the transmission path of the message in the network based on the label stack.

[0005] In the prior art, when configuring network nodes, some nodes support the RSVP protocol, some support the SR protocol, and some nodes support both. In this scenario, how the nodes supporting RSVP establish tunnels with the nodes supporting the SR protocol through the nodes supporting both protocols remains to be studied. Summary of the invention

[0006] The present application provides a tunnel establishment method, device and system to solve the problem in the prior art that a node supporting RSVP cannot establish a tunnel with a node supporting SR protocol through a node that supports both.

[0007] In a first aspect, an embodiment of the present application provides a method for establishing a tunnel, comprising: a first network device receives a first request message sent by a previous-hop network device, the first request message is used to request to obtain a Resource Reservation Protocol Traffic Engineering (RSVP-TE) label of the first network device, the first request message includes path information of the tunnel to be built, the path information of the tunnel to be built is used to indicate the path of the tunnel to be built, wherein the previous-hop network device is the previous-hop network device of the first network device on the path of the tunnel to be built, the first network device supports RSVP-TE and Segment Routing Traffic Engineering (SR-TE), and the previous-hop network device supports RSVP-TE; when the first When a network device determines that at least one network device among the downstream network devices of the first network device on the path of the tunnel to be established supports SR-TE, an SR-TE tunnel is established from the first network device to a second network device among the at least one network device, and a tunnel identifier for identifying the SR-TE tunnel is generated, wherein the first network device is an ingress network device of the SR-TE tunnel and the second network device is an egress network device of the SR-TE tunnel; the first network device sends a first response message to the previous-hop network device, the first response message includes the tunnel identifier, and the tunnel identifier is used as an RSVP-TE label of the first network device.

[0008] The above solution provides a tunnel establishment method in the scenario where an RSVP-TE tunnel passes through an SR-TE tunnel or an RSVP-TE tunnel is adhered to an SR-TE tunnel, thereby enriching the networking scenarios of RSVP-TE nodes and SR-TE nodes.

[0009] In one possible design, the establishing of an SR-TE tunnel from the first network device to a second network device among the at least one network device, and the generating of a tunnel identifier for identifying the SR-TE tunnel, include: the first network device acquiring, according to the path information of the tunnel to be established, at least one adjacency label corresponding to every two adjacent nodes in the SR-TE tunnel between the first network device and the second network device; the first network device generating a label stack list of the SR-TE tunnel according to the at least one adjacency label, and generating the tunnel identifier mapped to the label stack list; the first network device saving an association between the tunnel identifier and the label stack list.

[0010] The above design provides a simple and effective way to establish an SR-TE tunnel in the scenario where an RSVP-TE tunnel passes through an SR-TE tunnel or an RSVP-TE tunnel is attached to an SR-TE tunnel.

[0011] In one possible design, the second network device is an egress network device of the tunnel to be built, and at least one of the network devices does not support RSVP-TE.

[0012] The above design indicates that the embodiment of the present application is applicable to the scenario of RSVP-TE being adhered to SR-TE.

[0013] In one possible design, only the second network device among the at least one network device supports RSVP-TE, and the second network device is an intermediate network device of the tunnel to be established; before the first network device sends a first response message to the previous-hop network device, it also includes: the first network device sends a second request message to the second network device through the SR-TE tunnel, and the second request message is used to request to obtain the RSVP-TE label of the second network device; the first network device receives a second response message sent by the second network device, and the second response message includes the RSVP-TE label of the second network device.

[0014] The above design indicates that the embodiment of the present application is also applicable to the scenario where the RSVP-TE tunnel traverses through the SR-TE tunnel.

[0015] In one possible design, the method also includes: the first network device receives a message sent by the previous-hop network device, the message carrying the tunnel identifier; the first network device exchanges the tunnel identifier in the message with the label stack list according to the association between the tunnel identifier and the label stack list, and sends the updated message to the next-hop network device of the first network device in the tunnel to be built.

[0016] The above design provides a simple and effective way to send packets when an RSVP-TE tunnel passes through or adheres to an SR-TE tunnel.

[0017] In one possible design, when only the second network device among the at least one network device supports RSVP-TE, and the second network device is an intermediate network device in the tunnel to be built, after the first network device exchanges the tunnel identifier in the message with the label stack list, the method also includes: the first network device encapsulates the RSVP-TE label of the second network device at the bottom of the label stack list in the message.

[0018] The above design provides another simple and effective way to send messages when the RSVP-TE tunnel passes through the SR-TE tunnel.

[0019] In a second aspect, an embodiment of the present application provides a tunnel establishment method, including: a network device sends a request message to a next-hop network device in a tunnel to be established, the request message is used to request to obtain a Resource Reservation Protocol Traffic Engineering (RSVP-TE) label of the next-hop network device, the request message includes path information of the tunnel to be established, and the path information of the tunnel to be established is used to indicate the path of the tunnel to be established, wherein the next-hop network device is the next-hop network device of the network device on the path of the tunnel to be established, the network device supports RSVP-TE, and the next-hop network device supports RSVP-TE and segment routing traffic engineering (SR-TE); the network device receives a response message sent by the next-hop network device, the response message includes a tunnel identifier as the RSVP-TE label of the network device, and the tunnel identifier is used to identify the SR-TE tunnel established by the next-hop network device in the path of the tunnel to be established.

[0020] The above solution provides a tunnel establishment method in the scenario where an RSVP-TE tunnel passes through an SR-TE tunnel or an RSVP-TE tunnel is adhered to an SR-TE tunnel, thereby enriching the networking scenarios of RSVP-TE nodes and SR-TE nodes.

[0021] In a possible design, it also includes: when the network device sends a message to the next-hop network device, the network device carries the tunnel identifier as the RSVP-TE label of the next-hop network device in the message and sends it to the next-hop network device.

[0022] The above design provides a method for sending packets in a scenario where an RSVP-TE tunnel passes through an SR-TE tunnel or an RSVP-TE tunnel is adhered to an SR-TE tunnel.

[0023] In a third aspect, based on the same inventive concept as the method embodiment of the first aspect, an embodiment of the present application provides a tunnel establishment device, which is applied to the first network device described in the first aspect, that is, the device can be the first network device, or it can be a chip that can be applied to the first network device. The device has the functions of implementing the various embodiments of the first aspect above. The function can be implemented by hardware, or it can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

[0024] In a fourth aspect, based on the same inventive concept as the method embodiment provided in the second aspect, an embodiment of the present application provides a tunnel establishment device, which is applied to the network device described in the second aspect, that is, the device can be a network device, or a chip that can be applied to a network device. The device has the functions of implementing the various embodiments of the first aspect above. The function can be implemented by hardware, or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

[0025] In a fifth aspect, an embodiment of the present application provides a device, comprising: a processor and a memory; the memory is used to store instructions, and when the device is running, the processor executes the instructions stored in the memory, so that the device executes the tunnel establishment method in the above-mentioned first aspect or any implementation method of the first aspect. It should be noted that the memory can be integrated into the processor or can be independent of the processor. The device may also include a bus. Among them, the processor is coupled to the memory through the bus. Among them, the memory may include a readable memory and a random access memory. When the device needs to be run, it is started by the basic input and output system solidified in the read-only memory or the bootloader boot system in the embedded system, and the device is booted into a normal operating state. After the device enters the normal operating state, the application and the operating system are run in the random access memory, so that the processor executes the method in the first aspect or any possible implementation design of the first aspect.

[0026] In a sixth aspect, an embodiment of the present application provides a device, comprising: a processor and a memory; the memory is used to store instructions, and when the device is running, the processor executes the instructions stored in the memory, so that the device executes the tunnel establishment method in the above-mentioned second aspect or any implementation method of the second aspect. It should be noted that the memory can be integrated into the processor or can be independent of the processor. The device may also include a bus. Among them, the processor is coupled to the memory through the bus. Among them, the memory may include a readable memory and a random access memory. When the device needs to be run, it is started by the basic input and output system solidified in the read-only memory or the bootloader boot system in the embedded system, and the device is booted into a normal operating state. After the device enters the normal operating state, the application and the operating system are run in the random access memory, so that the processor executes the method in the second aspect or any possible implementation design of the second aspect.

[0027] In a seventh aspect, an embodiment of the present application further provides a system, comprising the first network device described in the third aspect or the fifth aspect, and the network device described in the fourth aspect or the sixth aspect. In a possible design, the system may also include other network devices that interact with the two network devices in the solution provided in the embodiment of the present application, such as other network devices on the path of the tunnel to be built.

[0028] In an eighth aspect, an embodiment of the present application further provides a readable storage medium, wherein the readable storage medium stores a program or instruction, which, when executed on a computer, enables any of the tunnel establishment methods of the above aspects to be executed.

[0029] In a ninth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute any of the tunnel establishment methods in the above aspects.

[0030] In addition, the technical effects brought about by any design method in the third to ninth aspects can refer to the technical effects brought about by different implementation methods in the first to second aspects, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 A schematic diagram of the working principle of RSVP-TE provided in an embodiment of the present application;

[0032] Figure 2 A schematic diagram of the working principle of SR-TE provided in an embodiment of the present application;

[0033] Figure 3A A schematic diagram of the architecture of an RSVP-TE tunnel traversing through an SR-TE tunnel provided in an embodiment of the present application;

[0034] Figure 3B A schematic diagram of the RSVP-TE tunnel adhesion SR-TE tunnel architecture provided in an embodiment of the present application;

[0035] Figure 3C A schematic diagram of a traversal architecture of multiple RSVP-TE tunnels and multiple SR-TE tunnels provided in an embodiment of the present application;

[0036] Figure 4 A flow chart of a tunnel establishment method provided in an embodiment of the present application;

[0037] Figure 5 A schematic diagram of the architecture of a scenario in which an RSVP-TE tunnel traverses an SR-TE tunnel provided in an embodiment of the present application;

[0038] Figure 6A-6B A schematic diagram of a tunnel establishment method flow in a scenario where an RSVP-TE tunnel traverses an SR-TE tunnel provided in an embodiment of the present application;

[0039] Figure 7A-7B A schematic diagram of a message transmission method for an RSVP-TE tunnel traversing an SR-TE tunnel provided in an embodiment of the present application;

[0040] Figure 8 A schematic diagram of the RSVP-TE tunnel adhesion SR-TE tunnel scenario architecture provided in an embodiment of the present application;

[0041] Figures 9A-9B A schematic diagram of a tunnel establishment method in a scenario where an RSVP-TE tunnel is adhered to an SR-TE tunnel provided in an embodiment of the present application;

[0042] Figures 10A-10B A schematic diagram of a message transmission method in a scenario where an RSVP-TE tunnel is adhered to an SR-TE tunnel provided in an embodiment of the present application;

[0043] Fig.11 A schematic diagram of the structure of the device 1100 provided in an embodiment of the present application;

[0044] Fig.12 A schematic diagram of the structure of a network device 1200 provided in an embodiment of the present application;

[0045] Fig.13 A schematic diagram of the structure of the device 1300 provided in an embodiment of the present application;

[0046] Fig.14 A schematic diagram of the structure of the network device 1400 provided in an embodiment of the present application. DETAILED DESCRIPTION

[0047] The present application is applied to a mixed networking scenario of nodes supporting SR-TE and nodes supporting RSVP-TE.

[0048] In the embodiment of the present application, a node may also be referred to as a network device, which is a device that provides routing and forwarding functions in a network, for example, a router, a switch, a forwarder, or a label switching router (LSR), etc., without limitation. In the subsequent description process, a node is used as an example for explanation.

[0049] Below Figure 1 The working principle of RSVP-TE is briefly described using the example of establishing a tunnel from node R1 to node R8:

[0050] The ingress node R1 calculates the path that the RSVP-TE tunnel will pass through CSPF according to the constraints configured for the RSVP-TE tunnel, such as the specified path, bandwidth constraints, link coloring and other conditions. Take the path R1->R2->R4->R8 as an example. After completing the path calculation, the ingress node R1 sends an RSVP path message to the destination node (also called the egress node, end node or tail node) R8. The RSVP path message is used to request the label of the node in the downstream direction and apply for reserved resources. The downstream node that receives the RSVP path message, such as node R2, will first detect whether the message format is correct, and then detect whether the resources requested for reservation in the path message can be met. This process can be called admission control.

[0051] After the admission control succeeds, each downstream node will generate a new path message and then send it to the next hop node, such as R2 to R3, R3 to R4, and the process continues to the last node, the egress node. When the egress node R8 receives the path message sent by the previous hop, it verifies whether the resources requested for reservation in the path message can be met. If so, it responds through an RSVP response message (such as an RSVP resv message) and reserves the corresponding resources. The RSVP resv message is also sent hop by hop along the path and carries information such as RSVP labels and reserved resources. For example, the RSVP resv message sent by R4 to R3 carries R4's RSVP label. When the ingress node R1 receives the RSVP resv message, the tunnel is successfully established. The LSP established using RSVP-TE has a resource reservation function. The nodes along the way can allocate certain resources to the LSP so that the services transmitted on this LSP are guaranteed.

[0052] Below Figure 2 Take the following as an example to briefly explain the working principle of SR-TE:

[0053] In SR-TE technology, the control plane uses a link-state-based IGP protocol or a border gateway protocol (BGP) to distribute MPLS labels of nodes, and the data plane forwards MPLS packets based on the labels distributed by the control plane.

[0054] SR-TE (Segment Routing-Traffic Engineering) is a new type of TE tunnel technology that uses the interior gateway protocol (IGP) or border gateway protocol (BGP) as control signaling. The controller is responsible for calculating the forwarding path of the tunnel and sending the label stack list that strictly corresponds to the path to the forwarder. At the ingress node of the SR-TE tunnel, the forwarder can control the transmission path of the message in the network based on the label stack list.

[0055] The label stack list includes the adjacency label corresponding to each link on the forwarding path.

[0056] Adjacency Segment is used to identify routing links in an SR network and is the main label type used by SR-TE. Adjacency Segment can be identified by Adjacency Segment ID (SID). Adjacency labels have a certain directionality and are only valid at the source node when used to guide packet forwarding. Figure 2 As shown, adjacency label 9003 corresponds to link PE1->P3, and the source node is PE1; adjacency label 9004 corresponds to link P3->PE1, and the source node is P3.

[0057] The label stack list is an ordered set of adjacency labels used to identify a complete label switching path LSP. Each adjacency label in the label stack list identifies a specific link, and the entire label stack list identifies all links along the entire LSP path from the top of the stack to the bottom of the stack. During packet forwarding, the corresponding link is searched based on the adjacency label at the top of the label stack list, and the label is popped out before forwarding. After all adjacency labels in the label stack list are popped out, the packet has completed the entire LSP and reaches the destination of the SR-TE tunnel.

[0058] The forwarder allocates an adjacency label based on the IGP protocol and reports the allocated adjacency label to the controller, so that the controller generates a label stack list based on the adjacency label.

[0059] The adjacency label is flooded to the entire network through the IGP protocol. Figure 2 As shown in the figure, taking P3 device as an example, the specific process of IGP protocol allocating adjacency labels is as follows:

[0060] P3 applies for local dynamic labels for all its links through the IGP protocol (for example, P3 assigns link label 9002 to link P3->P4). P3 publishes adjacency labels through the IGP protocol and floods them to the entire network. Other devices in the network learn the adjacency labels published by P3 through the IGP protocol. Specifically, PE1, PE2, P1, P2, and P4 allocate and publish adjacency labels in the same way as P3, and flood them to other devices in the network.

[0061] The controller calculates the path based on the tunnel constraint attributes of SR-TE. The calculated path integrates the adjacency labels of the entire path according to the topology and adjacency labels to generate a label stack list. For example, see Figure 2 As shown in the figure, the controller calculates the SR-TE tunnel path as PE1->P3->P1->P2->P4->PE2, and the corresponding label stack list is {1003,1006,1005,1009,1010}. The controller sends the calculated label stack list to the forwarder ingress node PE1. The forwarder then obtains the SR-TE tunnel LSP based on the label stack list sent by the controller.

[0062] The forwarder performs label operation on the packet according to the label stack list corresponding to the SR-TE tunnel LSP, and searches for the outgoing interface hop by hop based on the top label in the stack to guide the data packet to be forwarded to the tunnel destination address.

[0063] When a packet enters an SR-TE tunnel, the ingress node inserts a label stack list into the packet; when the packet is forwarded in the SR-TE tunnel, the label at the top of the stack is searched for and forwarded to the outbound interface, and then the label at the top of the stack is stripped off. Figure 2 As shown in the figure, the ingress node PE1 adds a label stack list {1003, 1006, 1005, 1009, 1010} to the data message, then matches the link according to the label 1003 at the top of the stack, finds the corresponding forwarding interface is the PE1->P3 link, and then pops the label 1003. The message carries the label stack {1006, 1005, 1009, 1010} and is forwarded to the next hop node P3 through the PE1->P3 link. After the intermediate node P3 receives the message, it matches the link according to the label 1006 at the top of the stack, finds the corresponding forwarding interface is the P3->P1 link, and then pops the label 1006. Similarly, after nodes P1, P2, and P4 receive the message, they continue to forward it in the same way as the intermediate node P3. Until node P4 pops the last label 1010, the data message is forwarded to node F. The message received by the egress node PE2 does not carry a label and continues to be forwarded by searching the routing table.

[0064] In addition, it should be noted that the multiple in the embodiments of the present application refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, it should be understood that in the description of the present application, the words "first" and "second" are only used to distinguish the purpose of description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order. Node 1 or node 2, etc. are also only used to distinguish the nodes of the description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order.

[0065] In a mixed networking scenario where nodes supporting SR-TE and nodes supporting RSVP-TE are connected, how the RSVP-TE tunnel can pass through or adhere to the SR-TE tunnel to establish a hybrid tunnel consisting of the RSVP-TE tunnel and the SR-TE tunnel remains to be studied. Figure 3A and Figure 3B As shown, Figure 3A The figure shows that the RSVP-TE domain crosses the SR-TE domain. Figure 3B The figure shows the RS-TE domain being glued to the SR-TE domain. The number of nodes in each domain is not specifically limited. In addition, three RSVP-TE domains may need to pass through two SR-TE domains, or more, such as Figure 3C As shown. RSVP-TE (1) and RSVP-TE (2) need to pass through SR-TE (1) which can be achieved by the tunnel establishment method provided in the embodiment of the present application, and RSVP-TE (2) and RSVP-TE (3) need to pass through SR-TE (2) which can be achieved by the tunnel establishment method provided in the embodiment of the present application.

[0066] Based on this, the embodiments of the present application provide a tunnel establishment method, device and system to achieve RSVP-TE tunnel traversal or adhesion SR-TE tunnel to establish a hybrid tunnel composed of RSVP-TE tunnel and SR-TE tunnel. The method and the device are based on the same inventive concept. Since the principles of the method and the device to solve the problem are similar, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.

[0067] See also Figure 4As shown, it is a schematic diagram of the tunnel establishment method provided in an embodiment of the present application. Take the tunnel to be built including N nodes as an example, wherein node 1 located in the middle position supports RSVP-TE and SR-TE. The previous hop node of the first node does not support SR-TE, but only supports RSVP-TE, and at least one node in the downstream nodes of the first node on the path of the tunnel to be built supports SR-TE. For example, if a node in the downstream direction of the first node supports SR-TE, then in the tunnel to be built, in the downstream direction, the next hop node of the first node supports SR-TE. If two nodes in the downstream direction support SR-TE, the two nodes are two adjacent nodes, and one of the nodes is adjacent to the first node, that is, the next hop node of the first node supports SR-TE, and the next hop node of the next hop node also supports SR-TE. Taking A connected to B and B connected to C as an example, in the path of A->B->C, the next hop node of A's next hop node is C.

[0068] For the convenience of subsequent description, the last node supporting SR-TE among the downstream nodes of the first node is referred to as the second node.

[0069] It is worth noting that in the embodiments of the present application, upstream and downstream are described based on the direction in which data packets are transmitted on the tunnel. The tunnel to be built is a tunnel from the entry node to the exit node, and data packets are transmitted on the path of the tunnel. The entry node is the upstream node of the exit node, and conversely, the exit node is the downstream node of the entry node. If there is an intermediate node between the entry node and the exit node on the path of the tunnel to be built, the intermediate node is the downstream node of the entry node relative to the entry node, and the intermediate node is the upstream node of the exit node relative to the exit node.

[0070] S401: A previous-hop node of a first node sends a first request message to the first node. The first request message is used to request to obtain an RSVP-TE label of the first node. The first request message includes path information of the tunnel to be established.

[0071] The path information of the tunnel to be built is used to indicate the path of the tunnel to be built.

[0072] S402: The first node receives a first request message sent by the previous hop node.

[0073] S403: When the first node determines that at least one node among the downstream nodes of the first node on the path of the tunnel to be established supports SR-TE, an SR-TE tunnel is established from the first node to a second node among the at least one node, and a tunnel identifier is generated for identifying the SR-TE tunnel.

[0074] The format of the tunnel identifier may be the same as that of the RSVP label. The tunnel identifier may also be called a blind segment ID (BSID).

[0075] In the embodiment of the present application, each node in the SR network will announce its own SR capability in the entire SR domain through the IGP protocol extension, so that each SR node can automatically learn about other nodes that support SR-TE.

[0076] The at least one node includes the next hop node of the first node, and the second node is the egress node of the SR-TE tunnel. For example, when the at least one node is one node, the next hop node of the first node is the second node, and when the at least one node is two nodes, for example, the next hop node of the first node is node X, the second node is the next hop node of node X.

[0077] S404: The first node sends a first response message to the previous-hop node, where the first response message includes the tunnel identifier, and the tunnel identifier is used as an RSVP-TE label of the first node.

[0078] The request message may be a path message, and the response message may be a resv message.

[0079] When the embodiment of the present application is applied to the RSVP-TE adhesion SR-TE scenario, the second node is the egress node of the tunnel to be established, and the at least one node does not support RSVP-TE.

[0080] When the embodiment of the present application is applied to a scenario where an RSVP-TE tunnel traverses an SR-TE tunnel, only the second node among the at least one node supports RSVP-TE, and the second node is not an egress node of the tunnel to be established, that is, the second node is an intermediate node of the tunnel to be established.

[0081] In this scenario, before the first node sends a first response message to the previous hop node, the first node sends a second request message to the second node through the SR-TE tunnel, where the second request message is used to request an RSVP-TE label for the second node; the first node receives a second response message sent by the second node, where the second response message includes the RSVP-TE label of the second node.

[0082] The above two scenarios are described below with reference to specific examples.

[0083] See also Figure 5 The figure shows the scenario where an RSVP-TE tunnel traverses an SR-TE tunnel.

[0084] RSVP-TE nodes, i.e. nodes supporting RSVP-TE, include nodes A, B, H, and I. SR-TE nodes, i.e. nodes supporting SR-TE, include nodes D and F. RSVP-TE&SR-TE nodes, i.e. nodes supporting both RSVP-TE and SR-TE, include nodes C and G. Node A is the ingress node of the tunnel to be established, and node I is the egress node of the tunnel to be established.

[0085] The specific tunnel establishment scheme is as follows: Fig. 6A and Figure 6B shown.

[0086] Node A calculates the path of the tunnel to be built from node A to node I based on CSPF. This path specifies the IP address of each hop along the way. After calculation, the path is A->B->C->D->F->G->H->I. Node A uses the IP address list calculated by CSPF as the path information of the tunnel to be built. This path information can be called explicit route object (ERO) information, and constructs a path message (message, Msg) 1 based on the path information. Node A can also trigger the controller to calculate the path from node A to node I based on CSPF, and then send the calculated IP address list as ERO information to node A, so that node A constructs path message 1 based on the received ERO information.

[0087] The content of the path message 1 constructed by node A is shown in Table 1. The content included in the path message shown in the table provided in this application is only an example. Of course, the path message can also include other relevant information, such as the sender's address (which can be represented by Sender_Template) and the route that has been traversed is recorded through Record_Route, which is not specifically limited here.

[0088] The object session includes RSVP session related information, including: destination address, the entire established tunnel ID, extended tunnel ID, etc. PHOP indicates the outbound interface address of the previous hop that sends the path message, that is, the outbound interface address from node A to node B, which is the outbound interface address of A. Sender_Tspec indicates the traffic characteristics of the data flow, that is, it describes the requirements of the Path. For example, in Table 1, Sender_Tspec is configured as 2Mbps, which means that 2Mbps of bandwidth needs to be reserved.

[0089] Table 1

[0090] object value Session A->I PHOP A ERO B->C->D->F->G->H->I Sender_Tspec 2Mbps

[0091] S601, node A sends the constructed path message 1 to node B based on ERO.

[0092] S602, after receiving path message 1, node B updates path message 1 to path message 2, and sends path message 2 to node C.

[0093] The content of path message 2 is shown in Table 2. Specifically, node B updates the PHOP of path message 1 to the outbound interface address from B to C, that is, the address of B. Node B updates the ERO of path message 1 and deletes the outbound interface address of node B itself.

[0094] Table 2

[0095]

[0096]

[0097] S603, after node C receives path message 2 sent by node B, node C determines, based on path message 2, that there are nodes supporting SR-TE in the downstream nodes of node C in the path of the tunnel to be established, namely, node D, node F, and node G.

[0098] On the path of the tunnel to be built, node D is directly adjacent to node C (or node D is adjacent to node C), node F is directly adjacent to node D, and node G is directly adjacent to node F. That is, there is a node supporting SR-TE among the downstream nodes of node C, and the nodes supporting SR-TE are adjacent to each other in sequence on the tunnel to be built, and the node (such as node D) located most upstream among the nodes supporting SR-TE downstream of node C is directly adjacent to node C.

[0099] Specifically, node C can determine, based on path message 2, that nodes D and F in the tunnel to be built do not support RSVP-TE but only support SR-TE, and that node G supports both SR-TE and RSVP-TE, thereby determining an SR-TE path from node C to node G.

[0100] When node C determines that nodes D and F in the path do not support RSVP-TE, it can be determined by using the TE node capability descriptor extended by RFC5073. RFC5073 is a standard document related to the IGP routing protocol extended for discovering traffic engineering node capabilities.

[0101] S604, node C establishes an SR-TE tunnel from node C to node G, and allocates a tunnel identifier for the SR-TE tunnel. When allocating the tunnel identifier, node C can automatically allocate a label from the SRLB (ie, the SR local label segment) that does not conflict with other node labels.

[0102] When node C establishes the SR-TE tunnel from node C to node G, it can be established through the IGP protocol.

[0103] Specifically, node C obtains at least one adjacency label corresponding to every two adjacent nodes in the SR-TE tunnel between node C and node G. That is, it includes an adjacency label for representing the link between node C and node D, such as 304; an adjacency label for representing the link between node D and node F, such as 405; and an adjacency label for representing the link between node F and node G, such as 506. Thus, node C generates a label stack list of the SR-TE tunnel according to the adjacency label, and generates a tunnel identifier mapped to the label stack list, that is, assigns a tunnel identifier to the SR-TE tunnel, and establishes an association between the tunnel identifier and the label stack list, so that node C creates an SR-TE tunnel from node C to node G. Node C saves the association.

[0104] Among them, path message 2 includes the path information of the AI ​​tunnel to be built, and the path information is ERO information. The ERO in the path message 2 includes the IP routing information of D, F, and G, that is, the path D->F->G. Therefore, when node C generates a label stack list according to the adjacency label, it can generate a label stack list of the SR-TE tunnel based on the ERO information and the acquired adjacency label, that is, according to the path D->F->G, the label stack list is 304, 405, and 506 from the top to the bottom of the stack.

[0105] S605: Node C updates path message 2 to path message 3, and sends path message 3 to node G through the SR-TE tunnel between node C and node G, that is, sends path message 3 to node G based on the label stack list.

[0106] The content of path message 3 is shown in Table 3. Specifically, node C updates the PHOP of path message 2 to the outbound interface address from C to G, that is, the address of C. Node C updates the ERO of path message 2 and deletes the outbound interface address of node C itself.

[0107] Table 3

[0108] object value Session A->I PHOP C ERO G->H->I Sender_Tspec 2Mbps

[0109] S606: After receiving the path message 3, node G updates the path message 3 to path message 4 and sends it to node H.

[0110] The content of path message 4 is shown in Table 4. Specifically, node G updates the PHOP of path message 3 to the outbound interface address from G to H, that is, the address of G. Node G updates the ERO of path message 3 and deletes the outbound interface address of node G itself.

[0111] Table 4

[0112] object value Session A->I PHOP G ERO H->I Sender_Tspec 2Mbps

[0113] S607, after receiving the path message 4, node H updates the path message 4 to path message 5 and sends it to node I.

[0114] The content of path message 5 is shown in Table 5. Specifically, node H updates the PHOP of path message 4 to the outbound interface address from H to I, that is, the outbound interface address of H. Node H updates the ERO of path message 4 and deletes its own outbound interface address.

[0115] Table 5

[0116] object value Session A->I PHOP H ERO I Sender_Tspec 2Mbps

[0117] S608, after receiving the path message 5, node I allocates an RSVP-TE label of node I, and carries the RSVP-TE label of node I in a resv message 5 and sends it to node H. The RSVP-TE label of node I is a label allocated by node I for node H to identify itself.

[0118] Node I extracts the outbound interface address of H in the PHOP field from the received Path message 5 as the destination IP address of the Resv message. In addition, the Resv message is forwarded along the reverse path, so the Resv message does not carry ERO.

[0119] S609, after receiving resv message 5, node H allocates the RSVP-TE label of node H, saves the RSVP-TE label of node I in resv message 5, and replaces the RSVP-TE label of node I with the RSVP-TE label of node H in resv message 5. Thus, resv message 5 is updated to resv message 4, and resv message 4 is sent to node G.

[0120] Similarly, in S610, after receiving resv message 4, node G allocates the RSVP-TE label of node G, saves the RSVP-TE label of node H in resv message 4, replaces the RSVP-TE label of node H in resv message 4 with the RSVP-TE label of node G, thereby updating resv message 4 to resv message 3, and sending resv message 3 to node C. Specifically, node G determines the IP address of node C according to the record route object (PRO), and sends resv message 3 to node C according to the IP address of node C. The PRO record route list records the IP address of each node in the RSVP-TE tunnel that sends the path message.

[0121] S611, after receiving resv message 3, node C saves the RSVP-TE label of node G in resv message 3, replaces the RSVP-TE label of node G in resv message 3 with the tunnel identifier (the tunnel identifier serves as the RSVP-TE label of node C), so that resv message 3 is updated to resv message 2, and resv message 2 is sent to node B.

[0122] S612, after receiving resv message 2, node B allocates an RSVP-TE label to node B, saves the tunnel identifier in resv message 2, replaces the tunnel identifier in resv message 2 with the RSVP-TE label of node B, thereby updating resv message 2 to resv message 1, and sends resv message 1 to node A.

[0123] After receiving resv message 1, node A saves the RSVP-TE label of node B. Thus, the entire tunnel is established.

[0124] After the tunnel is established, node A can send a message to node I through the established tunnel in the following way. Fig. 7A and Figure 7B As shown:

[0125] S701: Node A sends a message to the next-hop node B. The message carries the RSVP-TE label of node B.

[0126] S702: After receiving the message, node B replaces the label of node B in the message with a tunnel identifier, such as BSID, and sends the updated message to node C.

[0127] S703: After receiving the message sent by node B, node C exchanges the tunnel identifier in the message with the label stack list according to the stored association relationship between the tunnel identifier and the label stack list.

[0128] The label stack list contains, in order, the adjacency label of the link between node C and node D, the adjacency label of the link between node D and node F, and the adjacency label of the link between node F and node G.

[0129] Specifically, node C searches for a label stack list associated with the tunnel identifier in the message based on the association relationship, and then replaces the tunnel identifier with the searched label stack list.

[0130] S704: Node C adds the RSVP-TE label of node G to the bottom of the label stack list in the message.

[0131] S705, node C determines the link between node C and node D based on the adjacency label at the top of the stack in the label stack list (adjacency label 304 of the link between node C and node D), pops the adjacency label 304 at the top of the stack, and sends the updated message to node D.

[0132] S706, after receiving the message sent by node C, node D determines the link between node D and node F according to the adjacency label 405 at the top of the label stack list in the message, pops the adjacency label 405 at the top of the stack, and sends the updated message to node F.

[0133] S707, after receiving the message sent by node D, node F determines the link between node F and node G according to the adjacency label 506 at the top of the label stack list in the message, pops the adjacency label 506 at the top of the stack, and sends the updated message to node G.

[0134] S708 , after receiving the message sent by node F, node G determines that the label in the message is its own RSVP-TE label, exchanges its own RSVP-TE label in the message with the RSVP-TE label of node H, and sends the updated message to node H.

[0135] S709, after receiving the message sent by node G, node H determines that the label in the message is its own RSVP-TE label, exchanges its own RSVP-TE label in the message with the RSVP-TE label of node I, and sends the updated message to node I. Thus, after receiving the message sent by node H, node I determines that the label in the message is its own RSVP-TE label, deletes its own RSVP-TE label in the message, and continues to forward the message.

[0136] See also Figure 8 The figure shows the RSVP-TE-SR-TE scenario.

[0137] The RSVP-TE nodes include nodes A and B; the SR-TE nodes include nodes D, F, and G. The RSVP-TE&SR-TE nodes include node C. Node A is the ingress node of the tunnel to be established, and node G is the egress node of the tunnel to be established. Figure 8 The corresponding embodiments and Figure 5 The difference between the corresponding embodiments is that the node G does not support RSVP-TE, and the node G is the egress node of the tunnel to be established.

[0138] The specific tunnel establishment scheme is as follows: Fig. 9A and Fig. 9B shown.

[0139] Node A calculates the path of the tunnel to be built from node A to node G based on CSPF. This path specifies the IP address of each hop along the way. After calculation, the path is A->B->C->D->F->G. Node A uses the IP address list calculated by CSPF as explicit route object (ERO) information to construct path message (message, Msg) 1. Node A can also trigger the controller to calculate the path from node A to node I based on CSPF, and then send the calculated IP address list as ERO information to node A, so that node A constructs path message 1 according to the received ERO information.

[0140] S901-S904, refer to S601-S604, which will not be repeated here.

[0141] S905 , node C determines that node G is the egress node of the tunnel to be established, and sends the tunnel identifier to node B in resv message 1 . The tunnel identifier serves as the RSVP-TE label of node C .

[0142] S906, after receiving resv message 2, node B allocates an RSVP-TE label to node B, saves the tunnel identifier in resv message 2, replaces the tunnel identifier in resv message 2 with the RSVP-TE label of node B, that is, resv message 2 is updated to resv message 1, and resv message 1 is sent to node A.

[0143] After receiving resv message 1, node A saves the RSVP-TE label of node B. Thus, the entire tunnel is established.

[0144] After the tunnel is established, node A can send a message to node G through the established tunnel in the following way. Fig. 10A and Fig. 10B As shown:

[0145] S1001-S1003, refer to S701-S703, which will not be repeated here.

[0146] S1004-S1006, refer to S705-S707, which will not be described in detail here. After receiving the message sent by node F, node G continues to forward the message.

[0147] Based on the same inventive concept as the method embodiment, the present application embodiment also provides a device, see Fig.11 As shown, the apparatus 1100 is applied to a network device, which may be a bonding node between RSVP-TE and SR-TE, such as Figure 4 The first node in the corresponding embodiment or Figure 5 , Figure 8 In the corresponding embodiment, the node C, the device 1100 may specifically be a processor in a network device, or a chip or a chip system, or a functional module, etc. The device 1100 may include a receiving module 1101, a processing module 1102, and a sending module 1103. The processing module 1102 is used to control and manage the actions of the device 1100, the receiving module 1101 is used to receive a request message or receive a message, the sending module 1103 is used to send a response message or send a message, and the processing module 1102 is used to process the request message or message received by the receiving module 1101. The processing module 1102 may also be used to indicate the processing process involving the network device (such as the first node or node C) in any of the above embodiments and / or other processes of the technical solution described in this application. The device may also include a storage module ( Fig.11 The storage module is used to store the association relationship between the tunnel identifier and the label stack list.

[0148] Taking the device 1100 applied to the first node as an example, the receiving module 1101 is used to receive the first request message sent by the previous hop node (see Figure 4-10B, which will not be repeated here), the first request message is used to request to obtain the RSVP-TE label of the first node, the first request message includes the path information of the tunnel to be built, and the path information of the tunnel to be built is used to indicate the path of the tunnel to be built, wherein the previous hop node is the previous hop node of the first node on the path of the tunnel to be built, the first node supports RSVP-TE and segment routing traffic engineering SR-TE, and the previous hop node supports RSVP-TE. The processing module 1102 is used to establish an SR-TE tunnel from the first node to a second node of the at least one node when it is determined that at least one node in the downstream nodes of the first node on the path of the tunnel to be built supports SR-TE, and generate a tunnel identifier for identifying the SR-TE tunnel, wherein the first node is the ingress node of the SR-TE tunnel, and the second node is the egress node of the SR-TE tunnel; the sending module 1103 is used to send a first response message to the previous hop node, the first response message includes the tunnel identifier, and the tunnel identifier is used as the RSVP-TE label of the first node.

[0149] The embodiments of the present application can be applied in two scenarios:

[0150] In the first scenario, the second node is an egress node of the tunnel to be established, and the at least one node does not support RSVP-TE.

[0151] In the second scenario, among the at least one node, only the second node supports RSVP-TE, and the second node is an intermediate node of the tunnel to be established.

[0152] In any scenario, in a possible implementation manner, the processing module 1102, when establishing the SR-TE tunnel from the first node to the second node of the at least one node and generating a tunnel identifier for identifying the SR-TE tunnel, can be implemented in the following manner:

[0153] According to the path information of the tunnel to be built, at least one adjacency label corresponding to every two adjacent nodes in the SR-TE tunnel between the first node and the second node is obtained; according to the at least one adjacency label, a label stack list of the SR-TE tunnel is generated, and the tunnel identifier mapped to the label stack list is generated. And the association relationship between the tunnel identifier and the label stack list is saved in the storage module.

[0154] In the second scenario, in a possible implementation, the sending module 1103 is also used to send a second request message to the second node through the SR-TE tunnel before sending a first response message to the previous hop node, and the second request message is used to request to obtain the RSVP-TE label of the second node; the receiving module 1101 is also used to receive a second response message sent by the second node, and the second response message includes the RSVP-TE label of the second node.

[0155] In any scenario, in a possible implementation, the receiving module 1101 is also used to receive a message sent by the previous hop node, the message carrying the tunnel identifier; the processing module 1102 is also used to exchange the tunnel identifier in the message with the label stack list based on the association between the tunnel identifier and the label stack list; the sending module 1103 is also used to send the updated message to the next hop node of the first node in the tunnel to be built.

[0156] In the second scenario, in a possible implementation, when only the second node among the at least one node supports RSVP-TE and the second node is an intermediate node in the tunnel to be established, the processing module 1102 is further used to encapsulate the RSVP-TE label of the second node at the bottom of the label stack list in the message after exchanging the tunnel identifier in the message with the label stack list.

[0157] The present application embodiment also provides another structure of a network device, such as Fig.12 As shown, the network device 1200 may include a communication interface 1210 and a processor 1220. Optionally, the network device 120 may also include a memory 1230. The network device 1200 is a bonding node, such as Figure 4-10B The first node or node C described in the above. The memory 1230 may be arranged inside the network device or outside the network device 1200. Fig.11 The processing module 1102 shown in FIG. 1 can be implemented by the processor 1220. The receiving module 1101 and the sending module 1103 can be implemented by the communication interface 1210. The processor 1220 sends and receives messages or messages through the communication interface 1210, and is used to implement Figures 4 to 10B In the implementation process, each step of the processing flow can be completed by the hardware integrated logic circuit in the processor 1220 or the software instruction. Figures 4 to 10BThe method executed by the first node or node C described in the above. For the sake of brevity, it is not repeated here. The program code executed by the processor 1220 to implement the above method can be stored in the memory 1230. The memory 1230 is coupled to the processor 1220. The memory 1230 is also used to store the association relationship between the tunnel identifier and the label stack list.

[0158] The specific connection medium between the communication interface 1210, the processor 1220 and the memory 1230 is not limited in the embodiment of the present application. Fig.12 The memory 1230, the processor 1220 and the communication interface 1210 are connected via a bus. Fig.12 The connections between the other components are shown in bold lines, which are only for illustration and are not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.12 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0159] Based on the same inventive concept as the method embodiment, the present application embodiment also provides a device, see Fig.13 As shown, the device 1300 is applied to a network device, which may be a previous hop node of a bonding node between RSVP-TE and SR-TE, such as Figure 4 The previous hop node of the first node in the corresponding embodiment or Figure 5-10B In the corresponding embodiment, the node B, the device 1300 may be a processor in a network device, or a chip or a chip system, or a functional module, etc. The device 1300 may include a receiving module 1301, a processing module 1302, and a sending module 1303. The processing module 1302 is used to control and manage the actions of the device 1300, the receiving module 1301 is used to receive a request message or receive a message, the sending module 1303 is used to send a response message or send a message, and the processing module 1302 is used to process the request message or message received by the receiving module 1301. The processing module 1302 may also be used to indicate the network device (such as Figure 4-10B The processing process of the previous hop node of the first node or node B) and / or other processes of the technical solution described in this application.

[0160] The sending module 1303 is used to send a request message to the next hop node in the tunnel to be built, the request message is used to request to obtain the Resource Reservation Protocol Traffic Engineering RSVP-TE label of the next hop node, the request message includes the path information of the tunnel to be built, the path information of the tunnel to be built is used to indicate the path of the tunnel to be built, wherein the next hop node is the next hop node of the node on the path of the tunnel to be built, the node supports RSVP-TE, and the next hop node supports RSVP-TE and segment routing traffic engineering SR-TE; the receiving module 1301 is used to receive a response message sent by the next hop node, the response message includes a tunnel identifier as the RSVP-TE label of the node, and the tunnel identifier is used to identify the SR-TE tunnel established by the next hop node in the path of the tunnel to be built.

[0161] In a possible implementation, the processing module 1302 is used to carry the tunnel identifier as the RSVP-TE label of the next hop node in the message when the sending module 1303 sends the message to the next hop node; the sending module 1303 is also used to send the message carrying the tunnel identifier to the next hop node.

[0162] The present application embodiment also provides another structure of a network device, such as Fig.14 As shown, the network device 1400 may include a communication interface 1410 and a processor 1420. Optionally, the network device 140 may also include a memory 1430. The memory 1430 may be disposed inside the network device or outside the network device. Fig.13 The processing module 1302 shown in FIG. 1 can be implemented by the processor 1420. The receiving module 1301 and the sending module 1303 can be implemented by the communication interface 1410. The processor 1420 sends and receives messages or messages through the communication interface 1410, and is used to implement Figures 4 to 10B In the implementation process, each step of the processing flow can be completed by the hardware integrated logic circuit in the processor 1420 or the software form of instructions. Figure 4 to Figure 10B The method executed by the previous hop node or node B of the first node described in the above. For the sake of brevity, it is not repeated here. The program code executed by the processor 1420 to implement the above method can be stored in the memory 1430. The memory 1430 is coupled to the processor 1420.

[0163] Any communication interface involved in the embodiments of the present application may be a circuit, a bus, a transceiver, or any other device that can be used for information exchange. For example, the communication interface 1410 in the network device 1400, illustratively, the other device may be a device connected to the network device 1400, for example, the other device may be the previous hop node or the next hop node of the network device 1400, etc.

[0164] The processor involved in the embodiments of the present application may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0165] The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, modules or modules, which can be electrical, mechanical or other forms, and is used for information exchange between devices, modules or modules.

[0166] The processor 1420 may operate in conjunction with the memory 1430. The memory 1430 may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), or a volatile memory (volatile memory), such as a random-access memory (RAM). The memory 1430 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0167] The specific connection medium between the communication interface 1410, the processor 1420 and the memory 1430 is not limited in the embodiment of the present application. Fig.14 The memory 1430, the processor 1420 and the communication interface 1410 are connected via a bus. Fig.14 The connections between the other components are shown in bold lines, which are only for illustration and are not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.14 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0168] Based on the above embodiments, the embodiments of the present application further provide a computer storage medium, in which a software program is stored, and when the software program is read and executed by one or more processors, the method provided in any one or more of the above embodiments can be implemented. The computer storage medium may include: a USB flash drive, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk or an optical disk, and other media that can store program codes.

[0169] Based on the above embodiments, the present application also provides a chip, which includes a processor, for implementing the functions involved in any one or more of the above embodiments, such as for implementing Figure 4-10B The method executed by the first node or node C in the embodiment, or for implementing Figure 4-10B The method is performed by the previous hop node or node B of the first node in the process. Optionally, the chip also includes a memory, and the memory is used for the necessary program instructions and data executed by the processor. The chip can be composed of a chip, or it can include a chip and other discrete devices.

[0170] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0171] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0172] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1A function specified in one or more boxes.

[0173] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0174] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A tunnel establishment method, characterized in that: include: A first network device sends a first request message to a second network device through a segment routing traffic engineering SR-TE tunnel, where the first request message is used to request to obtain a resource reservation protocol traffic engineering RSVP-TE label of the second network device; wherein the first network device is an ingress network device of the SR-TE tunnel, the second network device is an egress network device of the SR-TE tunnel, the SR-TE tunnel further includes at least one network device between the first network device and the second network device, and the at least one network device does not support resource reservation protocol traffic engineering RSVP-TE; The first network device receives a first response message, where the first response message includes the RSVP-TE label of the second network device.

2. The method according to claim 1, characterized in that: Before the first network device sends a first request message to the second network device through the SR-TE tunnel, the method further includes: the first network device receives a second request message sent by a previous-hop network device, the second request message is used to request to obtain an RSVP-TE label of the first network device, the second request message includes path information of the tunnel to be built, the path information of the tunnel to be built is used to indicate the path of the tunnel to be built, wherein the previous-hop network device is the previous-hop network device of the first network device on the path of the tunnel to be built, the first network device supports RSVP-TE and segment routing traffic engineering SR-TE, and the previous-hop network device supports RSVP-TE; When the first network device determines that at least one of the downstream network devices of the first network device on the path of the to-be-established tunnel supports SR-TE, establish an SR-TE tunnel from the first network device to the second network device, and generate a tunnel identifier for identifying the SR-TE tunnel; The first network device sends a second response message to the previous-hop network device, where the second response message includes the tunnel identifier, and the tunnel identifier is used as an RSVP-TE label of the first network device.

3. The method according to claim 2, characterized in that The establishing the SR-TE tunnel from the first network device to the second network device, and generating a tunnel identifier for identifying the SR-TE tunnel, includes: The first network device acquires, according to the path information of the tunnel to be established, at least one adjacency label corresponding to every two adjacent nodes in the SR-TE tunnel between the first network device and the second network device; The first network device generates a label stack list of the SR-TE tunnel according to the at least one adjacency label, and generates the tunnel identifier mapped to the label stack list; The first network device stores an association relationship between the tunnel identifier and the label stack list.

4. The method according to claim 3, characterized in that The method further comprises: The first network device receives a message sent by the previous-hop network device, wherein the message carries the tunnel identifier; The first network device exchanges the tunnel identifier in the message with the label stack list according to the association relationship between the tunnel identifier and the label stack list, and sends the updated message to a next-hop network device of the first network device in the tunnel to be established.

5. The method according to claim 4, characterized in that After the first network device exchanges the tunnel identifier in the message with the label stack list, the method further includes: The first network device encapsulates the RSVP-TE label of the second network device at the bottom of the label stack list in the message.

6. The method according to any one of claims 2 to 5, characterized in that: The first request message includes the path information of the tunnel to be established, and the first request message includes the address of the first network device.

7. A tunnel establishment method, characterized in that: include: The second network device receives a first request message sent by the first network device through the segment routing traffic engineering SR-TE tunnel, where the first request message is used to request to obtain a resource reservation protocol traffic engineering RSVP-TE label of the second network device; wherein the first network device is an ingress network device of the SR-TE tunnel, the second network device is an egress network device of the SR-TE tunnel, the SR-TE tunnel further includes at least one network device between the first network device and the second network device, and the at least one network device does not support resource reservation protocol traffic engineering RSVP-TE; The second network device sends a first response message, where the first response message includes the RSVP-TE label of the second network device.

8. The method according to claim 7, characterized in that The first request message includes path information of the tunnel to be built, where the path information of the tunnel to be built is used to indicate the path of the tunnel to be built, the path of the tunnel to be built includes the SR-TE tunnel, and the first request message includes the address of the first network device.

9. The method according to claim 8, characterized in that The method further comprises: The second network device sends a third request message to the next-hop network device on the tunnel to be established, where the third request message is used to request the RSVP-TE label of the next-hop network device. The third request message includes the path information of the tunnel to be established, and the third request message includes the address of the second network device.

10. The method according to claim 9, characterized in that The method further comprises: The second network device receives a third response message sent by the next-hop network device, where the third response message includes an RSVP-TE label of the next-hop network device.

11. A network device, characterized in that: include: Processor and memory; The memory is used to store a software program, and the processor is used to read the software program stored in the memory, so that the network device executes the method according to any one of claims 1 to 6.

12. A network device, characterized in that: include: Processor and memory; The memory is used to store software programs, and the processor is used to read the software programs stored in the memory, so that the network device executes the method according to any one of claims 7 to 10.

13. A tunnel establishment system, characterized in that: The method comprises a first network device and a second network device, wherein the first network device is used to execute the method according to any one of claims 1 to 6, and the second network device is used to execute the method according to any one of claims 7 to 10.

14. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a software program, which can implement the method of any one of claims 1 to 10 when read and executed by one or more processors.

Images