CN107370675B

CN107370675B - Method and node for route dissemination

Info

Publication number: CN107370675B
Application number: CN201610321953.7A
Authority: CN
Inventors: 梁乾灯; 陈霞; 李振斌
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2016-05-13
Filing date: 2016-05-13
Publication date: 2021-02-23
Anticipated expiration: 2036-05-13
Also published as: WO2017193733A1; CN107370675A

Abstract

The invention provides a method and a node for route dissemination, wherein the method comprises the following steps: a first node receives first identification information disseminated by a second node, wherein the first identification information is used for identifying a global label domain to which the second node belongs; the first node broadcasts a mapping relation between a target route and a label corresponding to the target route to the second node according to a matching result of the first identification information and the second identification information, the second identification information is used for identifying 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. Therefore, the mapping relation between the route and the global label can be automatically prevented from spreading to the nodes outside the global label domain to which the nodes belong without manually configuring the edge nodes of the global label domain network, and label collision or unnecessary error response of the outside nodes is avoided.

Description

Method and node for route dissemination

Technical Field

The embodiment of the invention relates to the technical field of network communication, in particular to a route dissemination method and a node.

Background

The global nature of the global tag is limited to the network domain where the global tag is deployed, only within which the global tag is unique. In the forwarding path of the global label, the label is not switched or the outgoing label and the incoming label are completely consistent during label switching. However, since the network domain where the global Label is deployed may be only a subset of a Multi-Protocol Label Switching (MPLS) network, the problem of interfacing the global Label and the local Label on the network domain node where the global Label is deployed needs to be considered.

In the prior art, when a traditional Label Switch Path (Label Switch Path, abbreviated as "LSP") is connected to a global Label forwarding Path in a butt joint manner, a rule applying for a global Label for a route is only deployed on a connected forwarding node, so that seamless connection between the LSP and the global Label forwarding Path can be realized. However, when the LSP is connected to the global label forwarding path, it is necessary to configure a Segment Routing Mapping Server (SRMS) at which forwarding nodes are configured, and configure a Mapping rule from the global label to the local label on the SRMS.

Therefore, the prior art relies on static configuration to identify the edge node of the network domain where the global label is applied, which is not flexible and automatic enough, and may cause the forwarding node to get a false response or cause label collision of the neighbor nodes of the forwarding node.

Disclosure of Invention

The invention provides a method and a node for route dissemination, wherein a forwarding node can automatically identify whether a neighbor node of a forwarding node relative to a downstream dynamic routing protocol is an edge node of a network domain with an application global label, and can avoid the mapping relation between a route and the global label from spreading to nodes outside the network domain, and avoid label collision or unnecessary false response of the external nodes.

To facilitate an understanding of the embodiments of the present invention, a few elements that will be introduced in the description of the embodiments of the present invention are first introduced here.

A local label, a label that uniquely identifies and validates a service (e.g., an IP prefix) locally at a node (device, including a virtual device).

Global labeling: a label uniquely identifying a service within a network of an administrative domain that can be validated on a plurality of nodes (devices) of the network.

And the global label domain is used for deploying a network applying the global labels. Global tags may be advertised among nodes in the global tag domain, or local tags that are valid only locally at the nodes may be advertised.

The global label application strategy is a strategy for distributing global labels for the specified route.

Dynamic routing protocol: the dynamic routing Protocol is classified into an Interior Gateway Protocol (IGP) and an Exterior Gateway Protocol (EGP) according to whether it is used within an autonomous domain. An Autonomous System (AS) refers to a network having a unified management mechanism and a unified routing policy. A Routing Protocol adopted in the autonomous domain is called an interior gateway Protocol, and a Routing Information Protocol (RIP for short) and an Open Shortest Path First (OSPF for short) are commonly used; the exterior Gateway Protocol is mainly used for routing among a plurality of autonomous domains, and Border Gateway Protocol (BGP) and BGP-4 are commonly used.

Dissemination (disconnect), an operation in which one node in a network sends a message to another node, wherein the message includes, but is not limited to: the routing method comprises the steps of routing, mapping relation of routing and labels, identification information of a global label domain where a node IS located, BGP updating information, Link-State-Advertisement (LSA) information in an OSPF Protocol, and a Link State Protocol Data Unit (LSP) in an Intermediate System to Intermediate System (IS-IS) Protocol. In describing particular embodiments, dissemination may be replaced with words of publication, transmission, announcement, and the like.

In a first aspect, a method for route dissemination is provided, including: a first node receives first identification information disseminated by a second node, wherein the first identification information is used for identifying a global label domain to which the second node belongs; the first node broadcasts a mapping relation between a target route and a label corresponding to the target route to the second node according to a matching result of the first identification information and second identification information, wherein the second identification information is used for identifying 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.

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

Optionally, the identification information of the global label domain may be a routing (Router) ID of a controller node of the global label domain, or another globally unique ID value, which is not limited in the present invention.

Correspondingly, when the first node receives the ID sent by the second node, it is determined whether the received ID is the same as the ID of the global label domain to which the first node belongs, and if so, the second node and the first node are considered to belong to the same global label domain, that is, the first node is not an edge node of the global label domain, and the first node can disseminate the mapping relationship between the received route and the global label to the second node. If the ID sent by the second node and received by the first node is not the same as the ID of the global label domain 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 belong to different global label domains, or the first node is an edge node of the global label domain to which the first node belongs. The first node disseminates to the second node a mapping of the route and a local label that is valid locally at the first node.

Therefore, in the method for route dissemination according to the embodiment of the present invention, the node determines the type of the label disseminated to the neighbor node according to the matching result of the identification 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, without manually configuring the edge node of the global label domain network, and thus, the mapping relationship between the route and the global label can be automatically prevented from being spread to the nodes outside the global label domain network to which the node belongs, and label collision or unnecessary false response caused by the external nodes can be avoided.

With reference to the first aspect, in a first possible implementation manner of the first aspect, before the first node disseminates the mapping relationship between the target route and the label corresponding to the target of the target route to the second node, the method further includes: the first node acquires the target route; the first node assigns or applies for a label for the target route.

With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the allocating or applying for a label for the target route by the first node includes: if the target route hits the routing strategy of the global label application deployed on the first node, the first node applies the label for the target route to a control node in a global label domain to which the first node belongs; and the first node receives a first label distributed for the target route and sent by the control node, wherein the first label is effective in a global label domain to which the first node belongs.

The first node disseminates the mapping relationship between the target route and the label corresponding to the target route to the second node according to the matching result of the first identification information and the second identification information, and the method comprises the following steps: if the first node determines that the first identification information is matched with the second identification information, the first node broadcasts the mapping relation between the target route and the first label to the second node; and/or, if the first node determines that the first identification information does not match the second identification information, the first node disseminates the target route to the second node in a mapping relationship with a second label, the second label being valid locally at the first node.

The matching of the first identification information and the second identification information can be understood that the global tag domain identified by the first identification information and the global tag domain identified by the second identification information are the same global tag domain, and the non-matching of the first identification information and the second identification information can be understood that the global tag domain identified by the first identification information and the global tag domain identified by the second identification information are not the same global tag domain. Optionally, matching the first identification information with the second identification information may mean that a global tag domain ID identified by the first identification information is the same as a global tag domain ID identified by the second identification information, and mismatching the first identification information with the second identification information may mean that the global tag domain ID identified by the first identification information is different from the global tag domain ID identified by the second identification information.

Optionally, if the first node is locally configured with the global label allocated to the target route, or the control node of the global label domain to which the first node belongs has issued the global label corresponding to the target route to the first node, the first node directly allocates the existing global label corresponding to the target route, so as to obtain the mapping relationship between the target route and the global label, and does not need to apply for the control node.

It should be noted that, when the first node receives a mapping relationship between a target route advertised by another node and a label, if the first node determines that the effective range of the label is a global label domain to which the first node belongs, the first node does not allocate a local label to the target route, and at this time, allocating a label to the target route by the first node may be understood as that the first node allocates the received label to the target route.

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

With reference to the first possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, the allocating or applying for a label for the target route by the first node includes: the first node assigns 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 first node: (1) the target route does not hit the routing strategy deployed on the first node for applying the global label and the first node does not have the global label pre-allocated to the target route, (2) the routing strategy deployed on the first node for applying the global label and the first node does not have the global label pre-allocated to the target route;

wherein, the first node broadcasts the mapping relationship between the target route and the label corresponding to the target route to the second node according to the matching result of the first identification information and the second identification information, and the method comprises the following steps: the first node disseminates the mapping relationship between the target route and the third label to the second node.

With reference to any one of the first to third possible implementation manners of the first aspect, in a fourth possible implementation manner of the first aspect, the obtaining, by the first node, the target route includes: the first node receives a mapping relation between the target route and a fourth label disseminated by a third node, wherein the fourth label is a label distributed or applied by the third node for the target route;

wherein, the first node allocates or applies for a label for the target route, including: the first node determines the valid range of the fourth label; and if the effective range of the fourth label is not the global label domain to which the first node belongs, the first node allocates or applies for the label for the target route.

In other words, after receiving a mapping relationship message of a route and a label, the first node determines that the effective range of the label in the mapping relationship message is of the global label domain to which the first node belongs. If the effective range of the label is not the global label domain to which the first node belongs, the first node needs to allocate or apply for the label for the route in the received route and label mapping relation message; if the effective range of the label is the global label domain to which the first node belongs, it is indicated that the node scattering the mapping relationship message and the first node belong to the same global label domain, the first node maintains the mapping relationship between the received route and the label, and adds the mapping relationship between the received route and the label to a route and global label mapping relationship table in the first node.

It can be understood that, in the embodiment of the present invention, if the upstream and downstream forwarding nodes of a forwarding node that belongs to a certain global label domain do not belong to the global label domain, for a routing policy that hits an application global label deployed on the forwarding node or a route to which a global label has been allocated, a mapping table from a local label of an upstream node to the global label and a mapping table from the global label to a locally newly allocated label may occur at the same time on the forwarding node, so that an incoming label of a label forwarding table actually formed by iteration is a locally newly allocated label, and an outgoing label is a local label advertised by the upstream forwarding node and does not include information of the global label.

Optionally, the mapping relationship message broadcast by the third node further carries tag type indication information, where the tag type indication information indicates whether the valid range of a tag in the mapping relationship message is a global tag domain to which the first node belongs; and the first node determines the effective range of the label according to the label type indication information.

In this embodiment of the present invention, optionally, the acquiring, by the first node, the target route may further include: the first node generates the destination route, or the first node receives the destination route sent by a Customer Edge (CE) node. Alternatively, it may be described as generating a target route for the first node that is local as an origin or that learns to a label-free mapping.

