CN105634948A - LSP reconvergence identification method and LSP reconvergence identification device in P2MP - Google Patents
LSP reconvergence identification method and LSP reconvergence identification device in P2MP Download PDFInfo
- Publication number
- CN105634948A CN105634948A CN201410589418.0A CN201410589418A CN105634948A CN 105634948 A CN105634948 A CN 105634948A CN 201410589418 A CN201410589418 A CN 201410589418A CN 105634948 A CN105634948 A CN 105634948A
- Authority
- CN
- China
- Prior art keywords
- lsp
- sub
- routing node
- condition
- routing
- 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.)
- Granted
Links
Abstract
The invention discloses an LSP reconvergence identification method in P2MP (point-to-multipoint). The LSP reconvergence identification method comprises the steps of determining whether two SUB-LSPs which satisfy a first condition exist in a plurality of SUB-LSP after a plurality of SUB-LSPs are generated, wherein the first condition is characterized in that same routing nodes with different input interface addresses in two SUB-LSPs exist in the two SUB-LSPs; when existance of two SUB-LSPs which satisfy the first condition is determined, determining whether the two SUB-LSPs satisfy a second condition that the next-hop routing node of the same routing nodes in the two SUB-LSPs are same and furthermore the input interface addresses of the same next-hop routing nodes are same; and when a fact that the two SUB-LSPs satisfy the second condition is determined, confirming LSP reconvergence between the two SUB-LSPs. The invention further discloses an LSP reconvergence identification device in P2MP.
Description
Technical field
The present invention relates to data network communications field, be specifically related to label switching path LSP re-aggregation recognition methods and device in a kind of P2MP.
Background technology
Fig. 1 illustrates the point-to-multipoint (P2MP of a kind of generation, Point-to-Multipoint) topological structure of LSP re-aggregation, in described topological structure, including two strip LSP (SUB-LSP), it is Sub-LSP1 and Sub-LSP2 respectively, wherein, Sub-LSP1 through intermediary device R2 and R4, eventually arrives at tail node equipment R5 from head node equipment R1; Sub-LSP2 through intermediary device R3 and R4, eventually arrives at tail node equipment R6 from head node equipment R1; Wherein, described head node equipment, intermediary device and tail node equipment are referred to as node device, and these node devices are realized by routing device, concrete, it is possible to be realized by the routing device such as router or switch.
Wherein, after Sub-LSP1 and Sub-LSP2 separates on R1, same interface is converged to again on R4, this situation is P2MPLSP re-aggregation, when occurring LSP re-aggregation in P2MP network, can cause unnecessary signaling consumption, and increase router-level topology and the signaling processing pressure of interdependent node, therefore, it is necessary to detect the Sub-LSP that LSP re-aggregation can occur or have occurred and that in time, and process;
At present, for the situation shown in figure 1 above, adopt the following step that processes that LSP re-aggregation is detected:
After the path P ATH message of Sub-LSP1 passes through R4, when the PATH message of Sub-LSP2 arrives R4, the flow direction of PATH message is detected, find in Sub-LSP2 and Sub-LSP1 that PATH message is from the entrance R4 of different interfaces by detecting, but R4 is gone out from same interface, thus checking the generation of LSP re-aggregation.
It can be seen that this LSP re-aggregation detection method, it is necessary to after the PATH message of Sub-LSP1 passes through R4, when the PATH message of Sub-LSP2 arrives the routing node that re-aggregation occurs, just can check re-aggregation situation; Therefore, whether this detection method can only detect exists re-aggregation situation between the Sub-LSP having built up, and before setting up the Sub-LSP that there is re-aggregation situation, can not possess the function of anticipation in advance.
Summary of the invention
In order to solve the technical problem of existing existence, embodiment of the present invention expectation provides LSP re-aggregation recognition methods method and apparatus in a kind of P2MP.
Embodiments providing LSP re-aggregation recognition methods in a kind of P2MP, described method includes:
After generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
When judging to exist SUB-LSP and the two SUB-LSP meeting first condition, judge whether described SUB-LSP and the two SUB-LSP meets second condition, described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
When judging that described SUB-LSP and the two SUB-LSP meets described second condition, confirm that described SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
In such scheme, described judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, including:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition.
In such scheme, the nodal information of described routing node includes: the node equipment identification of routing node and the incoming interface address of routing node.
In such scheme, after judging whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described method also includes: judge in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP.
In such scheme, described in the routing information of SUB-LSP that has built up be that the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP obtains; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation.
In such scheme, determine in described SUB-LSP and the two SUB-LSP there is identical routing node in the following manner:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node.
Embodiments providing LSP re-aggregation identification device in a kind of P2MP, described device includes: the first judge module, the second judge module and confirmation module; Wherein,
Described first judge module, for after generation has multiple label switched path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, and after confirming SUB-LSP and the two SUB-LSP that existence meets first condition, trigger the second judge module; Described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
Described second judge module, during for being triggered by the first judge module, it is judged that whether described SUB-LSP and the two SUB-LSP meets second condition, and when confirming that SUB-LSP and the two SUB-LSP meets second condition, triggers and confirm module; Described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
Described confirmation module, during for being triggered by the second judge module, confirms that SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
In such scheme, described first judge module judges whether there is SUB-LSP and the two SUB-LSP meeting first condition in multiple SUB-LSP in the following manner:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition.
In such scheme, the nodal information of described routing node includes: the node equipment identification of routing node and the incoming interface address of routing node.
Said apparatus also includes: the 3rd judge module, after judging whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition at the first judge module, judge in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP.
In such scheme, described in the routing information of SUB-LSP that has built up be that the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP obtains; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation.
In such scheme, there is identical routing node in described first judge module or the second judge module described SUB-LSP and the two SUB-LSP in the following manner:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node.
LSP re-aggregation recognition methods method and apparatus in a kind of P2MP that the embodiment of the present invention provides, after generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP; When judging to exist SUB-LSP and the two SUB-LSP meeting first condition, judge whether described SUB-LSP and the two SUB-LSP meets second condition, described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP; When judging that described SUB-LSP and the two SUB-LSP meets described second condition, confirm that described SUB-LSP and the two SUB-LSP exists LSP re-aggregation. So, can after when multiple SUB-LSP generate but before being not set up or in multiple SUB-LSP, at least one be established, it is accurately judged between SUB-LSP and whether there is LSP re-aggregation, when when multiple SUB-LSP generate but before being not set up, when it is made whether the identification that there is LSP re-aggregation, can effectively prevent the generation of LSP re-aggregation, it is to avoid the unnecessary signaling consumption that causes during LSP re-aggregation and the increase to the router-level topology of interdependent node and signaling processing pressure occur; And, the method is simple, easy, it is not required to meet harsh restrictive condition and just can carry out the identification of LSP re-aggregation, specifically, need not as in the prior art, must after multiple Sub-LSP be established, and meet essential condition (namely, in two Sub-LSP, after first routing node of re-aggregation occurs PATH message in a Sub-LSP, when described PATH message arrives the same routing node that re-aggregation occurs in another Sub-LSP) time can carry out the detection of LSP re-aggregation.
Accompanying drawing explanation
Fig. 1 is the topological structure that point-to-multipoint LSP re-aggregation occurs in prior art;
LSP re-aggregation recognition methods flow chart one in the P2MP that Fig. 2 provides for the embodiment of the present invention;
LSP re-aggregation recognition methods flowchart 2 in the P2MP that Fig. 3 provides for the embodiment of the present invention;
LSP re-aggregation identification device basic block diagram in the P2MP that Fig. 4 provides for the embodiment of the present invention.
Detailed description of the invention
In the embodiment of the present invention, after generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP; When judging to exist SUB-LSP and the two SUB-LSP meeting first condition, judge whether described SUB-LSP and the two SUB-LSP meets second condition, described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP; When judging that described SUB-LSP and the two SUB-LSP meets described second condition, confirm that described SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
Below by drawings and the specific embodiments, the present invention is described in further detail.
Embodiment one
The embodiment of the present invention one provides LSP re-aggregation recognition methods in a kind of P2MP, as in figure 2 it is shown, the method comprises the following steps:
Step 201: after generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
Concrete, in a SUB-LSP and the two SUB-LSP respectively P2MP network different Sub-LSP;
After a SUB-LSP or the 2nd SUB-LSP generate, it is thus achieved that path computation result be the routing information of SUB-LSP and the two SUB-LSP; Described routing information includes: the nodal information of each jumping routing node on corresponding SUB-LSP; Described nodal information specifically includes: the incoming interface address of node equipment identification and node device; Described node equipment identification refers to the identification information that may be used for uniquely identifying some node device, such as: iso-ip Internetworking protocol ISO-IP (IP, InternetProtocol) address, medium education (MAC, MediaAccessControl) address or be pre-assigned to the node device ID of each node device; After SUB-LSP generates, upper each node device except head node equipment of SUB-LSP has an incoming interface address;
A SUB-LSP routing information can be obtained by multiple method, for instance, when generating SUB-LSP on head node equipment or routed domain boundary node equipment, the routing information of the SUB-LSP of described generation can be obtained; Or, after SUB-LSP is established, record routing object (the RecordRouteObject carried in the RESV message transmitted in SUB-LSP, RRO) namely the IP subobject (IPSubobject) in carries the routing information of corresponding SUB-LSP, therefore, it can the routing information by the corresponding SUB-LSP of this RESV Receive message;
Concrete, it is possible to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition in the following manner:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition;
Concrete, in practical implementations, can in the routing information of a SUB-LSP from multiple SUB-LSP second jump routing node, the nodal information jumping routing node information and each jumping routing node afterwards respectively by second first contrasts with the second of a SUB-LSP the nodal information jumping routing node, if being found that, in the 2nd SUB-LSP, the routing node meeting first condition, then jump out current process, and carry out the process in step 102 further; If there is no the routing node finding to meet first condition in the 2nd SUB-LSP, then continue that second in the 2nd SUB-LSP routing information jumps routing node information and each jumping routing node information afterwards to contrast with the nodal information of the second down hop routing node jumping routing node in a SUB-LSP, if being found that, in the 2nd SUB-LSP, the routing node meeting first condition, then jump out current process, and carry out the process in step 102 further; By that analogy, until second in the 2nd SUB-LSP is jumped routing node information and the nodal information of each jumping routing node and a SUB-LSP in the nodal information of final jump routing node contrast after, without finding to meet the routing node of first condition in a SUB-LSP, then confirm that LSP re-aggregation does not occur the 2nd SUB-LSP and the one SUB-LSP, now, whole LSP re-aggregation identification process is jumped out;
Concrete, determine in described SUB-LSP and the two SUB-LSP there is identical routing node in the following manner:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node; Time different, it is determined that SUB-LSP and the two SUB-LSP is absent from identical routing node.
After confirming SUB-LSP and the two SUB-LSP exists identical routing node, further confirm that, whether the incoming interface address of described identical routing node is identical, if identical, then confirm whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition;
Step 202: when judging to exist SUB-LSP and the two SUB-LSP meeting first condition, judge whether described SUB-LSP and the two SUB-LSP meets second condition, described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
In step 201, after finding the first routing node and secondary route node meeting first condition, can't determine that SUB-LSP and the two SUB-LSP exists re-aggregation, also need to the judgement carrying out in this step further, namely judge whether described SUB-LSP and the two SUB-LSP meets second condition;
Now, judge whether SUB-LSP and the two SUB-LSP meets second condition by following steps:
Step S301: by described identical routing node (for convenience, hereinafter referred to as the first routing node) node equipment identification of down hop routing node in a described SUB-LSP is with described identical routing node (for convenience, hereinafter referred to as secondary route node) node equipment identification of down hop routing node in described 2nd SUB-LSP contrasts, if it is identical, then perform step S302 further, here identical refers to: the down hop routing node of described first routing node and secondary route node all exists, and node equipment identification is identical, if differed, go to step S304, it should be noted that, here situation about differing refers to other any situation except identical situation, for instance: the down hop routing node of the first routing node and secondary route node all exists and node equipment identification differs or in the first routing node and secondary route node few one of them be absent from down hop routing node, when in the first routing node and secondary route node, at least one is absent from routing node, then start LSP re-aggregation from the first routing node or secondary route node,
Step S302: judge that whether the incoming interface address of the down hop routing node of described first routing node is identical with the incoming interface address of the down hop routing node of secondary route node; If identical, then go to step S303; If differed, go to step S304;
Step S303: confirm that SUB-LSP and the two SUB-LSP meets second condition; Jump out current process;
Step S304: confirm that SUB-LSP and the two SUB-LSP is unsatisfactory for second condition; Jump out and currently judge flow process.
It will be appreciated by persons skilled in the art that whether above-mentioned to judge whether SUB-LSP and the two SUB-LSP meets the incoming interface address of the down hop routing node that can also first compare the first routing node in the flow process of second condition identical with the incoming interface address of the down hop routing node of secondary route node; When confirming identical, further comparing, whether the down hop routing node of the first routing node and the down hop routing node of secondary route node are identical routing nodes;
Step 203: when judging that described SUB-LSP and the two SUB-LSP meets described second condition, confirms that described SUB-LSP and the two SUB-LSP exists LSP re-aggregation;
By above-mentioned judge whether SUB-LSP and the two SUB-LSP meets second condition after, if it is judged that be that SUB-LSP and the two SUB-LSP meets second condition, then confirm SUB-LSP and the two SUB-LSP there is SUB-LSP re-aggregation; If it is judged that be that SUB-LSP and the two SUB-LSP is unsatisfactory for second condition, then confirm that SUB-LSP and the two SUB-LSP is absent from LSP re-aggregation.
Further, after whether there is SUB-LSP and the two SUB-LSP meeting first condition in judging multiple SUB-LSP, can determine whether in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP; The routing information of the described SUB-LSP having built up is obtain in the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation. As such, it is possible to detect whether the SUB-LSP generated but be also not set up exists LSP re-aggregation with the SUB-LSP having built up.
Further, before all not setting up if in SUB-LSP and the two SUB-LSP or after being all established, confirm that SUB-LSP and the two SUB-LSP exists re-aggregation, then can select as required to delete a SUB-LSP, and generate new and the 2nd SUB-LSP and be absent from a SUB-LSP of re-aggregation; Or, the 2nd SUB-LSP is deleted, and generates a new and SUB-LSP and be absent from the 2nd SUB-LSP of re-aggregation;
If in SUB-LSP and the two SUB-LSP, one of them has built up, but when another one SUB-LSP does not also set up, determine that SUB-LSP and the two SUB-LSP exists re-aggregation, then unfounded SUB-LSP can be deleted, and generate new and another one SUB-LSP and be absent from the SUB-LSP of re-aggregation.
Concrete, before SUB-LSP and the two SUB-LSP does not all set up, the routing information of described SUB-LSP and the two SUB-LSP comes from path computation result when SUB-LSP and the two SUB-LSP generates;
After SUB-LSP and the two SUB-LSP is all established, the routing information of described SUB-LSP and the two SUB-LSP comes from the IP subobject in the record routing object RRO carried in the PATH message transmitted in SUB-LSP and the two SUB-LSP;
When in SUB-LSP and the two SUB-LSP, one of them has built up, but when another one SUB-LSP does not also set up, described in the routing information of SUB-LSP that has built up come from the IP subobject in the record routing object RRO carried in the PATH message transmitted in this SUB-LSP; The routing information of the described SUB-LSP being not set up comes from path computation result when this SUB-LSP generates.
Can be seen that in the P2MP that the embodiment of the present invention provides, the recognition methods of LSP re-aggregation can realize whether SUB-LSP exists the detection of re-aggregation quickly and easily, during in particular for the Sub-LSP Establishment strategy not allowing Sub-LSP formation re-aggregation specified in using existing RFC4875, can be upon computing the paths, initiate before RSVP-TE signaling it may determine that the problem that whether there is LSP re-aggregation in outbound path, and avoid unnecessary RSVP signaling message, save Internet resources.
Below by a concrete example, in the P2MP provide the embodiment of the present invention, LSP re-aggregation recognition methods is done and is introduced in detail below.
Still for the topological structure of the existence LSP re-aggregation shown in Fig. 1, the scene of Fig. 1 exists two from head node equipment R1, and the LSP being destination with R5, R6 respectively, these two LSP are respectively as follows: Sub-LSP1 and Sub-LSP2, wherein, Sub-LSP1 destination is R5, Sub-LSP2 destination is R6; Sub-LSP1 has built up successfully, and the path of its process is R1 > R2 > R4 > R5, i.e. from R1, arrives R5 through R2, R4; The path of Sub-LSP2 process is R1 > R3 > R4 > R5 > R6, i.e. from R1, arrives R6 via R3, R4, R5; Before Sub-LSP2 sets up, by flow process shown in Fig. 4, whether Sub-LSP2 and Sub-LSP1 being existed LSP re-aggregation and detect, this flow process comprises the following steps:
Step 401: the IP address taking out the down hop routing node on Sub-LSP2 is stored in variables A DDR (when first time takes IP address, jump routing node from second Sub-LSP2 and start to take IP address);
Step 402: the IPSubobject in RESV message RRO in traversal Sub-LSP1;
Step 403: judge that the IP address whether having a routing node in IPSubobject is identical with ADDR, if it has, go to step 404; If it did not, go to step 401;
Step 404: judge that whether the incoming interface address of the routing node that in Sub-LSP1 and Sub-LSP2, IP address is identical is identical, if identical, then go to step 405; If difference, go to step 406;
Step 405: confirm that whether the IP address of the down hop routing node of the identical routing node in described IP address is all identical with incoming interface address; Identical if (identical situation includes: the down hop routing node of the routing node that in Sub-LSP1 and Sub-LSP2, IP address is identical all exists, and IP address is all identical with incoming interface address), then go to step 407; If differed, (situation about differing includes: the down hop routing node of the routing node that in Sub-LSP1 and Sub-LSP2, IP address is identical all exists, and IP address differs; Or, in the routing node that in Sub-LSP1 and Sub-LSP2, IP address is identical, at least one is absent from down hop routing node), then go to step 406;
Step 406: determine that Sub-LSP1 and Sub-LSP2 is absent from LSP re-aggregation, jump out current process;
Step 407: determine that Sub-LSP1 and Sub-LSP2 exists LSP re-aggregation, jump out current process.
According to above-mentioned flow process, and specific to topological structure shown in Fig. 1, first take out the IP address of R3 in Sub-LSP2 and be stored in ADDR, and travel through the IP address of all routing nodes in Sub-LSP1 successively, confirm to be absent from the routing node that IP address is identical with ADDR; Then take out down hop routing node in Sub-LSP2 further, i.e. the IP address of R4 is stored in ADDR, now, the IP address of all routing nodes in traversal Sub-LSP1, it has been found that in Sub-LSP1, the IP address of R4 is identical with ADDR; Take out the nodal information of the down hop routing node of R4 in Sub-LSP1 further, and in Sub-LSP2, the nodal information of the down hop routing node of R4 compares; Owing in Sub-LSP1 and Sub-LSP2 in Fig. 1, the down hop routing node of R4 is R5, therefore, in Sub-LSP1 and Sub-LSP2 the IP address of the down hop routing node of R4 and incoming interface site homogeneous with, therefore, confirm that Sub-LSP1 and Sub-LSP2 exists LSP re-aggregation, and can confirm that it is start that LSP re-aggregation occurs from R4.
Embodiments providing LSP re-aggregation identification device in a kind of P2MP, as shown in Figure 4, described device includes: first judge module the 51, second judge module 52 and confirmation module 53; Wherein,
Described first judge module 51, for after generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, and after confirming SUB-LSP and the two SUB-LSP that existence meets first condition, trigger the second judge module; Described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
Described second judge module 52, during for being triggered by the first judge module 51, it is judged that whether described SUB-LSP and the two SUB-LSP meets second condition, and when confirming that SUB-LSP and the two SUB-LSP meets second condition, triggers and confirm module; Described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
Described confirmation module 53, during for being triggered by the second judge module 52, confirms that SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
Concrete, whether described first judge module 51 multiple SUB-LSP in the following manner exist SUB-LSP and the two SUB-LSP meeting first condition:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition.
Concrete, the nodal information of described routing node includes: the node equipment identification of routing node and the incoming interface address of routing node.
Further, described device also includes: the 3rd judge module 54, after judging whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition at described first judge module 51, judge in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP.
Concrete, described in the routing information of SUB-LSP that has built up be that the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP obtains; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation.
Concrete, described first judge module 51 or the second judge module 52 determine that the first routing node on the 2nd SUB-LSP and the secondary route node on a SUB-LSP belong to same node device in the following manner:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node.
In specific implementation process, above-mentioned first judge module the 51, second judge module 52, confirmation module 53 and the 3rd judge module 54 can by the central processing unit (CPU in routing device, CentralProcessingUnit), microprocessor (MPU, MicroProcessingUnit), digital signal processor (DSP, DigitalSignalProcessor) or programmable logic array (FPGA, Field-ProgrammableGateArray) realize.
Those skilled in the art are it should be appreciated that embodiments of the invention can be provided as method, system or computer program. Therefore, the present invention can adopt the form of hardware embodiment, software implementation or the embodiment in conjunction with software and hardware aspect. And, the present invention can adopt the form at one or more upper computer programs implemented of computer-usable storage medium (including but not limited to disk memory and optical memory etc.) wherein including computer usable program code.
The present invention is that flow chart and/or block diagram with reference to method according to embodiments of the present invention, equipment (system) and computer program describe. It should be understood that can by the combination of the flow process in each flow process in computer program instructions flowchart and/or block diagram and/or square frame and flow chart and/or block diagram and/or square frame. These computer program instructions can be provided to produce a machine to the processor of general purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device so that the instruction performed by the processor of computer or other programmable data processing device is produced for realizing the device of function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and can guide in the computer-readable memory that computer or other programmable data processing device work in a specific way, the instruction making to be stored in this computer-readable memory produces to include the manufacture of command device, and this command device realizes the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make on computer or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computer or other programmable devices provides for realizing the step of function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
The above, be only presently preferred embodiments of the present invention, is not intended to limit protection scope of the present invention.
Claims (12)
1. LSP re-aggregation recognition methods in a P2MP, it is characterised in that described method includes:
After generation has multiple subtab switching path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
When judging to exist SUB-LSP and the two SUB-LSP meeting first condition, judge whether described SUB-LSP and the two SUB-LSP meets second condition, described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
When judging that described SUB-LSP and the two SUB-LSP meets described second condition, confirm that described SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
2. method according to claim 1, it is characterised in that described judge whether there is SUB-LSP and the two SUB-LSP meeting first condition in multiple SUB-LSP, including:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition.
3. method according to claim 2, it is characterised in that the nodal information of described routing node includes: the node equipment identification of routing node and the incoming interface address of routing node.
4. method according to claim 3, it is characterized in that, after judging whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, described method also includes: judge in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP.
5. method according to claim 4, it is characterised in that described in the routing information of SUB-LSP that has built up be that the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP obtains; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation.
6. the method according to claim 3 or 4 or 5, it is characterised in that determine in described SUB-LSP and the two SUB-LSP there is identical routing node in the following manner:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node.
7. LSP re-aggregation identification device in a P2MP, it is characterised in that described device includes: the first judge module, the second judge module and confirmation module; Wherein,
Described first judge module, for after generation has multiple label switched path SUB-LSP, judge whether the plurality of SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition, and after confirming SUB-LSP and the two SUB-LSP that existence meets first condition, trigger the second judge module; Described first condition includes: there is identical routing node in described SUB-LSP and the two SUB-LSP, and the incoming interface address that described identical routing node is in a described SUB-LSP is different from the incoming interface address in described 2nd SUB-LSP;
Described second judge module, during for being triggered by the first judge module, it is judged that whether described SUB-LSP and the two SUB-LSP meets second condition, and when confirming that SUB-LSP and the two SUB-LSP meets second condition, triggers and confirm module; Described second condition includes: described identical routing node down hop routing node in a described SUB-LSP identical with the down hop routing node in described 2nd SUB-LSP and identical down hop routing node incoming interface address in a described SUB-LSP is identical with the incoming interface address in described 2nd SUB-LSP;
Described confirmation module, during for being triggered by the second judge module, confirms that SUB-LSP and the two SUB-LSP exists LSP re-aggregation.
8. device according to claim 7, it is characterised in that described first judge module judges whether there is SUB-LSP and the two SUB-LSP meeting first condition in multiple SUB-LSP in the following manner:
The nodal information of each jumping routing node in the routing information of a SUB-LSP in multiple SUB-LSP is compared with the nodal information of each jumping routing node in the routing information of other any one SUB-LSP successively, to judge whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition.
9. device according to claim 8, it is characterised in that the nodal information of described routing node includes: the node equipment identification of routing node and the incoming interface address of routing node.
10. device according to claim 9, it is characterized in that, described device also includes: the 3rd judge module, after judging whether multiple SUB-LSP exists SUB-LSP and the two SUB-LSP meeting first condition at the first judge module, judge in described SUB-LSP and the two SUB-LSP whether one be the SUB-LSP having built up, and another is unfounded SUB-LSP.
11. device according to claim 10, it is characterised in that described in the routing information of SUB-LSP that has built up be that the IP subobject in the record routing object RRO carried in the RESV message transmitted from a SUB-LSP obtains; The routing information of described unfounded SUB-LSP is the routing information calculated during the 2nd SUB-LSP generation.
12. according to the device described in claim 9 or 10 or 11, it is characterised in that described first judge module or the second judge module described SUB-LSP and the two SUB-LSP in the following manner exists identical routing node:
Judge that whether the node equipment identification of routing node on the node equipment identification of routing node on the 2nd SUB-LSP and a SUB-LSP is identical, time identical, it is determined that described SUB-LSP and the two SUB-LSP exists identical routing node.
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 true CN105634948A (en) | 2016-06-01 |
| CN105634948B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395483A (en) * | 2017-08-28 | 2017-11-24 | 迈普通信技术股份有限公司 | A kind of path establishment method and device |
Families Citing this family (1)
| 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 |
Citations (10)
| 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 |
| US20050169266A1 (en) * | 2004-02-03 | 2005-08-04 | Rahul Aggarwal | MPLS traffic engineering for point-to-multipoint label switched paths |
| 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 (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102790713A (en) * | 2011-05-18 | 2012-11-21 | 中兴通讯股份有限公司 | Quick heavy-route protection method and system of bidirectional path |
-
2014
- 2014-10-28 CN CN201410589418.0A patent/CN105634948B/en active Active
-
2015
- 2015-01-20 WO PCT/CN2015/071107 patent/WO2016065747A1/en active Application Filing
Patent Citations (10)
| 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 |
| US20050169266A1 (en) * | 2004-02-03 | 2005-08-04 | Rahul Aggarwal | MPLS traffic engineering for point-to-multipoint label switched paths |
| 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 |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395483A (en) * | 2017-08-28 | 2017-11-24 | 迈普通信技术股份有限公司 | A kind of path establishment method and device |
| CN107395483B (en) * | 2017-08-28 | 2020-06-02 | 迈普通信技术股份有限公司 | Path establishing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016065747A1 (en) | 2016-05-06 |
| CN105634948B (en) | 2020-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11362940B2 (en) | Method and apparatus for determining identification information about cross-domain path, and storage medium | |
| CN111917643B (en) | Seamless bidirectional forwarding detection method and device for segmented routing tunnel | |
| CN106656801B (en) | Reorientation method, device and the Business Stream repeater system of the forward-path of Business Stream | |
| CN107547383B (en) | Path detection method and device | |
| US8442050B2 (en) | Apparatus and method of controlling LSP of RSVP-TE protocol using label with availability of end-to-end range | |
| WO2018054397A1 (en) | Service function chain detection path method and device | |
| US11177976B2 (en) | Method and device for automatically implementing IOAM encapsulation and storage medium | |
| US20150215156A1 (en) | Method and apparatus for network failure restoration | |
| WO2016177049A1 (en) | Method and device for achieving capacity expansion and reduction of access apparatus | |
| CN110493129B (en) | Updating method of backup label path, message forwarding method and device | |
| EP2541847A1 (en) | Method for establishing associated bidirectional label switching path and system thereof | |
| EP3355533A1 (en) | Route switcher | |
| CN104468208A (en) | Detection and recovery method and device for communication faults | |
| EP2621133A1 (en) | Method and system for implementing pw control bit capability negotiation | |
| CN105634948A (en) | LSP reconvergence identification method and LSP reconvergence identification device in P2MP | |
| CN103746828A (en) | Method and device for network node management | |
| CN103716236A (en) | Route calculation method based on IS-IS protocol and equipment | |
| CN103384220A (en) | Method, device and system for building traffic engineering label switching path | |
| US9998807B2 (en) | Method and apparatus for establishing trail network | |
| CN102769552A (en) | Method and apparatus for transmitting BFD (bidirectional forwarding detection) message during LSP (label switched path) detection by BFD | |
| JP4684351B2 (en) | Signaling apparatus and signaling method | |
| CN106330701B (en) | Rapid rerouting method and device for ring network | |
| WO2016061920A1 (en) | Path backup method and system, header node device and intermediate node device | |
| CN102255797B (en) | Method and equipment for quickly determining OSPF (Open Shortest Path First) interface role | |
| CN104579758A (en) | LISP (Location/ID Separation Protocol) domain fault detection convergence method and 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 |