WO2017066971A1

WO2017066971A1 - Method and device for removing a residual label switching path (lsp)

Info

Publication number: WO2017066971A1
Application number: PCT/CN2015/092586
Authority: WO
Inventors: 冯皓宇
Original assignee: 华为技术有限公司
Priority date: 2015-10-22
Filing date: 2015-10-22
Publication date: 2017-04-27

Abstract

The present invention relates to the technical field of communications, and especially relates to a method and a device for removing a residual label switching path (LSP), so as to resolve the problems of wrongly removing a normal resource or not being able to effectively remove a residual resource due to residual link erroneous determination. Said method is: a first node receiving a residual LSP removing request corresponding to a current LSP; when the first node determines, according to the path information of all LSPs stored by itself and the residual LSP removing request, an LSP belonging to the same group as the current LSP exists, forming a first LSP group of all LSPs belonging to the same group as the current LSP; the first node setting an LSP, among the first LSP group, not indicated by the residual LSP removing request as a second LSP group, and setting the LSP in the second LSP group as a residual LSP; the first node removing the LSP in the second LSP group. This can achieve the efficiency of the residual removing, and improving the reliability of the residual removing and the survivability of the services in the network.

Description

Method and device for clearing residual label switching path LSP

Technical field

The present invention relates to the field of communications technologies, and in particular, to a method and apparatus for clearing a residual label switching path LSP.

Background technique

The rapid development of the Internet poses various challenges to the IP bearer network, such as routing problems, quality of service (QoS) guarantees, and the like. For example, the future service is mainly based on bursty data services, and the IP bearer network has insufficient processing capability for such services. The Asynchronous Transfer Mode (ATM) network has insufficient processing efficiency for such services, and Transmission and switching costs are high. In addition, various IP and ATM convergence technologies such as LAN Emulation (LANE), IPOA (IP Over ATM), and Label Switching (TAG SWITC H) can only solve local problems. Take care of the overall situation.

At present, the development of the network is moving towards the trend of broadband, intelligence and integration. Referring to FIG. 1 , a transport network supporting Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) is an open communication network that uses tags to guide data at high speed. , efficient transmission network. Among them, the meaning of multi-protocol means that it can support multiple network switching technologies, such as packet switching, time-switching, and wavelength switching. The value of this label switching technology is to introduce the connection mode feature in a connectionless network, reduce the complexity of the network, and be compatible with existing mainstream network technologies, which can reduce the network cost and provide IP services. Ensure QoS and security.

However, as the scale and traffic of MPLS/GMPLS networks become larger and larger, there are more and more network of resources. Due to frequent service switching or communication anomalies, there will be many residual services in the long-running network. If it is not released in time, if these residual businesses cannot be cleaned up in time, it will seriously affect the survivability of the business.

In the prior art, when a node detects that a resource occupation state of a link changes, And determining whether the resource occupation status of the two ends of the link is consistent by the Open Shortest Path First (OSPF) or the Constraint-based Shortest Path First (CSPF), if the link is consistent. If the resource usage status of the two ends is inconsistent, the link is determined to be a residual link, and the link is cleared. If the resources at both ends of the link are in the same state, the link is determined to be a normal link. Clean up. However, it is necessary to determine whether the link is deleted by the resource occupancy status of the two ends of the link. Therefore, if both ends are residual resources and the occupied status is the same, the link cannot be determined as a residual link, and the corresponding link cannot be performed. Residual cleaning. In addition, since the flooding of the message through the routing protocol has a certain delay, the state of the two ends of the link may be updated in the future, resulting in inconsistent state of the two ends of the link, thereby causing the normal link to be misidentified as a residual link. The error cleaned up the normal resources. Therefore, in the prior art, there is a problem that the residual resources cannot be completely cleaned or the residual resources are erroneously cleaned up.

Summary of the invention

The embodiment of the invention provides a method and a device for clearing a residual label switching path LSP, which are used to solve the problem of residual link misjudgment, which cannot effectively clean up residual resources or incorrectly clean up normal resources.

The specific technical solutions provided by the embodiments of the present invention are as follows:

The first aspect is a method for clearing a residual label switching path LSP, including:

The first node receives a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate the current LSP a parent path, where the partner object encoding information is used to indicate an alternate path of the current LSP;

The first node determines that the LSPs in the same group as the current LSP form the first LSP group according to the path information of all the LSPs that are saved by the first LSP and the residual LSP clearing request. The first LSP group is a set of LSPs established by the same service as the current LSP;

The first node, in the first LSP group, the LSP that is not indicated by the residual LSP clearing request is used as the second LSP group, and the LSP in the second LSP group is used as the residual LSP;

The first node clears an LSP in the second LSP group.

With reference to the first aspect, in a first possible implementation manner of the first aspect, after the first node sends the LSP in the second LSP group to a residual LSP, the first node clears the Before the LSP in the second LSP group, the method further includes:

The first node filters out an LSP whose time-scale value of the LSP in the second LSP group is greater than the time-scale value of the current LSP as a non-residual LSP, and the non-residual LSP is from the second LSP group. delete;

The residual LSP clearing request further carries a time stamp value of the current LSP, and the time stamp value of the current LSP is used to identify a serial number when the current LSP is newly created.

With reference to the first aspect or the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the first node is configured according to a path message of all LSPs saved by the first node and the residual LSP. The clearing request determines that there is an LSP in the same group as the current LSP, including:

And determining, by the first node, the LSP that meets the following at least one condition is an LSP that is in the same group as the current LSP according to the path information of all the LSPs that are saved by the first LSP and the residual LSP clearing request:

Condition 1: the same as the head node management address of the current LSP;

Condition 2: the same as the last node management address of the current LSP;

Condition 3: the identity of the tunnel where the current LSP is located is the same;

The residual LSP clearing request carries the head node management address of the current LSP, the last node management address of the current LSP, the identity identifier of the tunnel where the current LSP is located, and the path identifier of the current LSP.

With reference to the first aspect, or any one of the foregoing possible implementation manners of the first aspect, in the third possible implementation manner of the first aspect, the first node is in the first LSP group, the residual The LSP that is not indicated by the LSP clearing request is used as the second LSP group, including:

The first node uses each LSP in the first LSP group as the LSP to be determined, and performs:

Determining, by the first node, whether the current LSP to be determined is a parent path of the current LSP indicated by the parent object coding information;

If yes, proceed to determine whether the current LSP to be determined is an alternate path of the current LSP indicated by the partner object coding information;

If no, it is determined that the current to-be-determined LSP belongs to the second LSP group.

With reference to the first aspect, or any one of the foregoing possible implementation manners of the first aspect, in the fourth possible implementation manner of the first aspect, the first node clears an LSP in the second LSP group, including :

The first node performs the LSP in each of the second LSP groups as a residual LSP, and performs:

If the first node is the first node in the current LSP, the first node sends a path clearing message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP; or

If the first node is an intermediate node in the current LSP, the first node sends a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP. And sending a path error message for the current residual LSP to the neighboring upstream node of the first node in the residual path; or

If the first node is the last node in the current LSP, the first node sends a path error message for the current residual LSP to the neighboring upstream node of the first node in the current residual path.

In a second aspect, an apparatus for clearing a residual label switching path LSP includes:

a receiving unit, configured to receive a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate the current a parent path of the LSP, where the partner object encoding information is used to indicate an alternate path of the current LSP;

a processing unit, configured to determine, according to the path message of all the LSPs saved by the LSP and the residual LSP clearing request, that the LSPs in the same group as the current LSP form the first LSP group The first LSP group is a set of LSPs established by the same service as the current LSP;

And the LSP that is not indicated by the residual LSP clearing request in the first LSP group is used as the second LSP group, and the LSP in the second LSP group is used as the residual LSP;

And a clearing unit, configured to clear an LSP in the second LSP group.

With reference to the second aspect, in a first possible implementation manner of the second aspect, after the processing unit uses the LSPs in the second LSP group as residual LSPs, the clearing unit clears the second Before the LSP in the LSP group, it also includes:

a screening unit, configured to filter out an LSP whose time-scale value of the LSP in the second LSP group is greater than a time-scale value of the current LSP as a non-residual LSP, and the non-residual LSP from the second LSP group delete;

With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, determining, by using a path message of all LSPs saved by the LSP and the residual LSP clearing request, When the current LSP is in the same group as the LSP, the processing unit is specifically configured to:

The LSP that meets the following at least one condition is an LSP that is in the same group as the current LSP according to the path information of all LSPs that are saved by the LSP and the residual LSP clearing request:

Condition 1: the same as the head node management address of the current LSP;

Condition 2: the same as the last node management address of the current LSP;

With reference to the second aspect, or the first possible implementation manner of the second aspect, in a third possible implementation manner of the second aspect, the LSP that is not indicated by the residual LSP clear request in the first LSP group When the second LSP group is used, the processing unit is specifically configured to:

Each LSP in the first LSP group is used as the LSP to be determined, and respectively:

Determining whether the current LSP to be determined is the current LSP indicated by the parent object coding information Parent path

With the second aspect or the first possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, the clearing unit is specifically used to clear an LSP in the second LSP group :

The LSP in each of the second LSP groups is used as a residual LSP, and respectively:

If the device is the first node in the current LSP, send a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP; or

If the device is an intermediate node in the current LSP, send a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP, and go to the residual path. An adjacent upstream node of the first node sends a path error message for the current residual LSP; or

If the device is the last node in the current LSP, send a path error message for the current residual LSP to the neighboring upstream node of the first node in the current residual path.

In a third aspect, a label switching router includes a transceiver, a processor, and a memory. The transceiver, the processor, and the memory are connected to each other;

The transceiver is configured to receive a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate a parent path of the current LSP, the partner The object coding information is used to indicate an alternate path of the current LSP;

a processor, configured to determine, by using a path message of all the LSPs that are saved by the root and the LSP clearing request that is in the same LSP, that the LSPs in the same group as the current LSP form the first LSP group, where the first The LSP group is a set of LSPs established by the same service as the current LSP; and the LSP that is not indicated by the residual LSP clearing request in the first LSP group is used as the second LSP group, and the LSP in the second LSP group is used as a residual LSP; and used to clear the second LSP group LSP;

A memory for storing program code executed by the processor.

The beneficial effects of the present invention are as follows:

The first node receives a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, which are preset objects extended in the signaling protocol, the parent object The encoding information is used to indicate the parent path of the current LSP, and the partner object encoding information is used to indicate the alternate path of the current LSP. The residual LSP clearing request may be carried in the existing LSP establishment request or the refresh request without adding an additional processing procedure. The first node determines that the LSPs in the same group as the current LSP form the first LSP group according to the path information of the LSPs and the residual LSP clearing request that are saved by the first LSP. The first LSP group is the first LSP group. A set of LSPs established by the pointer to the same service as the current LSP. The solution of the present application combines the path information standard object to clear the residual LSPs in the same group of services, and finally implements residual LSP clearing in the entire network. The first node uses the LSP that is not indicated by the residual LSP clearing request in the first LSP group as the second LSP group, and uses the LSP in the second LSP group as the residual LSP, and further uses the time stamp for the LSP in the second LSP group. The value is filtered to make the determination of the residual LSP more accurate. Finally, the first node clears the LSP in the second LSP group. Therefore, the method provided by the embodiment of the invention can achieve the high efficiency of the residual cleaning, and improve the reliability of the residual cleaning and the survivability of the service in the network.

DRAWINGS

1 is a basic network architecture of an MPLS and GMPLS network in the background art of the present invention;

2 is a flowchart of an overview of clearing a residual label switching path LSP according to an embodiment of the present invention;

3 is a schematic structural diagram of a definition of a parent object according to an embodiment of the present invention;

4 is a schematic structural diagram of a partner object definition according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a time stamp value definition according to an embodiment of the present invention; FIG.

6 is a schematic diagram of a process of creating a silver-level service according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of a process of creating a 1+1 service according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a re-routing process of a silver-level service according to an embodiment of the present invention; FIG.

FIG. 9 is a schematic diagram of a process of establishing a re-routing of a 1+1 service according to an embodiment of the present invention;

FIG. 10 is a specific flowchart of clearing residual LSPs in a process of returning a diamond service in the embodiment of the present invention; FIG.

11 is a schematic diagram of a routing connection of a returnable diamond service according to an embodiment of the present invention;

FIG. 12 is a schematic diagram of a new process of returning a diamond service according to an embodiment of the present invention; FIG.

FIG. 13 is a schematic structural diagram of an apparatus for clearing a residual label switching path LSP according to an embodiment of the present invention;

FIG. 14 is a schematic structural diagram of a label switching router according to an embodiment of the present invention.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. It is a partial embodiment of the invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

The embodiment of the invention provides a method and a device for clearing a residual label switching path LSP, which are used to solve the problem of residual link misjudgment, which cannot effectively clean up residual resources or incorrectly clean up normal resources. The method and the device are based on the same inventive concept. Since the principles of the method and the device for solving the problem are similar, the implementation of the device and the method can be referred to each other, and the repeated description is not repeated.

In the embodiment of the present invention, the residual LSP refers to a protocol soft state control block in which an LSP remains on the control plane, and the residual resource refers to a resource remaining in the forwarding layer corresponding to the residual LSP, such as an actual wavelength, a channel, a time slot, or Bandwidth, etc.

In the label switching network, the main reasons for the residual LSP are as follows:

First, in the process of deleting the LSP, the message is lost due to insufficient stability of the communication protocol, and the entire end-to-end LSP deletion process is not completed, resulting in a residue;

Second, in the process of deleting the LSP, since the intermediate node of the path is unstable, for example, the intermediate node may be in a reset state and cannot process the protocol message, resulting in failure to complete the entire end-to-end LSP. Deletion process, resulting in residue;

Third, in the process of deleting the LSP, due to the reliability or stability of the protocol software itself, for example, a software exception may not be processed normally, and the entire end-to-end LSP deletion process is not completed, resulting in a residue.

Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

Referring to FIG. 2, an embodiment of the present invention provides a method for clearing a residual label switching path LSP, including:

Step 200: The first node receives a residual LSP clear request for the current LSP.

The residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information. The parent object encoding information is used to indicate a parent path of the current LSP, and the partner object encoding information is used to indicate an alternate path of the current LSP.

Specifically, the residual LSP clearing request may be initiated at the same time when the LSP is established, that is, the residual LSP clearing request is carried in the LSP establishment request, or may be initiated when the operator triggers the refresh process for an LSP, that is, the residual LSP is cleared. The request is carried in the LSP refresh request.

The parent object and the partner object are both preset objects, and can be represented by a new set of objects extended by the Resource Reservation Protocol (RSVP). The following mainly introduces the specific meaning and purpose of the parent object and the partner object:

The parent object (parent OBJ) is used to indicate the parent path of the current LSP, that is, which LSP is rerouted by the current LSP. See Figure 3 for the definition of parent OBJ. The residual LSP clearing request may carry multiple parent object encoding information. Preferably, the number of parent object encoding information is generally less than or equal to 2.

For example, the path with the active/standby attribute has three LSPs, namely LSP1, LSP2, and LSP3. LSP1 reroutes LSP2 and LSP2 reroutes LSP3. The parent 1 of LSP3 is the LSP ID of LSP2, and parent2 is the LSP ID of LSP1. . The parent1 of LSP2 is the LSP ID of LSP1.

Specifically, the number of the parent object coding information is 2, and the parent OBJ code information for LSP1 is: (parent1:0/parent2:0);

The parent OBJ encoding information for LSP2 is: (parent1:1/parent2:0);

The parent OBJ encoding information for LSP3 is: (parent1:2/parent2:1).

