WO2017193733A1 - Route propagation method, and node - Google Patents

Abstract

The application provides a route propagation method, and a node. The method comprises: a first node receives first identification information propagated by a second node and used to indicate a global label domain that the second node belongs to; and the first node propagates to the second node and according to a matching result of the first identification information and second identification information, a mapping relationship between a target route and a label corresponding to the target route, wherein the second identification information is used to indicate a global label domain that the first node belongs to, and the target route is a route from the first node to the second node. Therefore, the embodiment can automatically prevent the mapping relationship between the route and the global label thereof from being propagated to a node outside the global label domains of the first and second nodes, preventing label conflict or an unnecessary false response of an external node.

Description

Route dissemination method and node

The present application claims priority to Chinese Patent Application No. Serial No. No. No. No. No. No. No. No. No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No

Technical field

The embodiments of the present invention relate to the field of network communication technologies, and in particular, to a method and a node for route distribution.

Background technique

The globality of the global label is limited to the network domain where the application global label is deployed, and only the global label is unique within the network domain. In the forwarding path of the global label, the label is not exchanged or the label and the inbound label are exactly the same when the label is exchanged. However, the network domain where the global label is applied may be a subset of the Multi-Protocol Label Switching (MPLS) network. Therefore, you need to consider the global label and the local label. The problem of docking.

In the prior art, when a traditional label switching path ("LSP") is connected to a global label forwarding path, only the rules for requesting a global label are required to be configured on the forwarding node. Seamlessly interface with the global label forwarding path. However, when the global label forwarding path is connected to the LSP, the configuration needs to identify which forwarding nodes are configured with the Segment Routing Mapping Server (SRMS), and configure the global label to local label mapping on the SRMS. rule.

It can be seen that the prior art relies on the static configuration to identify the edge node of the network domain where the application global label is deployed, which is not flexible and automatic, and may cause the forwarding node to get an error response or cause a label conflict of the neighbor node of the forwarding node.

Summary of the invention

The present application provides a method and a node for route distribution, and the forwarding node can automatically identify whether the neighbor node of the dynamic routing protocol relative to the downstream is an edge node of the network domain where the global label is applied, and can avoid the mapping between the route and the global label. Spread to nodes outside the network domain to avoid label conflicts or unnecessary error responses from these external nodes.

In order to facilitate the understanding of the embodiments of the present application, several elements introduced in the description of the embodiments of the present application are first introduced herein.

A local label that uniquely identifies a service (for example, an IP prefix) and takes effect on a node (device, including a virtual device).

Global tag: A tag that uniquely identifies a service in a network of an administrative domain and can take effect on multiple nodes (devices) of the network.

Global label domain, which deploys networks that apply global labels. Global labels can be advertised between nodes in the global label domain, and local labels that are valid only locally on the node can be advertised.

A global label application policy is a policy for assigning global labels to specified routes.

Dynamic routing protocol: According to whether it is used within an autonomous domain, the dynamic routing protocol is divided into an Interior Gateway Protocol ("IGP") and an Exterior Gateway Protocol ("EGP"). An autonomous system (AS) refers to a network with a unified management organization and a unified routing policy. The routing protocol adopted within the autonomous domain is called the internal gateway protocol. The Routing Information Protocol (RIP) and the Open Shortest Path First (OSPF) are used. The external gateway protocol is mainly used for routing between multiple autonomous domains. Select, commonly used is the Border Gateway Protocol ("BGP") and BGP-4.

Disseminate, an operation in which a node in a network sends a message to another node, where the message includes but is not limited to: a mapping relationship between a route, a route, and a label, an identifier information of a global label domain where the node is located, a BGP update message, Link state protocol in Link-State-Advertisement (LSA) message and Intermediate System to Intermediate System (IS-IS) protocol in OSPF Link State Protocol Data Unit ("LSP"). In describing a particular embodiment, the dissemination can be replaced with words such as posting, sending, advertising, and the like.

In a first aspect, a method for routing a route is provided, including: receiving, by a first node, first identifier information that is generated by a second node, where the first identifier information is used to identify a global label domain to which the second node belongs; And the node, according to the matching result of the first identifier information and the second identifier information, the mapping relationship between the target route and the label corresponding to the target route is generated to the second node, where the second identifier information is used to identify the first The global label domain to which the node belongs. The destination route is the route from the first node to the second node.

In the embodiment of the present application, the node may be, but not limited to, a router and a switch.

Optionally, the identifier information of the global label domain may be a router ID of the controller node of the global label domain, or other globally unique ID value, which is not limited in this application.

Correspondingly, when the first node receives the ID sent by the second node, it confirms whether the received ID is the same as the ID of the global label domain to which it belongs. If the same, the second node and the first node belong to the same global label. The domain, that is, the first node is not an edge node of the global label domain, and the first node may distribute the mapping relationship between the received route and the global label to the second node. If the ID sent by the second node received by the first node is different from the ID of the global tag field to which the first node belongs or the first node does not receive the ID advertised by the second node, the first node and the second node are considered to be different. The global label field, or the edge node of the global label field to which the first node belongs. The first node disseminates a mapping relationship between the route and the local label to the second node, and the local label is valid locally at the first node.

Therefore, in the method of route distribution in the embodiment of the present application, the node determines the type of the label to be distributed to the neighbor node by the matching result of the identifier information of the global label domain to which the node belongs and the identification information of the global label domain to which the neighbor node of the node belongs. There is no need to manually configure the edge nodes of the global label domain network, and the mapping between the routing and the global label can be automatically prevented from spreading to the nodes outside the global label domain network to which the node belongs, so as to avoid label conflicts or unnecessary of these external nodes. The error response.

In conjunction with the first aspect, in a first possible implementation manner of the first aspect, before the mapping, by the first node, the mapping of the target route and the label corresponding to the target to the target node, the method further includes: The first node acquires the target route; the first node allocates or applies a label for the target route.

In conjunction with the first possible implementation of the first aspect, in a second possible implementation manner of the first aspect, the first node allocates or applies a label to the target route, including: if the target route hits the first a routing policy of the global label that is deployed on the node, the first node requests a label for the target route from the control node in the global label domain to which the first node belongs; the first node receives the target route sent by the control node The first tag is allocated, and the first tag is valid in the global tag domain to which the first node belongs.

The first node, according to the matching result of the first identifier information and the second identifier information, the mapping relationship between the target route and the label corresponding to the target route is generated to the second node, including: if the first node determines The first identifier The information is matched with the identifier of the second identifier information, and the first node distributes the mapping relationship between the target route and the first label to the second node; and/or, if the first node determines the first identifier information and The second identifier information does not match, and the first node distributes the mapping relationship between the target route and the second label to the second node, where the second label is valid locally at the first node.

The first identifier information and the second identifier information are matched. The global label field identified by the first identifier information and the global label field identified by the second identifier information are the same global label domain, and the first identifier information and the second identifier information are not. The matching may be understood as the global label field identified by the first identification information and the global label domain identified by the second identification information is not the same global label domain. Optionally, the first identifier information and the second identifier information are matched. The global label domain ID identified by the first identifier information is the same as the global label domain ID of the second identifier information, and the first identifier information and the second identifier information. The mismatch can be understood as the difference between the global tag domain ID identified by the first identity information and the global tag domain ID identified by the second identity information.

Optionally, if the first node is configured with the global label allocated for the target route, or the control node of the global label domain to which the first node belongs has sent the global label corresponding to the target route to the first node, A node directly assigns a global label corresponding to the target route to the target route, and obtains a mapping relationship between the target route and the global label, and does not need to apply to the control node again.

It should be noted that, when the first node receives the mapping relationship between the target route and the label advertised by the other node, if the first node determines that the valid range of the label is the global label domain to which the first node belongs, the first node does not Assigning a local label to the target route, the first node assigning a label to the target route at this time can be understood as the first node assigning the received label to the target route.

Therefore, the method for the route distribution in the embodiment of the present invention does not need to configure the mapping rule between the global label and the local label, and the node can automatically implement the docking between the global label forwarding path and the traditional label switching path.

In conjunction with the first possible implementation of the first aspect, in a third possible implementation manner of the first aspect, the first node allocates or applies a label to the target route, including: if the target route meets the following conditions ( 1) or (2), the first node assigns a third label to the target route, wherein the third label is valid locally at the first node: (1) the target route does not hit the deployment on the first node The routing policy of the global label is applied, and the global label that is not allocated for the target routing is not configured on the first node, and (2) the routing policy for applying the global label is not deployed on the first node, and the target is not pre-defined on the first node. Global label for route assignment;

The first node, according to the matching result of the first identifier information and the second identifier information, the mapping relationship between the target route and the label corresponding to the target route is distributed to the second node, including: the first node The second node spreads the mapping relationship between the target route and the third label.

Therefore, the method for the route distribution in the embodiment of the present invention does not need to configure the mapping rule between the global label and the local label, and the node can automatically implement the docking between the global label forwarding path and the traditional label switching path.

With reference to any possible implementation of the first to third possible implementation manners of the first aspect, in a fourth possible implementation manner of the first aspect, the first node acquires the target route, including: The first node receives a mapping relationship between the target route and the fourth label that is distributed by the third node, where the fourth label is a label that the third node allocates or applies for the target route;

The first node allocates or applies a label to the target route, including: the first node determines a valid range of the fourth label; if the valid range of the fourth label is not a global label field to which the first node belongs, The first node assigns or applies a label to the target route.

In other words, after receiving the mapping relationship between the route and the label, the first node determines the mapping relationship message. The valid range of the label in the middle is the global label field to which the first node belongs. If the valid range of the label is not the global label field to which the first node belongs, the first node needs to allocate or apply a label for the route in the received route and label mapping relationship; if the valid range of the label is the first The global label field to which the node belongs, indicating that the node that broadcasts the mapping relationship message belongs to the same global label domain as the first node, and the first node maintains the mapping relationship between the received route and the label, and the received route and label are received. The mapping relationship is added to the routing and global label mapping relationship table in the first node.

It can be understood that, in the embodiment of the present application, if the upstream and downstream forwarding nodes of the forwarding node that belong to a certain global label domain do not belong to the global label domain, on the forwarding node, for a hit on the forwarding node, the deployment is performed. When a routing policy that requests a global label or a route that has been assigned a global label, a mapping table of the local label to the global label of the upstream node and a mapping table of the global label to the newly allocated label of the local label appear at the same time, so that the label formed by the actual iteration The inbound label of the forwarding table is the newly assigned label of the local, and the outgoing label is the local label advertised by the upstream forwarding node, and does not contain the information of the global label.

Optionally, the mapping relationship message that is transmitted by the third node further includes a label type indication information, where the label type indication information indicates whether the valid range of the label in the mapping relationship message is a global label field to which the first node belongs; The first node determines the valid range of the label according to the label type indication information.

In the embodiment of the present application, optionally, the acquiring, by the first node, the target route may include: the first node generates the target route, or the first node receives a customer edge (Customer Edge, referred to as “CE”) The target route sent by the node. Alternatively, it may be described that the first node generates a target route that is locally originated as a destination or learns to a target route without a label mapping relationship.

With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, the first node determines a valid range of the fourth label, including: the first node receives the third The third identifier information that is generated by the node, the third identifier information is used to identify the global label domain to which the third node belongs; the first node determines the fourth according to the matching result of the second identifier information and the third identifier information The valid range of the label.

With reference to the fifth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the first node determines, according to a matching result of the second identifier information and the third identifier information, The valid range of four tags, including:

If the first node determines that the second identifier information matches the third identifier information, the first node determines the fourth label according to the relationship between the fourth label and the range of the global label address pool of the first node. effective coverage.

Specifically, if the first node determines that the second identifier information matches the third identifier information, the first node and the first node belong to the same global label domain, and the first node determines whether the fourth label is in the first node. The range of the global label address pool is the range of labels that the first node itself can assign to the route. If the first node is not in the global label address pool, the valid range of the fourth label is The global label field to which the first node belongs, otherwise the valid range of the fourth label is considered to be the third node local, that is, the fourth label is the local label of the third node.

