WO2016065747A1

WO2016065747A1 - Method and apparatus for identifying lsp reaggregation in p2mp

Info

Publication number: WO2016065747A1
Application number: PCT/CN2015/071107
Authority: WO
Inventors: 赵德涛
Original assignee: 中兴通讯股份有限公司
Priority date: 2014-10-28
Filing date: 2015-01-20
Publication date: 2016-05-06
Also published as: CN105634948A; CN105634948B

Abstract

Disclosed is a method for identifying LSP reaggregation in P2MP. The method comprises: after multiple SUB-LSPs are generated, determining whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the multiple SUB-LSPs, the first condition comprising that the same routing node exists in the first SUB-LSP and the second SUB-LSP, and an ingress port address of the same routing node in the first SUB-LSP is different from an ingress port address of the same routing node in the second SUB-LSP; when it is determined that the first SUB-LSP and the second SUB-LSP satisfying the first condition exist, determining whether the first SUB-LSP and the second SUB-LSP satisfy a second condition, the second condition comprising that a next-hop routing node of the same routing node in the first SUB-LSP is the same as a next-hop routing node of the same routing node in the second SUB-LSP, and an ingress port address of the same next-hop routing node in the first SUB-LSP is the same as an ingress port address of the same next-hop routing node in the second SUB-LSP; and when it is determined that the first SUB-LSP and the second SUB-LSP satisfy the second condition, determining that LSP reaggregation exists in the first SUB-LSP and the second SUB-LSP. Also disclosed is an apparatus for identifying LSP reaggregation in P2MP.

Description

Method and device for identifying LSP reaggregation in P2MP

Technical field

The present invention relates to the field of data network communication, and in particular, to a method and device for identifying label switching path LSP re-aggregation in P2MP.

Background technique

Figure 1 shows a topology of a point-to-multipoint (P2MP) LSP re-convergence. The topology includes two sub-LSPs (SUB-LSPs), which are Sub-LSP1 and Sub-LSP2, wherein Sub-LSP1 from the head node device R1 through the intermediate node devices R2 and R4, and finally to the tail node device R5; Sub-LSP2 from the head node device R1 through the intermediate node devices R3 and R4, and finally to the tail node device R6; The head node device, the intermediate node device, and the tail node device are collectively referred to as a node device, and the node devices are implemented by a routing device, and specifically, may be implemented by a routing device such as a router or a switch.

After the sub-LSP1 and the sub-LSP2 are separated on the R1, they are aggregated to the same interface on the R4. In this case, the P2MP LSP is re-aggregated. When the LSP re-aggregation occurs on the P2MP network, unnecessary The signaling overhead, and the routing calculation and signaling processing pressure of the relevant nodes are increased. Therefore, the Sub-LSPs that have occurred or have LSP re-aggregation must be detected and processed.

Currently, for the situation shown in Figure 1 above, the following processing steps are used to detect LSP re-aggregation:

After the PATH packet of the Sub-LSP1 passes the R4, the PATH packet of the Sub-LSP2 is detected. The PATH packet of the Sub-LSP2 and the Sub-LSP1 are different. The interface enters R4, but R4 is sent from the same interface to check the occurrence of LSP reconvergence.

It can be seen that the LSP re-aggregation detection method needs to check the re-aggregation situation when the PATH packet of the Sub-LSP1 passes the R4 and the PATH packet of the Sub-LSP2 reaches the re-aggregation routing node. The detection method can only detect whether there is a re-aggregation between the established Sub-LSPs, but not the pre-prediction function before establishing the Sub-LSP with the re-aggregation.

Summary of the invention

In order to solve the existing technical problems, embodiments of the present invention are expected to provide an LSP re-aggregation identification method and apparatus in P2MP.

An embodiment of the present invention provides a method for identifying an LSP re-aggregation in a P2MP, where the method includes:

After the multiple sub-label switching paths SUB-LSP are generated, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the first condition are present in the multiple SUB-LSPs, where the first condition includes: The same routing node exists in the first SUB-LSP and the second SUB-LSP, and the inbound interface address of the same routing node in the first SUB-LSP and the ingress in the second SUB-LSP The interface address is different;

When it is determined that the first SUB-LSP and the second SUB-LSP satisfy the first condition, determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, where the second condition includes: The next hop routing node of the same routing node in the first SUB-LSP is the same as the next hop routing node in the second SUB-LSP, and the same next hop routing node is in the The inbound interface address in a SUB-LSP is the same as the inbound interface address in the second SUB-LSP;

When it is determined that the first SUB-LSP and the second SUB-LSP meet the second condition, it is confirmed that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation.

In the above solution, the determining whether the first SUB-LSP and the second SUB-LSP satisfy the first condition in the multiple SUB-LSPs include:

Comparing the node information of each hop routing node in the path information of one SUB-LSP of the multiple SUB-LSPs with the node information of each hop routing node in the path information of any other SUB-LSP, The first SUB-LSP and the second SUB-LSP satisfying the first condition are determined in the multiple SUB-LSPs.

In the above solution, the node information of the routing node includes: a node device identifier of the routing node and an inbound interface address of the routing node.

In the above solution, after determining whether the first SUB-LSP and the second SUB-LSP satisfy the first condition in the multiple SUB-LSPs, the method further includes: determining the first SUB-LSP and the second SUB- Whether one of the LSPs is an established SUB-LSP and the other is an unestablished SUB-LSP.

In the above solution, the path information of the established SUB-LSP is obtained from the IP sub-object in the record routing object RRO carried in the RESV packet transmitted in the first SUB-LSP; the un-established SUB- The path information of the LSP is the calculated path information when the second SUB-LSP is generated.

In the foregoing solution, the same routing node exists in the first SUB-LSP and the second SUB-LSP by:

Determining whether the node device identifier of the routing node on the second SUB-LSP is the same as the node device identifier of the routing node on the first SUB-LSP, and if the same, determining that the first SUB-LSP and the second SUB-LSP are present The same routing node.

An embodiment of the present invention provides an LSP re-aggregation and identification device in a P2MP, where the device includes: a first judging module, a second judging module, and a confirming module;

The first determining module is configured to determine, after the multiple label switching paths SUB-LSP is generated, whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs, After the first SUB-LSP and the second SUB-LSP satisfying the first condition are confirmed, the second determining module is triggered; the first condition includes: the first SUB-LSP and the second SUB-LSP are present. The same routing node, and the same routing node is in the first The inbound interface address in the SUB-LSP is different from the inbound interface address in the second SUB-LSP;

The second determining module, configured to be triggered by the first determining module, determines whether the first SUB-LSP and the second SUB-LSP meet the second condition, and confirms the first SUB-LSP and the second SUB- When the LSP meets the second condition, the acknowledgment module is triggered; the second condition includes: the same routing node is in the next hop routing node in the first SUB-LSP, and in the second SUB-LSP The next hop routing node is the same, and the inbound interface address of the same next hop routing node in the first SUB-LSP is the same as the inbound interface address in the second SUB-LSP;

The acknowledgment module is configured to confirm that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation when triggered by the second judging module.

In the foregoing solution, the first determining module determines whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs by:

The device further includes: a third determining module, configured to determine, after the first determining module determines whether the first SUB-LSP and the second SUB-LSP satisfy the first condition, the first SUB One of the LSP and the second SUB-LSP is an established SUB-LSP, and the other is an unestablished SUB-LSP.

In the above solution, the first determining module or the second determining module is configured by the following manner The same routing node exists in one SUB-LSP and the second SUB-LSP:

The embodiment of the present invention further provides a computer storage medium, the storage medium includes a set of computer executable instructions, and the instructions are used to perform the LSP reaggregation identification method in the P2MP according to the embodiment of the present invention.

The LSP re-aggregation identification method and device in the P2MP provided by the embodiment of the present invention, after generating a plurality of sub-label switching paths SUB-LSP, determining whether the first SUB-LSP meets the first condition The SUB-LSP and the second SUB-LSP, the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the same routing node is in the first SUB - The inbound interface address in the LSP is different from the inbound interface address in the second SUB-LSP; when it is determined that there is a first SUB-LSP and a second SUB-LSP that satisfy the first condition, the first SUB is determined. Whether the LSP and the second SUB-LSP satisfy the second condition, the second condition comprising: the same routing node in the first SUB-LSP, the next hop routing node, and the second SUB The next hop routing node in the LSP is the same, and the inbound interface address of the same next hop routing node in the first SUB-LSP is the same as the inbound interface address in the second SUB-LSP; Determining, when the first SUB-LSP and the second SUB-LSP satisfy the second condition, confirming the first SUB-LSP and the second SUB-L The SP has LSP reconvergence. In this way, it is possible to accurately determine whether there is an LSP re-aggregation between the SUB-LSPs before the multiple SUB-LSPs are generated but not established, or after at least one of the plurality of SUB-LSPs is established. When the SUB-LSP is generated but not established, it can prevent the occurrence of LSP re-aggregation and avoid unnecessary signaling overhead caused by LSP re-aggregation. And the calculation of the route calculation and the signaling processing pressure on the relevant node; moreover, the method is simple and easy to implement, and does not need to meet the severe constraints to identify the LSP re-aggregation. Specifically, it does not need to be as prior art. Same, must After a plurality of Sub-LSPs are established, and the necessary conditions are met (ie, after the PATH message passes through the first routing node that is re-aggregated in a Sub-LSP in the two Sub-LSPs, the PATH message The LSP re-aggregation detection can be performed only when the same routing node that is re-aggregated in another Sub-LSP is reached.

DRAWINGS

FIG. 1 is a topological structure of a point-to-multipoint LSP re-convergence in the prior art;

2 is a flowchart 1 of an LSP re-aggregation identification method in a P2MP according to an embodiment of the present invention;

FIG. 3 is a flowchart 2 of an LSP re-aggregation identification method in a P2MP according to an embodiment of the present disclosure;

FIG. 4 is a schematic structural diagram of an LSP re-aggregation identification device in a P2MP according to an embodiment of the present invention.

detailed description

In the embodiment of the present invention, after the multiple sub-label switching paths SUB-LSP are generated, it is determined whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs. A condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the ingress interface address of the same routing node in the first SUB-LSP is in the second The inbound interface address of the SUB-LSP is different. When it is determined that the first SUB-LSP and the second SUB-LSP satisfy the first condition, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the second condition. The second condition includes: the same routing node is the same as the next hop routing node in the first SUB-LSP, and the same as the next hop routing node in the second SUB-LSP The ingress interface address of the next hop routing node in the first SUB-LSP is the same as the inbound interface address in the second SUB-LSP; determining the first SUB-LSP and the second SUB- When the LSP meets the second condition, it is confirmed that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation.

The invention will be further described in detail below with reference to the drawings and specific embodiments.

Embodiment 1

A first embodiment of the present invention provides a method for identifying an LSP re-aggregation in a P2MP. As shown in FIG. 2, the method includes the following steps:

Step 201: After generating a plurality of sub-label switching paths SUB-LSP, determining whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs, where the first condition includes The same routing node exists in the first SUB-LSP and the second SUB-LSP, and the inbound interface address of the same routing node in the first SUB-LSP is in the second SUB-LSP. The inbound interface address is different.

The first SUB-LSP and the second SUB-LSP are respectively different Sub-LSPs in the P2MP network;

After the first SUB-LSP or the second SUB-LSP is generated, the obtained path calculation result is path information of the first SUB-LSP and the second SUB-LSP; the path information includes: each on the corresponding SUB-LSP The node information of the one-hop routing node; the node information specifically includes: a node device identifier and an inbound interface address of the node device; the node device identifier refers to identifier information that can be used to uniquely identify a node device, for example: internetworking Protocol (IP, Internet Protocol) address, Media Access Control (MAC) address, or node device ID pre-assigned to each node device; after the SUB-LSP is generated, the header device on the SUB-LSP Each node device outside has an inbound interface address.

A SUB-LSP path information may be obtained by using various methods. For example, when a SUB-LSP is generated on a head node device or a routing domain border node device, path information of the generated SUB-LSP may be obtained; or, when After the SUB-LSP is established, the IP sub-object (IP Subobject) in the Record Route Object (RRO) carried in the RESV packet transmitted in the SUB-LSP carries the path information of the corresponding SUB-LSP. The path information of the corresponding SUB-LSP can be obtained through the RESV message.

The first SUB-LSP and the second SUB-LSP satisfying the first condition are determined in the multiple SUB-LSPs by:

The node information of each hop routing node in the path information of one SUB-LSP of the plurality of SUB-LSPs is sequentially connected to each hop routing node in the path information of any other SUB-LSP. The node information is compared to determine whether there are first SUB-LSPs and second SUB-LSPs that satisfy the first condition in the plurality of SUB-LSPs.

In an actual implementation, the second hop routing node information and the node information of each subsequent routing node may be respectively started from the second hop routing node in the path information of one SUB-LSP of the multiple SUB-LSPs. Comparing with the node information of the second hop routing node of the first SUB-LSP, if a routing node that satisfies the first condition is found in the second SUB-LSP, the current process is skipped, and the processing in step 102 is performed; If the routing node that satisfies the first condition is not found in the second SUB-LSP, the information of the second hop routing node in the second SUB-LSP path information and the information of each hop routing node and the first SUB-LSP are continued. The node information of the next hop routing node of the second hop routing node is compared. If a routing node that satisfies the first condition is found in the second SUB-LSP, the current flow is skipped, and the processing in step 102 is performed; Similarly, after comparing the second hop routing node information in the second SUB-LSP and the node information of each subsequent hop routing node with the node information of the last hop routing node in the first SUB-LSP, If the routing node that satisfies the first condition is not found in the first SUB-LSP, it is confirmed that the LSP re-aggregation of the second SUB-LSP and the first SUB-LSP does not occur. At this time, the entire LSP re-aggregation identification process is skipped.

The same routing node exists in the first SUB-LSP and the second SUB-LSP in the following manner:

Determining whether the node device identifier of the routing node on the second SUB-LSP is the same as the node device identifier of the routing node on the first SUB-LSP, and if the same, determining that the first SUB-LSP and the second SUB-LSP are present The same routing node; at the same time, it is determined that the same routing node does not exist in the first SUB-LSP and the second SUB-LSP.

After confirming that the same routing node exists in the first SUB-LSP and the second SUB-LSP, it is confirmed whether the inbound interface addresses of the same routing node are the same. If they are the same, it is confirmed whether the multiple SUB-LSPs exist. The first SUB-LSP and the second SUB-LSP satisfying the first condition.

Step 202: Determine that there are first SUB-LSPs and second SUB-LSPs that satisfy the first condition. Determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, where the second condition includes: the next routing node of the same routing node in the first SUB-LSP And the same as the next hop routing node in the second SUB-LSP, and the same next hop routing node in the first SUB-LSP in the inbound interface address, and in the second SUB-LSP The inbound interface address is the same.

In step 201, after the first routing node and the second routing node satisfying the first condition are found, it is not determined that the first SUB-LSP and the second SUB-LSP have re-aggregation, and the judgment in this step is also required, that is, Determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition;

At this time, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the second condition by using the following steps:

Step S301: The same routing node (hereinafter referred to as a first routing node for convenience) has a node device identifier of the next hop routing node in the first SUB-LSP and the same routing node ( For convenience, the second routing node is referred to as a second routing node. The node device identifiers of the next hop routing nodes in the second SUB-LSP are compared. If they are the same, step S302 is performed, where the same means: The next hop routing node of the first routing node and the second routing node are both present, and the node device identifiers are the same; if not, the process goes to step S304; it should be noted that the different situations here refer to the same situation. Any other than the case, for example, the first routing node and the second routing node of the second routing node are both present and the node device identifier is different, or one of the first routing node and the second routing node does not exist. a next hop routing node; when at least one of the first routing node and the second routing node does not have a routing node, starting from the first routing node or the second routing node LSP re-convergence;

Step S302: It is determined whether the inbound interface address of the next hop routing node of the first routing node is the same as the inbound interface address of the next hop routing node of the second routing node; if they are the same, go to step S303; Then go to step S304;

Step S303: Confirm that the first SUB-LSP and the second SUB-LSP satisfy the second condition; Current process

Step S304: Confirm that the first SUB-LSP and the second SUB-LSP do not satisfy the second condition; and skip the current judgment process.

It can be understood by those skilled in the art that, in the foregoing process of determining whether the first SUB-LSP and the second SUB-LSP meet the second condition, the inbound interface address of the next hop routing node of the first routing node may be compared first. Whether the inbound interface address of the next hop routing node of the second routing node is the same; when the acknowledgment is the same, compare whether the next hop routing node of the first routing node and the next hop routing node of the second routing node are the same routing node ;

Step 203: When it is determined that the first SUB-LSP and the second SUB-LSP meet the second condition, it is confirmed that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation.

After determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, if the first SUB-LSP and the second SUB-LSP satisfy the second condition, the first SUB-LSP and the first If the second SUB-LSP and the second SUB-LSP do not satisfy the second condition, it is confirmed that the first SUB-LSP and the second SUB-LSP do not have the LSP re-aggregation. .

After determining whether the first SUB-LSP and the second SUB-LSP satisfy the first condition in the multiple SUB-LSPs, it may be determined whether one of the first SUB-LSP and the second SUB-LSP is established. The SUB-LSP, and the other is an unestablished SUB-LSP; the path information of the established SUB-LSP is the IP sub-subject in the record routing object RRO carried in the RESV packet transmitted from the first SUB-LSP Obtained in the object; the path information of the unestablished SUB-LSP is the calculated path information when the second SUB-LSP is generated. In this way, it can be detected whether the SUB-LSP that has been generated but not yet established is re-aggregated with the existing SUB-LSP existing LSP.

If it is confirmed that the first SUB-LSP and the second SUB-LSP are re-aggregated before the first SUB-LSP and the second SUB-LSP are not established, or the second SUB-LSP is re-aggregated, the first SUB may be selected as needed. - LSP is deleted, and a new one is generated, and there is no re-convergence with the second SUB-LSP. The first SUB-LSP is deleted; or the second SUB-LSP is deleted, and a new second SUB-LSP that does not re-converge with the first SUB-LSP is generated;

If it is determined that one of the first SUB-LSP and the second SUB-LSP has been established but another SUB-LSP has not been established, it is determined that the first SUB-LSP and the second SUB-LSP are re-aggregated. The unestablished SUB-LSP is deleted, and a new SUB-LSP that does not re-converge with another SUB-LSP is generated.

The path information of the first SUB-LSP and the second SUB-LSP is derived from the path when the first SUB-LSP and the second SUB-LSP are generated before the first SUB-LSP and the second SUB-LSP are not established. Calculation results;

After the first SUB-LSP and the second SUB-LSP are both established, the path information of the first SUB-LSP and the second SUB-LSP is derived from the PATH transmitted in the first SUB-LSP and the second SUB-LSP. The IP sub-object in the record routing object RRO carried in the packet;

When one of the first SUB-LSP and the second SUB-LSP has been established, but another SUB-LSP has not been established, the path information of the established SUB-LSP is from the SUB-LSP. The IP sub-object in the record routing object RRO carried in the PATH packet; the path information of the unestablished SUB-LSP is derived from the path calculation result when the SUB-LSP is generated.

It can be seen that the LSP re-aggregation identification method in the P2MP provided by the embodiment of the present invention can quickly and conveniently implement the detection of re-aggregation of the SUB-LSP, especially for not allowing the sub-LSP to be formed in the existing RFC4875. When the aggregation of the sub-LSP is established, the problem of whether the LSP re-aggregation exists in the path can be determined before the RSVP-TE signaling is initiated, and the unnecessary RSVP signaling is avoided. .

The LSP re-aggregation identification method in the P2MP provided by the embodiment of the present invention is specifically described below through a specific example.

For example, the topology in which LSP re-aggregation is shown in Figure 1 is taken as an example, in the scenario of Figure 1. There are two LSPs starting from the head node device R1 and destined for R5 and R6 respectively. The two LSPs are: Sub-LSP1 and Sub-LSP2, where Sub-LSP1 destination is R5, Sub-LSP2 destination The ground is R6; Sub-LSP1 has been successfully established, and the path it passes is R1->R2->R4->R5, that is, starting from R1, passing R2 and R4 to R5; the path through which Sub-LSP2 passes is R1-> R3—>R4—>R5—>R6, that is, starting from R1 and reaching R6 via R3, R4, and R5; before the establishment of Sub-LSP2, whether there are LSPs for Sub-LSP2 and Sub-LSP1 through the flow shown in Figure 3. Re-aggregation for detection, the process includes the following steps:

Step 401: The IP address of the next hop routing node on the Sub-LSP 2 is stored in the variable ADDR (when the IP address is taken for the first time, the IP address is taken from the second hop routing node on the Sub-LSP 2);

Step 402: Traversing the IP Subobject in the RESV message RRO in Sub-LSP1;

Step 403: Determine whether the IP address of one routing node in the IP Subobject is the same as the ADDR, if yes, go to step 404; if not, go to step 401;

Step 404: Determine whether the inbound interface addresses of the routing nodes with the same IP address in Sub-LSP1 and Sub-LSP2 are the same. If they are the same, go to step 405; if not, go to step 406;

Step 405: Confirm whether the IP address and the inbound interface address of the next hop routing node of the routing node with the same IP address are the same; if the same (the same situation includes: the route with the same IP address in Sub-LSP1 and Sub-LSP2) If the next hop routing node of the node exists and the IP address and the inbound interface address are the same, go to step 407. If they are different, the different routes include: the routes with the same IP address in Sub-LSP1 and Sub-LSP2. The next hop routing node of the node exists and the IP address is different. Or, if at least one of the routing nodes with the same IP address in Sub-LSP1 and Sub-LSP2 does not have a next hop routing node, go to the step. 406;

Step 406: It is determined that there is no LSP re-aggregation on the Sub-LSP1 and the Sub-LSP2, and the current flow is skipped.

Step 407: It is determined that LSP re-aggregation exists in Sub-LSP1 and Sub-LSP2, and the current flow is skipped.

According to the above process, and specifically to the topology shown in Figure 1, firstly, the IP address of R3 in Sub-LSP2 is taken out to ADDR, and the IP addresses of all routing nodes in Sub-LSP1 are traversed in sequence, and it is confirmed that there is no IP address and the same as ADDR. The routing node is the next hop routing node in Sub-LSP2, that is, the IP address of R4 is stored in ADDR. At this time, the IP address of all routing nodes in Sub-LSP1 is traversed, and the IP address of R4 in Sub-LSP1 is found. Same as ADDR; further extracting the node information of the next hop routing node of R4 in Sub-LSP1, and comparing the node information of the next hop routing node of R4 in Sub-LSP2; because Sub-LSP1 and Sub-LSP2 in FIG. The next hop routing node of R4 is R5. Therefore, the IP address and the inbound interface address of the next hop routing node of R4 in Sub-LSP1 and Sub-LSP2 are the same. Therefore, it is confirmed that Sub-LSP1 and Sub-LSP2 exist. The LSP reconverges and it can be confirmed that LSP re-aggregation starts from R4.

An embodiment of the present invention provides an LSP re-aggregation and identification device in a P2MP. As shown in FIG. 4, the device includes: a first judging module 51, a second judging module 52, and a confirming module 53;

The first determining module 51 is configured to determine, after the multiple sub-label switching paths SUB-LSP is generated, whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs. After the first SUB-LSP and the second SUB-LSP satisfying the first condition are confirmed, the second determining module is triggered; the first condition includes: the first SUB-LSP and the second SUB-LSP The same routing node exists, and the inbound interface address of the same routing node in the first SUB-LSP is different from the inbound interface address in the second SUB-LSP;

When the first judging module 51 is configured to be triggered by the first judging module 51, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, and confirm the first SUB-LSP and the second When the SUB-LSP meets the second condition, the acknowledgment module is triggered; the second condition includes: the same routing node in the first SUB-LSP, the next hop routing node, and the second SUB- The next hop routing node in the LSP is the same, and the inbound interface address of the same next hop routing node in the first SUB-LSP is the same as the inbound interface address in the second SUB-LSP;

The confirmation module 53 is configured to be triggered by the second determining module 52 to confirm that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation.

The first judging module 51 determines whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the plurality of SUB-LSPs in the following manner:

The node information of the routing node includes: a node device identifier of the routing node and an inbound interface address of the routing node.

The device further includes: a third determining module 54 configured to determine, after the first determining module 51 determines whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the plurality of SUB-LSPs, Whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP, and the other is an unestablished SUB-LSP.

The path information of the established SUB-LSP is obtained from the IP sub-object in the record routing object RRO carried in the RESV packet transmitted in the first SUB-LSP; the path information of the unestablished SUB-LSP The calculated path information when the second SUB-LSP is generated.

The first determining module 51 or the second determining module 52 determines that the first routing node on the second SUB-LSP belongs to the same node device as the second routing node on the first SUB-LSP:

In a specific implementation process, the first determining module 51, the second determining module 52, the confirming module 53 and the third determining module 54 may be configured by a central processing unit (CPU, Central) in the routing device. Processing Unit), Microprocessor (MPU), Digital Signal Processor (DSP) or Field-Programmable Gate Array (FPGA).

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 can take the form of a hardware embodiment, a 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 and 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 stream The steps of a function specified in one or more processes and/or block diagrams in one or more blocks.

The above is only the preferred embodiment of the present invention and is not intended to limit the scope of the present invention.

Claims

An LSP re-aggregation identification method in P2MP, the method includes:

After the multiple sub-label switching paths SUB-LSP are generated, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the first condition are present in the multiple SUB-LSPs, where the first condition includes: The same routing node exists in the first SUB-LSP and the second SUB-LSP, and the inbound interface address of the same routing node in the first SUB-LSP and the ingress in the second SUB-LSP The interface address is different;

When it is determined that the first SUB-LSP and the second SUB-LSP satisfy the first condition, determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, where the second condition includes: The next hop routing node of the same routing node in the first SUB-LSP is the same as the next hop routing node in the second SUB-LSP, and the same next hop routing node is in the The inbound interface address in a SUB-LSP is the same as the inbound interface address in the second SUB-LSP;

When it is determined that the first SUB-LSP and the second SUB-LSP meet the second condition, it is confirmed that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation.
The method of claim 1, wherein the determining whether the first SUB-LSP and the second SUB-LSP satisfy the first condition in the plurality of SUB-LSPs comprises:

Comparing the node information of each hop routing node in the path information of one SUB-LSP of the multiple SUB-LSPs with the node information of each hop routing node in the path information of any other SUB-LSP, The first SUB-LSP and the second SUB-LSP satisfying the first condition are determined in the multiple SUB-LSPs.
The method of claim 2, wherein the node information of the routing node comprises: a node device identifier of the routing node and an inbound interface address of the routing node.
The method according to claim 3, wherein after determining whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the plurality of SUB-LSPs, the method further The method includes: determining whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP, and the other is an unestablished SUB-LSP.
The method according to claim 4, wherein the path information of the established SUB-LSP is obtained from an IP sub-object in a record routing object RRO carried in a RESV message transmitted in the first SUB-LSP; The path information of the unestablished SUB-LSP is the calculated path information when the second SUB-LSP is generated.
The method according to claim 3 or 4 or 5, wherein the same routing node exists in the first SUB-LSP and the second SUB-LSP by:

Determining whether the node device identifier of the routing node on the second SUB-LSP is the same as the node device identifier of the routing node on the first SUB-LSP, and if the same, determining that the first SUB-LSP and the second SUB-LSP are present The same routing node.
An LSP re-aggregation identification device in a P2MP, the device includes: a first judging module, a second judging module, and a confirming module; wherein

The first determining module is configured to determine, after the multiple label switching paths SUB-LSP is generated, whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the multiple SUB-LSPs, After the first SUB-LSP and the second SUB-LSP satisfying the first condition are confirmed, the second determining module is triggered; the first condition includes: the first SUB-LSP and the second SUB-LSP are present. The same routing node, and the inbound interface address of the same routing node in the first SUB-LSP is different from the inbound interface address in the second SUB-LSP;

The second determining module, configured to be triggered by the first determining module, determines whether the first SUB-LSP and the second SUB-LSP meet the second condition, and confirms the first SUB-LSP and the second SUB- When the LSP meets the second condition, the acknowledgment module is triggered; the second condition includes: the same routing node is in the next hop routing node in the first SUB-LSP, and in the second SUB-LSP The next hop routing node is the same, and the inbound interface address of the same next hop routing node in the first SUB-LSP and the ingress in the second SUB-LSP The same port address;

The acknowledgment module is configured to confirm that the first SUB-LSP and the second SUB-LSP have an LSP re-aggregation when triggered by the second judging module.
The apparatus according to claim 7, wherein the first determining module determines whether the first SUB-LSP and the second SUB-LSP satisfying the first condition exist in the plurality of SUB-LSPs by:

Comparing the node information of each hop routing node in the path information of one SUB-LSP of the multiple SUB-LSPs with the node information of each hop routing node in the path information of any other SUB-LSP, The first SUB-LSP and the second SUB-LSP satisfying the first condition are determined in the multiple SUB-LSPs.
The apparatus according to claim 8, wherein the node information of the routing node comprises: a node device identifier of the routing node and an inbound interface address of the routing node.
The apparatus according to claim 9, wherein the apparatus further comprises: a third determining module, configured to determine, by the first determining module, whether the first SUB-LSP and the first condition satisfying the first condition are present in the plurality of SUB-LSPs After the second SUB-LSP, it is determined whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP, and the other is an unestablished SUB-LSP.
The device according to claim 10, wherein the path information of the established SUB-LSP is obtained from an IP sub-object in a record routing object RRO carried in a RESV message transmitted in the first SUB-LSP; The path information of the unestablished SUB-LSP is the calculated path information when the second SUB-LSP is generated.
The device according to claim 9 or 10 or 11, wherein the first judging module or the second judging module has the same routing node in the first SUB-LSP and the second SUB-LSP in the following manner:

Determining whether the node device identifier of the routing node on the second SUB-LSP is the same as the node device identifier of the routing node on the first SUB-LSP, and if the same, determining the first SUB-LSP The same routing node exists in the second SUB-LSP.
A computer storage medium, the storage medium comprising a set of computer executable instructions for performing the P2MP LSP reaggregation identification method according to any one of claims 1-6.