Second, the partner object (OBB) is used to indicate the alternate path of the current LSP, that is, the current LSP has an active/standby relationship with which LSPs. See Figure 4 for the definition of partner OBJ. The LSP clearing request may carry multiple partner object encoding information, and the number of partner object encoding information is generally less than or equal to 2.

For example, the primary path has two LSPs, namely LSP1 and LSP3, and LSP1 reroutes LSP3. The backup path has one LSP, that is, LSP2, which is the backup path of LSP1 and LSP3. When LSP2 reroutes LSP4, that is for LSP4. Partner1 is the LSP ID of LSP3, and partner2 is the LSP ID of LSP1.

Specifically, the number of the partner object coding information is 2, and the partner OBJ coding information for LSP1 is: (partner 1:2/parent2:0);

The partner OBJ encoding information for LSP2 is: (partner 1:1/partner2:0);

The partner OBJ encoding information for LSP3 is: (partner 1:2/partner2:0);

The partner OBJ encoding information for LSP4 is: (partner 1:3/partner2:1);

Optionally, the residual LSP clearing request may further carry a timestamp of the current LSP, where the timestamp value is a serial number that identifies the current LSP newly created. See Figure 5 for the definition of the timeStamp object.

The following describes in detail how the parent object coding information and the partner object coding information are encoded in the residual LSP clear request.

See Figure 6 for a new process for the silver business.

Specifically, the new LSP-1 is from the first node A to the last node D, and the path of the LSP-1 is ABD, and the path information standard object of the LSP-1 is [1.1.1.1/1.1.1.4/1/1] because it is newly built. In the silver service, there is no parent LSP or active/standby LSP. Therefore, the parent object encoding information and partner object encoding information of LSP-1 are: (parent1:0/parent2:0), (partner1:0/partner2:0), The time scale value is timestamp(1).

The path information standard object here is referred to as a quad group, including a head node management address, a last node management address, a tunnel identity, and a path identifier, which are contents specified by the standard protocol.

Refer to Figure 7 for the 1+1 service creation process.

Specifically, the new working path LSP-1 and the protection path LSP-2 are from the first node A to the last node D, the path of the LSP-1 is ACD, the path of the LSP-2 is ABD, and the path information standard object of the LSP-1 is [1.1.1.1/1.1.1.4/1/1], the path information standard object of LSP-2 is [1.1.1.1/1.1.1.4/1/2] because it is a new 1+1 service, LSP-1 and LSP. There is an active/standby relationship between -2 and no parent-child relationship. Therefore, the parent object encoding information and partner object encoding information of LSP-1 are: (parent1:0/parent2:0), (partner1:2/partner2:0) The timestamp value is timestamp(1). The parent object encoding information of LSP-2 and the partner object encoding information are: (parent1:0/parent2:0), (partner1:1/partner2:0), and the timestamp value is timestamp. (2).

Referring to FIG. 8, the re-routing process is established for the silver service.

Re-routing the silver-level service shown in Figure 6. The path of the LSP-1 is ABD, and the path information standard object of the LSP is [1.1.1.1/1.1.1.4/1/1]. The path of the new LSP-2 is re-routed. The information standard object is [1.1.1.1/1.1.1.4/1/2], and the path of LSP-2 is ACD. Because LSP-2 is a rerouting silver service, LSP-2 has a parent path but no alternate path. The parent object coding information and partner object coding information of LSP-2 are: (parent1:1/parent2:0), (partner1:0/partner2:0), and the timestamp value is timestamp(2).

Referring to FIG. 9, the re-routing process is established for the 1+1 service.

Rerouting is performed for the 1+1 service shown in FIG. 7, and LSP-1 is rerouted to obtain LSP-3. The path of LSP3 is ABCD, and the path information standard object of the new LSP-3 for rerouting is [1.1.1.1/1.1.1.4/1/3]. Because LSP-3 is a rerouting 1+1 service, LSP-3 has a parent. The path also has an alternate path. Therefore, the parent object encoding information and the partner object encoding information of LSP-3 are: (parent1:1/parent2:0), (partner1:2/partner2:0), and the timestamp value is timestamp (3). ).

Step 210: The first node determines that the LSPs in the same group as the current LSP form the first LSP group according to the path information of the LSPs and the residual LSP clearing request that are saved by the first LSP. An LSP group is a group of LSPs established by the same service as the current LSP.

Specifically, the first node determines, according to the path message of all the LSPs and the residual LSP clearing request that is saved by the first node, that the LSP that meets the following conditions is an LSP that is in the same group as the current LSP:

Condition 1: the same as the head node management address of the current LSP;

Condition 2: the same as the management address of the last node of the current LSP;

Condition 3: Same as the identity of the tunnel where the current LSP is located.

It is only necessary to satisfy a condition that an LSP belongs to the same service group as the current LSP, that is, belongs to the first LSP group. The residual LSP clearing request carries the management address of the first node of the current LSP, the management address of the last node of the current LSP, the identity of the tunnel where the current LSP is located, and the path identifier of the current LSP. The first node management address of the current LSP, the management address of the last node of the current LSP, the identity of the tunnel where the current LSP is located, and the path identifier of the current LSP are the standard information of the path information of the current LSP, which is the content specified by the standard protocol.

For example, LSP3 is from the first node A to the last node D, and the path information standard object of the node B and the node C, that is, ABCD, LSP3 is [1.1.1.1/1.1.1.4/1/3], that is, the head node management address 1.1.1.1, the last node management address 1.1.1.4, the tunnel identity 1, the path identifier 3, referred to as the quad. When the LSP3 is newly created, it is assumed that the node A receives the residual LSP clearing request for the LSP3, and determines that the LSP that satisfies at least one of the following conditions is an LSP of the same group as the LSP3 according to the path information of all the LSPs and the residual LSP clearing request.

Condition 1: The same as the head node management address of LSP3;

Condition 2: Same as the management address of the last node of LSP3;

Condition 3: Same as the identity of the tunnel where LSP3 is located.

Node A determines that LSP1 and LSP2 meet the three conditions. These LSPs are the same as the first ternary of the quaternary LSP3 and belong to the first LSP group.

In addition, the first node determines that there is no LSP in the same group as the current LSP according to the path message standard object of the current LSP, and if the residual LSP clear request is carried in the LSP establishment request or the LSP refresh request, the current LSP is completed or The path refresh process of the i-th LSP.

Step 220: The first node uses the LSP that is not indicated by the residual LSP clearing request in the first LSP group as the second LSP group, and uses the LSP in the second LSP group as the residual LSP.

Specifically, the first node uses each LSP in the first LSP group as the LSP to be determined, and respectively performs:

If not, proceed to determine whether the current LSP to be determined is an alternate path of the current LSP indicated by the partner object coding information;

If no, it is determined that the current LSP to be determined belongs to the second LSP group.

Therefore, the LSP that does not belong to the second LSP group in the first LSP group indicates the path indicated by the parent or partner in the LSP establishment request. If there is no LSP belonging to the second LSP group, it indicates that there is no residual path in node A.

In addition, after the LSPs in the second LSP group are the residual LSPs, the first node filters out the LSPs in the second LSP group. The LSP of the current LSP time-scale value is used as the non-residual LSP, and the non-residual LSP is deleted from the second LSP group. The residual LSP clearing request also carries the timestamp value of the current LSP, and the current LSP timestamp value is used to identify the serial number of the current LSP.

Here, a filtering process is added because there is a special case. When the downstream node restarts and recovers, if the new path (new_LSP) is established from the upstream node to the downstream node and the residual LSP is being recovered synchronously, the residual LSP may be normal. The LSP (new_LSP) error is cleared. Alternatively, when refreshing for LSP2, the path established after LSP2 may be deleted by mistake. Therefore, special treatment is required for these situations.

For example, LSP-1 is the original path, and LSP-2 is rerouted by LSP-1. The first node has deleted LSP-2, but there may be residual LSP-2 on the downstream node. The node sends a synchronization recovery message. LSP-3 is the rerouting path of LSP-1. At this time, the first node is also sending an LSP establishment message downstream to LSP-3. If the LSP establishment message of the rerouted LSP-3 is sent to the node P to complete the establishment process of the new LSP-3, the synchronization recovery message for the LSP-2 subsequently arrives at the node P, which is carried by the synchronization recovery message for the LSP-2. Both parent and partner do not indicate LSP-3. The LSP-3 may be directly removed as a residual LSP. Therefore, you need to compare the time-scale values of LSP-3 and LSP-2 before deleting LSP-3. The time stamp value is greater than the time stamp value of LSP-2. Therefore, LSP-3 cannot be deleted as a residual LSP.

Step 230: The first node clears the LSP in the second LSP group.

The first node uses the LSP in each second LSP group as a residual LSP to initiate the deletion of the end-to-end residual LSP. The following three scenarios are included:

In the first case, if the first node is the first node in the current LSP, the first node sends a path clear message for the current residual LSP, that is, PathTear, to the neighboring downstream node of the first node in the current residual LSP.

For example, when the first node is the head node (Node A), the residual LSP is found to be LSP-2, that is, ACD, and the first node (Node A) sends PathTear to LSP-2 to the node C. After the node C is cleaned, the node D is cleared to the node D. Send PathTear for LSP-2.

The second case: if the first node is an intermediate node in the current LSP, the first node sends a path clear message for the current residual LSP, that is, PathTear, to the neighboring downstream node of the first node in the current residual LSP, and the residual path The neighboring upstream node of the first node sends a path error message for the current residual LSP, that is, PathErr.

For example, when the first node is an intermediate node (Node C), the residual LSP is found to be LSP-2, that is, ACD, and the intermediate node (Node C) sends PathTear for LSP-2 to Node D, and sends LSP-2 to Node A. PathErr.

The third case: if the first node is the last node in the current LSP, the first node sends a path error message for the current residual LSP, that is, PathErr, to the neighboring upstream node of the first node in the current residual path.

For example, when the first node is the last node (node D), the residual LSP is found to be LSP-2, that is, ACD, and the last node (node D) sends PathErr to the LSP-2 to the node C. After the node C is cleaned up, the node is sent to the node. A sends a PathErr for LSP-2.

Example 1:

Referring to FIG. 10, FIG. 11, and FIG. 12, in order to return the diamond service, the route that the primary path LSP-1 passes is A-B-D, and the route that the standby path LSP-2 passes is A-C-D. The primary path LSP-1 is faulty, and the LSP-3 is rerouted. The route that passes is A-B-E-D. LSP-3 initiates a return after the LSP-1 alarm disappears, and deletes LSP-3 after returning. Deletion of LSP-3 due to unstable downstream communication or intermediate node reset The signaling message does not complete the end-to-end deletion process, and the downstream node has LSP-3 remaining, assuming that LSP-3 remains in Node B, Node E, and Node D.