With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, the determining, by the first node, the valid range of the fourth label includes: the first node receives third identification information disseminated by the third node, wherein the third identification information is used for identifying a global label domain to which the third node belongs; and the first node determines the effective range of the fourth label according to the matching result of the second identification information and the third identification information.

With reference to the fifth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the determining, by the first node, the valid range of the fourth tag according to the matching result of the second identification information and the third identification information includes:

and if the first node determines that the second identification information is matched with the third identification information, the first node determines the effective range of the fourth label according to the relationship between the fourth label and the range of the global label address pool of the first node.

Specifically, if the first node determines that the second identification information matches the third identification information, that is, the third node and the first node belong to the same global label domain, the first node determines whether a fourth label is in a range of a global label address pool of the first node, where the range of the global label address pool is a range of labels that the first node itself can allocate to a route, and if the first node is not in the global label address pool, it indicates that an effective range of the fourth label is the global label domain to which the first node belongs, otherwise, it is considered that the effective range of the fourth label is local to the third node, that is, the fourth label is a local label of the third node.

Or, if the first node does not receive the identification information, which is disseminated by the third node and used for identifying the global label domain to which the third node belongs, the first node considers that the third node and the first node do not belong to the same global label domain, or the third node is not a node of the global label domain, the first node may directly determine that the fourth label is a local label whose effective range is local to the third node.

With reference to the first aspect or any one of the first to sixth possible implementation manners of the first aspect, in a seventh possible implementation manner of the first aspect, the receiving, by the first node, first identification information disseminated by a second node includes: the first node receives a BGP (border gateway protocol) update message disseminated by the second node, wherein the BGP update message carries the first identification information; or, the first node receives a Link State Advertisement (LSA) message of an Open Shortest Path First (OSPF) protocol, which is broadcast by the second node, wherein the LSA message carries the first identification information; or, the first node receives a link state protocol data unit LSP from an intermediate system to an intermediate system IS-IS protocol, which IS broadcasted by the second node, and the LSP carries the first identification information.

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

In a second aspect, a node is provided, comprising: for carrying out the method of the first aspect described above or any possible implementation manner of the first aspect. In particular, the node comprises means for performing the method of the first aspect described above or any possible implementation manner 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 being connected by a bus system, the memory being configured to store instructions, and the processor being configured to execute the 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 the first aspect or any possible implementation manner of the first aspect.

In a fourth aspect, there is provided a computer readable medium for storing a computer program comprising instructions for carrying out the method of the first aspect or any possible implementation manner of the first aspect.

In 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 identification information disseminated by the second node, and the first identification information is used to identify a global tag domain to which the second node belongs;

the first node is configured to disseminate, to the second node, a mapping relationship between a target route and a label corresponding to the target route according to a matching result of the first identification information and the second identification information, where the second identification 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 above alternatives apply to all aspects from the first to the fifth aspect.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.

FIGS. 1(a) - (c) are schematic diagrams of an application scenario of the present invention;

FIG. 2 is a schematic flow chart diagram of a method of route dissemination according to an embodiment of the present invention;

fig. 3 is a schematic diagram of a route dissemination method according to another embodiment of the present invention;

FIG. 4 is a schematic block diagram of a node according to an embodiment of the present invention;

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

fig. 6 is a schematic block diagram of a node according to another embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without inventive effort based on the embodiments of the present invention, are within the scope of the present invention.

Fig. 1(a) - (c) are schematic diagrams of a scenario in which an embodiment of the present invention is applied. AS shown in fig. 1(a), the global label domain covers a plurality of dynamic routing protocol Autonomous domains (Autonomous systems, abbreviated AS ") 1 and AS2, Autonomous domain border routers (Autonomous systems Boundary routers, abbreviated AS" ASBRs ") 1 and ASBRs 4 are edge nodes of the global label domain, and ASBRs 2 and ASBRs 3 are not edge nodes of the global label domain.

In fig. 1(b), the global label domain covers a single dynamic routing protocol autonomous domain AS1, ASBRs 1 and ASBRs 2 are edge nodes of the global label domain, ASBRs 2 need to terminate the global label forwarding path from ASBR1 to ASBR2, and the ASBR3 is allocated an advertised local label that is valid locally at ASBR3 for the path traffic. A Border Gateway Protocol (BGP) runs between ASBR1 and ASBR2, and BGP runs between ASBR3 and ASBR 4.

In fig. 1(c), the global label domain covers a single dynamic routing protocol autonomous domain,

ASBRs

1 and 2 are edge nodes of global label domain 1, and belong to AS1, and BGP is run between ASBRs 1 and ASBRs 2. ASBRs 3 and 4 are edge nodes of global label domain 2 and belong to AS2, with BGP running between ASBRs 3 and ASBRs 4. ASBR2 needs to terminate the global label forwarding path ASBR1 to ASBR2, which is allocated an advertised local label that is valid locally at ASBR3 in exchange for ASBR 3. ASBR3 may redirect the traffic to a new global label forwarding path.

Fig. 2 is a schematic flow chart diagram of a method of route dissemination according to an embodiment of the present invention. As shown in fig. 2, the method 100 includes:

s110, a first node receives first identification information disseminated by a second node, wherein the first identification information is used for identifying a global label domain to which the second node belongs;

in the embodiment of the present invention, after a node joins a global label domain according to signaling or configuration, the node notifies an Internal Gateway Protocol (IGP) of the node itself or a BGP neighbor of identification ID information of the global label domain that the node joins itself, and stores an ID of the global label domain to which the neighbor node belongs, which is notified by the neighbor node. 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.

Taking fig. 3 AS an example, in fig. 3, the forwarding node A, B, C, E joins the global label domain, the forwarding node A, B, C belongs to AS1, the forwarding node E, D belongs to AS2, and the forwarding node F, G, H belongs to AS 3. Deploying a global label application strategy of matching 192.0.3.1/32 on the forwarding node A, namely allocating a global label for the IP prefix of matching 192.0.3.1/32 by the forwarding node A; and deploying a global label application strategy of matching 192.0.4.1/32 on the forwarding node E, namely allocating a global label to the IP prefix of matching 192.0.4.1/32 by the forwarding node E. IBGP (internal BGP) connection is established among forwarding nodes in the autonomous domain, and EBGP (external BGP) connection is established among adjacent forwarding nodes across the domain.

The dotted line in fig. 3 represents an advertisement process of a mapping relationship between a route corresponding to a local Loopback (Loopback) interface address 192.0.3.1/32 of a Customer Edge (Customer Edge, abbreviated as "CE") node 1 and a label bound by the route, and the specific advertisement process shown by the dotted line in fig. 3 is as follows: the CE1 advertises the route corresponding to 192.0.3.1/32 to node A, and node A applies for a label (corresponding to number 1 in FIG. 3) for the route to the control node and receives a label (corresponding to number 2 in FIG. 3) sent by the control node and allocated to the route; the node A advertises the mapping relationship between the route and the label to the node C (corresponding to number 3 in FIG. 3); after receiving the mapping relationship announced by the node a, the node C announces the mapping relationship to the node E (corresponding to number 4 in fig. 3); after receiving the mapping relationship advertised by the node C, the node E re-allocates a label to the route, and advertises, to the node G, the mapping relationship between the route and the label re-allocated by the node C (corresponding to number 5 in fig. 3); after receiving the mapping relationship advertised by the node E, the node G reallocates the label to the route, and advertises, to the node H, the mapping relationship between the route and the label reallocated by the node G (corresponding to number 6 in fig. 3); node H advertises the route to CE 2.

The dotted line in fig. 3 represents an advertisement process of the mapping relationship between the route corresponding to the Loopback interface address 192.0.4.1/32 of the CE2 and the label bound to the route, and a specific advertisement process will be described in detail below.

After the forwarding node a in fig. 3 joins the global label domain, a BGP update message may carry a newly defined Path Attribute (Path Attribute) or a newly defined Extended community Attribute (Extended community Attribute) to notify a BGP neighbor node (hereinafter also referred to as "BGP Peer") B, C of the forwarding node a of ID information of the global label domain that the forwarding node a joins, and store an ID of the global label domain to which the forwarding node B, C belongs, the ID being notified by the forwarding node B, C. And if the ID of the global label domain is an invalid value, the forwarding node which sends the BGP update message carrying the newly defined path attribute or the newly defined extended team attribute does not join the global label domain. In a similar way, the forwarding node E in the AS2 may determine that the forwarding node C in the AS1 and itself belong 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 the AS2 and the forwarding node F, G, H in the AS3 do not belong to the global label domain. The forwarding node G does not join the global label domain, and may not notify E, F, H of the ID information of the global label domain to which it belongs, but may receive the ID information of the global label domain to which the forwarding node E belongs, which is notified by the forwarding node E.

Optionally, as an example, a Global tag Domain Attribute (Global-Label-Domain-Attribute) may be newly defined in the Path Attribute, where the Global-Label-Domain-Attribute carries ID information of the Global tag Domain, and a reference format of the Path Attribute is shown in table 1.

TABLE 1

The definition of the attribute (Flags) field may refer to Request For Reference (RFC) 1267.

The Type (Type) field defines that the Type of the tag is a global tag, which is optional and non-transitive.

A Length field indicating the Length of the global tag.

A global tag domain ID (GLD _ ID), indicating the ID of the global tag domain, which is unique throughout the global tag domain.

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

TABLE 2

Further, when the method of the embodiment of the present invention is applied to a global label domain that partially covers a single AS, when a forwarding node advertises ID information of the global label domain to which the forwarding node belongs, a new Link State (LS) type may be defined in the OSPF protocol: the forwarding node advertises GLD-LSA information to its neighbor nodes, and the neighbor nodes receiving the GLD-LSA information can acquire the ID information of the Global Label Domain to which the forwarding node belongs from the GLD-LSA message.

TABLE 3

The definition of LSA Header refers To RFC 2328, and the value of "LS type" in LSA Header is pending (To Be Determined, abbreviated as "TBD").

A global tag domain ID (GLD _ ID) indicating an ID of a global tag domain that is unique throughout the global tag domain.

Further, a new Type-Length-Value (TLV) option may be defined in an Intermediate System to Intermediate System (IS-IS) Protocol, where a Type in the TLV option indicates a global label domain attribute, the attribute IS optional, the Length domain indicates a Length of a GLD _ ID, the GLD _ ID indicates an ID of the global label domain, the ID of the global label domain IS unique in the entire global label domain, a forwarding node may carry the new TLV option in a Link State Protocol Data Unit (Link State Protocol Data Unit, which IS simply referred to as LSP "), and a forwarding node receiving an LSP sent by the forwarding node may know an ID of the global label domain to which the forwarding node belongs according to the LSP. For example, the reference format of the TLV may be as shown in table 4.

TABLE 4

S120, the first node broadcasts a mapping relation between a target route and a label corresponding to the target route to the second node according to a matching result of the first identification information and second identification information, wherein the second identification information is used for identifying 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.

Optionally, the first node may generate a target route with the first node as a source node and the second node as a destination node, or learn the target route to a label-free mapping relationship from the first node to the second node. And then the first node checks whether the target route hits the global label application strategy locally deployed by the first node. If the target route hits the global label applying policy locally deployed 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 assigns the existing global label to the target route to form a mapping relation between the target route and the global label. If the target route does not hit the global label application strategy locally deployed by the first node and the first node does not locally have a global label corresponding to the target route, the first node allocates a local label to the target route to form a mapping relation between the target route and the local label.

For example, in FIG. 3, forwarding node A learns of Customer Edge (CE) nodes 1 advertised or locally configured routes 192.0.3.1/32 via BGP. Because the route 192.0.3.1/32 hits the global label application policy locally deployed by forwarding node A, forwarding node A applies for a global label for route 192.0.3.1/32 from the control node of the global label domain to which forwarding node A belongs.

Specifically, the forwarding node a sends request information carrying a route (192.0.3.1/31) to which a global label is to be applied to the control node. The request information may also include Virtual Routing Forwarding (VRF) information, the control node responds to the request information of the Forwarding node a, allocates a global label Lable1 to a route (192.0.3.1/31) sent by the Forwarding node a, and sends a mapping relationship between the route 192.0.3.1/31 and Lable1 to the Forwarding node a.

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 a global label to the forwarding node a within the label range of the forwarding node a.

In the embodiment of the invention, before a forwarding node advertises a mapping relation between a route and a label to a neighbor 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 announces a mapping relation between a route and the label to a neighbor node of the forwarding node according to the identification of a global label domain to which the neighbor node of the forwarding node belongs and the identification of a global label domain to which the forwarding node itself belongs. 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 neighboring nodes of the forwarding node.

For example, in fig. 3, forwarding node a obtains 192.0.3.1/32 and a mapping relationship of a global Label 1, and by checking an ID of a global Label domain to which its own BGP Peer forwarding node belongs, forwarding node a determines that forwarding node C and forwarding node a belong to the same global Label domain, and then forwarding node a advertises 192.0.3.1/32 and the mapping relationship of Label 1 to forwarding node C through BGP, respectively. Optionally, the forwarding node a may also notify 192.0.3.1/32 of the mapping relationship between Label 1 and forwarding node C through a Label Distribution Protocol (LDP) session. Specifically, the forwarding node a advertises a label mapping message to the forwarding node C, where a label field in a general label TLV in the label mapping message includes a global label flag bit, and the global label flag bit is used to indicate whether a label in the advertised mapping relationship is a global label. For example, the highest Bit of the tag field of 32 bits may be defined as a global tag flag, and when the value of the flag takes 1, it indicates that the tag in the mapping relationship is a global tag, and when the value of the flag takes 0, it indicates that the tag in the mapping relationship is a local tag.

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 belongs, which is notified by the forwarding node E, so that the forwarding node B notifies 192.0.3.1/32 of the mapping relationship with Label 1 to the forwarding node E by the same method as that of the forwarding node a.

After the forwarding node E receives the mapping relationship between 192.0.3.1/32 and Label 1 announced by the forwarding node B, the forwarding node E determines that the forwarding node B 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 B announced by the forwarding node B belongs, so that the forwarding node E directly adds the mapping relationship between 192.0.3.1/32 and Label 1 locally on the forwarding node E, and the forwarding node E does not receive the ID of the global Label domain to which the forwarding node G announced by the forwarding node G belongs, so that the forwarding node E determines that the forwarding node G and the forwarding node E do not belong to the same global Label domain, and therefore the forwarding node E obtains a local Label Label 2 from a local Label resource pool of the forwarding node E locally, and announces the mapping relationship between 192.0.3.1/32 and Label 2 to the forwarding node G through BGP.

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

From the above steps, the forwarding path of 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, wherein H- > G- > E is a traditional LSP, and the Label is exchanged point by point for the forwarding node; e- > C- > A is a global label forwarding path.

One specific flow of the method of route dissemination of an embodiment of the present invention will now be described with reference to fig. 3, taking as an example the process of advertising a mapping between a route 192.0.4.1/32 and a label bound to that route 192.0.4.1/32.

Specifically, after the forwarding node H in fig. 3 receives the route 192.0.4.1/32 advertised by the CE2 or configured locally, the forwarding node H assigns a local Label4 to the route 192.0.4.1/32 because the forwarding node H does not join the global Label domain. And announces the route 192.0.4.1/32 to the forwarding node G through BGP, announces the mapping relationship between the route 192.0.4.1/32 and Label4 to the forwarding node G through LDP, and optionally, the forwarding node H can also announce the mapping relationship between the route 192.0.4.1/32 and Label4 to the forwarding node G through BGP (corresponding to number I in fig. 3).

When the forwarding node G receives the mapping relationship between the route 192.0.4.1/32 and Label4 advertised by the forwarding node H, because the forwarding node G is not in the global Label domain, the forwarding node G allocates a local Label Label 5 to the route 192.0.4.1/32, and advertises the mapping relationship between the route 192.0.4.1/32 and Label 5 (corresponding to the number II in FIG. 3) to the forwarding node E through BGP.

After the forwarding node E receives the mapping relationship between the forwarding node G advertised route 192.0.4.1/32 and Label 5, because the forwarding node G and the forwarding node E do not belong to the same global Label domain, the Label 5 advertised by the forwarding node G is not a global Label. However, the forwarding node E checks that the route 192.0.4.1/32 hits the global label application policy locally deployed by the forwarding node E, so that the forwarding node E applies the global label (corresponding to number III in fig. 3) corresponding to the route 192.0.4.1/32 to the control node of the global label domain to which the forwarding node E belongs. The control node of the global Label domain assigns global Label 6 to route 192.0.4.1/32 and sends the global Label 6 assigned to route 192.0.4.1/32 to forwarding node E (corresponding to 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 belongs notified by the forwarding node C, so that the forwarding node E directly notifies the forwarding node C of the mapping relationship (corresponding to number V in fig. 3) between the routes 192.0.4.1/32 and the Label 6 through BGP.

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, so that the forwarding node C directly advertises the mapping relationship between the routes 192.0.4.1/32 and the Label 6 to the forwarding node a through BGP (corresponding to number VI in fig. 3).

From the above steps, the forwarding path of traffic from CE1 with IP address 192.0.3.1 to CE2 with IP address 192.0.4.1 is CE1- > a- > C- > E- > G- > H- > CE2, and the Label forwarding table along the path 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 a global Label forwarding path and E- > G- > H is a traditional LSP, and labels are exchanged point by point for forwarding nodes.

The method for route dissemination according to the embodiment of the present invention is described in detail above with reference to fig. 2 and 3, and the node according to the embodiment of the present invention will be described in detail below with reference to fig. 4 and 5. As shown in fig. 4, the node 10 includes:

a receiving unit 11, configured to receive first identification information disseminated by a second node, where the first identification information is used to identify a global tag domain to which the second node belongs;

a sending unit 12, configured to disseminate, to the second node, a mapping relationship between a target route and a label corresponding to the target route according to a matching result between the first identification information and second identification information, where the second identification 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.

Therefore, the node of the embodiment of the present invention determines the type of the label to be broadcast to the neighboring node according to the matching result of the identification information of the global label domain to which the node belongs and the identification information of the global label domain to which the neighboring node of the node belongs, and does not need to manually configure the edge node of the global label domain network, thereby automatically avoiding the mapping relationship between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, and avoiding causing label collision or unnecessary false response of the outside nodes.

In this 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 disseminates 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: obtaining the target route; a label is assigned or applied for the target route.

In this embodiment of the present invention, optionally, the sending unit 12 is further configured to: if the target route hits the routing strategy of the global label application deployed on the node, applying the label for the target route to a control node in a global label domain to which the node belongs; the receiving unit 11 is further configured to: receiving a first label distributed for the target route and sent by the control node, wherein the first label is effective in a global label domain to which the node belongs;

if the processing unit 13 determines that the first identification information matches the second identification information, the sending unit 12 is configured to: broadcasting the mapping relation between the target route and the first label to the second node; and/or the presence of a gas in the gas,

if the processing unit 13 determines that the first identification information does not match the second identification information, the sending unit 12 is configured to: and broadcasting the mapping relation between the target route and a second label to the second node, wherein the second label is valid locally at the node.

In this embodiment of the present invention, optionally, the processing unit 13 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 the routing strategy deployed on the node applying the global label and the node does not have the global label pre-allocated to the target route, (2) the routing strategy deployed on the node applying the global label and the node does not have the global label pre-allocated to the target route;

the sending unit 12 is specifically configured to: and diffusing the mapping relation between the target route and the third label to the second node.

In this embodiment of the present invention, optionally, the receiving unit 11 is further configured to: receiving a mapping relation between the target route and a fourth label disseminated by a third node, wherein the fourth label is a label distributed or applied by the third node for the target route;

in terms of assigning or applying for a label for the target route, the processing unit 13 is specifically configured to: determining a valid range of the fourth tag; and if the effective range of the fourth label is determined not to be the global label domain of the node, allocating or applying a label for the target route.

In this embodiment of the present invention, optionally, the receiving unit 11 is further configured to: receiving third identification information disseminated by the third node, wherein the third identification information is used for identifying a global label domain to which the third node belongs;

wherein the processing unit 13 is specifically configured to: and determining the effective range of the fourth label according to the matching result of the second identification information and the third identification information.

In this embodiment of the present invention, optionally, in terms of determining the valid range of the fourth tag according to the matching result between the second identification information and the third identification information, the processing unit 13 is specifically configured to: and if the processing unit determines that the second identification information is matched with the third identification information, determining the effective 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 this embodiment of the present invention, optionally, the receiving unit 11 is specifically configured to: receiving a Border Gateway Protocol (BGP) update message disseminated by the second node, wherein the BGP update message carries the first identification information; or, receiving a Link State Advertisement (LSA) message of an Open Shortest Path First (OSPF) protocol, which is broadcasted by the second node, wherein the LSA message carries the first identification information; or receiving a link state protocol data unit (LSP) of an intermediate-to-intermediate system (IS-IS) protocol, which IS disseminated by the second node, wherein the LSP carries the first identification information.

It should be understood that the node 10 according to the embodiment of the present invention may correspond to a first node executing the method 100 in the embodiment of the present invention, and the above and other operations and/or functions of each module in the node 10 are respectively for implementing a corresponding flow corresponding to the first node in the method in 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 neighbor node according to the matching result of the identification 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, and does not need to manually configure the edge node of the global label domain network, thereby automatically avoiding the mapping relationship between the route and the global label from spreading to the nodes outside the global label domain network to which the node belongs, and avoiding causing label collision or unnecessary false response of the outside nodes.

As shown in fig. 6, an embodiment of the present invention further provides a node 100. The node 100 comprises a processor 101, a receiver 102, a sender 103 and a memory 104. Wherein, the processor 101, the memory 104, the receiver 102 and the transmitter 103 are connected by a bus system 105, the memory 104 is used for storing instructions, and the processor 101 is used for executing the instructions stored by the memory 104 to control the receiver 102 to receive signals and the transmitter 103 to transmit signals.

Wherein the receiver 102 is configured to: the first identification information is used for identifying the global label domain to which the second node belongs; the transmitter 103 is further configured to: the second identification information is used for identifying a global label domain to which the node belongs, and the target route is a route from the node to the second node.

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), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The memory 104 may include both 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 non-volatile random access memory. For example, the memory 104 may also store device type information.

The bus system 105 may include a power bus, a control bus, a status signal bus, and the like, in addition to a data bus. For clarity of illustration, however, the various buses are labeled in the figures as bus system 105.

In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 101. The steps of a method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in the processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in the memory 104, and the processor 101 reads the information in the memory 104 and completes the steps of the above method in combination with the hardware thereof. To avoid repetition, it is not described in detail here.

Optionally, as an embodiment, before the sender 103 disseminates 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: obtaining the target route; a label is assigned or applied for the target route.

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

the receiver 102 is specifically configured to: receiving a first label distributed for the target route and sent by the control node, wherein the first label is effective in a global label domain to which the node belongs;

if the processor 101 determines that the first identification information matches the second identification information, the transmitter 103 is configured to: broadcasting the mapping relation between the target route and the first label to the second node; and/or the presence of a gas in the gas,

if the processor 101 determines that the first identification information does not match the second identification information, the transmitter 103 is configured to: and broadcasting the mapping relation between the target route and a second label to the second node, wherein the second label is valid locally at the node.

Optionally, as an embodiment, the processor 101 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 the routing strategy deployed on the node applying the global label and the node does not have the global label pre-allocated to the target route, (2) the routing strategy deployed on the node applying the global label and the node does not have the global label pre-allocated to the target route;

wherein the transmitter 103 is specifically configured to: and diffusing the mapping relation between the target route and the third label to the second node.

Optionally, as an embodiment, the receiver 102 is further configured to: receiving a mapping relation between the target route and a fourth label disseminated by a third node, wherein the fourth label is a label distributed or applied by the third node for the target route;

in assigning or applying for a label for the target route, the processor 101 is specifically configured to: determining a valid range of the fourth tag; and if the effective range of the fourth label is determined not to be the global label domain of the node, allocating or applying a label for the target route.

Optionally, as an embodiment, the receiver 102 is further configured to: receiving third identification information disseminated by the third node, wherein the third identification information is used for identifying a global label domain to which the third node belongs;

wherein, the processor 101 is specifically configured to: and determining the effective range of the fourth label according to the matching result of the second identification information and the third identification information.

Optionally, as an embodiment, in terms of determining the valid range of the fourth tag according to the matching result of the second identification information and the third identification information, the processor 101 is specifically configured to: if the processor 101 determines that the second identification information matches the third identification information, the valid 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 specifically configured to: receiving a Border Gateway Protocol (BGP) update message disseminated by the second node, wherein the BGP update message carries the first identification information; or, receiving a Link State Advertisement (LSA) message of an Open Shortest Path First (OSPF) protocol, which is broadcasted by the second node, wherein the LSA message carries the first identification information; or receiving a link state protocol data unit (LSP) message from the intermediate system to the intermediate system IS-IS protocol, which IS broadcasted by the second node, wherein the LSP carries the first identification information.

It should be understood that the node 100 according to the embodiment of the present invention may correspond to the node 10 in the embodiment of the present invention, and may correspond to a first node in executing the method 100 according to the embodiment of the present invention, and the above and other operations and/or functions of each module in the node 100 are respectively for implementing corresponding processes corresponding to the first node in the method of fig. 2, and are not described herein again for brevity.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

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

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.

The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims

1. A method of route dissemination, comprising:

a first node receives first identification information disseminated by a second node, wherein the first identification information is used for identifying a global label domain to which the second node belongs;

the first node broadcasts a mapping relation between a target route and a label corresponding to the target route to the second node according to a matching result of the first identification information and second identification information, wherein the second identification information is used for identifying 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 step of the first node broadcasting the mapping relationship between the target route and the label corresponding to the target route to the second node according to the matching result of the first identification information and the second identification information includes:

if the first node determines that the first identification information is matched with the second identification information, the first node broadcasts the mapping relation between the target route and a first label to the second node, and the first label is effective in a global label domain to which the first node belongs;

and/or the presence of a gas in the gas,

and if the first node determines that the first identification information is not matched with the second identification information, the first node broadcasts the mapping relation between the target route and a second label to the second node, and the second label is locally effective at the first node.

2. The method of claim 1, further comprising, prior to the first node disseminating to the second node a mapping of a target route and a label corresponding to the target route:

the first node acquires the target route;

and the first node allocates or applies for a label for the target route.

3. The method of claim 2, wherein the first node assigning or applying for a label for the target route comprises:

if the target route hits a routing strategy deployed on the first node and applying for a global label, the first node applies for the label for the target route to a control node in a global label domain to which the first node belongs;

and the first node receives the first label distributed for the target route and sent by the control node.

4. The method of claim 2, wherein the first node assigning or applying for a label for the target route comprises:

the first node 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 first node: (1) the target route does not hit a routing policy applied for global labels deployed on the first node and the first node does not have a global label pre-allocated for the target route, (2) the first node does not have a routing policy applied for global labels deployed and the first node does not have a global label pre-allocated for the target route;

and the first node broadcasts the mapping relation between the target route and the third label to the second node.

5. The method of any of claims 2 to 4, wherein the first node obtaining the target route comprises:

the first node receives a mapping relation between the target route and a fourth label disseminated by a third node, wherein the fourth label is a label distributed or applied by the third node for the target route;

wherein the first node assigns or applies for a label for the target route, including:

the first node determines a valid range of the fourth label;

and if the effective range of the fourth label is not the global label domain to which the first node belongs, the first node allocates or applies for a label for the target route.

6. The method of claim 5, wherein the first node determining the valid range of the fourth tag comprises:

the first node receives third identification information disseminated by the third node, wherein the third identification information is used for identifying a global label domain to which the third node belongs;

and the first node determines the effective range of the fourth label according to the matching result of the second identification information and the third identification information.

7. The method of claim 6, wherein the determining, by the first node, the valid range of the fourth tag according to the matching result of the second identification information and the third identification information comprises:

8. The method of any of claims 1 to 4 or 6 or 7, wherein the first node receives first identification information disseminated by a second node, comprising:

the first node receives a Border Gateway Protocol (BGP) update message disseminated by the second node, wherein the BGP update message carries the first identification information; or the like, or, alternatively,

the first node receives a Link State Advertisement (LSA) message of an Open Shortest Path First (OSPF) protocol, which is broadcasted by the second node, wherein the LSA message carries the first identification information; or the like, or, alternatively,

and the first node receives a link state protocol data unit (LSP) from an intermediate system to an intermediate system (IS-IS) protocol, which IS broadcasted by the second node, wherein the LSP carries the first identification information.

9. A node, comprising:

a receiving unit, configured to receive first identification information disseminated by a second node, where the first identification information is used to identify a global tag domain to which the second node belongs;

a sending unit, configured to disseminate, to the second node, a mapping relationship between a target route and a label corresponding to the target route according to a matching result of the first identification information and second identification information, where the second identification 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 further comprises: a processing unit;

the sending unit is further configured to:

if the processing unit determines that the first identification information is matched with the second identification information, the mapping relation between the target route and a first label is disseminated to the second node, and the first label is effective in a global label domain to which the node belongs; and/or the presence of a gas in the gas,

and if the processing unit determines that the first identification information is not matched with the second identification information, the processing unit broadcasts the mapping relation between the target route and a second label to the second node, and the second label is locally effective at the node.

10. The node of claim 9, wherein before the sending unit disseminates to the second node a mapping of a target route and a label corresponding to the target route, the processing unit is configured to:

acquiring the target route;

and allocating or applying for a label for the target route.

11. The node of claim 10, wherein the sending unit is further configured to:

if the target route hits a routing strategy deployed on the node for applying the global label, applying the label for the target route to a control node in a global label domain to which the node belongs;

and receiving the first label distributed to the target route and sent by the control node.

12. 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 strategy deployed on the node and applying for a global label, and the node does not have a global label pre-allocated for the target route, (2) the node does not deploy a routing strategy applying for a global label, and the node does not have a global label pre-allocated for the target route;

wherein the sending unit is specifically configured to:

and diffusing the mapping relation between the target route and the third label to the second node.

13. The node according to any of claims 10 to 12, wherein the receiving unit is further configured to:

receiving a mapping relation between the target route disseminated by a third node and a fourth label, wherein the fourth label is a label distributed or applied by the third node for the target route;

wherein, in terms of assigning or applying for a label for the target route, the processing unit is specifically configured to:

determining a valid range of the fourth tag;

and if the effective range of the fourth label is determined not to be the global label domain of the node, distributing or applying a label for the target route.

14. The node of claim 13, wherein the receiving unit is further configured to:

receiving third identification information disseminated by the third node, wherein the third identification information is used for identifying a global label domain to which the third node belongs;

wherein the processing unit is specifically configured to:

and determining the effective range of the fourth label according to the matching result of the second identification information and the third identification information.

15. The node according to claim 14, wherein in determining the valid range of the fourth tag according to the matching result of the second identification information and the third identification information, the processing unit is specifically configured to:

and if the processing unit determines that the second identification information is matched with the third identification information, determining the effective 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.

16. The node according to any of claims 9 to 12, 14 or 15, wherein the receiving unit is specifically configured to:

receiving a Border Gateway Protocol (BGP) update message disseminated by the second node, wherein the BGP update message carries the first identification information; or the like, or, alternatively,

receiving a Link State Advertisement (LSA) message of an Open Shortest Path First (OSPF) protocol, which is broadcasted by the second node, wherein the LSA message carries the first identification information; or the like, or, alternatively,

and receiving a link state protocol data unit (LSP) from the intermediate system to an intermediate system (IS-IS) protocol, which IS disseminated by the second node, wherein the LSP carries the first identification information.

17. A node, comprising: processor, memory, receiver and transmitter, the processor, the memory, the receiver and the transmitter being connected by a bus system, the memory being adapted to store instructions, the processor being adapted to execute the 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 claims 1 to 8.