CN105634948B - LSP reconvergence identification method and device in P2MP - Google Patents

LSP reconvergence identification method and device in P2MP Download PDF

Info

Publication number
CN105634948B
CN105634948B CN201410589418.0A CN201410589418A CN105634948B CN 105634948 B CN105634948 B CN 105634948B CN 201410589418 A CN201410589418 A CN 201410589418A CN 105634948 B CN105634948 B CN 105634948B
Authority
CN
China
Prior art keywords
sub
lsp
routing node
node
same
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201410589418.0A
Other languages
Chinese (zh)
Other versions
CN105634948A (en
Inventor
赵德涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201410589418.0A priority Critical patent/CN105634948B/en
Priority to PCT/CN2015/071107 priority patent/WO2016065747A1/en
Publication of CN105634948A publication Critical patent/CN105634948A/en
Application granted granted Critical
Publication of CN105634948B publication Critical patent/CN105634948B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a LSP reconvergence identification method in P2MP, which comprises the steps of generating a plurality of SUB-LSPs, and then judging whether two SUB-LSPs meeting the following first conditions exist in the plurality of SUB-LSPs: the two SUB-LSPs have the same routing node, and the same routing node has different interface addresses in the two SUB-LSPs; when judging that two SUB-LSPs meeting a first condition exist, judging whether the two SUB-LSPs meet the following second condition: the next hop routing nodes of the same routing node in the two SUB-LSPs are the same, and the incoming interface addresses of the same next hop routing node in the two SUB-LSPs are the same; and when the two SUB-LSPs are judged to meet the second condition, confirming that LSP reconvergence exists between the two SUB-LSPs. The invention also discloses a device for identifying LSP reconvergence in P2 MP.

Description

LSP reconvergence identification method and device in P2MP
Technical Field
The invention relates to the field of data network communication, in particular to a Label Switched Path (LSP) reconvergence identification method and device in P2 MP.
Background
Fig. 1 shows a topology structure in which Point-to-Multipoint (P2MP, Point-to-Multipoint) LSP reconvergence occurs, and in the topology structure, two SUB-LSPs (SUB-LSPs) are included, which are SUB-LSP1 and SUB-LSP2, respectively, where SUB-LSP1 passes from head node device R1 through intermediate node devices R2 and R4, and finally reaches tail node device R5; the Sub-LSP2 passes 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 node devices, and these node devices are implemented by a routing device, specifically, may be implemented by a routing device such as a router or a switch.
After being separated on R1, Sub-LSP1 and Sub-LSP2 are converged to the same interface on R4, which is P2MP LSP reconvergence, when LSP reconvergence occurs in a P2MP network, unnecessary signaling overhead is caused, and routing calculation and signaling processing pressure of related nodes is increased, so that Sub-LSP which can occur or already occur LSP reconvergence must be detected in time and processed;
currently, for the situation shown in fig. 1 above, the following processing steps are adopted to detect LSP reconvergence:
after the PATH message of the Sub-LSP1 passes through R4, when the PATH message of the Sub-LSP2 reaches R4, the flow direction of the PATH message is detected, and it is found through detection that the PATH message in the Sub-LSP2 and the Sub-LSP1 enters R4 from different interfaces, but exits R4 from the same interface, thereby detecting the occurrence of LSP reconvergence.
It can be seen that, the LSP reconvergence detection method needs to check the reconvergence condition only when the PATH packet of Sub-LSP2 reaches the route node where reconvergence occurs after the PATH packet of Sub-LSP1 passes through R4; therefore, the detection method can only detect whether the established Sub-LSP has the condition of re-aggregation, but cannot have the function of pre-judging in advance before the Sub-LSP with the condition of re-aggregation is established.
Disclosure of Invention
In order to solve the existing technical problem, embodiments of the present invention desirably provide a method and an apparatus for identifying LSP reconvergence in P2 MP.
The embodiment of the invention provides a method for identifying LSP reconvergence in P2MP, which comprises the following steps:
after a plurality of SUB label switching paths SUB-LSPs are generated, determining whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the plurality of SUB-LSPs, where the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
when judging that a first SUB-LSP and a second SUB-LSP which meet a first condition exist, judging whether the first SUB-LSP and the second SUB-LSP meet a second condition, wherein the second condition comprises the following steps: 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
and when the first SUB-LSP and the second SUB-LSP are judged to meet the second condition, determining that LSP reconvergence exists in the first SUB-LSP and the second SUB-LSP.
In the foregoing solution, the determining whether there are a first SUB-LSP and a second SUB-LSP that satisfy a first condition in the plurality of SUB-LSPs includes:
and comparing the node information of each hop of routing node in the path information of one SUB-LSP in the plurality of SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs.
In the foregoing solution, the node information of the routing node includes: a node device identification of the routing node and an ingress interface address of the routing node.
In the foregoing solution, after determining whether there are a first SUB-LSP and a second SUB-LSP that satisfy a first condition in the plurality of SUB-LSPs, the method further includes: and judging whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP and the other is an un-established SUB-LSP.
In the above scheme, the path information of the established SUB-LSP is obtained from an IP SUB-object in a record routing object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated.
In the above scheme, it is determined that the same routing node exists in the first SUB-LSP and the second SUB-LSP by:
and judging whether the node equipment identifier of the routing node on the second SUB-LSP is the same as the node equipment identifier of the routing node on the first SUB-LSP, and determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP when the node equipment identifiers are the same.
The embodiment of the invention provides an LSP reconvergence identification device in P2MP, which comprises: the device comprises a first judgment module, a second judgment module and a confirmation module; wherein the content of the first and second substances,
the first judging module is configured to, after a plurality of SUB-LSPs are generated, judge whether a first SUB-LSP and a second SUB-LSP that satisfy a first condition exist in the plurality of SUB-LSPs, and trigger the second judging module after confirming that the first SUB-LSP and the second SUB-LSP that satisfy the first condition exist; the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
the second judging module is used for judging whether the first SUB-LSP and the second SUB-LSP meet the second condition when triggered by the first judging module, and triggering the confirming module when the first SUB-LSP and the second SUB-LSP are confirmed to meet the second condition; 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
and the confirming module is used for confirming that LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP when the confirming module is triggered by the second judging module.
In the foregoing solution, the first determining module determines whether a first SUB-LSP and a second SUB-LSP that satisfy a first condition exist in the plurality of SUB-LSPs by:
and comparing the node information of each hop of routing node in the path information of one SUB-LSP in the plurality of SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs.
In the foregoing solution, the node information of the routing node includes: a node device identification of the routing node and an ingress interface address of the routing node.
The above-mentioned device still includes: and a third judging module, configured to, after the first judging module judges whether there are a first SUB-LSP and a second SUB-LSP that satisfy the first condition in the multiple SUB-LSPs, judge 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.
In the above scheme, the path information of the established SUB-LSP is obtained from an IP SUB-object in a record routing object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated.
In the foregoing solution, the first determining module or the second determining module may determine that the same routing node exists in the first SUB-LSP and the second SUB-LSP in the following manner:
and judging whether the node equipment identifier of the routing node on the second SUB-LSP is the same as the node equipment identifier of the routing node on the first SUB-LSP, and determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP when the node equipment identifiers are the same.
The method and the device for identifying the LSP reconvergence in the P2MP provided by the embodiment of the invention are characterized in that after a plurality of SUB label switched paths (SUB-LSPs) are generated, whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs is judged, wherein the first condition comprises the following steps: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP; when judging that a first SUB-LSP and a second SUB-LSP which meet a first condition exist, judging whether the first SUB-LSP and the second SUB-LSP meet a second condition, wherein the second condition comprises the following steps: 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP; and when the first SUB-LSP and the second SUB-LSP are judged to meet the second condition, determining that LSP reconvergence exists in the first SUB-LSP and the second SUB-LSP. Therefore, whether LSP reconvergence exists between the SUB-LSPs can be accurately judged when the plurality of SUB-LSPs are generated but not established or after at least one of the plurality of SUB-LSPs is established, and when the plurality of SUB-LSPs are generated but not established, and the identification of whether the LSP reconvergence exists is carried out on the SUB-LSPs, the LSP reconvergence can be effectively prevented, and unnecessary signaling overhead caused by LSP reconvergence and the increase of routing calculation and signaling processing pressure of related nodes are avoided; moreover, the method is simple and easy to implement, and the LSP reconvergence identification can be performed without meeting harsh constraints, specifically, the LSP reconvergence detection can be performed without having to establish a plurality of Sub-LSPs and meeting necessary conditions (that is, in two Sub-LSPs, after a PATH packet passes through a first routing node in one Sub-LSP where reconvergence occurs, the PATH packet reaches the same routing node in another Sub-LSP where reconvergence occurs) as in the prior art.
Drawings
FIG. 1 is a topology of a prior art where point-to-multipoint LSP reconvergence occurs;
fig. 2 is a first flowchart of a method for identifying LSP reconvergence in P2MP according to an embodiment of the present invention;
fig. 3 is a flowchart of a second method for identifying LSP reconvergence in P2MP according to an embodiment of the present invention;
fig. 4 is a basic structure diagram of an LSP reconvergence identification apparatus in P2MP according to an embodiment of the present invention.
Detailed Description
In this embodiment of the present invention, after a plurality of SUB label switched paths SUB-LSPs are generated, it is determined whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the plurality of SUB-LSPs, where the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP; when judging that a first SUB-LSP and a second SUB-LSP which meet a first condition exist, judging whether the first SUB-LSP and the second SUB-LSP meet a second condition, wherein the second condition comprises the following steps: 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP; and when the first SUB-LSP and the second SUB-LSP are judged to meet the second condition, determining that LSP reconvergence exists in the first SUB-LSP and the second SUB-LSP.
The invention is further described in detail below with reference to the figures and the specific embodiments.
Example one
An embodiment of the present invention provides a method for identifying LSP reconvergence in P2MP, where as shown in fig. 2, the method includes the following steps:
step 201: after a plurality of SUB label switching paths SUB-LSPs are generated, determining whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the plurality of SUB-LSPs, where the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
specifically, 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 the path information of the first SUB-LSP and the second SUB-LSP; the path information includes: node information of each hop routing node on the corresponding SUB-LSP; the node information specifically includes: the node equipment identification and the access interface address of the node equipment; the node device identifier refers to identification information that can be used to uniquely identify a certain node device, for example: an Internet Protocol (IP) address, a Media Access Control (MAC) address, or a node device ID pre-assigned to each node device; after the SUB-LSP is generated, each node device except the head node device on the SUB-LSP has an incoming interface address;
the path information of one SUB-LSP can be acquired by various methods, for example, when a SUB-LSP is generated on a head node device or a routing domain boundary node device, the path information of the generated SUB-LSP can be acquired; or, after the SUB-LSP is established, an IP Subobject (IP Subobject) in a Record Route Object (RRO) carried in an RESV message transmitted in the SUB-LSP carries path information of the corresponding SUB-LSP, so that the path information of the corresponding SUB-LSP can be acquired through the RESV message;
specifically, whether a first SUB-LSP and a second SUB-LSP that satisfy a first condition exist in the plurality of SUB-LSPs may be determined in the following manner:
comparing the node information of each hop of routing node in the path information of one SUB-LSP in the SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the SUB-LSPs;
specifically, in an actual implementation, the second hop routing node information and the node information of each subsequent hop routing node in the path information of one SUB-LSP in the multiple SUB-LSPs may be compared with the node information of the second hop routing node of the first SUB-LSP, respectively, and if a routing node satisfying the first condition is found in the second SUB-LSP, the current flow is skipped, and the processing in step 102 is further performed; if no routing node meeting the first condition is found in the second SUB-LSP, continuously comparing second hop routing node information in the second SUB-LSP path information and each hop routing node information thereafter with node information of a next hop routing node of the second hop routing node in the first SUB-LSP, if a routing node meeting the first condition is found in the second SUB-LSP, jumping out of the current flow, and further performing the processing in step 102; repeating the steps until the second hop routing node information in the second SUB-LSP and the node information of each hop routing node after the second SUB-LSP are compared with the node information of the last hop routing node in the first SUB-LSP, if no routing node meeting the first condition is found in the first SUB-LSP, confirming that the second SUB-LSP and the first SUB-LSP do not generate LSP reconvergence, and at the moment, jumping out the whole LSP reconvergence identification flow;
specifically, it is determined that the same routing node exists in the first SUB-LSP and the second SUB-LSP by:
judging whether the node equipment identification of the routing node on the second SUB-LSP is the same as the node equipment identification of the routing node on the first SUB-LSP, and if so, determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP; and when the SUB-LSP is different from the first SUB-LSP, determining 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, further confirming whether the incoming interface address of the same routing node is the same, and if so, confirming whether the first SUB-LSP and the second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs;
step 202: when judging that a first SUB-LSP and a second SUB-LSP which meet a first condition exist, judging whether the first SUB-LSP and the second SUB-LSP meet a second condition, wherein the second condition comprises the following steps: 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
in step 201, after the first routing node and the second routing node that satisfy the first condition are found, it cannot be determined that the first SUB-LSP and the second SUB-LSP have reconvergence, and further determination in this step is required, that is, it is determined whether the first SUB-LSP and the second SUB-LSP satisfy the second condition;
at this time, whether the first SUB-LSP and the second SUB-LSP satisfy the second condition is determined by:
step S301: comparing the node device identifier of the next-hop routing node of the same routing node (hereinafter referred to as a first routing node for convenience) in the first SUB-LSP with the node device identifier of the next-hop routing node of the same routing node (hereinafter referred to as a second routing node for convenience) in the second SUB-LSP, and if the node device identifiers are the same, further performing step S302, where the same means: the next hop routing nodes of the first routing node and the second routing node exist, and the node equipment identifications are the same; if not, go to step S304; here, the different cases refer to any other cases than the same cases, for example: the next hop routing nodes of the first routing node and the second routing node exist and have different node equipment identifications, or the next hop routing node does not exist in at least one of the first routing node and the second routing node; when at least one of the first routing node and the second routing node does not have a routing node, LSP reconvergence does not occur from the first routing node or the second routing node;
step S302: judging whether the incoming interface address of the next hop routing node of the first routing node is the same as the incoming interface address of the next hop routing node of the second routing node; if yes, go to step S303; if not, go to step S304;
step S303: confirming that the first SUB-LSP and the second SUB-LSP meet a second condition; jumping out of the current flow;
step S304: confirming that the first SUB-LSP and the second SUB-LSP do not satisfy the second condition; and jumping out of the current judging process.
It can be understood by those skilled in the art that, in the above-mentioned flow for determining whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, it may also be first compared whether an ingress interface address of a next-hop routing node of the first routing node is the same as an ingress interface address of a next-hop routing node of the second routing node; when the first routing node and the second routing node are the same, further comparing 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 or not;
step 203: when the first SUB-LSP and the second SUB-LSP are judged to meet the second condition, determining that LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP;
after judging whether the first SUB-LSP and the second SUB-LSP meet the second condition, if the judgment result is that the first SUB-LSP and the second SUB-LSP meet the second condition, determining that SUB-LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP; and if the judgment result is that the first SUB-LSP and the second SUB-LSP do not meet the second condition, confirming that the first SUB-LSP and the second SUB-LSP do not have LSP reconvergence.
Further, after determining whether there are a first SUB-LSP and a second SUB-LSP that satisfy a first condition in the plurality of SUB-LSPs, it may be further 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 established path information of the SUB-LSP is obtained from an IP SUB-object in a record routing object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated. In this way, it can be detected whether an LSP reconvergence exists between a SUB-LSP that has been generated but has not yet been established and an already established SUB-LSP.
Further, if before the first SUB-LSP and the second SUB-LSP are not established or after the first SUB-LSP and the second SUB-LSP are both established, it is determined that there is a reconvergence of the first SUB-LSP and the second SUB-LSP, the first SUB-LSP may be selected to be deleted as needed, and a new first SUB-LSP which does not have a reconvergence with the second SUB-LSP is generated; or deleting the second SUB-LSP and generating a new second SUB-LSP which does not have reconvergence with the first SUB-LSP;
if it is determined that the first SUB-LSP and the second SUB-LSP have re-aggregation when one of the first SUB-LSP and the second SUB-LSP is already established but the other SUB-LSP is not yet established, the SUB-LSP that is not established may be deleted and a new SUB-LSP that does not have re-aggregation with the other SUB-LSP may be generated.
Specifically, before a first SUB-LSP and a second SUB-LSP are not established, the path information of the first SUB-LSP and the second SUB-LSP is from the path calculation result when the first SUB-LSP and the second SUB-LSP are generated;
when 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 comes from an IP SUB-object in a record routing object RRO carried in a PATH message transmitted in the first SUB-LSP and the second SUB-LSP;
when one of the first SUB-LSP and the second SUB-LSP is established but the other SUB-LSP is not established, the PATH information of the established SUB-LSP comes from an IP SUB-object in a record routing object RRO carried in a PATH message transmitted in the SUB-LSP; the path information of the SUB-LSP which is not established comes from the path calculation result when the SUB-LSP is generated.
It can be seen that the LSP reconvergence identification method in P2MP provided in the embodiments of the present invention can quickly and conveniently implement the detection whether or not the SUB-LSP has reconvergence, and especially, when the SUB-LSP establishment policy that does not allow the SUB-LSP to form reconvergence, which is specified in the existing RFC4875, is used, the problem of whether or not the LSP reconvergence exists in the path can be determined after the path is calculated and before RSVP-TE signaling is initiated, and unnecessary RSVP signaling messages are avoided, thereby saving network resources.
The following describes, by way of a specific example, the LSP reconvergence identification method in P2MP according to an embodiment of the present invention.
Still taking the topology structure shown in fig. 1 in which LSP reconvergence exists as an example, in the scenario of fig. 1, there are two LSPs starting from the head node device R1 and respectively having R5 and R6 as destinations, where the two LSPs are respectively: Sub-LSP1 and Sub-LSP2, wherein Sub-LSP1 is destined for R5 and Sub-LSP2 is destined for R6; Sub-LSP1 has been successfully established, having traversed a path R1 — > R2 — > R4 — > R5, i.e., starting from R1, passing through R2, R4 to R5; the path traversed by Sub-LSP2 is R1 — > R3 — > R4 — > R5 — > R6, i.e., from R1, via R3, R4, R5 to R6; before the Sub-LSP2 is established, whether LSP reconvergence exists between Sub-LSP2 and Sub-LSP1 is detected through the process shown in fig. 4, which includes the following steps:
step 401: taking out the IP address of the next-hop routing node on the Sub-LSP2 and storing the IP address into a 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 an IP Subobject in an RESV message RRO in the Sub-LSP 1;
step 403: judging whether the IP address of one routing node in the IP subject is the same as the ADDR, if so, turning to step 404; if not, go to step 401;
step 404: judging whether the incoming interface addresses of the routing nodes with the same IP addresses in the Sub-LSP1 and the Sub-LSP2 are the same, if so, turning to the step 405; if not, go to step 406;
step 405: confirming whether the IP address and the interface-in address of the next hop routing node of the routing node with the same IP address are the same; if the same (the same condition includes that the next hop routing nodes of the routing nodes with the same IP address in Sub-LSP1 and Sub-LSP2 exist and the IP address and the incoming interface address are the same), go to step 407; if the two routing nodes are different (the different conditions include that the next hop routing nodes of the routing nodes with the same IP addresses in the Sub-LSP1 and the Sub-LSP2 exist and the IP addresses are different, or at least one of the routing nodes with the same IP addresses in the Sub-LSP1 and the Sub-LSP2 does not have a next hop routing node), then the step 406 is carried out;
step 406: determining that no LSP reconvergence exists between Sub-LSP1 and Sub-LSP2, and jumping out of the current flow;
step 407: and determining that LSP reconvergence exists between Sub-LSP1 and Sub-LSP2, and jumping out of the current flow.
According to the above flow, and specifically to the topology shown in fig. 1, first take out the IP address of R3 in Sub-LSP2 and store it in ADDR, and sequentially traverse the IP addresses of all routing nodes in Sub-LSP1, and confirm that there is no routing node whose IP address is the same as ADDR; then further taking out the next-hop routing node in the Sub-LSP2, namely, storing the IP address of R4 into ADDR, at this time, traversing the IP addresses of all routing nodes in the Sub-LSP1, and finding that the IP address of R4 in the Sub-LSP1 is the same as the ADDR; further extracting node information of a next hop routing node of R4 in Sub-LSP1, and comparing the node information with node information of a next hop routing node of R4 in Sub-LSP 2; since the next-hop routing nodes of R4 in Sub-LSP1 and Sub-LSP2 in fig. 1 are both R5, the IP addresses and ingress interface addresses of the next-hop routing nodes of R4 in Sub-LSP1 and Sub-LSP2 are both the same, and therefore, it is confirmed that LSP reconvergence occurs in Sub-LSP1 and Sub-LSP2, and it can be confirmed that LSP reconvergence occurs from R4.
An embodiment of the present invention provides an LSP reconvergence identification device in P2MP, where as shown in fig. 4, the device includes: a first judgment module 51, a second judgment module 52 and a confirmation module 53; wherein the content of the first and second substances,
the first judging module 51 is configured to, after a plurality of SUB label switched paths SUB-LSPs are generated, judge whether a first SUB-LSP and a second SUB-LSP that satisfy a first condition exist in the plurality of SUB-LSPs, and trigger the second judging module after confirming that the first SUB-LSP and the second SUB-LSP that satisfy the first condition exist; the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
the second judging module 52 is configured to, when triggered by the first judging module 51, judge whether the first SUB-LSP and the second SUB-LSP satisfy the second condition, and when it is confirmed that the first SUB-LSP and the second SUB-LSP satisfy the second condition, trigger the confirming module; 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
the confirming module 53 is configured to confirm that LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP when triggered by the second determining module 52.
Specifically, the first determining module 51 determines whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the plurality of SUB-LSPs by:
and comparing the node information of each hop of routing node in the path information of one SUB-LSP in the plurality of SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs.
Specifically, the node information of the routing node includes: a node device identification of the routing node and an ingress interface address of the routing node.
Further, the apparatus further comprises: a third judging module 54, configured to judge whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP and the other is an un-established SUB-LSP after the first judging module 51 judges whether there are the first SUB-LSP and the second SUB-LSP that satisfy the first condition in the multiple SUB-LSPs.
Specifically, the path information of the established SUB-LSP is obtained from an IP SUB-object in a record routing object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated.
Specifically, the first determining module 51 or the second determining module 52 determines that the first routing node on the second SUB-LSP and the second routing node on the first SUB-LSP belong to the same node device by the following means:
and judging whether the node equipment identifier of the routing node on the second SUB-LSP is the same as the node equipment identifier of the routing node on the first SUB-LSP, and determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP when the node equipment identifiers are the same.
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 implemented by a Central Processing Unit (CPU), a Micro Processing Unit (MPU), a Digital Signal Processor (DSP), or a Programmable logic Array (FPGA) in the routing device.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.

Claims (12)

1. A method for identifying LSP reconvergence in P2MP, which is characterized by comprising the following steps:
after a plurality of SUB label switching paths SUB-LSPs are generated, determining whether a first SUB-LSP and a second SUB-LSP satisfying a first condition exist in the plurality of SUB-LSPs, where the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
when judging that a first SUB-LSP and a second SUB-LSP which meet a first condition exist, judging whether the first SUB-LSP and the second SUB-LSP meet a second condition, wherein the second condition comprises the following steps: 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
when the first SUB-LSP and the second SUB-LSP are judged to meet the second condition, determining that LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP;
when the first SUB-LSP and the second SUB-LSP have LSP reconvergence, judging whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP and the other is an un-established SUB-LSP; if yes, deleting the non-established SUB-LSP, and generating a target SUB-LSP according to the established SUB-LSP; if not, deleting the first SUB-LSP and generating a target SUB-LSP according to the second SUB-LSP, or deleting the second SUB-LSP and generating the target SUB-LSP according to the first SUB-LSP.
2. The method of claim 1, wherein determining whether there is a first SUB-LSP and a second SUB-LSP in the plurality of SUB-LSPs that satisfy a first condition comprises: and comparing the node information of each hop of routing node in the path information of one SUB-LSP in the plurality of SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs.
3. The method of claim 2, wherein the node information of the routing node comprises: a node device identification of the routing node and an ingress interface address of the routing node.
4. The method of claim 3, wherein after determining whether there is a first SUB-LSP and a second SUB-LSP that satisfy a first condition in the plurality of SUB-LSPs, the method further comprises: and judging whether one of the first SUB-LSP and the second SUB-LSP is an established SUB-LSP and the other is an un-established SUB-LSP.
5. 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 route object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated.
6. The method of claim 3 or 4 or 5, wherein the determination is made by: the same routing node exists in the first SUB-LSP and the second SUB-LSP:
and judging whether the node equipment identifier of the routing node on the second SUB-LSP is the same as the node equipment identifier of the routing node on the first SUB-LSP, and determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP when the node equipment identifiers are the same.
7. An apparatus for identifying LSP reconvergence in P2MP, the apparatus comprising: the device comprises a first judgment module, a second judgment module, a confirmation module and a third judgment module; wherein the content of the first and second substances,
the first judging module is configured to, after a plurality of SUB-LSPs are generated, judge whether a first SUB-LSP and a second SUB-LSP that satisfy a first condition exist in the plurality of SUB-LSPs, and trigger the second judging module after confirming that the first SUB-LSP and the second SUB-LSP that satisfy the first condition exist; the first condition includes: the same routing node exists in the first SUB-LSP and the second SUB-LSP, and the incoming interface address of the same routing node in the first SUB-LSP is different from the incoming interface address in the second SUB-LSP;
the second judging module is used for judging whether the first SUB-LSP and the second SUB-LSP meet the second condition when triggered by the first judging module, and triggering the confirming module when the first SUB-LSP and the second SUB-LSP are confirmed to meet the second condition; 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 incoming interface address of the same next-hop routing node in the first SUB-LSP is the same as the incoming interface address in the second SUB-LSP;
the confirming module is used for confirming that LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP when the confirming module is triggered by the second judging module;
the third determining module is configured to determine, when LSP reconvergence exists between the first SUB-LSP and the second SUB-LSP, 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; if yes, deleting the non-established SUB-LSP, and generating a target SUB-LSP according to the established SUB-LSP; if not, deleting the first SUB-LSP and generating a target SUB-LSP according to the second SUB-LSP, or deleting the second SUB-LSP and generating the target SUB-LSP according to the first SUB-LSP.
8. The apparatus of claim 7, wherein the first determining module determines whether there is a first SUB-LSP and a second SUB-LSP that satisfy a first condition among the plurality of SUB-LSPs by:
and comparing the node information of each hop of routing node in the path information of one SUB-LSP in the plurality of SUB-LSPs with the node information of each hop of routing node in the path information of any other SUB-LSP in sequence to judge whether a first SUB-LSP and a second SUB-LSP meeting a first condition exist in the plurality of SUB-LSPs.
9. The apparatus of claim 8, wherein the node information of the routing node comprises: a node device identification of the routing node and an ingress interface address of the routing node.
10. The apparatus of claim 9, further comprising: and a third judging module, configured to, after the first judging module judges whether there are a first SUB-LSP and a second SUB-LSP that satisfy the first condition in the multiple SUB-LSPs, judge 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.
11. The apparatus according to claim 10, wherein the path information of the established SUB-LSP is obtained from an IP SUB-object in a record route object RRO carried in an RESV message transmitted in the first SUB-LSP; and the path information of the non-established SUB-LSP is calculated path information when the second SUB-LSP is generated.
12. The apparatus according to claim 9, 10 or 11, wherein the first judging module or the second judging module exists the same routing node in the first SUB-LSP and the second SUB-LSP by:
and judging whether the node equipment identifier of the routing node on the second SUB-LSP is the same as the node equipment identifier of the routing node on the first SUB-LSP, and determining that the same routing node exists in the first SUB-LSP and the second SUB-LSP when the node equipment identifiers are the same.
CN201410589418.0A 2014-10-28 2014-10-28 LSP reconvergence identification method and device in P2MP Active CN105634948B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201410589418.0A CN105634948B (en) 2014-10-28 2014-10-28 LSP reconvergence identification method and device in P2MP
PCT/CN2015/071107 WO2016065747A1 (en) 2014-10-28 2015-01-20 Method and apparatus for identifying lsp reaggregation in p2mp

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410589418.0A CN105634948B (en) 2014-10-28 2014-10-28 LSP reconvergence identification method and device in P2MP

Publications (2)

Publication Number Publication Date
CN105634948A CN105634948A (en) 2016-06-01
CN105634948B true CN105634948B (en) 2020-04-10

Family

ID=55856481

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410589418.0A Active CN105634948B (en) 2014-10-28 2014-10-28 LSP reconvergence identification method and device in P2MP

Country Status (2)

Country Link
CN (1) CN105634948B (en)
WO (1) WO2016065747A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10250487B2 (en) * 2016-10-27 2019-04-02 Juniper Networks, Inc. Dynamic modification of bypass label-switched paths based on monitoring network traffic conditions
CN107395483B (en) * 2017-08-28 2020-06-02 迈普通信技术股份有限公司 Path establishing method and device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159681A (en) * 2007-09-28 2008-04-09 杭州华三通信技术有限公司 Method and node of implementing fast re-routing
CN101371150A (en) * 2006-01-18 2009-02-18 思科技术公司 Dynamic protection against failure of a head-end node of one or more TE-LSPs
CN101483539A (en) * 2008-01-07 2009-07-15 华为技术有限公司 Method, path computing unit and system for obtaining path
CN101552715A (en) * 2008-03-31 2009-10-07 华为技术有限公司 Method, node and system for establishing backup label switching path
CN101753409A (en) * 2008-12-01 2010-06-23 华为技术有限公司 Method, device and system for sharing resources
CN102158396A (en) * 2011-02-15 2011-08-17 中兴通讯股份有限公司 Label distribution method and device for node
CN103023780A (en) * 2012-12-06 2013-04-03 中兴通讯股份有限公司 Method and device for routing computation
CN103490998A (en) * 2013-09-09 2014-01-01 杭州华三通信技术有限公司 Protection tunnel building method and device and flow switching method and device

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030145105A1 (en) * 2002-01-30 2003-07-31 Harikishan Desineni Method and apparatus for obtaining information about one or more paths terminating at a subject node for a group of packets
US7477642B2 (en) * 2004-02-03 2009-01-13 Redback Networks, Inc. MPLS traffic engineering for point-to-multipoint label switched paths
CN102790713A (en) * 2011-05-18 2012-11-21 中兴通讯股份有限公司 Quick heavy-route protection method and system of bidirectional path

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101371150A (en) * 2006-01-18 2009-02-18 思科技术公司 Dynamic protection against failure of a head-end node of one or more TE-LSPs
CN101159681A (en) * 2007-09-28 2008-04-09 杭州华三通信技术有限公司 Method and node of implementing fast re-routing
CN101483539A (en) * 2008-01-07 2009-07-15 华为技术有限公司 Method, path computing unit and system for obtaining path
CN101552715A (en) * 2008-03-31 2009-10-07 华为技术有限公司 Method, node and system for establishing backup label switching path
CN101753409A (en) * 2008-12-01 2010-06-23 华为技术有限公司 Method, device and system for sharing resources
CN102158396A (en) * 2011-02-15 2011-08-17 中兴通讯股份有限公司 Label distribution method and device for node
CN103023780A (en) * 2012-12-06 2013-04-03 中兴通讯股份有限公司 Method and device for routing computation
CN103490998A (en) * 2013-09-09 2014-01-01 杭州华三通信技术有限公司 Protection tunnel building method and device and flow switching method and device

Also Published As

Publication number Publication date
WO2016065747A1 (en) 2016-05-06
CN105634948A (en) 2016-06-01

Similar Documents

Publication Publication Date Title
CN111917643B (en) Seamless bidirectional forwarding detection method and device for segmented routing tunnel
US10148573B2 (en) Packet processing method, node, and system
CN111431800B (en) Method, device and equipment for establishing path and machine-readable storage medium
RU2012138150A (en) COMMUNICATION SYSTEM, CONTROL DEVICE, COMMUNICATION METHOD AND PROGRAM
JP5426770B2 (en) Method and apparatus in a telecommunications network
EP3641353B1 (en) Multicast forwarding method, and related device
CN106789625B (en) Loop detection method and device
US20140043956A1 (en) Techniques for Flooding Optimization for Link State Protocols in a Network Topology
US8427970B2 (en) Apparatus and method for determining a service interruption time measurement
US9237078B1 (en) Path validation in segment routing networks
US11463345B2 (en) Monitoring BGP routes of a device in a network
EP3355533B1 (en) Path switching
US20170195203A1 (en) Method, apparatus, and system for implementing packet loss detection
CN107948066B (en) Designated forwarder DF election method, system and device
US20150036685A1 (en) Multicast label distribution protocol over a remote loop-free alternative
US20160344611A1 (en) Method and control node for handling data packets
CN105634948B (en) LSP reconvergence identification method and device in P2MP
CN106130821B (en) Method and device for sending detection message
CN113615132A (en) Fast flooding topology protection
CN104506369A (en) Packet loss position detecting method and device
CN112702221B (en) BGP abnormal route monitoring method and device
EP2804352B1 (en) Method and apparatus for processing residual information
CN107347034B (en) Link information processing method, device and system
WO2016061920A1 (en) Path backup method and system, header node device and intermediate node device
CN115280745B (en) Stream following detection method and electronic equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant