WO2010145070A1 - Method, device and system for establishing backup label switched path - Google Patents

Abstract

The embodiment of the present invention discloses a method, a device and a system for establishing a backup Label Switched Path (LSP). The method includes: acquiring path information; performing selection for the backup LSP according to the path information; if a non-optimal path without loop path is selected, using the non-optimal path without a loop path as the backup LSP. The present invention binds the main LSP with the backup LSP and implements that the network negotiates generation of backup LSP by itself.

Description

 Method, device and system for establishing exchanges

 The present invention relates to the field of communication wood, and particularly relates to a method, device and system for establishing a Labe Swtched Path (LSP). Background

 Multi-switch (Ult-Protoco Labe Swtchng, MPLS) supports multiple and connection-oriented, and has good scalability, enabling MPLS/P in the system.

 The customer offers a variety of possibilities. Looking at MPLS's increasingly large-scale wood, (abe DstribUtion Protoco, LDP) is developed for MPLS, and is also subject to households.

 LDP is the control of MPLS, which is related to the signaling, the allocation of orthopaedic Equvaence Cass (FEC), and the establishment of LSPs. LSPs established using LDP, including LDPLSP (seudoWre, ).

 Establishing an LSP, the LDP can establish the LSP LDP measurement system based on the P and P, or the specified path of the P, and the LDP is in the middle and phase information. After receiving the information, the LSP generated by the security does not have a forest.

 Fast ( ast Re-Route, FRR) is a sacred strategy that can be switched on or off, or quickly disabled to minimize loss. P FRR is the flow of P from P, that is, P is generated by the generation of enemies and phases, so that P traffic can be switched to each other.

In this example, the establishment of each LSP in a fixed defect in the existing wood may be configured by specifying each direction, and each P by the P FRR algorithm to establish each LSP. The former has a large workload and is also a troublesome algorithm. The solution is not yet mature. content

 The method, device and system for establishing each LSP are provided to generate each LSP and sheep.

 This section provides methods for establishing each LSP, including

 Lai to the information

 Lost to the information line LSP

 If there is no road to Lin Road, there will be no LSPs for the non-forest roads.

 This provides the establishment of each LSP, including

 Lai, the past information

 , Yu Gen lost to the information line LSP

 If there is no road to the forest road, there will be no LSPs for the non-forest roads.

 This section provides the establishment of each LSP, including the switching routers, the past information, and the LSPs that go to the information line. If there is no road to the road, there will be no non-competition for the roads. The LSP can be obtained from the Shangmu scheme. The information in the information can be used in the information. The LSPs on the primary LSP are generated by the LSPs on the primary LSP. to. Description

 To explain more clearly the wood scheme in this or existing wood, the following will introduce the sheep that need to be used in the existing wood, and the easy ones, the following are the ones, the ordinary wood in the field, without paying for the work. Under the premise, you can get other.

 The flow chart of the method for establishing each LSP provided by Liben

2A force provides the downstream of each LSP LSR indication

 The flow chart of the method for establishing each LSP provided by 2B is used.

 The method of establishing each LSP provided by 3A is used.

 The flow chart of the method for establishing each LSP provided by 3B is used.

 4 Schematic diagram of the establishment of each LSP provided by Liben

 5 Schematic diagram of the establishment of each LSP provided by Liben

 6 The establishment of each LSP provided by Liben.

 Hugh way

 The following is a combination of the wood schemes in this section, which are clear, complete, and true, but not all of them. In the present invention, all other common woods in this field are not guaranteed to be made.

 In this case, LD RR LD SP MPLS traffic, that is, LDP generates LSPs and phase LSPs, so that LSPs can be blocked, and MPLS traffic can be switched to LSPs.

 The flow chart of the method for establishing each LSP provided by the present invention shows that the method for establishing each LSP may include the following steps.

 Step 101, going to the information

 Step 102, getting lost to the information line LSP

 Step 3. When there is no road to Lin Road, there will be no LSPs on the roads without forest roads.

 The information in this book can be information,

Information can contain past information. The path information includes the information of the switching router (abe SwtchedRouter LSR), for example, the LSR (LSR D), and the LSR of the LSR that is included in the information. Example The route information to the LSR LSR2 LSR3 can be expressed as (LSR, LSR2, LSR).

In this case, the information of the upstream LSR to the downstream LSR can be To the information, there is no LSP for the non-competition of the forest road, but the LSPs of the primary LSP can be determined, and each LSP is generated.

 2A is the indication of the multiple downstream LSRs used in the establishment of each LSP. In the upstream LSR LSRA of the LSRB, the LSRB has 5 downstream LSRs, namely LSRC and LSRD, but the downstream LSR of the LSRC is also LSRD, then LSRB to LSRD The road has, LSRB LSRC LSRD, another

 LSRB LSRD. Upward, according to P, can be LSRB LSRD.

 2B shows the flow chart of the method for establishing each LSP. As shown in 2B, the method for establishing each LSP may include

 201 LSRB respectively, the downstream LSR, that is, the information of LSRC and LSRD. The information of LSRC includes the direction information (LSRC, LSRD). The information of the LSRD includes the route information (LSRD). This step can be used ( abe DstribUtionProtoco , LDP) 5 function, mapping information on the message, where the destination LSRD

 202 LSRB's upstream information line LSP's

 203. If the LSRB does not have a forest path to the LSRB LSRC LSRD, then there is no 0 LSRB LSRC LSRD with no forest path to force each LSP.

 In this step, there is no path to the LSRB LSRD and the LSRB LSRC LSRD of the information (LSRC, LSRD) to the information (LSR). Due to the LSRB LSRD force primary LSP to the information (LSRD), the LSRB to the information (LSRC, LSRD) and (LSRD) to the information (LSRC, 5 LSR) are not LSRB LSRC LSRD LSPs

 204 LSRB LSP on the primary LSP

In this example, the information of the upstream LSRB in the middle-to-downstream LSRC and the downstream LSRD can be included in the information. There is no LSP, LSRB to the information. The LSP (LSRD) is the LSP of the LSRB LSRD to the LSRC LSRD. The LSP is the LSRB LSRC LSRD. The LSP is the LSP, and the LSRB switches the traffic to each LSP.

 Step, the LSRB can be used to forward the information to the upstream LSR, that is, LSRA,

 205A LSRB forwards the incoming information (LSRB, LSRD) to the upstream LSRA or

 205B LSRB will forward non-route information (LSRB, LSRC, LSRD) to LSRA or

 The 205C LSRB forwards the information of the incoming route (LSRB, LSRD) to the upstream LSR, and the non-information of the non-route information (LSRB, LSRC, LSRD) to the upstream LSRA.

 It should be noted that the path information of the LSRC to the LSRB does not have other downstream LSRs under the LSRC. If the LSR has other downstream LSRs, the LSRC information may contain more information. For the rest, you can refer to the information about the way to the LSRA by the LSRB. This is no longer the case.

 The LSRE has a downstream LSR, that is, LSRH and LSRF, LSRF downstream LSR LSRG, LSRG downstream LSR LSRH, LSRE to LSRH, LSRE LSRF LSRG LSRH , another

LSRE LSRH. Up and down, according to P, can be LSRE LSRH.

 The flow chart of the method for establishing each LSP provided by the 3B is provided, and as shown in FIG. 3B, the method for establishing each LSP may include

301 LSRE is the downstream LSR, that is, the information of LSRH and LSRF. The information of LSRH includes the direction information (LSRH), and the information of LSRF contains the information (LSRF, LSRE, LSRH) and (LSRF, LSRG, LSRH)

 In this step, you can use the function of the LDP command to map the information on the message, where the destination LSRH

 302 LSRE's upstream information line LSP's

 303. The LSRE LSRF LSRG LSRH with no lining path to the LSRE (LSRF, LSRG, LSRH), and the LSRE LSRF LSRG LSRH without the forest path to the LSP

 In this step, there is a non-destination LSRE to the LSRE LSRH and the forward information (LSRF, LSRG, LSRH) of the information (LSRF, LSRE, LSRH) to the LSRE LSRF LSRE LSRH. There is no path in the LSRF LSRG LSRH, and the route information (SR) to the LSRE LSRH force primary LSP, so the LSRE to information (LSRH) (LSRF, LSRE, LSRH) and (LSRF, LSRG, LSRH) to the information (LSR, LSRG LSRH) Non-destination LSRE LSRF LSRG LSRH LSPs

 304 LSRE primary LSP LSP

 In this example, the information of the upstream LSRE in the middle-to-downstream LSRF and the downstream LSRH may be the LSPs in the information that are included in the information, and the LSPs of the LSRH downstream information (LSR) of the LSRE downstream. The LSPs of the LSRE LSRH information (LSRF, LSRG, and LSRH) are LSRE LSRF LSRG LSRH. The LDP FRR is the LSP barrier. The LSRE switches traffic to each LSP and generates LSPs.

 It should be noted that the LSRF to LSRE information does not have other downstream LSRs under LSRF. If the LSR has other downstream LSRs, the LSRF information may contain more information. For the rest, you can refer to the information of the way to the LSRA by the upper and middle LSRBs. This is no longer the case.

Step, the rabbit has a forest, the LSRE LSP in the After the LSP, the LSRs on each LSP can be advertised. The LSRE can forward the LSPs (LSRF, LSRG, LSRH) to the LSRF and LSRG so that the LSRF does not receive the LSRE. Until the LSRE LSRG does not receive the LSRF to the LSRF, and the rabbit has a path, improving performance.

 What is needed is the previous method, the sheep, the combination of the columns, but the field is not limited by the order, because some steps can be in other order or the same. Secondly, the wood in the field is also known,

Yes, the involved and the indefinite are necessary.

 In the above, each has its own focus, and there is no part in it, which can be other phases.

 For example, as shown in FIG. 4, the LSP establishment means of the present LSP may include 41, 42, and 43. Among them, 41 to the information, 42 lost to the LSP of the information line, if 42 to the non-forest road to the future, then the 42 to the non-forest road to the non-going LSP

 The method of this, the LSRB and this

 The functions of the LSRE can be set by the LSPs provided by this LSP.

 The information of the road to the 41 can be information, and the information can include the information. The route information may include information of the LSR, such as LSR (LSR D), and the LSR of the LSR that is included in the information. The way to LSR LSR2 LSR3 can be expressed as (LSR, LSR2, LSR3).

 In this, the past information, if

 The road to the information to the non-forest road to the future, there will be no lining roads to the non-competition LSP, the most recent step can be

Each LSP on the primary LSP is generated, and each LSP is generated. Yu.

 5 shows that the LSP establishment device provided by Liben is shown in FIG. 5, and the LSP establishment device of the present invention can be similarly included.

 Hugh can be used to route information about the enemy to the upstream LSR or

 Hugh can be used to forward non-route information to the upstream LSR or

 Hugh can be used to route information about enemies to upstream LSRs, and to non-information of non-information to upstream LSRs.

 Step, the rabbit has a forest, the book or this

 The establishment of each LSP may include an announcement (not in the middle), and all the LSRs on each LSP are advertised, and the rabbits appear to have a path, and the performance is improved.

 6 The establishment of each LSP provided by the force, 6, the establishment of each LSP may include the LSR 61, the past information, lost to the LSP of the information line, if there is no road to the forest, There will be no non-competition LSPs for Lin Road

 The method of this, the LSRB and this

 The function of the LSRE can be established by the LSR 61 and LSR 61 in the establishment of each LSP provided by the present LSP.

 The road information of the LSR 61 in this book can be information, and the information can include the past information. The route information may include information of the LSR, for example, LSR (LSR[D), LSR included in the information [D

Up the LSR. The way to the LSR LSR2 LSR3 can be expressed as (LSR, LSR2, LSR3).

In this case, if the LSR arrives at the information, if the road information goes to the non-forest road, there will be no LSPs for the non-going roads, and the LSPs on the primary LSP can be determined in the near future. Go Generate each LSP, sheep.

 It should be noted that the upper LSP may include but is not limited to an LDP LSP.

 Ordinary wood in the art can understand that all or part of the steps of the method can be completed by the hardware of the program instruction phase, the former program can be stored in the storable, the program is executed, and the execution includes the steps of the method, and the storage includes the ROM RAM and the magnetic Discs or other gods can store programs.

 The last block illustrates the above-mentioned wood scheme for explaining this, and instead of referring to the previous description, the ordinary wood understanding in the field can still be repaired by the previous wood schemes, or some of the woods are replaced or repaired. No phase

Claims

Claim  And the method of establishing each exchange, which is characterized by  Lai to the information  Lost to the information line, exchanged  When there is no road to Lin Road, there will be no exchange of non-communication roads.  2. The method described is characterized in that the information includes the function utilized, and the mapping message  Information, information contains road information.  3. The method as claimed, characterized in that the lost information includes the downstream information of the downstream switching router or  Downstream switching routers' non-directional information or  Downstream switching routers' information to and from information, as well as non-information to non-information.  4. The method of claim 3, wherein the method comprises: routing the information of the enemies to the upstream switching router or  Forward non-route information to the upstream switch router or  The exchange of information to the upstream exchange routers and the non-information of non-information to the upstream exchange routers.  5. The method of requesting 2, 3 or 4, which is characterized in that the non-communication of the roads without Lin Road are exchanged, including 6. The device for establishing each exchange, which is characterized in that it includes  Lai, the past information  , Yu Gen lost to the information line to exchange , as described above, there is no road to Lin Road. 7. The device of claim 6, characterized in that, the function of rest, the mapping message  Information, information contains road information.  8. The apparatus of claim 6 wherein the apparatus includes, for example, routing information to the upstream exchange router or  It exchanges the forward route information to the upstream switch router or exchanges the information of the incoming route to the upstream switch router, and forwards the non-information route to the upstream switch router.  9. A device requiring 6, 7, or 8, characterized in that it includes a notification, and the information to be exchanged to each switching exchange router.  1 0. The establishment of each exchange, including the exchange of routers, the past information, the lost to the information lines, and the non-forest roads, there will be no non-forest roads. Switch to each other.  The system requires 10, the special feature is that the switching router has the function of rest, the message information is included, the information includes the information of the road, and the information is exchanged to the information line, if there is no road to the forest. Not going,