Or, if the first node does not receive the identifier information that is used by the third node to identify the global label domain to which the third node belongs, the first node considers that the third node does not belong to the same global label domain, or The third node is not a node of the global label domain, and the first node may directly determine that the fourth label is a local label whose valid range is local to the third node.

With reference to the first aspect, or any one of the first to the sixth possible implementation manners of the first aspect, in a seventh possible implementation manner of the first aspect, the first node receives the second First identification information distributed by the node, the package The first node receives the border gateway protocol BGP update message that is sent by the second node, and the BGP update message carries the first identifier information; or the first node receives the open shortest path priority that is broadcast by the second node. The link state of the OSPF protocol advertises the LSA message, where the LSA message carries the first identifier information; or the first node receives the link state protocol data unit of the intermediate system distributed by the second node to the intermediate system IS-IS protocol The LSP carries the first identification information.

Optionally, the LSP carries a type length value TLV option, where the TLV option carries the first identifier information.

In a second aspect, a node is provided, comprising: a method for performing the first aspect or any of the possible implementations of the first aspect. In particular, the node comprises means for performing the method of any of the above-described first aspect or any of the possible implementations of the first aspect.

In a third aspect, a node is provided, including: a processor, a memory, a receiver, and a transmitter, the processor, the memory, the receiver, and the transmitter are connected by a bus system, and the memory is configured to store an instruction, where The processor is operative to execute instructions stored in the memory to control the receiver to receive information or the transmitter to transmit information such that the node performs the method of any of the first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, a computer readable medium is provided for storing a computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.

According to a fifth aspect, a network system is provided, where the network system includes a first node and a second node, where the first node is configured to receive first identifier information that is sent by the second node, where the first identifier information is used to identify Describe a global label field to which the second node belongs;

The first node is configured to: according to the matching result of the first identifier information and the second identifier information, distribute a mapping relationship between the target route and a label corresponding to the target route to the second node, where the second identifier information The global label domain to which the first node belongs is used, and the target route is a route from the first node to the second node.

The above alternatives apply to all aspects from the first aspect to the fifth aspect.

DRAWINGS

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings to be used in the embodiments or the prior art description will be briefly described below. Obviously, the drawings in the following description are only some of the present application. For the embodiments, other drawings may be obtained from those skilled in the art without any inventive labor.

1(a)-(c) are schematic diagrams of application scenarios of the present application;

2 is a schematic flowchart of a method for route distribution according to an embodiment of the present application;

FIG. 3 is a schematic diagram of a route distribution method according to another embodiment of the present application; FIG.

4 is a schematic block diagram of a node in accordance with an embodiment of the present application;

FIG. 5 is another schematic block diagram of a node according to an embodiment of the present application; FIG.

FIG. 6 is a schematic block diagram of a node according to another embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are a part of the embodiments of the present invention, but not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without departing from the inventive scope are the scope of the present invention.

1(a)-(c) are schematic views of a scenario to which an embodiment of the present invention is applied. As shown in Figure 1(a), the global label domain covers multiple Autonomous System (AS) 1 and AS2, and the Autonomous System Boundary Router (ASBR). 1 and ASBR4 are edge nodes of the global label domain, and ASBR2 and ASBR3 are not edge nodes of the global label domain.

In Figure 1(b), the global label field covers the AS6 of the single dynamic routing protocol. ASBR1 and ASBR2 are the edge nodes of the global label domain. ASBR2 needs to terminate the global label forwarding path from ASBR1 to ASBR2. The local tag that was advertised and valid locally in ASBR3. The Border Gateway Protocol (BGP) is used between ASBR1 and ASBR2. BGP runs between ASBR3 and ASBR4.

In Figure 1(c), the global label field covers a single dynamic routing protocol autonomous domain. ASBR1 and ASBR2 are edge nodes of the global label domain 1, and belong to AS1. BGP runs between ASBR1 and ASBR2. ASBR3 and ASBR4 are edge nodes of global label domain 2 and belong to AS2. BGP runs between ASBR3 and ASBR4. The ASBR2 needs to terminate the global label forwarding path from ASBR1 to ASBR2, and replace the local label with the local label valid in ASBR3. ASBR3 can re-drive the traffic to a new global label forwarding path.

2 is a schematic flowchart of a method for route spreading according to an embodiment of the present invention. As shown in FIG. 2, the method 100 includes:

S110. The first node receives the first identifier information that is sent by the second node, where the first identifier information is used to identify the global label domain to which the second node belongs.

In the embodiment of the present invention, after the node joins the global label domain according to the signaling or the configuration, the node advertises the identifier of the global label domain that the user joins to the node's own internal gateway protocol ("IGP") or the BGP neighbor. ID information, and the ID of the global tag field to which the neighbor node is advertised by the neighbor node is saved. The global tag domain ID information may be set to an invalid value indicating that the node advertising the global tag domain ID information does not join the global tag domain.

As shown in Figure 3, in Figure 3, forwarding nodes A, B, C, and E join the global label domain, forwarding nodes A, B, and C belong to AS1, forwarding nodes E and D belong to AS2, and forwarding nodes F, G, and H belong to AS3. . A global label application policy matching 192.0.3.1/32 is deployed on the forwarding node A. That is, the forwarding node A allocates a global label to match the IP prefix of 192.0.3.1/32; and deploys a global matching match of 192.0.4.1/32 on the forwarding node E. The label application policy, that is, the forwarding node E assigns a global label to the IP prefix matching the 192.0.4.1/32. An IBGP (internal BGP) connection is established between the forwarding nodes in the autonomous domain, and an EBGP (external BGP) connection is established between the adjacent forwarding nodes in the inter-domain.