Now, the standby path LSP-2 is faulty, and the LSP-4 is rerouted. The route that passes is A-C-E-D.

Step 1001: The node E receives an LSP establishment request for the LSP-4, and the LSP establishment request carries a residual LSP clearing request for the LSP-4.

The residual LSP clear request for LSP-4 is generated by the node A code.

The path information standard object of LSP-4 is [1.1.1.1/1.1.1.4/1/4], and the parent object coding information and partner object coding information of LSP-4 are: (parent1:2/parent2:0), ( Partner1:1/partner2:0), the timestamp value is timestamp(4). LSP-3 has been deleted and therefore will not be encoded in the parent object encoding information and partner object encoding information of LSP-4.

Step 1002: Node E parses the residual LSP clear request for LSP-4.

Step 1003: The node E determines the LSP attributed to the first LSP group according to the existing path information and the residual LSP clearing request for the LSP-4.

The path information stored in node E includes: the path information standard object of LSP-1 is [1.1.1.1/1.1.1.4/1/1], and the path information standard object of LSP-2 is [1.1.1.1/1.1.1.4/ 1/2], the path information standard object of LSP-3 is [1.1.1.1/1.1.1.4/1/3]. The node E has not deleted the LSP-3 because the downstream communication is unstable or the intermediate node is reset. Therefore, the path information standard object of the LSP-3 is also stored.

The node E determines that LSP-1, LSP-2, and LSP-3 meet the three conditions according to the path information standard object of LSP-4, which is the same as the first ternary of the quaternary LSP-4. Therefore, LSP-1 and LSP -2, LSP-3 are all attributed to the first LSP group.

Step 1004: The node E determines, for each LSP in the first LSP group, whether it is a path indicated by a parent or a partner, and determines an LSP that belongs to the second LSP group.

Specifically, the parent object coding information parent1:2 of LSP-4 indicates that LSP-2 is the parent path of LSP-4, and the partner object coding information partner1:1 indicates that LSP-1 is an alternate path of LSP-4, therefore, The LSP-3 in an LSP group belongs to the second LSP group.

Step 1005: Node E determines that LSP-3 is a residual LSP.

Step 1006: Node E initiates residual LSP clearing for LSP-3.

Specifically, the route that the LSP-3 passes is ABED, the node E is the intermediate node in the LSP-4, and the node E sends the PathTear for the LSP-3 to the adjacent downstream node D of the node E in the LSP-3, and the LSP- The neighboring upstream node B of the node E sends the PathErr for the LSP-3. After the node B completes the cleaning of the LSP-3, it continues to send the PathErr for the LSP-3 to the node A. This way LSP-3 can be completely cleaned up.

The method provided in the embodiment of the present invention is completely based on the existing GMPLS protocol, and fully integrates with the existing signaling establishment process, does not need to add an additional processing flow, improves the efficiency of the residual cleaning, and only needs to be extended in the signaling protocol. The preset object, combined with the path information standard object to determine the same group of service paths, can accurately determine the residual LSP, improve the reliability of the residual cleanup and the survivability of the service in the network.

Referring to FIG. 13, an embodiment of the present invention provides an apparatus for clearing a residual label switching path LSP, including:

The receiving unit 1301 is configured to receive a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate a parent path of the current LSP. The partner object encoding information is used to indicate an alternate path of the current LSP;

The processing unit 1302 is configured to determine, according to the path message of all the LSPs that are saved by the LSP and the residual LSP clearing request, that the LSPs in the same group as the current LSP form the first LSP group, where the first LSP group is formed. An LSP group is a group of LSPs established by the same service as the current LSP.

And the LSP in the first LSP group that is not indicated by the residual LSP clearing request is used as the second LSP group, and the LSP in the second LSP group is used as the residual LSP;

The clearing unit 1303 is configured to clear an LSP in the second LSP group.

Optionally, after the processing unit 1302 removes the LSPs in the second LSP group from the LSPs in the second LSP group, the clearing unit 1303 further includes:

The filtering unit 1304 is configured to filter out an LSP whose time-scale value of the LSP in the second LSP group is greater than the time-scale value of the current LSP as a non-residual LSP, and delete the non-residual LSP from the second LSP group;

The residual LSP clearing request also carries the timestamp value of the current LSP, and the current LSP timestamp value is used to identify the serial number of the current LSP.

Optionally, the processing unit 1302 is specifically configured to: when the LSPs in the same group as the current LSP are determined according to the path information of the LSPs and the residual LSP clearing request that are saved by the LSP.

The LSP that satisfies at least one of the following conditions is an LSP that is in the same group as the current LSP according to the path information of the LSP and the residual LSP clearing request that are saved by the LSP.

Condition 1: the same as the head node management address of the current LSP;

The residual LSP clearing request carries the management address of the first node of the current LSP, the management address of the last node of the current LSP, the identity of the tunnel where the current LSP is located, and the path identifier of the current LSP.

Optionally, when the LSP that is not indicated by the residual LSP clearing request is used as the second LSP group in the first LSP group, the processing unit 1302 is specifically configured to:

Determining whether the current LSP to be determined is a parent path of the current LSP indicated by the parent object coding information;

Optionally, when the LSP in the second LSP group is cleared, the clearing unit 1303 is specifically configured to:

The LSP in each second LSP group is used as a residual LSP.

If the device is an intermediate node in the current LSP, send a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP, and send the current residual to the adjacent upstream node of the first node in the residual path. Path error message of the LSP; or

If the device is the last node in the current LSP, a path error message for the current residual LSP is sent to the neighboring upstream node of the first node in the current residual path.

It should be noted that, in the embodiment of the present invention, the division of the module is schematic, and only one logical function is divided. In actual implementation, there may be another division manner. In addition, each functional module in each embodiment of the present application may be used. It can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules.

The integrated modules, if implemented in the form of software functional modules and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application, in essence or the contribution to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium. A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) or a processor to perform all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .

The embodiment of the present invention further provides a label switching router. As shown in FIG. 14, FIG. 14 is a schematic structural diagram of a label switching router according to an embodiment of the present invention. The device includes a transceiver 1401, a processor 1402, and a memory 1403. The transceiver 1401, the processor 1402, and the memory 1403 are connected to each other. The specific connecting medium between the above components is not limited in the embodiment of the present invention. In the embodiment of the present invention, the memory 1403, the processor 1402, and the transceiver 1401 are connected by a bus 1404 in FIG. 14. The bus is shown by a thick line in FIG. 14, and the connection manner between other components is only schematically illustrated. , not limited to. The bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 14, but it does not mean that there is only one bus or one type of bus.

In the embodiment of the present invention, the transceiver 1401 is configured to receive a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate The parent path of the current LSP, the partner object encoding information is used to indicate the alternate path of the current LSP.

The processor 1402 is configured to determine, by using the path information of all the LSPs that are saved by the root and the LSP clearing request that is in the same LSP, that the LSPs in the same group as the current LSP form the first LSP group, where An LSP group is a set of LSPs established by the same service as the current LSP; and an LSP that is not indicated by the residual LSP clearing request in the first LSP group is used as the second LSP group, and the LSP in the second LSP group is used as the LSP. a residual LSP; and used to clear an LSP in the second LSP group.

In the embodiment of the present invention, the memory 1403 is configured to store the program code executed by the processor 1402, and may be a volatile memory, such as a random access memory (English: random-access memory, abbreviation: RAM); The memory 1403 may also be a non-volatile memory (English: non-volatile memory), such as read-only memory (English: read-only memory, abbreviation: ROM), flash memory (English: flash memory), hard disk (English: hard Disk drive, abbreviated: HDD) or solid state drive (English: solid-state drive, SSD), or memory 1403 can be used to carry or store desired program code in the form of an instruction or data structure and can be accessed by a computer. Any other medium, but not limited to this. The memory 1403 may be a combination of the above memories.

The processor 1402 in the embodiment of the present invention may be a central processing unit (CPU).

In summary, the first node receives a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, which are pre-expanded in the signaling protocol. For example, the parent object encoding information is used to indicate the parent path of the current LSP, and the partner object encoding information is used to indicate the alternate path of the current LSP. The residual LSP clearing request may be carried in the existing LSP establishment request or the refresh request, without adding Additional processing flow.

The first node determines that the LSPs in the same group as the current LSP form the first LSP group according to the path information of the LSPs and the residual LSP clearing request that are saved by the first LSP. The first LSP group is the first LSP group. A set of LSPs established by the pointer to the same service as the current LSP. The solution of the present application combines the path information standard object to clear the residual LSP in the same group of services, the most Finally, the residual LSP is cleared in the whole network.

The first node uses the LSP that is not indicated by the residual LSP clearing request in the first LSP group as the second LSP group, and uses the LSP in the second LSP group as the residual LSP, and further uses the time stamp for the LSP in the second LSP group. The value is filtered to make the determination of the residual LSP more accurate. Finally, the first node clears the LSP in the second LSP group.

Therefore, the method provided by the embodiment of the invention can achieve the high efficiency of the residual cleaning, and improve the reliability of the residual cleaning and the survivability of the service in the network.

Those skilled in the art will appreciate that embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (system), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. Instructions are provided for implementation in the flowchart The steps of a process or a plurality of processes and/or block diagrams of a function specified in a block or blocks.

While the preferred embodiment of the invention has been described, it will be understood that Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and the modifications and

It is apparent that those skilled in the art can make various modifications and variations to the embodiments of the invention without departing from the spirit and scope of the embodiments of the invention. Thus, it is intended that the present invention cover the modifications and modifications of the embodiments of the invention.

Claims

A method for clearing a residual label switching path LSP, comprising:

The first node receives a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate the current LSP a parent path, where the partner object encoding information is used to indicate an alternate path of the current LSP;

The first node determines that the LSPs in the same group as the current LSP form the first LSP group according to the path information of all the LSPs that are saved by the first LSP and the residual LSP clearing request. The first LSP group is a set of LSPs established by the same service as the current LSP;

The first node, in the first LSP group, the LSP that is not indicated by the residual LSP clearing request is used as the second LSP group, and the LSP in the second LSP group is used as the residual LSP;

The first node clears an LSP in the second LSP group.
The method according to claim 1, wherein after the first node is the residual LSP in the second LSP group, the first node clears the second LSP group. Before the LSP, it also includes:

The first node filters out an LSP whose time-scale value of the LSP in the second LSP group is greater than the time-scale value of the current LSP as a non-residual LSP, and the non-residual LSP is from the second LSP group. delete;

The residual LSP clearing request further carries a time stamp value of the current LSP, and the time stamp value of the current LSP is used to identify a serial number when the current LSP is newly created.
The method according to claim 1 or 2, wherein the first node determines that there is an LSP in the same group as the current LSP according to the path message of all the LSPs saved by the first LSP and the residual LSP clearing request, including:

And determining, by the first node, the LSP that meets the following at least one condition is an LSP that is in the same group as the current LSP according to the path information of all the LSPs that are saved by the first LSP and the residual LSP clearing request:

Condition 1: the same as the head node management address of the current LSP;

Condition 2: the same as the last node management address of the current LSP;

Condition 3: the identity of the tunnel where the current LSP is located is the same;

The residual LSP clearing request carries the head node management address of the current LSP, the last node management address of the current LSP, the identity identifier of the tunnel where the current LSP is located, and the path identifier of the current LSP.
The method according to claim 1 or 2, wherein the first node, in the first LSP group, the LSP that is not indicated by the residual LSP clearing request is used as the second LSP group, and includes:

The first node uses each LSP in the first LSP group as the LSP to be determined, and performs:

Determining, by the first node, whether the current LSP to be determined is a parent path of the current LSP indicated by the parent object coding information;

If yes, proceed to determine whether the current LSP to be determined is an alternate path of the current LSP indicated by the partner object coding information;

If no, it is determined that the current to-be-determined LSP belongs to the second LSP group.
The method of claim 1 or 2, wherein the clearing, by the first node, the LSP in the second LSP group comprises:

The first node performs the LSP in each of the second LSP groups as a residual LSP, and performs:

If the first node is the first node in the current LSP, the first node sends a path clearing message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP; or

If the first node is an intermediate node in the current LSP, the first node sends a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP. And sending a path error message for the current residual LSP to the neighboring upstream node of the first node in the residual path; or

If the first node is the last node in the current LSP, the first node is to the current node A neighboring upstream node of the first node in the residual path sends a path error message for the current residual LSP.
An apparatus for removing a residual label switching path LSP, comprising:

a receiving unit, configured to receive a residual LSP clearing request for the current LSP, where the residual LSP clearing request carries at least one parent object encoding information and at least one partner object encoding information, where the parent object encoding information is used to indicate the current a parent path of the LSP, where the partner object encoding information is used to indicate an alternate path of the current LSP;

a processing unit, configured to determine, according to the path message of all the LSPs saved by the LSP and the residual LSP clearing request, that the LSPs in the same group as the current LSP form the first LSP group The first LSP group is a set of LSPs established by the same service as the current LSP;

And the LSP that is not indicated by the residual LSP clearing request in the first LSP group is used as the second LSP group, and the LSP in the second LSP group is used as the residual LSP;

And a clearing unit, configured to clear an LSP in the second LSP group.
The apparatus according to claim 6, wherein after the processing unit sets the LSPs in the second LSP group to be residual LSPs, before the clearing unit clears the LSPs in the second LSP group ,Also includes:

a screening unit, configured to filter out an LSP whose time-scale value of the LSP in the second LSP group is greater than a time-scale value of the current LSP as a non-residual LSP, and the non-residual LSP from the second LSP group delete;

The residual LSP clearing request further carries a time stamp value of the current LSP, and the time stamp value of the current LSP is used to identify a serial number when the current LSP is newly created.
The apparatus according to claim 6 or 7, wherein the processing unit is specifically configured to use an LSP that is in the same group as the current LSP according to a path message of all LSPs that is saved by itself and the residual LSP clearing request. to:

The LSP that meets the following at least one condition is an LSP that is in the same group as the current LSP according to the path information of all LSPs that are saved by the LSP and the residual LSP clearing request:

Condition 1: the same as the head node management address of the current LSP;

Condition 2: the same as the last node management address of the current LSP;

Condition 3: the identity of the tunnel where the current LSP is located is the same;

The residual LSP clearing request carries the head node management address of the current LSP, the last node management address of the current LSP, the identity identifier of the tunnel where the current LSP is located, and the path identifier of the current LSP.
The apparatus according to claim 6 or 7, wherein, when the LSP that is not indicated by the residual LSP clearing request is used as the second LSP group in the first LSP group, the processing unit is specifically configured to:

Each LSP in the first LSP group is used as the LSP to be determined, and respectively:

Determining whether the current LSP to be determined is the parent path of the current LSP indicated by the parent object coding information;

If yes, proceed to determine whether the current LSP to be determined is an alternate path of the current LSP indicated by the partner object coding information;

If no, it is determined that the current to-be-determined LSP belongs to the second LSP group.
The apparatus according to claim 6 or 7, wherein the clearing unit is specifically configured to: when the LSP in the second LSP group is cleared;

The LSP in each of the second LSP groups is used as a residual LSP, and respectively:

If the device is the first node in the current LSP, send a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP; or

If the device is an intermediate node in the current LSP, send a path clear message for the current residual LSP to the neighboring downstream node of the first node in the current residual LSP, and go to the residual path. An adjacent upstream node of the first node sends a path error message for the current residual LSP; or

If the device is the last node in the current LSP, send a path error message for the current residual LSP to the neighboring upstream node of the first node in the current residual path.