CN101610214A - In multi-protocol label switching network, realize the method and the router of reliable transmission - Google Patents
In multi-protocol label switching network, realize the method and the router of reliable transmission Download PDFInfo
- Publication number
- CN101610214A CN101610214A CNA2009100894075A CN200910089407A CN101610214A CN 101610214 A CN101610214 A CN 101610214A CN A2009100894075 A CNA2009100894075 A CN A2009100894075A CN 200910089407 A CN200910089407 A CN 200910089407A CN 101610214 A CN101610214 A CN 101610214A
- Authority
- CN
- China
- Prior art keywords
- lsp
- free state
- force
- comes
- minimum free
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a kind of method and router of in multi-protocol label switching network, realizing reliable transmission.Described method comprises the steps: all LSR in the mpls domain are enabled loop detection; After head node receives label mapping message, wherein routing information is saved in the path vector record sheet; For the current LSP that comes into force, head node selects a LSP as backup LSP from the free state LSP of correspondence according to described path vector record sheet; When head node detects the path, LSP place of coming into force and breaks down, flow is switched on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.According to the present invention, make that when LSP breaks down flow can not interrupt or the time decreased of flow interrupt.
Description
Technical field
The present invention relates to the multiprotocol label switching (mpls) technology, particularly a kind of method and router of in the MPLS network, realizing reliable transmission.
Background technology
The explosive increase of Internet in recent years, for ISP (ISP) provides huge commercial opportunity, also its backbone network is had higher requirement simultaneously, people wish that IP network not only can provide services such as E-Mail, online, can also provide broadband, real-time service.MPLS is exactly a kind of technology that produces under this background, it has absorbed some thoughts of virtual path identifier/Virtual Path Identifier (VPI/VCI) exchange of asynchronous transfer mode (ATM), the flexibility of seamlessly integrated IP route technology and the simple and direct property of two layers of exchange are increasing this connection-oriented attribute of MPLS in connectionless IP network.By adopting the method for MPLS foundation " virtual connections ", the means of some management and operation have been increased for IP network.
Fig. 1 is the structural representation of MPLS network.As shown in Figure 1, the basic comprising unit of MPLS network is LSR (LSR), and the network that is made of LSR is called mpls domain.The LSR that be positioned at the mpls domain edge, connects other user network is called Edge LSR (LER), and the LSR of intra-zone is called core LSR.After label was stamped in grouping, the label switched path (LSP) that constitutes along a series of LSR transmitted, and inlet LER wherein is called Ingress, and outlet LER is called Engress.
The signaling of the normally used MPLS of foundation label switched path has label distribution method agreement/based on tag distribution protocol (LDP/CR-LDP), the RSVP-traffic engineering (RSVP-TE) of constraint route, Border Gateway Protocol (BGP) expansion etc.Be example below with LDP, the process of care label distribution.
The distribution procedure of label has two kinds of patterns, and the main distinction is that the issue of label mapping is that (DU) initiatively issued in upstream request (DoD) or downstream.
The DoD pattern
Upstream LSR LSR downstream sends label request message (Label Request Message), wherein comprises the descriptor of forwarding equivalence class (FEC).Downstream LSR is the FEC distributing labels for this reason, and the label of binding is fed back to upstream LSR by label mapping message (Label Mapping Message).
When downstream LSR feeds back label mapping message, depends on the label distribution control mode that this LSR adopts:
When (1) adopting Ordered mode (ordered label control mode), only receive the label mapping message that its downstream returns after, just send label mapping message to its upstream;
When (2) adopting Independent mode (separate label control mode),, all send label mapping message to its upstream immediately no matter whether receive the label mapping message that its downstream is returned.
Upstream LSR selects downstream LSR according to the information in its routing table.In Fig. 1, LSP1 (A-B-C-D) LSR on the way adopts the Ordered mode, and the LSR F on the LSP2 (E-F-G-H) then adopts the Independent mode.
The DU pattern
Downstream LSR is after the LDP session is set up successfully, initiatively to its upstream LSR issue label mapping message.Upstream LSR preserves tag mapping information, and handles the tag mapping information of receiving according to routing table information.
In addition, after LSR receives label mapping message, to temporarily use at present less than label be mapped with following two kinds of processing modes:
Liberal label retention mode (Liberal): for the label mapping of receiving from neighbours LSR, neighbours LSR is that next jumping of oneself all keeps.
Conservative retention mode (Conservative):, have only when neighbours are next jumping of oneself just to keep for the label mapping of receiving from neighbours.
The process of setting up of LSP is actual binds forwarding equivalence class (FEC) and label exactly, and this binding (label mapping) announcement LSP is gone up adjacent LSR.With DU pattern, ordered label control mode is example, and the foundation of LSP mainly comprises the steps:
Step S1: when the route changing of network, if a fringe node is arranged to be found new destination address to have occurred in the routing table of oneself, and this address does not belong to any existing FEC, and then this fringe node need be set up a new FEC for this purpose address.
Step S2: if there is upstream LSR in this fringe node, and distributable label is arranged still, then this node is the FEC distributing labels, and upstream sends label mapping message, wherein comprises information such as distributed labels.
Step S3: the LSR that receives label mapping message writes down corresponding tag mapping information, if message then will increase corresponding clauses and subclauses by next jumping transmission of corresponding FEC in its Label Forwarding Information Base.This LSR is its upstream LSR distributing labels, and continues the label mapping message of LSR transmission upstream.
Step S4: when inlet LSR receives label mapping message, in Label Forwarding Information Base, increase corresponding clauses and subclauses.At this moment, just finished the foundation of LSP, next just can carry out label forwarding the packet of this FEC correspondence.
Set up LSP and will prevent to produce loop in mpls domain, LDP loop detection mechanism can detect the appearance of LSP loop, and avoids taking place loop.If mpls domain is carried out loop detection, then should on all LSR, all enable loop detection.
The LDP loop detection has following dual mode:
Maximum hop count
In the message of transmitting label mapping (perhaps label request), comprise jumping figure information, every through adding 1 once jumping this value.Think loop to occur when this value reaches the maximum of regulation, LSP sets up failure.
Path vector
Carry routing information (Path VectorTLV) in the message of transmitting label mapping (perhaps label request), every through a jumping, corresponding apparatus is just checked the LSR sign that whether comprises oneself in the routing information.Think loop to occur when one of meeting the following conditions, LSP sets up failure:
The record of existing this LSR in the routing information;
The jumping figure in path reaches the maximum of setting.
If there is not the LSR sign of oneself in the routing information, the LSR sign of oneself will be added in this routing information, and the routing information after carrying renewal in the label mapping message that sends to other reciprocity LSR.
Because miscellaneous service is of a great variety on the current network, particularly some voice, videoconferencing service require all very highly to real-time, and this just has higher reliability and real-time requirement to LDP LSP.In case the LSP of current use breaks down, break down to the LSP (A-B-F) of LSR F as the LSR A among Fig. 2, how to guarantee that the continuation of flow is transmitted? following two kinds of schemes are arranged in the current realization.
Scheme one, trigger LSP by Interior Gateway Protocol (IGP) routing convergence and rebuild: because the LSP that LDP sets up just is packaged into MPLS to the IP message that needs are transmitted, the actual route of walking is the same with the route that original IP wraps away still.So very natural, if route has alternative path can reach the destination, then can trigger LSP and rebuild; After LSP rebuilds, converting flow again then.As shown in Figure 2, that original route is walked is A-B-F, so LSP also should walk A-B-F, in case the link between LSR A and the LSR B breaks down or LSR B delays machine, will reappear preferred route on the LSR A, make route transmit, so LSP also can and then switch from A-C or A-E.
Scheme two, when LDP FRR (fast heavy-route): LDP is operated in the label control+liberal label retention mode of upstream request+in order, LSR can preserve all label of receiving mappings, and wherein, the label mapping of sending from next jumping of the corresponding route of FEC can generate Label Forwarding Information Base.If, be equivalent to set up backup LSP for the mapping of Liberal label also generates Label Forwarding Information Base.Router is safeguarded the operating state of each port, in the message repeating process, if next state of jumping port that is checked through message is selected to be switched to the port that backs up LSP behind the backup LSP for losing efficacy at random, use backup LSP to transmit, temporary transient assurance flow is continuous before routing convergence.
Anatomize, be not difficult to find that there are some problems in existing scheme.
For scheme one, because by the IGP routing convergence, and the routing convergence time generally is that second level is above, thus be difficult to realize that flow does not interrupt, and break period is longer.Take this method can not accomplish high reliability and real-time.
For scheme two; can realize a second grade following LSP protection; detect link fails between LSR A and the LSR B as LSR A; LSR A can be according to the LSP of Liberal state; flow is directly switched; wait until the route recovery of scheme one then, again LSP is switched back to newly-generated LSP.Can accomplish the message packet loss of trying one's best few like this, even packet loss not.But this method can't reliably be switched under more situation.For example, the machine if LSR B delays, LSR A detect the link fails between LSRA and the LSR B, flow may be switched to A-E-B-F then, the machine because LSR B has delayed, and therefore, flow still can interrupt.
Summary of the invention
Technical problem to be solved by this invention provides a kind of method and router of realizing reliable transmission in multi-protocol label switching network, makes when LSP breaks down, and flow can not interrupt or the time decreased of flow interrupt.
For solving the problems of the technologies described above, it is as follows to the invention provides technical scheme:
A kind of method that realizes reliable transmission in multi-protocol label switching network comprises the steps:
All LSR in the mpls domain are enabled loop detection;
After head node receives label mapping message, wherein routing information is saved in the path vector record sheet;
For the current LSP that comes into force, head node selects a LSP as backup LSP from the free state LSP of correspondence according to described path vector record sheet;
When head node detects the path, LSP place of coming into force and breaks down, flow is switched on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
Above-mentioned method, wherein, describedly from the free state LSP of correspondence, select a LSP to comprise as backup LSP:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
Above-mentioned method, wherein, describedly from the free state LSP of correspondence, select a LSP to comprise as backup LSP:
The preferential free state LSP that selects to include user's Designated Router;
, from the free state LSP of the described user's of including Designated Router, select and the described minimum free state LSP of LSP duplicate node that comes into force during at the free state LSP that includes user's Designated Router more than one;
When in all free state LSP, not comprising user's Designated Router, from all free state LSP, select and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
Above-mentioned method, wherein, describedly from the free state LSP of correspondence, select a LSP to comprise as backup LSP:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP of coming into force duplicate node the preferential free state LSP that selects to include user's Designated Router;
At the free state LSP that includes user's Designated Router during, from the described free state LSP that includes user's Designated Router, select through the minimum free state LSP of jumping figure more than one;
When in the minimum free state LSP of all and the described LSP of coming into force duplicate node, not comprising user's Designated Router, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
A kind of LSR is characterized in that, comprising:
The loop detection enable module is used to enable the loop detection of this LSR;
The path logging modle is used for after receiving label mapping message, and wherein routing information is saved in the path vector record sheet;
Backup LSP selects module, is used for the LSP that comes into force for current, according to described path vector record sheet, selects a LSP as backup LSP from the free state LSP of correspondence;
Handover module when being used for breaking down in the path, LSP place of coming into force, switching to flow on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
The embodiment of the invention is by enabling the loop detection function on LSR, LSR writes down the routing information of LSP, and selects to back up LSP according to described routing information, has so improved the reliability of backup LSP, has reduced the risk of flow interrupt.
Description of drawings
Fig. 1 is the structural representation of MPLS network;
Fig. 2 is that the lsp failure of prior art is handled schematic diagram;
Fig. 3 is the method flow diagram of realizing reliable transmission in the MPLS network of the embodiment of the invention;
Fig. 4 is a kind of method flow diagram of selecting to back up LSP in the embodiment of the invention;
Fig. 5 is an another kind of method flow diagram of selecting backup LSP in the embodiment of the invention;
Fig. 6 is another method flow diagram of selecting backup LSP in the embodiment of the invention;
Fig. 7 is the structural representation of the LSR of the embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, describe the present invention below in conjunction with the accompanying drawings and the specific embodiments.
With reference to Fig. 3, the method that realizes reliable transmission in the MPLS network of the embodiment of the invention mainly comprises the steps:
Step 301: all LSR in the mpls domain are enabled loop detection;
After enabling loop detection, just carry routing information (PathVector TLV) in the message of transmitting the label mapping, every through a jumping, corresponding apparatus is just checked the LSR sign that whether comprises oneself in the routing information.If comprise the LSR sign of oneself in the routing information, perhaps, the jumping figure in path reaches the maximum of setting (enable loop detection and also comprise setting to maximum hop count, can rational jumping figure restriction be set according to real needs), then think loop to occur, LSP sets up failure; If there is not the LSR sign of oneself in the routing information, the LSR sign of oneself will be added in this routing information, and the routing information after carrying renewal in the label mapping message that sends to other reciprocity LSR.
Step 302: after head node receives label mapping message, wherein routing information is saved in the path vector record sheet;
Head node refers to the ingress of any LSP.Because all LSR have been enabled the loop detection function, therefore, carry the routing information of LSP in the Label Mapping message that head node receives, then, head node is saved in described routing information in the corresponding path vector record sheet.Particularly, include the LSP sign of all nodes of certain bar LSP process in the path vector record sheet, and each path vector record sheet is corresponding to a LSP.
In addition, also some strategies can be set on LSR, make head node only preserve the routing information of partial L SP, for example, only be saved in the LSP of specific purpose IP.Like this, can reduce the resource consumption of LSP.
Step 303: for the current LSP that comes into force, head node selects a LSP as backup LSP from free state (Liberal) LSP of correspondence according to described path vector record sheet;
The current LSP that comes into force of head node traversal, for certain bar LSP that comes into force, if many Liberal LSP of existence and this LSP correspondence that comes into force, then according to corresponding path vector record sheet, select the backup LSP of a LSP as this LSP that comes into force from described many LiberalLSP, concrete system of selection sees also hereinafter.
Because preserve the path vector record sheet corresponding with each LSP in the head node, therefore, head node has also just been known the routing information of the concrete process of each LSP, like this, just can select to back up LSP according to preset rules, to improve the reliability of backup LSP.And in the existing LDP FRR scheme, head node is only known next jumping LSR information of Liberal LSP, and does not know the routing information of its concrete process, therefore, can only select a Liberal LSP as backup LSP at random, like this, the reliability of backup LSP is not high.
Step 304: when head node detects the path, LSP place of coming into force and breaks down, flow is switched on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
Head node detects the path, LSP place of coming into force and breaks down (do not limit detection mode, for example, detect by two-way forwarding testing mechanism BFD), then flow is directed on the backup LSP that selects.Then, wait for route recovery, new LSP comes into force.After new LSP comes into force, earlier flow is switched to new LSP,, select the backup LSP of new LSP again according to the method described above then according to up-to-date route recovery result.
Fig. 4 is a kind of method flow diagram of selecting to back up LSP in the embodiment of the invention.
Under this kind implementation, select the strategy of backup LSP to be: the preferential selection and the minimum Liberal LSP of LSP duplicate node that comes into force; With the minimum Liberal LSP of the described LSP duplicate node that comes into force during more than one, from the minimum Liberal LSP of the described LSP duplicate node that comes into force select through the minimum Liberal LSP of jumping figure; When passing through the minimum Liberal LSP of jumping figure, from the minimum Liberal LSP of described process jumping figure, select a LSP at random more than one.With reference to Fig. 4, specifically comprise the steps:
Step 401: search and the minimum Liberal LSP of LSP duplicate node that comes into force;
For every Liberal LSP, the path vector record sheet corresponding respectively to this Liberal LSP and the LSP that comes into force compares, can obtain the number of duplicate node,, obtain and the minimum Liberal LSP information of LSP duplicate node that comes into force according to the number of the duplicate node that gets access to.
Step 402: judge with the minimum Liberal LSP of LSP duplicate node that comes into force whether more than one, if, enter step 404, otherwise, enter step 403;
Step 403: select the minimum Liberal LSP of this and the LSP duplicate node that comes into force as backup LSP, finish to select;
Step 404: from the minimum Liberal LSP of the LSP duplicate node that comes into force search through jumping figure minimum Liberal LSP;
For every Liberal LSP, can get access to the jumping figure information of its process according to its corresponding path vector record sheet, according to the jumping figure information that gets access to, obtain through the minimum Liberal LSP information of jumping figure;
Step 405: whether judge the minimum Liberal LSP of process jumping figure more than one, if, enter step 407, otherwise, step 406 entered;
Step 406: select the minimum Liberal LSP of described process jumping figure as backup LSP, finish to select;
Step 407: from the minimum Liberal LSP of described process jumping figure, select a LSP at random as backup LSP.
Need to prove, in step 402, if with the minimum LiberalLSP of the LSP duplicate node that comes into force more than one, also can not carry out follow-up jumping figure and judge, but directly therefrom select a Liberal LSP at random as backup LSP.
Fig. 5 is an another kind of method flow diagram of selecting backup LSP in the embodiment of the invention.
Under this kind implementation, select the strategy of backup LSP to be: the preferential Liberal LSP that selects to include user's Designated Router; , from the Liberal LSP of the described user's of including Designated Router, select and the minimum Liberal LSP of the described LSP duplicate node that comes into force during at the Liberal LSP that includes user's Designated Router more than one; When in all Liberal LSP, not comprising user's Designated Router, from all Liberal LSP, select and the minimum Liberal LSP of the described LSP duplicate node that comes into force; With the minimum Liberal LSP of the described LSP duplicate node that comes into force during more than one, from the minimum Liberal LSP of the described LSP duplicate node that comes into force select through the minimum Liberal LSP of jumping figure; When passing through the minimum Liberal LSP of jumping figure, from the minimum Liberal LSP of described process jumping figure, select a LSP at random more than one.With reference to Fig. 5, specifically comprise the steps:
Step 501: judge whether to exist the Liberal LSP that includes user's Designated Router, if, enter step 502, otherwise, step 504 entered;
Can on LSR, be provided with, the sign of user's Designated Router is stored among the LSR.In general, the user can specify some highly reliable routers, for example, nucleus equipment or the bigger equipment of bandwidth is leaned on router as height.Like this, the preferential Liberal LSP that selects to include highly reliable router can make that as backup LSP the reliability of this backup LSP is also higher relatively.For every Liberal LSP, can get access to the routing information of its process according to its corresponding path vector record sheet, then, just can judge whether comprise user's Designated Router in the path of process.
Step 502: whether judge the Liberal LSP that includes user's Designated Router more than one, if, enter step 504, otherwise, step 503 entered;
Step 503: select this Liberal LSP that includes user's Designated Router as backup LSP, finish to select;
Step 504: search and the minimum Liberal LSP of LSP duplicate node that comes into force;
If the previous step of this step is step 501 suddenly, then from all LiberalLSPs corresponding, search and the minimum Liberal LSP of LSP duplicate node that comes into force with the LSP that comes into force;
If the previous step of this step is step 502 suddenly, then from the LiberalLSP that includes user's Designated Router, search and the minimum Liberal LSP of LSP duplicate node that comes into force.
Step 505: judge with the minimum Liberal LSP of LSP duplicate node that comes into force whether more than one, if, enter step 507, otherwise, enter step 506;
Step 506: select the minimum Liberal LSP of this and the LSP duplicate node that comes into force as backup LSP, finish to select;
Step 507: from the minimum Liberal LSP of the LSP duplicate node that comes into force search through jumping figure minimum Liberal LSP;
Step 508: whether judge the minimum Liberal LSP of process jumping figure more than one, if, enter step 510, otherwise, step 509 entered;
Step 509: select the minimum Liberal LSP of described process jumping figure as backup LSP, finish to select;
Step 510: from the minimum Liberal LSP of described process jumping figure, select a LSP at random as backup LSP.
Need to prove, in step 502, judge, but directly therefrom select a Liberal LSP at random as backup LSP if the Liberal LSP that includes user's Designated Router, also can not carry out follow-up duplicate node more than one.Similarly, in step 505, if with the minimum Liberal LSP of the LSP duplicate node that comes into force more than one, also can not carry out follow-up jumping figure and judge, but directly therefrom select a Liberal LSP at random as backup LSP.
Fig. 6 is another method flow diagram of selecting backup LSP in the embodiment of the invention.
Under this kind implementation, select the strategy of backup LSP to be: the preferential selection and the minimum Liberal LSP of the described LSP duplicate node that comes into force; With the minimum Liberal LSP of the described LSP duplicate node that comes into force during more than one, from the minimum Liberal LSP of described Liberal LSP duplicate node the preferential Liberal LSP that selects to include user's Designated Router; At the Liberal LSP that includes user's Designated Router during, from the described Liberal LSP that includes user's Designated Router, select through the minimum Liberal LSP of jumping figure more than one; When in the minimum Liberal LSP of all and the described LSP of coming into force duplicate node, not comprising user's Designated Router, from the minimum Liberal LSP of the described LSP duplicate node that comes into force select through the minimum Liberal LSP of jumping figure; When passing through the minimum Liberal LSP of jumping figure, from the minimum Liberal LSP of described process jumping figure, select a LSP at random more than one.With reference to Fig. 6, specifically comprise the steps:
Step 601: search and the minimum Liberal LSP of LSP duplicate node that comes into force;
Step 602: judge with the minimum Liberal LSP of LSP duplicate node that comes into force whether more than one, if, enter step 604, otherwise, enter step 603;
Step 603: select the minimum Liberal LSP of this and the LSP duplicate node that comes into force as backup LSP, finish to select;
Step 604: judge with the minimum Liberal LSP of LSP duplicate node that comes into force in whether have the Liberal LSP that includes user's Designated Router, if, enter step 605, otherwise, enter step 607;
Step 605: whether judge the Liberal LSP that includes user's Designated Router more than one, if, enter step 607, otherwise, step 606 entered;
Step 606: select this Liberal LSP that includes user's Designated Router as backup LSP, finish to select;
Step 607: search through the minimum Liberal LSP of jumping figure;
If the previous step of this step is step 604 suddenly, then from the minimum Liberal LSP of the LSP duplicate node that comes into force search through jumping figure minimum Liberal LSP;
If the previous step of this step is step 605 suddenly, then from the LiberalLSP that includes user's Designated Router, search through the minimum Liberal LSP of jumping figure.
Step 608: whether judge the minimum Liberal LSP of process jumping figure more than one, if, enter step 610, otherwise, step 609 entered;
Step 609: select the minimum Liberal LSP of described process jumping figure as backup LSP, finish to select;
Step 610: from the minimum Liberal LSP of described process jumping figure, select a LSP at random as backup LSP.
Need to prove, in step 602, if with the minimum LiberalLSP of the LSP duplicate node that comes into force more than one, also can not carry out the follow-up judgement that whether comprises user's Designated Router, but directly therefrom select a Liberal LSP at random as backup LSP.Similarly, in step 605, judge, but directly therefrom select a Liberal LSP at random as backup LSP if the Liberal LSP that includes user's Designated Router, also can not carry out follow-up jumping figure more than one.
With reference to Fig. 7, the LSR of the embodiment of the invention comprises: loop detection enable module, path logging modle, backup LSP select module and handover module.
The loop detection enable module is used to enable the loop detection of this LSR.After enabling loop detection, just carry routing information (Path Vector TLV) in the message of transmitting the label mapping, every through a jumping, corresponding apparatus is just checked the LSR sign that whether comprises oneself in the routing information.If comprise the LSR sign of oneself in the routing information, perhaps, the jumping figure in path reaches the maximum of setting (enable loop detection and also comprise setting to maximum hop count, can rational jumping figure restriction be set according to real needs), then think loop to occur, LSP sets up failure; If there is not the LSR sign of oneself in the routing information, the LSR sign of oneself will be added in this routing information, and the routing information after carrying renewal in the label mapping message that sends to other reciprocity LSR.
The path logging modle is used for after receiving label mapping message, and wherein routing information is saved in the path vector record sheet.Include the LSP sign of all nodes of certain bar LSP process in the path vector record sheet, and each path vector record sheet is corresponding to a LSP.
Backup LSP selects module, is used for the LSP that comes into force for current, according to described path vector record sheet, selects a LSP as backup LSP from the Liberal LSP of correspondence.Backup LSP selects the current LSP that comes into force of module head node traversal, for certain bar LSP that comes into force, if many Liberal LSP of existence and this LSP correspondence that comes into force, then according to corresponding path vector record sheet, select the backup LSP of a LSP as this LSP that comes into force from described many Liberal LSP, concrete system of selection sees also above.
Handover module when being used for breaking down in the path, LSP place of coming into force, switching to flow on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
In sum, the embodiment of the invention is by enabling the loop detection function on LSR, and LSR writes down the routing information of LSP, and selects to back up LSP according to described routing information, has so improved the reliability of backup LSP, has reduced the risk of flow interrupt.
Should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spiritual scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (8)
1. a method that realizes reliable transmission in multiprotocol label switching MPLS network is characterized in that, comprises the steps:
All LSR LSR in the mpls domain are enabled loop detection;
After head node receives label mapping message, wherein routing information is saved in the path vector record sheet;
For the current label switching path LSP that comes into force, head node selects a LSP as backup LSP from the free state LSP of correspondence according to described path vector record sheet;
When head node detects the path, LSP place of coming into force and breaks down, flow is switched on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
2. the method for claim 1 is characterized in that, describedly selects a LSP to comprise as backup LSP from the free state LSP of correspondence:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
3. the method for claim 1 is characterized in that, describedly selects a LSP to comprise as backup LSP from the free state LSP of correspondence:
The preferential free state LSP that selects to include user's Designated Router;
, from the free state LSP of the described user's of including Designated Router, select and the described minimum free state LSP of LSP duplicate node that comes into force during at the free state LSP that includes user's Designated Router more than one;
When in all free state LSP, not comprising user's Designated Router, from all free state LSP, select and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
4. the method for claim 1 is characterized in that, describedly selects a LSP to comprise as backup LSP from the free state LSP of correspondence:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP of coming into force duplicate node the preferential free state LSP that selects to include user's Designated Router;
At the free state LSP that includes user's Designated Router during, from the described free state LSP that includes user's Designated Router, select through the minimum free state LSP of jumping figure more than one;
When in the minimum free state LSP of all and the described LSP of coming into force duplicate node, not comprising user's Designated Router, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
5. a LSR is characterized in that, comprising:
The loop detection enable module is used to enable the loop detection of this LSR;
The path logging modle is used for after receiving label mapping message, and wherein routing information is saved in the path vector record sheet;
Backup LSP selects module, is used for the LSP that comes into force for current, according to described path vector record sheet, selects a LSP as backup LSP from the free state LSP of correspondence;
Handover module when being used for breaking down in the path, LSP place of coming into force, switching to flow on the described backup LSP, and after routing convergence generates new LSP, flow is switched on the described new LSP.
6. LSR as claimed in claim 5 is characterized in that, described backup LSP selects module to be further used for:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
7. LSR as claimed in claim 5 is characterized in that, described backup LSP selects module to be further used for:
The preferential free state LSP that selects to include user's Designated Router;
, from the free state LSP of the described user's of including Designated Router, select and the described minimum free state LSP of LSP duplicate node that comes into force during at the free state LSP that includes user's Designated Router more than one;
When in all free state LSP, not comprising user's Designated Router, from all free state LSP, select and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
8. LSR as claimed in claim 5 is characterized in that, described backup LSP selects module to be further used for:
The preferential selection and the described minimum free state LSP of LSP duplicate node that comes into force;
With the minimum free state LSP of the described LSP duplicate node that comes into force during more than one, from the minimum free state LSP of the described LSP of coming into force duplicate node the preferential free state LSP that selects to include user's Designated Router;
At the free state LSP that includes user's Designated Router during, from the described free state LSP that includes user's Designated Router, select through the minimum free state LSP of jumping figure more than one;
When in the minimum free state LSP of all and the described LSP of coming into force duplicate node, not comprising user's Designated Router, from the minimum free state LSP of the described LSP duplicate node that comes into force select through the minimum free state LSP of jumping figure;
When passing through the minimum free state LSP of jumping figure, from the minimum free state LSP of described process jumping figure, select a LSP at random more than one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100894075A CN101610214A (en) | 2009-07-17 | 2009-07-17 | In multi-protocol label switching network, realize the method and the router of reliable transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100894075A CN101610214A (en) | 2009-07-17 | 2009-07-17 | In multi-protocol label switching network, realize the method and the router of reliable transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101610214A true CN101610214A (en) | 2009-12-23 |
Family
ID=41483805
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009100894075A Pending CN101610214A (en) | 2009-07-17 | 2009-07-17 | In multi-protocol label switching network, realize the method and the router of reliable transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101610214A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143043A (en) * | 2010-07-14 | 2011-08-03 | 华为技术有限公司 | Method and device for establishing label switching path |
| CN102413034A (en) * | 2010-09-26 | 2012-04-11 | 杭州华三通信技术有限公司 | Method for controlling label notice message and maintaining LSP (Label Switching Path), and LSR (Label Switching Router) |
| WO2015013905A1 (en) * | 2013-07-31 | 2015-02-05 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for selecting path from paths between label edge routers |
| WO2016090950A1 (en) * | 2014-12-11 | 2016-06-16 | 中兴通讯股份有限公司 | Label request message control method and system and upstream and downstream label switching router |
| CN108848041A (en) * | 2018-06-07 | 2018-11-20 | 烽火通信科技股份有限公司 | Business transmitting method and system when LSP changes in MPLS network |
| CN112217719A (en) * | 2019-07-12 | 2021-01-12 | 华为技术有限公司 | Data transmission method, network node and storage medium |
-
2009
- 2009-07-17 CN CNA2009100894075A patent/CN101610214A/en active Pending
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011140923A1 (en) * | 2010-07-14 | 2011-11-17 | 华为技术有限公司 | Method and apparatus for establishing label switch path |
| CN102143043B (en) * | 2010-07-14 | 2014-11-05 | 华为技术有限公司 | Method and device for establishing label switching path |
| CN102143043A (en) * | 2010-07-14 | 2011-08-03 | 华为技术有限公司 | Method and device for establishing label switching path |
| CN102413034A (en) * | 2010-09-26 | 2012-04-11 | 杭州华三通信技术有限公司 | Method for controlling label notice message and maintaining LSP (Label Switching Path), and LSR (Label Switching Router) |
| CN102413034B (en) * | 2010-09-26 | 2014-06-25 | 杭州华三通信技术有限公司 | Method for controlling label notice message and maintaining LSP (Label Switching Path), and LSR (Label Switching Router) |
| US9843511B2 (en) | 2013-07-31 | 2017-12-12 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for selecting path from paths between label edge routers |
| WO2015013905A1 (en) * | 2013-07-31 | 2015-02-05 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for selecting path from paths between label edge routers |
| WO2016090950A1 (en) * | 2014-12-11 | 2016-06-16 | 中兴通讯股份有限公司 | Label request message control method and system and upstream and downstream label switching router |
| CN105743787A (en) * | 2014-12-11 | 2016-07-06 | 中兴通讯股份有限公司 | Control method and system of label request information, and upstream and downstream label switching routers |
| CN105743787B (en) * | 2014-12-11 | 2020-09-25 | 中兴通讯股份有限公司 | Control method and system for label request information and up-down cursor label exchange router |
| CN108848041A (en) * | 2018-06-07 | 2018-11-20 | 烽火通信科技股份有限公司 | Business transmitting method and system when LSP changes in MPLS network |
| CN108848041B (en) * | 2018-06-07 | 2022-01-04 | 烽火通信科技股份有限公司 | Service transmission method and system for LSP change in MPLS network |
| CN112217719A (en) * | 2019-07-12 | 2021-01-12 | 华为技术有限公司 | Data transmission method, network node and storage medium |
| WO2021008497A1 (en) * | 2019-07-12 | 2021-01-21 | 华为技术有限公司 | Data transmission method, network node, and storage medium |
| CN112217719B (en) * | 2019-07-12 | 2022-08-09 | 华为技术有限公司 | Data transmission method, network node and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| CN105049350B (en) | Utilize the method, apparatus and system of the Segment routing of the reciprocity engineering in outlet | |
| CN101371150B (en) | Dynamic protection against failure of a head-end node of one or more TE-LSPs | |
| US6721269B2 (en) | Apparatus and method for internet protocol flow ring protection switching | |
| CN103368843B (en) | The OAM label switched path of the quick heavy-route of protected label switched path | |
| CN101150587B (en) | A method, device and system for traffic switching of multi-protocol label switching traffic engineering | |
| US7180866B1 (en) | Rerouting in connection-oriented communication networks and communication systems | |
| CN100380330C (en) | Transparent re-routing of MPLS traffic engineering LSPs within a link bundle | |
| CN101741709B (en) | Method and system for establishing label switched path and network node | |
| CN101552715B (en) | Method and node for establishing backup label switching path | |
| CN102907051B (en) | Label switching path establishing method, data forwarding method and equipment | |
| CN103891220B (en) | The MPLS using LDP quickly re-routes method and the NE of (LDP-FRR) | |
| US20130336191A1 (en) | mRSVP-TE Based Fast Reroute in Detour (1:1) Protection Mode | |
| CN100527683C (en) | Failure protecting method and system | |
| CN101710877A (en) | Method, device and system for processing traffic flow based on pseudowire | |
| WO2008098451A1 (en) | Tunnel establishing method, network node device and network system | |
| Kini et al. | Fast recovery from dual-link or single-node failures in IP networks using tunneling | |
| CN1794715A (en) | Centralized control of multi protocol label switching (mpls) network | |
| CN101651630A (en) | Switching method and switching device based on link fault | |
| WO2008083590A1 (en) | Method and apparatus of rapid convergence of point-to-point service | |
| CN101610214A (en) | In multi-protocol label switching network, realize the method and the router of reliable transmission | |
| CN101771577A (en) | Method, system and equipment for establishing bidirectional forwarding detection (BFD) for bidirectional LSP | |
| CN104718732A (en) | Method for exchanging information for establishing a path between two nodes of a communication network | |
| Hariyawan | Comparison analysis of recovery mechanism at MPLS network | |
| CN103580904A (en) | Method and device for sending inter-domain fault information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20091223 |