The dotted line in FIG. 3 indicates the process of advertising the mapping between the route corresponding to the local loopback interface address 192.3.3.1/32 of the customer edge (Customer Edge ("CE") node 1 and the label bound to the route. The specific notification process shown by the dotted line in FIG. 3 is: CE1 advertises the route corresponding to 192.0.3.1/32 to node A, and node A requests the control node for the route (corresponding to number 1 in FIG. 3) and receives The label sent by the control node for the route (corresponding to the number 2 in FIG. 3); the node A notifies the node C of the mapping relationship between the route and the label (corresponding to the number 3 in FIG. 3); the node C receives the node A. After the advertised mapping relationship is advertised, the mapping relationship is advertised to the node E (corresponding to the number 4 in FIG. 3). After receiving the mapping relationship advertised by the node C, the node E re-assigns the label to the node G and sends the label to the node G. Notifying the mapping relationship between the route and the re-allocated label of the node C (corresponding to the number 5 in FIG. 3); after receiving the mapping relationship advertised by the node E, the node G re-assigns the label to the route and advertises the route to the node H. Reassigned with node G Signed mapping relation (corresponding to FIG. 3 No. 6); Node H advertises the route to CE2.

The dotted line in FIG. 3 indicates the notification process of the mapping between the route corresponding to the loopback interface address 192.0.4.1/32 of CE2 and the label bound to the route. The specific notification process will be specifically described below.

After the forwarding node A joins the global label domain in Figure 3, the BGP update message may carry the newly defined Path Attribute or the newly defined Extended Communities Attribute to the BGP neighbor node of the forwarding node A (below Also referred to as "BGP Peer", the forwarding node B, C advertises the ID information of the global label field that it joins, and saves the ID of the global label field to which the forwarding node B, C advertises, and the forwarding node B, C belong. The newly defined path attribute or the newly defined extended team attribute carries the ID information of the global label field added by the forwarding node that sends the attribute. If the ID of the global label field is an invalid value, it indicates that the path attribute or the new definition carrying the new definition is sent. The forwarding node of the BGP update message that extends the team attribute does not join the global tag field. The forwarding node E in the same AS2 can determine that the forwarding node C in AS1 belongs to the same global label domain according to the ID information of the global label domain joined by the forwarding node C advertised by the forwarding node C, and the forwarding node D in AS2 The forwarding nodes F, G, and H in AS3 do not belong to the global label domain. The forwarding node G does not join the global label field, and may not notify the E, F, and H of the ID information of the global label field to which it belongs, but may receive the ID information of the global label field to which the forwarding node E to which the forwarding node E belongs.

Optionally, as an example, a global label field attribute (Global-Label-Domain-Attribute) may be newly defined in the Path Attribute, and the Global-Label-Domain-Attribute carries the ID information of the global label field, and the Path Attribute The reference format is shown in Table 1.

Table 1

The definition of the attributes (Flags) field can be referred to the Request For Comments (RFC) 1267.

The Type field defines the type of the tag as a global tag. This attribute is optional and non-transitive.

Length field indicating the length of the global label.

The global tag domain ID (GLD_ID) indicates the ID of the global tag domain, and the ID of the global tag domain is unique throughout the global tag domain.

Optionally, as an example, a Global-Label-Domain-Attribute attribute may be newly defined in the Extended Communities Attribute, and the reference format of the Extended Communities Attribute is as shown in Table 2.

Table 2

The global tag domain ID (GLD_ID) indicates the ID of the global tag domain, and the ID of the global tag domain is unique throughout the global tag domain.

Further, when the method in the embodiment of the present invention is applied to the global label domain partially covering a single AS, the forwarding node may define a new chain in the OSPF protocol when advertising the ID information of the global label domain to which the forwarding node belongs. Link state ("LS") type: Global-Label Domain-Link-State-Advertisement (GLDLSA), which carries the ID of the global tag domain. The forwarding node advertises a GLD-LSA message to its neighboring node, and the neighboring node that receives the GLD-LSA message can obtain the ID information of the global label domain to which the forwarding node belongs from the GLD-LSA message. For example, GLD The reference format of the -LSA is shown in Table 3.

table 3

The definition of the LSA Header refers to RFC 2328. The value of "LS Type" in the LSA Header is To Be Determined ("TBD").

A global tag domain ID (GLD_ID) indicating the ID of the global tag domain whose ID is unique throughout the global tag domain.

Further, a new Type-Length-Value ("TLV") can be defined in the Intermediate System to Intermediate System (IS-IS) protocol. Option, the Type in the TLV option indicates the global tag domain attribute, this attribute is optional, the Length field indicates the length of the GLD_ID, the GLD_ID indicates the ID of the global tag field, and the ID of the global tag field is unique in the entire global tag field. The forwarding node may carry the new TLV option in a Link State Protocol Data Unit (LSP), and the forwarding node that receives the LSP sent by the forwarding node may learn the LSP according to the LSP. ID of the global tag domain to which the forwarding node belongs. For example, the reference format of the TLV can be as shown in Table 4.

Table 4

S120. The first node, according to the matching result of the first identifier information and the second identifier information, distributes, to the second node, a mapping relationship between the target route and a label corresponding to the target route, where the second identifier information is used. And identifying the global label domain to which the first node belongs, the target route is a route from the first node to the second node.

Optionally, the first node may generate the first node as a source node, use the second node as a destination route of the destination node, or learn the target route from the first node to the second node without a label mapping relationship. . The first node then checks whether the target route hits the global label application policy deployed locally by the first node. If the target route hits the global label application policy deployed locally by the first node, the first node may apply for a global label to the control node of the global label domain to which the first node belongs. Or, if the first node has a global label locally, the first node allocates the existing global label to the target route, and forms a mapping relationship between the target route and the global label. If the target route does not hit the global label application policy deployed locally by the first node and the first node does not have a global label corresponding to the target route, the first node allocates a local label to the target route to form a target route and The mapping relationship of local tags.

For example, in FIG. 3, the forwarding node A learns that the customer edge (Customer Edge ("CE") node 1 is advertised by BGP or locally configured route 192.0.3.1/32. Because the route 192.0.3.1/32 hits the global label application policy of the local deployment of the forwarding node A, the forwarding node A applies the global label to the control node of the global label domain to which the forwarding node A belongs for the route 192.0.3.1/32.

Specifically, the forwarding node A sends the request information carrying the route (192.0.3.1/31) to which the global label is to be applied to the control node. The request information may further include a virtual routing forwarding (Virtual Routing Forwarding, referred to as "VRF" information. The control node responds to the request information of the forwarding node A, and allocates a global route for the forwarding node A (192.0.3.1/31). Label Lable1, and send a mapping relationship between the route 192.0.3.1/31 and the Lable 1 to the forwarding node A. The protocol for the forwarding node A to interact with the control node may be an extended BGP or RESTConf protocol, or may be other protocols. The invention is not limited thereto.

Optionally, the forwarding node A may further send the label range of the forwarding node A to the control node, so that the control node allocates the global label to the forwarding node A within the label range of the forwarding node A.

In the embodiment of the present invention, before the forwarding node advertises a mapping relationship between the route and the label to the neighboring node of the forwarding node, the forwarding node determines whether the label is a global label. If the forwarding node determines that the label is a global label, the forwarding node advertises a route to the neighboring node of the forwarding node according to the identifier of the global label domain to which the neighboring node of the forwarding node belongs and the identifier of the global label domain to which the forwarding node belongs. The mapping relationship with the label. If the forwarding node determines that the label is not a global label, the forwarding node directly advertises the mapping relationship between the route and the label to the neighboring node of the forwarding node.

For example, in FIG. 3, the forwarding node A obtains the mapping relationship between 192.0.3.1/32 and the global label Label 1, and checks the ID of the global label domain to which the own BGP Peer forwarding node belongs, and the forwarding node A determines the forwarding node C. The forwarding node A and the forwarding node A belong to the same global label domain, and the forwarding node A advertises the mapping relationship between 192.0.3.1/32 and Label 1 to the forwarding node C through BGP. Optionally, the forwarding node A can also notify the forwarding node C of the mapping relationship between 192.0.3.1/32 and Label 1 through a Label Distribution Protocol ("LDP") session. Specifically, the forwarding node A advertises a label mapping message to the forwarding node C. The label field in the universal label TLV in the label mapping message includes a global label flag, where the global label flag is used to indicate the label in the advertised mapping relationship. Whether it is a global label. For example, the highest bit of the 32Bit tag field may be defined as a global tag flag bit. When the value of the flag bit is 1, the tag in the mapping relationship is a global tag. When the value of the flag bit is 0, the mapping relationship is The label is a local label.

In FIG. 3, the forwarding node B determines that the forwarding node E and the forwarding node B belong to the same global label domain according to the ID of the global label domain to which the forwarding node E advertised by the forwarding node E belongs, so the forwarding node B adopts the same same as the forwarding node A. The method notifies the forwarding node E of the mapping relationship between 192.0.3.1/32 and Label 1.

After the forwarding node E receives the mapping relationship between 192.0.1.3/32 and Label 1 advertised by the forwarding node B, the forwarding node E determines the forwarding node B and the forwarding node according to the ID of the global label domain to which the forwarding node B advertised by the forwarding node B belongs. E belongs to the same global label field, so the forwarding node E directly adds the mapping relationship between 192.0.3.1/32 and Label 1 in the forwarding node E, and the forwarding node E does not receive the global label to which the forwarding node G advertised by the forwarding node G belongs. The ID of the domain, whereby the forwarding node E determines that the forwarding node G and the forwarding node E are not in the same global label domain, so the forwarding node E obtains the local label Label 2 from the local label resource pool local to the forwarding node E, and The forwarding node G advertises the mapping relationship between 192.0.3.1/32 and Label 2.

Moreover, since the forwarding node G does not belong to the global label domain, the forwarding node G obtains the local label Label 3 from the local label resource pool of the forwarding node G, and advertises the mapping of 192.0.3.1/32 and Label 3 to the forwarding node H through BGP. relationship.

The forwarding path of the traffic from CE2 with IP address 192.0.4.1 to CE1 with IP address 192.0.3.1 is: CE2->H->G->E->C->A->CE1, The label forwarding table along the way is CE2->(Input:192.0.3.1)H(Output:Label 3)->G(Output:Label 2)->E(Output:Label 1)->C(Output:Label 1) -> A (Output: 192.0.3.1) -> CE1, where H->G->E is a legacy LSP, the label is switched point by point to the forwarding node; E->C->A is the global label forwarding path.

Referring to FIG. 3, a specific process of the method for routing the route of the embodiment of the present invention will be described by taking the advertised process of the mapping relationship between the 192.0.4.1/32 and the label bound to the route 190.4.4.1.32 as an example.

Specifically, after the forwarding node H in FIG. 3 receives the route 192.0.4.1/32 advertised by the CE2 or locally configured, because the forwarding node H does not join the global label domain, the forwarding node H allocates the route 192.0.4.1/32. A local label Label 4. And advertise the route to the forwarding node G through the BGP to the forwarding node G. 192.0.4.1/32, and advertise the mapping between the 192.0.4.1/32 and the label 4 to the forwarding node G through LDP. Optionally, the forwarding node H can also forward the node G through BGP. The mapping relationship between the route 190.4.4.1/32 and Label 4 is notified (corresponding to the number I in Figure 3).

When the forwarding node G receives the mapping relationship between the route 190.4.1.3/32 and the Label 4 advertised by the forwarding node H, since the forwarding node G is not in the global label domain, the forwarding node G assigns the local label Label 5 to the route 192.4.4.1/32. The mapping relationship between the route 190.4.4.1/32 and the Label 5 is notified to the forwarding node E through BGP (corresponding to the number II in FIG. 3).

After the forwarding node E receives the mapping relationship between the forwarding node G and the route 190.4.4.1/32 and Label 5, the forwarding node E The forwarding node G and the forwarding node E do not belong to the same global label domain, so the Label 5 advertised by the forwarding node G is not a global label. However, the forwarding node E checks that the route 190.4.4.1/32 hits the global label application policy deployed locally by the forwarding node E. Therefore, the forwarding node E requests the control node of the global label domain to which the forwarding node E belongs to apply for the global correspondence corresponding to the 192.0.4.1/32. Label (corresponding to number III in Figure 3). The control node of the global label field assigns the global label Label 6 to the route 192.0.4.1/32, and sends the global label Label 6 assigned to the route 192.4.4.1/32 to the forwarding node E (corresponding to the number IV in FIG. 3).

The forwarding node E determines that the forwarding node C and the forwarding node E belong to the same global label domain according to the ID of the global label domain to which the forwarding node C advertised by the forwarding node C belongs, whereby the forwarding node E directly advertises the route to the forwarding node C through BGP 192.0. The mapping relationship between 4.1/32 and Label 6 (corresponding to the number V in Figure 3).

Similarly, the forwarding node C determines that the forwarding node C and the forwarding node A belong to the same global label domain according to the ID of the global label domain to which the forwarding node A advertised by the forwarding node A belongs. Therefore, the forwarding node C directly advertises the route to the forwarding node A through BGP. The mapping relationship between 192.0.4.1/32 and Label 6 (corresponding to the number VI in Figure 3).

According to the above procedure, the forwarding path of the traffic from CE1 with the IP address of 192.0.3.1 to the IP address of 192.0.4.1 is CE1->A->C->E->G->H->CE2. The label forwarding table is CE1->(Input:192.0.4.1)A(Output:Label 6)->C(Output:Label 6)->E(Output:Label 5)->G(Output:Label 4)- >A(Output:192.0.3.1)->CE2, where A->E->C is the global label forwarding path, E->G->H is the traditional LSP, and the label is switched point by point to the forwarding node.

The method of route spreading according to an embodiment of the present invention is described in detail above with reference to FIGS. 2 and 3. Hereinafter, a node according to an embodiment of the present invention will be described in detail with reference to FIGS. 4 and 5. As shown in FIG. 4, the node 10 includes:

The receiving unit 11 is configured to receive first identifier information that is generated by the second node, where the first identifier information is used to identify a global label domain to which the second node belongs;

The sending unit 12 is configured to: according to the matching result of the first identifier information and the second identifier information, distribute a mapping relationship between the target route and a label corresponding to the target route to the second node, where the second identifier information is used by To identify the global tag domain to which the node belongs, the target route is the route of the node to the second node.

Therefore, the node of the embodiment of the present invention determines the type of the label to be transmitted to the neighbor node by the matching result of the identifier information of the global label domain to which the node belongs and the identifier information of the global label domain to which the neighbor node belongs. The edge nodes of the domain network are manually configured to automatically prevent the mapping between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, so as to avoid label conflicts or unnecessary error responses of these external nodes.

In the embodiment of the present invention, optionally, as shown in FIG. 5, the node 10 further includes: a processing unit 13;

Before the sending unit 12 distributes the mapping relationship between the target route and the label corresponding to the target route to the second node, the processing unit 13 is configured to: acquire the target route; and allocate or apply a label for the target route.

In the embodiment of the present invention, the sending unit 12 is further configured to: if the target route hits a routing policy of the application global label deployed on the node, to the control node in the global label domain to which the node belongs a destination route requesting label; the receiving unit 11 is further configured to: receive a first label that is sent by the control node and that is allocated to the target route, where the first label is valid in a global label domain to which the node belongs;

If the processing unit 13 determines that the first identifier information matches the second identifier information, the sending unit 12 is configured to: spread the mapping relationship between the target route and the first label to the second node; and/or,

If the processing unit 13 determines that the first identification information does not match the second identification information, the sending unit 12 And a method for: transmitting, to the second node, a mapping relationship between the target route and the second label, where the second label is valid locally at the node.

In the embodiment of the present invention, the processing unit 13 is specifically configured to: if the target route meets the following condition (1) or (2), assign a third label to the target route, where the third label It is valid locally on the node: (1) The target route does not hit the routing policy of the request global label deployed on the node, and there is no global label allocated on the node for the target route. (2) There is no deployment request globally on the node. The routing policy of the label and there is no global label assigned to the target route on the node;

The sending unit 12 is specifically configured to: spread the mapping relationship between the target route and the third label to the second node.

In the embodiment of the present invention, the receiving unit 11 is further configured to: receive a mapping relationship between the target route and the fourth label that is distributed by the third node, where the fourth label is that the third node allocates the target route Or the label of the application;

The processing unit 13 is specifically configured to: determine a valid range of the fourth label, and determine, if it is determined that the valid range of the fourth label is not a global label field to which the node belongs, Target route assignment or application tag.

In the embodiment of the present invention, the receiving unit 11 is further configured to: receive third identifier information that is distributed by the third node, where the third identifier information is used to identify a global label domain to which the third node belongs;

The processing unit 13 is specifically configured to: determine, according to a matching result of the second identifier information and the third identifier information, a valid range of the fourth label.

In the embodiment of the present invention, optionally, in determining the effective range of the fourth label according to the matching result of the second identifier information and the third identifier information, the processing unit 13 is specifically configured to: if the processing unit Determining that the second identifier information matches the third identifier information, and determining a valid range of the fourth label according to the relationship between the fourth label and the range of the global label address pool of the node.

In the embodiment of the present invention, the receiving unit 11 is specifically configured to: receive a border gateway protocol BGP update message that is sent by the second node, where the BGP update message carries the first identifier information; or, receive the first The link state of the open shortest path first OSPF protocol of the two-node broadcasts the LSA message, the LSA message carries the first identifier information; or receives the link of the intermediate-to-intermediate system IS-IS protocol spread by the second node The state protocol data unit LSP carries the first identification information.

It should be understood that the node 10 according to an embodiment of the present invention may correspond to performing the first node in the method 100 in the embodiment of the present invention, and the above and other operations and/or functions of the respective modules in the node 10 are respectively implemented to implement FIG. 2 The corresponding process corresponding to the first node in the method in the method is not described here for brevity.

Therefore, the node of the embodiment of the present invention determines the type of the label advertised to the neighboring node by the matching result of the identifier information of the global label domain to which the node belongs and the identifier information of the global label domain to which the neighbor node belongs. The edge nodes of the domain network are manually configured to automatically prevent the mapping between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, so as to avoid label conflicts or unnecessary error responses of these external nodes.

As shown in FIG. 6, an embodiment of the present invention further provides a node 100. The node 100 includes a processor 101, a receiver 102, a transmitter 103, and a memory 104. The processor 101, the memory 104, the receiver 102 and the transmitter 103 are connected by a bus system 105 for storing instructions for executing instructions stored by the memory 104 to control the receiver 102 to receive. The signal and control transmitter 103 sends a signal.

The receiver 102 is configured to: receive the first identifier information that is sent by the second node, where the first identifier information is used to identify the global label domain to which the second node belongs; the sender 103 is further configured to: And mapping, according to the matching result of the first identifier information and the second identifier information, a mapping relationship between the target route and a label corresponding to the target route, where the second identifier information is used to identify that the node belongs to A global label field, the destination route is a route from the node to the second node.

Therefore, the node of the embodiment of the present invention determines the type of the label advertised to the neighboring node by the matching result of the identifier information of the global label domain to which the node belongs and the identifier information of the global label domain to which the neighbor node belongs. The edge nodes of the domain network are manually configured to automatically prevent the mapping between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, so as to avoid label conflicts or unnecessary error responses of these external nodes.

It should be understood that, in the embodiment of the present invention, the processor 101 may be a central processing unit ("CPU"), and the processor 101 may also be other general-purpose processors, digital signal processors (DSPs). , an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, and the like. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like.

The memory 104 can include read only memory and random access memory and provides instructions and data to the processor 410. A portion of the memory 104 may also include a non-volatile random access memory. For example, the memory 104 can also store information of the device type.

The bus system 105 may include a power bus, a control bus, a status signal bus, and the like in addition to the data bus. However, for clarity of description, various buses are labeled as bus system 105 in the figure.

In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the processor 101 or an instruction in a form of software. The steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory 104, and the processor 101 reads the information in the memory 104 and, in conjunction with its hardware, performs the steps of the above method. To avoid repetition, it will not be described in detail here.

Optionally, as an embodiment, before the transmitter 103 transmits the mapping relationship between the target route and the label corresponding to the target route to the second node, the processor 101 is configured to: obtain the target route; Target route assignment or application tag.

Optionally, as an embodiment, the transmitter 103 is specifically configured to: if the target route hits a routing policy of a request global label deployed on the node, the control node in the global label domain to which the node belongs is the target route. Apply for a label;

The receiver 102 is specifically configured to: receive a first label that is sent by the control node and that is allocated to the target route, where the first label is valid in a global label field to which the node belongs;

If the processor 101 determines that the first identifier information matches the second identifier information, the transmitter 103 is configured to: spread the mapping relationship between the target route and the first label to the second node; and/or,

If the processor 101 determines that the first identifier information does not match the second identifier information, the transmitter 103 is configured to: spread the mapping relationship between the target route and the second label to the second node, where the second label is This node is valid locally.

Optionally, as an embodiment, the processor 101 is specifically configured to: if the target route meets the following condition (1) or (2), assign a third label to the target route, where the third label is in the The node is locally valid: (1) The target route does not hit the routing policy of the request global label deployed on the node, and there is no global label allocated on the node for the target route. (2) The global label is not deployed on the node. Routing policy and there is no global label assigned to the target route on the node;

The transmitter 103 is specifically configured to: distribute the mapping relationship between the target route and the third label to the second node.

Optionally, as an embodiment, the receiver 102 is further configured to: receive a mapping relationship between the target route and the fourth label that is distributed by the third node, where the fourth label is used by the third node to allocate or apply for the target route. s Mark;

The processor 101 is specifically configured to: determine a valid range of the fourth label, and determine, if the valid range of the fourth label is not a global label field to which the node belongs, Target route assignment or application tag.

Optionally, as an embodiment, the receiver 102 is further configured to: receive the third identifier information that is sent by the third node, where the third identifier information is used to identify a global label domain to which the third node belongs;

The processor 101 is specifically configured to: determine, according to a matching result of the second identifier information and the third identifier information, a valid range of the fourth label.

Optionally, as an embodiment, in determining a valid range of the fourth label according to a matching result of the second identifier information and the third identifier information, the processor 101 is specifically configured to: if the processor 101 determines The second identifier information is matched with the third identifier information, and the effective range of the fourth label is determined according to the relationship between the fourth label and the range of the global label address pool of the node.

Optionally, as an embodiment, the receiver 102 is configured to: receive a border gateway protocol BGP update message that is sent by the second node, where the BGP update message carries the first identifier information; or receive the second node. The link state of the open shortest path first OSPF protocol is advertised to the LSA message, and the LSA message carries the first identifier information; or, the link state of the intermediate system to the intermediate system IS-IS protocol is received. The protocol data unit LSP message carries the first identifier information.

It should be understood that the node 100 according to an embodiment of the present invention may correspond to the node 10 in the embodiment of the present invention, and may correspond to the first node in the method 100 according to the embodiment of the present invention, and each module in the node 100 The foregoing and other operations and/or functions are respectively used to implement the corresponding processes corresponding to the first node in the method of FIG. 2, and are not described herein again for brevity.

Therefore, the node of the embodiment of the present invention determines the type of the label advertised to the neighboring node by the matching result of the identifier information of the global label domain to which the node belongs and the identifier information of the global label domain to which the neighbor node belongs. The edge nodes of the domain network are manually configured to automatically prevent the mapping between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, so as to avoid label conflicts or unnecessary error responses of these external nodes.

A person skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division, and the actual implementation may have another division manner, for example, multiple orders. Meta or components may be combined or integrated into another system, or some features may be omitted or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.

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

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

An integrated unit, if implemented in the form of a software functional unit and sold or used as a standalone product, can be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including The instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: a USB flash drive, a mobile hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a disk or a CD. A variety of media that can store program code.

The above is only a specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the appended claims.

Claims (17)

A method for route dissemination, comprising: The first node receives the first identifier information that is sent by the second node, where the first identifier information is used to identify the global label domain to which the second node belongs; Determining, by the first node, a mapping relationship between the target route and a label corresponding to the target route to the second node according to a matching result of the first identifier information and the second identifier information, where the second node The identifier information is used to identify a global label domain to which the first node belongs, and the target route is a route from the first node to the second node. The method according to claim 1, wherein before the first node distributes the mapping relationship between the target route and the label corresponding to the target route to the second node, the method further includes: The first node acquires the target route; The first node allocates or applies a label to the target route. The method according to claim 2, wherein the first node assigns or applies a label to the target route, including: If the target route hits the routing policy of the request global label deployed on the first node, the first node applies a label to the target node to the control node in the global label domain to which the first node belongs; The first node receives a first label that is sent by the control node and is allocated to the target route, where the first label is valid in a global label domain to which the first node belongs. The first node, according to the matching result of the first identifier information and the second identifier information, the mapping relationship between the target route and the label corresponding to the target route to the second node, including: If the first node determines that the first identifier information matches the second identifier information, the first node distributes a mapping relationship between the target route and the first label to the second node; and / or, If the first node determines that the first identifier information does not match the second identifier information, the first node transmits a mapping relationship between the target route and the second label to the second node, The second tag is valid locally at the first node. The method according to claim 2, wherein the first node assigns or applies a label to the target route, including: If the target route satisfies the following condition (1) or (2), the first node assigns a third label to the target route, wherein the third label is valid locally at the first node: (1) The destination route does not hit the routing policy of the request global label deployed on the first node, and the first node does not have a global label previously allocated for the target route, and (2) the first node does not have Deploying a routing policy for requesting a global label and having no global label previously allocated for the target route on the first node; The first node, according to the matching result of the first identifier information and the second identifier information, the mapping relationship between the target route and the label corresponding to the target route to the second node, including: The first node distributes a mapping relationship between the target route and the third label to the second node. The method according to any one of claims 2 to 4, wherein the acquiring, by the first node, the target route comprises: The first node receives a mapping relationship between the target route and the fourth label that is distributed by the third node, where the fourth label is a label that is allocated or applied by the third node for the target route; The first node allocates or applies a label to the target route, including: Determining, by the first node, a valid range of the fourth tag; If the valid range of the fourth tag is not the global tag domain to which the first node belongs, the first node allocates or applies a label for the target route. The method according to claim 5, wherein the determining, by the first node, the effective range of the fourth tag comprises: Receiving, by the first node, third identifier information that is distributed by the third node, where the third identifier information is used to identify a global label domain to which the third node belongs; Determining, by the first node, a valid range of the fourth label according to a matching result of the second identifier information and the third identifier information. The method according to claim 6, wherein the determining, by the first node, the valid range of the fourth label according to the matching result of the second identifier information and the third identifier information, including: If the first node determines that the second identifier information matches the third identifier information, the first node is configured according to a relationship between the fourth label and a range of a global label address pool of the first node, Determining a valid range of the fourth tag. The method according to any one of claims 1 to 7, wherein the first node receives the first identification information that is transmitted by the second node, and includes: Receiving, by the first node, a border gateway protocol BGP update message that is sent by the second node, where the BGP update message carries the first identifier information; or Receiving, by the first node, a link state advertisement LSA message of the open shortest path first OSPF protocol that is sent by the second node, where the LSA message carries the first identifier information; or The first node receives the link state protocol data unit LSP of the intermediate system to the intermediate system IS-IS protocol, and the LSP carries the first identifier information. A node, comprising: a receiving unit, configured to receive first identifier information that is sent by the second node, where the first identifier information is used to identify a global label domain to which the second node belongs; The transceiver unit is configured to: according to the matching result of the first identifier information and the second identifier information, distribute a mapping relationship between the target route and a label corresponding to the target route to the second node, where the second The identifier information is used to identify a global label domain to which the node belongs, and the target route is a route from the node to the second node. The node according to claim 9, wherein the node further comprises: a processing unit; The processing unit is configured to: before the sending unit transmits the mapping relationship between the target route and the label corresponding to the target route to the second node: Obtaining the target route; Assign or request a label for the target route. The node according to claim 10, wherein the transceiver unit is further configured to: If the target route hits the routing policy of the request global label deployed on the node, the control node in the global label domain to which the node belongs applies for the target route; Receiving, by the control node, a first label allocated to the target route, where the first label is valid in a global label domain to which the node belongs; If the processing unit determines that the first identifier information matches the second identifier information, spreading a mapping relationship between the target route and the first label to the second node; and/or, If the processing unit determines that the first identifier information does not match the second identifier information, the mapping relationship between the target route and the second label is distributed to the second node, where the second label is in the The node is valid locally. The node according to claim 10, wherein the processing unit is specifically configured to: Assigning a third label to the target route if the target route satisfies the following condition (1) or (2), wherein the third label is valid locally at the node: (1) the target route does not hit a routing policy of the global label that is deployed on the node and the global label that is not allocated for the target routing on the node, and (2) no routing policy for applying the global label is deployed on the node, and the node does not have a routing policy. a global label assigned in advance to the target route; The sending unit is specifically configured to: And mapping the mapping between the target route and the third label to the second node. The method according to any one of claims 10 to 12, wherein the receiving unit is further configured to: And receiving, by the third node, a mapping relationship between the target route and the fourth label, where the fourth label is a label that is allocated or applied by the third node for the target route; The processing unit is specifically configured to allocate or apply a label for the target route: Determining a valid range of the fourth label; If it is determined that the valid range of the fourth tag is not the global tag domain to which the node belongs, assign or apply a label for the target route. The node according to claim 13, wherein the receiving unit is further configured to: Receiving, by the third node, third identifier information, where the third identifier information is used to identify a global label domain to which the third node belongs; The processing unit is specifically configured to: And determining, according to a matching result of the second identifier information and the third identifier information, a valid range of the fourth label. The node according to claim 14, wherein the processing unit is specifically configured to determine a valid range of the fourth tag according to a matching result of the second identification information and the third identification information. : If the processing unit determines that the second identifier information matches the third identifier information, determining a valid range of the fourth label according to a relationship between the fourth label and a range of a global label address pool of the node . The node according to any one of claims 9 to 15, wherein the receiving unit is specifically configured to: Receiving, by the second node, a Border Gateway Protocol BGP update message, where the BGP update message carries the first identifier information; or Receiving, by the second node, the link state advertisement LSA message of the open shortest path first OSPF protocol, where the LSA message carries the first identifier information; or And receiving, by the second node, the intermediate system to the link state protocol data unit LSP of the intermediate system IS-IS protocol, where the LSP carries the first identifier information. A node, comprising: a processor, a memory, a receiver, and a transmitter, wherein the processor, the memory, the receiver, and the transmitter are connected by a bus system, and the memory is used for storing Means The processor is configured to execute an instruction stored in the memory to control the receiver to receive information or the transmitter to transmit information, such that the node performs the method of any one of claims 1 to 8. method.

Images