| Network Working Group | Y. Weingarten |
| Internet-Draft | Nokia Siemens Networks |
| Intended status: Informational | S. Bryant |
| Expires: December 30, 2011 | Cisco |
| N. Sprecher | |
| Nokia Siemens Networks | |
| D. Ceccarelli | |
| D. Caviglia | |
| F. Fondelli | |
| Ericsson | |
| M. Corsi | |
| Altran | |
| B. Wu | |
| X. Dai | |
| ZTE Corporation | |
| June 28, 2011 |
MPLS-TP Ring Protection
draft-weingarten-mpls-tp-ring-protection-05.txt
This document presents an applicability statement to address the requirements for protection of ring topologies for Multi-Protocol Label Switching Transport Profile (MPLS-TP) Label Switched Paths (LSP) on multiple layers. The MPLS-TP Requirements document [TPReqs] specifies specific criteria for justification of dedicated protection mechanism for particular topologies, including optimizing the number of OAM entities needed, minimizing the number of labels for protection paths, minimizing the number of recovery elements in the network, and minimizing the number of control and management transactions necessary. The document proposes a methodology for ring protection based on existing MPLS-TP survivability mechanisms, specifically those defined in [LinProtect], without the need for specification of new constructs or protocols.
This document is a product of a joint Internet Engineering Task Force (IETF) / International Telecommunications Union Telecommunications Standardization Sector (ITU-T) effort to include an MPLS Transport Profile within the IETF MPLS and PWE3 architectures to support the capabilities and functionalities of a packet transport network as defined by the ITU-T.
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."
This Internet-Draft will expire on December 30, 2011.
Copyright (c) 2011 IETF Trust and the persons identified as the document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
Multi-Protocol Label Switching Transport Profile (MPLS-TP) is being standardized as part of a joint effort between the Internet Engineering Task Force (IETF) and the International Telecommunication Union Standardization (ITU-T). These specifications are based on the requirements that were generated from this joint effort.
The requirements for MPLS-TP [TPReqs] indicates a requirement to support a network that may include sub-networks that constitute a MPLS-TP ring as defined in the requirements. The requirements document does not identify any protection requirements specific to a ring topology. However, the requirements state that specific protection mechanisms aimed at ring topologies may be developed if these allow the network to optimize:
This document will propose a set of basic mechanisms that could be used for the protection of the data flows that traverse a MPLS-TP ring. The mechanism is based on existing MPLS and MPLS-TP protection mechanisms. We show that this mechanism provides the ability to protect all of the basic conditions within a reasonable time frame and does optimize the criteria set out in [TPReqs] as summarized above.
Ring topologies, as defined in [TPReqs], are used in transport networks due to their ability to easily support both p2p and p2mp transport paths. When designing a protection mechanism for a ring topology, there is a need to address both –
In either of these two situations, there is a need to address the following different cases –
The protection domain addressed in this document is limited to the traffic that is traversing the ring. Traffic on the transport path prior to the ring ingress node or beyond the egress nodes may be protected by some other mechanism.
The terminology used in this document is based on the terminology defined in the MPLS-TP framework documents:
In addition, we describe the use of the label stack in connection with the redirecting of data packets by the protection mechanism. The following syntax will be used to describe the contents of the label stack:
For example -
Akira Sakurai (NEC), Rolf Winter (NEC)
Classically there are two protection architecture mechanisms for ring topologies, based on SDH specifications [G.841], that have been proposed in various forums to perform recovery of a topological ring network – "wrapping" and "steering". The following sub-sections will examine these two mechanisms.
Wrapping is defined as a local protection architecture. This mechanism is local to the LSRs that are neighbors to the detected fault. When a fault is detected (either a link or node failure), the neighboring LSR can identify that the fault would prevent forwarding of the data along the data path. Therefore, in order to continue the data along the path, there is need to "wrap" all data traffic around the ring, on an alternate data path, until arriving at the LSR that is on the opposite side of the fault. When this LSR also detects that there is a fault condition on the LSP, it can identify that the data traffic that is arriving on the alternate (protecting) data path is intended for the "broken" LSP. Therefore, again taking a local decision, can wrap the data back onto the normal working path until the egress from the ring segment. Wrapping behavior is similar to MPLS-TE FRR as defined in [RFC4090] using either bypass or detour tunnels. It would be possible to wrap each LSP arounf the failed links via a detour tunnel using a different label for each LSP or to wrap all the LSPs using a bypass tunnel and a single label.
____
=========>/ LSR\
* \__B_/ *
* @@@@@@@# *
* @ @# *
___* @ @# *___
/LSR\ @ @#/LSR\
\_C_/ @ #\_A_/
* @ # *
* @ XX
_*_ @ #*_
/LSR\@ /LSR\
\_D_/@ @\_F_/
* @ @#*
* @ @@#*
* @@____@##*
*/ LSR\*
\__E_/========>
===> connected LSP *** physical link
### working path @@@ wrapped data path
In this figure we have a ring with a LSP that enters the ring at LSR-B and exits at LSR-E. The normal working path follows through B-A-F-E. If a fault is detected on the link A<—>F, then the wrapping mechanism decides that LSR-A would wrap the traffic around the ring, on a wrapped data path A-B-C-D-E-F, to arrive at LSR-F (on the far side of the failed link). LSR-F would then wrap the data packets back onto the working path F—>E to the egress node. In this protection scheme, the traffic will follow the path – B-A-B-C-D-E-F-E.
This protection scheme is simple in the sense that there is no need for coordination between the different LSR in the ring – only the LSRs that detect the fault must wrap the traffic, either onto the wrapped data path (at the near-end) or back to the working path (at the far-end). Coordination would only be needed to maintain co-routed bidirectional traffic even in cases of a unidirectional fault condition.
The following considerations should be taken into account when considering use of wrapping protection:
The second common scheme for ring protection, steering, takes advantage of the ring topology by defining two paths from the ingress point (to the ring) to the egress point going in opposite directions around the ring. This is illustrated in Figure 2, where if we assume that the traffic needs to enter the ring from node B and exit through node F, we could define a primary path through nodes B-A-F, and an alternate path through the nodes B-C-D-E-F. In steering the switching is always performed by the ingress node (node B in Figure 2). If a fault condition is detected anywhere on the working path (B-A-F), then the traffic would be redirected by B to the alternate path (i.e. B-C-D-E-F).
This mechanism bears similarities to linear 1:1 protection [SurvivFwk]. The two paths around the ring act as the working and protection paths. There is need to communicate to the ingress node the need to switch over to the protection path and there is a need to coordinate the switchover between the two end-points of the protected domain.
The following considerations must be taken into account regarding the steering architecture:
The MPLS-TP Framework document [TPFwk] defines a Sub-Path Maintenance Entity (SPME) construct that can be defined between any two LSRs of a MPLS-TP LSP. This SPME may be configured as a bidirectional co-routed path. While [TPFwk] explains the use of the SPME for management and monitoring of traffic, this construct may also be used to aggregate all LSP traffic that traverses the sub-path delineated by the SPME. An SPME may be monitored using the OAM mechanisms as specified in the MPLS-TP OAM Framework document [OAMFwk].
When defining a MPLS-TP ring as a protection domain, there is a need to design a protection mechanism that protects all the LSPs that cross the MPLS-TP ring. For this purpose, we associate a (working) SPME with the segment of the transport path that traverses the ring. In addition, we configure an alternate (protecting) SPME that traverses the ring in the opposite direction around the ring. The exact selection of the SPMEs is dependent on the type of transport path and protection that is being implemented and will be detailed in the following sub-sections.
Based on this architectural configuration for ring protection, it is possible to limit the number of alternate paths needed to protect the data traversing the ring. Similarly, we can minimize the number of OAM sessions needed to monitor the data traffic of the ring - by monitoring the SPMEs, rather than monitoring each individual LSP.
The following figure shows a MPLS-TP ring that is part of a larger MPLS-TP network. The ring could be used as a network segment that may be traversed by numerous LSPs. In particular, the figure shows that for all LSPs that connect to the ring at LSR-B and exit the ring from LSR-F, we configure two SPME through the ring (the first SPME traverses along B-A-F, and the second SPME traverses B-C-D-E-F).
____
=========>/ LSR\
* \__B_/ *
* @ # *
* @ # *
__* @ # *___
/LSR\ @ #/LSR\
\_C_/ @ #\_A_/
* @ # *
* @ #*
_*_ @ #*_
/LSR\@ /LSR\========>
\_D_/@ \_F_/
* @ @*
* @ @*
* @@____@@*
*/ LSR\*
\__E_/
===> connected LSP *** physical link
### primary SPME @@@ secondary SPME
In all of the following subsections, we use 1:1 linear protection [SurvivFwk] [LinProtect] to perform protection switching and coordination when a signal fault is detected. The actual configuration of the SPMEs used may change dependent upon the choice of methodology and this will be detailed in the following sections. However, in all of these configurations the mechanism will be to transmit the data traffic on the primary SPME, while using OAM functionality to detect signal fault conditions on either the primary or the secondary SPME. If a signal fault is detected on the primary SPME, then the mechanism described in [LinProtect] shall be used to coordinate a switch-over of data traffic to the secondary SPME.
Assuming that the SPME is implemented as an hierarchical LSP, packets that arrive at LSR-B with a label stack [L1] will have the SPME label pushed at LSR-B (i.e. the packet will arrive at LSR-A with a label stack of [PA(F)|L1], arrive at LSR-F with [PF(F)|L1]). The SPME label will be popped by LSR-F and the LSP label will be treated appropriately at LSR-F and forwarded along the LSP. This scenario is true for all LSP that are aggregated by this primary SPME.
A p2p SPME that traverses part of a ring has two Maintenance Entity Group End Points (MEPs), each one acts as the ingress and egress in one direction of the bidirectional SPME. Since the SPME is traversing a ring we can take advantage of another characteristic of a ring - there is always an alternative path between the two MEPs, i.e. traversing the ring in the opposite direction. This alternative SPME can be defined as the protection path for the working path that is configured as part of the LSP and defined as a SPME.
For each pair of SPMEs that are defined in this way, it is possible to verify the connectivity and continuity by applying the MPLS-TP OAM functionality to both the working and protection SPME. If a discontinuity or mis-connectivity is detected then the MEPs will become aware of this condition, and could perform a protection switch of all LSPs to the alternate, protection SPME.
This protection mechanism is identical to application of 1:1 linear protection[SurvivFwk] [LinProtect] to the pair of SPMEs. Under normal conditions, all LSP data traffic will be transmitted on the working SPME. If the linear protection is triggered, by either the OAM indication, an other fault indication trigger, or an operator command, then the MEPs will select the protection SPME to transmit all LSP data packets.
The protection SPME will continue to transmit the data packets until the stable recovery of the fault condition. Upon recovery, the ingress LSR could switch traffic back to the working SPME, if the protection domain is configured for revertive behavior.
The control of the protection switching, especially for cases of operator commands, would be covered by the protocol defined in [LinProtect].
It is possible to use the SPME mechanism to perform segment-based protection. For each link in the ring, we define two SPME - the first is a SPME between the two LSRs that are connected by the link, and the second SPME between these same two LSRs but traversing the entire ring (except the link that connects the LSRs). In Figure 3 we show the primary SPME that connects LSR-A & LSR-F over a segment connection, and the secondary SPME that connects these same LSRs by traversing the ring in the opposite direction.
____
/ LSR\
* \__B_/ *
* @ @ *
* @ @ *
__* @ @ *___
/LSR\ @ @/LSR\
\_C_/ @ \_A_/
* @ #*
* @ #*
_*_ @ #*_
/LSR\@ /LSR\
\_D_/@ \_F_/
* @ @*
* @ @*
* @@____@@*
*/ LSR\*
\__E_/
*** physical link
### primary SPME @@@ secondary SPME
By applying OAM monitoring of these two SPME (at each LSR), it is possible to affect a wrapping protection mechanism for the LSP traffic that traverses the ring. The LSR on either side of the segment would identify that there is a fault condition on the link and redirect all LSP traffic to the secondary SPME. The traffic would traverse the ring until arriving at the neighboring (relative to the segment) LSR. At this point, the LSP traffic would be redirected onto the original LSP, quite likely over the neighboring SPME.
Following the progression of the label stack through this switching operation:
Implementation of protection at the node level would be similar to the mechanism described in the previous sub-section. The difference would be in the SPMEs that are used. For node protection, the primary SPME would be configured between the two LSR that are connected to the node that is being protected (see SPME between LSR-A and LSR-E through LSR-F in Figure 4), and the secondary SPME would be configured between these same nodes, going around the ring (see secondary SPME in Figure 4).
____
/ LSR\
* \__B_/ *
* @ @ *
* @ @ *
__* @ @ *___
/LSR\ @ @/LSR\
\_C_/ @ \_A_/
* @ #*
* @ #*
_*_ @ #*_
/LSR\@ /LSR\
\_D_/@ \_F_/
* @ # *
* @ # *
* @@____ # *
*/ LSR\#*
\__E_/
*** physical link
### primary SPME @@@ secondary SPME
The protection mechanism would work similarly - based on 1:1 linear protection [SurvivFwk], triggered by OAM functions on both SPMEs, and wrapping the data packets onto the secondary SPME at the ingress MEP (e.g. LSR-A in the figure) of the SPME and back onto the continuation of the LSP at the egress MEP (e.g. LSR-E in the figure) of the SPME.
In the different types of wrapping presented in sections 2.3.2 and 2.3.3, there is a limitation that the protection mechanism must a priori decide whether it is protecting for link or node failure. In addition, the neighboring LSR, that detects the fault, cannot readily differentiate between a link failure or a node failure.
It is possible to combine the link protection mechanism presented in section 2.3.2 with the protection mechanism of section 2.3.3 to give more complete coverage. For each segment, we configure both a secondary link protection SPME as well as two secondary node protection SPME, i.e. one for each direction of the bidirectional segment SPME (see Figure 5). When a protection switch is triggered, the ingress LSR of the segment will examine the packet ring destination. Only if this destination is for the LSR connected to the "secondary link" SPME, then the packets will be wrapped onto this secondary SPME. For all other cases, the data packets will be wrapped onto the "secondary node" SPME. In all cases the egress LSR for the secondary SPME will wrap the data traffic back onto the working LSP/SPME.
____
/ LSR\
* \__B_/ *
* @+$ +@ *
* @+$ +@ *
__* @+$ +@ *___
/LSR\ @+$ +@/LSR\
\_C_/ @+$ \_A_/
* @+$ #*
* @+$ #*
_*_ @+$ #*_
/LSR\@+$ /LSR\
\_D_/@+$ \_F_/
* @+$ $+*
* @+$ $+*
* @++$+$+$+*
*/ LSR\*
\__E_/
*** physical link
### primary SPME @@@ secondary node#1 SPME
$$$ secondary node#2 SPME +++ secondary segment SPME
Analyzing the mechanisms described in the above subsections we can point to the following observations (based on a ring with N nodes):
[TPReqs] requires that ring protection must provide protection for unidirectional point-to-multipoint paths through the ring. Ring topologies provide a ready platform for supporting such data paths. A p2mp LSP in an MPLS-TP ring would be characterized by a single ingress LSR and multiple egress LSRs. The following sub-sections will present methods to address the protection of the ring-based sections of these LSP.
When protecting a p2mp ring data path using the wrapping architecture, the basic operation is similar to the description given, as the traffic has been wrapped back onto the normal working path on the far-side of the detected fault and will continue to be transported to all of the egress points.
It is possible to optimize the performance of the wrapping mechanism when applied to p2mp LSPs by exploiting the topology of ring networks.
This improved mechanism, which we call Ring Optimized Multicast Wrapping (ROM-Wrapping), behaves much the same as classical wrapping. There is one difference – rather than configuring the protection LSP between the end nodes of a failed link (link protection) or between the upstream and downstream node of a failed node (node protection), the improved mechanism configures a protection p2mp LSP from the upstream (with respect to the failure) node and all egress nodes (for the particular LSP) downstream from the failure.
Referring to Figure 6, it is possible to identify the protected (working) LSP (A-B-[C]-[D]-E-[F]) and one possible backup (protection) LSP. This protection LSP will be used to wrap the data back around the ring to protect against a failure on link B-C. This protection LSP is also a p2mp LSP that is configured with egress points (at nodes F, D, & C) complimentary to the broken working data path.
|
|
V Ingress
___ _V_ ___
/LSR\ /LSR\**************/LSR\
<@@\_F_/@@@@@@@@@@@@@\_A_/@@@@@@@@@@@@@@\_B_/
@ * *
@ * *
@ * XXXX Failure
@ * *
@_* ___ __*
/LSR\*************/LSR\**************/LSR\
\_E_/@@@@@@@@@@@@@\_D_/@@@@@@@@@@@@@@\_C_/
@ @
@ @
V V
*** working LSP @@@ protection LSP
Using this mechanism, there is a need to configure a particular protection LSP for each node on the working LSP. In the table below, "X's Backup" is the backup path activated by node X as a consequence of a failure affecting node Y (downstream node with respect to X) or link X-Y, and square brackets, in the path,indicate egress nodes.
Protected LSP: A–>B–>[C]–>[D]–>E–>[F]
—— LINK/NODE PROTECTION——
| A's Backup: | A–>[F]–>E–>[D]–>[C] |
| B's Backup: | B–>A–>[F]–>E–>[D]–>[C] |
| C's Backup: | C–>B–>A–>[F]–>E–>[D] |
| D's Backup: | D–>C–>B–>A–>[F] |
| E's Backup: | E–>D–>C–>B–>A–>[F] |
It should be noted that ROM-Wrapping is an LSP based protection mechanism, as opposed to the SPME based protection mechanisms that are presented in other sections of this draft. While this may seem to be limited in scope, the mechanism may be very efficient for many applications that are based on p2mp distribution schemes. While ROM-Wrapping can be applied to any network topology, it is particularly efficient for interconnected ring topologies.
It is possible to compare the Wrapping and the ROM-Wrapping mechanisms in different aspects, and show some improvements offered by ROM-Wrapping.
When configuring the protection LSP for Wrapping it is necessary to configure for a specific failure: link protection or node protection. If the protection method is configured to protect node failures but the actual failure affects a link, this could result in failing to deliver traffic to the node, when it should be possible to.
ROM-Wrapping however does not have this limitation, because there is no distinction between node and link protection. Whether link B-C or node C fails, in either case the rerouting will attempt to reach C. If the failure is on the link, the traffic will be delivered to C, while if the failure is at node C, the traffic will be rerouted correctly until node D, and will be blocked at this point. However, all egress nodes up-to the failure will be able to deliver the traffic properly.
A second aspect is the number of hops needed to properly deliver the traffic. Referring to the example shown in Figure 6, where a failure is detected on link B-C, the following table lists the set of nodes traversed by the data in the protection:
Basic Wrapping:
| A-B | B-A-F-E-D-C | [C]-[D]-E-[F] |
| "Upstream" segment with respect to the failure | backup path | "Downstream" segment with respect to the failure |
ROM Wrapping:
| A-B | B-A-[F]-E-[D]-[C] | .. |
| "Upstream" segment with respect to the failure | backup path |
Comparing the two lists of nodes, it is possible to see that in this particular case the number of hops crossed using the simple Wrapping is significantly higher than the number of hops crossed by the traffic when ROM-Wrapping is used. Generally, the number of hops for basic Wrapping is always higher or at least equal compared to ROM-Wrapping. This implies a certain waste of bandwidth on all links that are crossed in both directions.
Considering the ring network previously seen, it is possible to do some bandwidth utilization considerations. The protected LSP is set up from A to F clockwise and an M Mbps bandwidth is reserved along the path. All the protection LSPs are pre-provisioned counterclockwise, each of them may also have reserved bandwidth M. These LSPs share the same bandwidth in a SE (Shared Explicit) [RSVP] style.
The bandwidth reserved counterclockwise is not used when the protected LSP is properly working and could, in theory, be used for extra traffic [RFC4427]. However, it should be noted that [TPReqs] does not require support of such extra traffic.
The two recovery mechanism require different protection bandwidths. In the case of Wrapping, the bandwidth used is M in both directions of many of the links. While in case of ROM-Wrapping, only the links from the ingress node to the node performing the actual wrapping utilize M bandwidth in both directions, while all other links utilize M bandwidth only in the counterclockwise direction.
Consider the case of a failure detected on link B-C as shown in Figure 6. The following table lists the bandwidth utilization on each link (in units equal to M), for each recovery mechanism and for each direction (CW=clockwise, CCW=counterclockwise).
| Wrapping | ROM-Wrapping | |
|---|---|---|
| Link A-B | CW+CCW | CW+CCW |
| Link A-F | CCW | CCW |
| Link F-E | CW+CCW | CCW |
| Link E-D | CW+CCW | CCW |
| Link D-C | CW+CCW | CCW |
A further comparison between Wrapping and ROM-Wrapping can be done with respect to their ability to react to multiple failures. The wrapping recovery mechanism does not have the ability to recover from multiple failures on a ring network, while ROM-Wrapping is able to recover, from some multiple failures.
Consider, for example, a double link failure affecting links B-C and C-D shown in Figure 6. The Wrapping mechanism is not able to recover from the failure because B, upon detecting the failure, has no alternative paths to reach C. The whole P2MP traffic is lost. The ROM-Wrapping mechanism is able to partially recover from the failure, because the backup P2MP LSP to node F and node D is correctly set up and continues delivering traffic.
When protecting p2mp traffic that uses a MPLS-TP ring as its branching point, i.e. it enters the ring at a head-end node and exits the ring at multiple nodes, we can employ a steering mechanism based on 1+1 linear protection [SurvivFwk]. We can configure two p2mp unidirectional SPME from each node on the ring that traverse the ring in both directions. These SPME will be configured with an egress at each ring node. In order to be able to properly direct the LSP traffic to the proper egress point for that particular LSP, we need to employ context labeling as defined in [RFC5331]. The method for using these labels is expanded in section 3.2.1.
For every LSP that enters the ring at a given node the traffic will be sent through one of these SPME (the working SPME). In case there is a failure condition, the traffic is transmitted on both SPME, each with its own context label and the context-specific label for the particular LSP. In this way, all egress nodes are able to receive the data traffic. While each node detects that there is connectivity from the ingress point, it continues to select the data that is coming from the working SPME. If a particular node stops receiving the connectivity messages from the working SPME, it identifies that it must switch its selector to read the data packets from the protection SPME.
^ ^ ^
_|_ _|_ _|_
----->/LSR\********/LSR\********/LSR\
\_A_/========\_B_/========\_C_/
+* <+++++++++*||
+* +*||
+* +*||
+* +*||
+*_ ++++++++ ___ +++++++++*||
/LSR\********/LSR\********/LSR\
\_F_/<=======\_E_/========\_D_/
| | |
V V V
---> connected LSP *** physical link
=== working SPME +++ protection SPME
Figure 7 shows the two unidirectional p2mp SPME that are configured from LSR-A with egress points at all of the nodes on the ring. The clockwise SPME (i.e. A-B-C-D-E-F) is configured as the working SPME, that will aggregate all traffic for p2mp LSPs that enter the ring at LSR-A and must be sent out of the ring at any subset of the ring nodes. The counter-clockwise SPME (i.e. A-F-E-D-C-B) is configured as the protection SPME.
[RFC5331] defines the concept of context labels. A context-identifying label defines a context label space that is used to interpret the context-specific labels (found directly below the context- identifying label) for a specific tunnel. The SPME label is a context- identifying label. This means that at each hop the node that receives the SPME label uses it to point not directly to a forwarding table, but to a LIB. As a node receives an SPME label it examines it, discovers that it is a context label, pops off the SPME label, and looks up the next label down in the stack in the LIB indicated by the context label.
The label below this context-identifying label should be used by the forwarding function of the node to decide the actions taken for this packet. In MPLS-TP ring protection there are two context LIBs. One is the context LIB for the working SPME and the other is the context LIB for the P-SPME. All context LIBs have a behavior defined for the e2e LSP label but the behavior at each node may be different in the context of each SPME.
For example, using the ring that is shown in Figure 7, if the working SPME is configured to have a context-identifying label of CW at each node on the ring and the protection SPME is configured to have a context-identifying label of CP at each node. For the specific LSP we will designate the context-specific label used on the working SPME as WL(x-y) to be the label used as node-x to forward the packet to node-y. Similarly, for the context-specific labels on the protection SPME would be designated PL(x-y). An explicit example of label values appears in the next sub-section.
If we apply the 1+1 linear protection scheme outlined above for an p2mp LSP that enters the ring at LSR-A and has egress points from the ring at LSR-C and LSR-E using the two SPME shown in Figure 7 then a packet that arrives at LSR-A with a label stack [LI+S] will be forwarded on the working SPME with a label stack [CW | WL(A-B)]. The packet should then be forwarded to LSR-C arriving with a label [CW | WL(B-C)], where WL(B-C) should instruct the forwarding function to egress the packet with [LE(C)] and forward a copy to LSR-D with label stack [CW | WL(C-D)].
If a fault condition is detected, then some of the nodes will cease to receive the packets from the clockwise (working) SPME. These LSR should then begin to switch their selector bridge to accept the data packets from the protection SPME. At the ingress point the packet will be transmitted on both the working SPME and the protection SPME. Continuing the example, if there is a failure on the link between LSR-C and LSR-D then LSR-A will transmit one copy of the data to LSR-B with stack [CW | WL(A-B)] and one copy to LSR-F with stack [CP | PL(A-F)]. The packet will arrive at LSR-C from the working SPME and egress from the ring. LSR-E will receive the packet from the protection SPME with stack [CP | PL(F-E)] and the context-sensitive label PL(F-E) will instruct the forwarding function to send a copy out of the ring with label LE(E) and a second copy to LSR-D with stack [CP | PL(E-D)]. In this way each of the egress points receive the packet from the SPME that is available at that point.
This architecture has the added advantages that there is no need for the ingress node to identify the existence of the mis-connectivity, and there is no need for a return path from the egress points to the ingress.
In order to better demonstrate the use of the context labels we present a walkthrough of an example application of the p2mp protection presented in this section. Referring to Figure 8, there is a p2mp LSP that traverses the ring, entering the ring at LSR-B and branching off at LSR-D, LSR-E, and LSR-H and does not continue beyond LSR-H. For purposes of protection two p2mp unidirectional SPME are configured on the ring starting from LSR-B. One of the SPME, the working SPME, is configured with egress points at each of the LSR - C, D, E, F, G, H, J, K, A. The second SPME, the protection SPME, is configured with egress points at each of the LSR - A, K, J, H, G, F, E, D, C.
^ ^ ^ ^ ^
_|_ xxxxxxxxx_|_ xxxxxxxxxX|_xxxxxxxxxX|_ xxxxxxxx_|_
xxxxx>/LSR\********/LSR\********/LSR\*******/LSR\*******/LSR\
\_B_/========\_C_/========\_D_/=======\_E_/=======\_F_/
*+ <+++++++++ +++++++ ++++++++*||x
*+ +*||x
*+ +*||x
*+ +*||x
_*++++++++++ ___ +++++++++___ ++++++++___+++++++++*||x
/LSR\********/LSR\********/LSR\*******/LSR\*******/LSR\
\_A_/<=======\_K_/========\_J_/=======\_H_/=======\_G_/
| | | |Xxxxxxxxxx |
V V V V V
xxx p2mp LSP (X LSP egress) *** physical link
=== working SPME +++ protection SPME
For this example we suppose that the LSP traffic enters the ring at LSR-B with the label stack [99], leaves the ring at LSR-D with stack [199], at LSR-E with stack [299], and LSR-H with stack [399].
While it is possible for the context-identifying label for the SPME be configured as a different value at each LSR, for the sake of this example we will suppose a configuration of 200 as the context-identifying label for the working SPME at each of the LSR in the ring, and 400 as the context-identifying label for the protection SPME at each LSR.
For the specific connected LSP we configure the following context-specific labels for each context:
| node | W-context(200) | P-context(400) |
|---|---|---|
| A | 65 {drop packet} | 165 {fwrd w/[400|190]} |
| C | 90 {fwrd w/[200|80]} | 190 {drop packet} |
| D | 80 {fwrd w/[200|75] + egress w/[199]} | 180 {egress w/[199]} |
| E | 75 {fwrd w/[200|65] + egress w/[299]} | 175 {fwrd w/[400|180] + egress w/[299]} |
| F | 65 {fwrd w/[200|55]} | 165 {fwrd w/[400|175]} |
| G | 55 {fwrd w/[200|45]} | 155 {fwrd w/[400|165]} |
| H | 45 {egress w/[399]} | 145 {fwrd w/[400|155] + egress w/[399]} |
| J | 65 {drop packet} | 165 {fwrd w/[400|145]} |
| K | 65 {drop packet} | 190 {fwrd w/[400|165]} |
When a packet arrives on the LSP to LSR-B with stack [99], the forwarding function determines that it is necessary to forward the packet to both the working SPME with stack [200|90] and the protection SPME with stack [400|165]. Each LSR on the SPME will identify the top label, i.e. 200 or 400, to be the context-identifying label and use the next label in the stack to select the forwarding action from the specific context table.
Therefore, at LSR-C the packet on the working SPME will arrive with stack [200|90] and the 200 will point to the table in the middle column above. After popping the 200 the next label, i.e. 90, will select the forwarding action "fwrd w/[200|80]" and the packet will be forwarded to LSR-D with stack [200|80]. In this manner, the packet will be forwarded along both SPME according to the configured behavior in the context tables. However, the egress points at LSR D, E, & H, will all be configured with a selector bridge to only use the input from the working SPME. If any of these egress points identify that there is a connection fault on the working SPME, then the selector bridge will cause the LSR to read the input from the protection SPME.
The Survivability Framework [SurvivFwk] indicates that there is a need to coordinate protection switching between the end-points of a protected bidirectional domain. The coordination is necessary for particular cases, in order to maintain the co-routed nature of the bidirectional transport path. The particular cases where this becomes necessary include cases of unidirectional fault detection and use of operator commands.
By using the same mechanisms defined in [LinProtect], for linear protection, to apply for ring protection we are able to gain a consistent solution for this coordination between the end-points of the protection domain. The Protection State Coordination Protocol that is specified in [LinProtect] provides coverage for all the coordination cases, including support for operator commands, e.g. Forced-Switch.
The Requirements document [TPReqs] states that the ring protection must support a single ring that may be interconnected to other rings. In addition, traffic that traverses a number of rings within a network of interconnected rings must be protected even if the interconnection nodes and links fail.
When interconnecting rings in a network there are three common interconnection schemes:
The protection schemes presented in Section 2 are capable of protecting each interconnected ring as a separate entity independent of the other rings in the network. This protects the traffic that traverses the entire network, as each ring will continue to transfer the traffic to the interconnection points, and from there to the next ring.
When the interconnection nodes or links fail, there is the need to protect these connection points. Therefore, it should be noted that in the case of single-node interconnect the interconnection node (LSR-A in Figure 10) is a single-point of failure and such an interconnection scheme should be avoided. In the case of the dual-node interconnect scheme in Figure 9, the connection point over LSR-A<—>LSR-6 and LSR-F<—>LSR-5 could use basic linear protection as defined in [SurvivFwk] and [LinProtect] .
For a chain of interconnected rings, as shown in Figure 11 it is possible to configure the ring protection for each ring separately. However, this would need to be augmented by some form of end-to-end protection in order to provide protection of the shared link and the interconnection nodes (LSR-A & LSR-F in the figure). This is dependent upon the exact requirements of the operator and the specific type of protection that is desired.
___ ___ ___ ___ ___ ___
/LSR\******/LSR\******/LSR\xxxx/LSR\*****/LSR\******/LSR\
\_C_/ \_B_/ \_A_/ \_6_/ \_1_/ \_2_/
* * * *
* Ring #1 * * Ring #2 *
_*_ ___ _*_ _*_ ___ _*_
/LSR\ /LSR\ /LSR\ /LSR\ /LSR\ /LSR\
\_D_/******\_E_/******\_F_/xxxx\_5_/*****\_4_/******\_3_/
*** physical link
xxx interconnection link
___ ___ ___ ___
/LSR\**********/LSR\ /LSR\*********/LSR\
\_C_/ \_B_/* *\_1_/ \_2_/
* * * *
* * * *
* * * *
_*_ * ___ * _*_
/LSR\ Ring #1 /LSR\ Ring #2 /LSR\
\_D_/ *\_A_/* \_3_/
* * * *
* * * *
* * * *
_*_ ___* *___ _*_
/LSR\ /LSR\ /LSR\ /LSR\
\_E_/***********\_F_/ \_5_/**********\_4_/
*** physical link
___ ___ ___ ___ ___
/LSR\******/LSR\******/LSR\*****/LSR\******/LSR\
\_C_/ \_B_/ \_A_/ \_1_/ \_2_/
* x *
* Ring #1 x Ring #2 *
_*_ ___ _x_ ___ _*_
/LSR\ /LSR\ /LSR\ /LSR\ /LSR\
\_D_/******\_E_/******\_F_/*****\_4_/******\_3_/
*** physical link
xxx shared link
Ring topologies are prevelant in traditional transport networks and will continue to be used for various reasons. Protection for transport paths that traverse a ring within a MPLS network can be provided by applying an appropriate instance of linear protection, as defined in [SurvivFwk]. This document has shown that for each of the traditional ring protection architectures there is an application of linear protection that provides efficient coverage, based on the use of the Sub-Path Maintenance Entity (SPME), defined in [TPFwk] and [OAMFwk]. For example,
It has been shown that this set of protection architecture and mechanisms are optimized based on the criteria defined in [TPReqs] for justification of designing a specific protection mechanism for a ring topology. This thereby aleviates the necessity to create a new mechanism or protocol to support the protection of ring topologies.
By basing the simple p2p ring protection on basic 1:1 linear protection there is a very efficient way of implementing Steering protection for the sections of a transport path that traverses the ring. Steering should be the preferred mechanism for ring protection since it reduces the extra bandwidth required when traffic doubles through wrapped protection, and the ability to protect both against link and node failures without complicating the fault detection or the need to configure multiple protection paths. While this is true, the possiblity remains to support either mechanism while depending upon the OAM functionality [outlined in [OAMFwk] and specified in various documents] and the coordination protocol specified for linear protection in [LinProtect].
This document makes no request of IANA.
Note to RFC Editor: this section may be removed on publication as an RFC.
To be added in future version.
The authors would like to thank all members of the teams (the Joint Working Team, the MPLS Interoperability Design Team in IETF and the T-MPLS Ad Hoc Group in ITU-T) involved in the definition and specification of MPLS Transport Profile.