idnits 2.17.1 draft-ietf-rtgwg-segment-routing-ti-lfa-05.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- No issues found here. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year -- The document date (November 15, 2020) is 806 days in the past. Is this intentional? Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) == Missing Reference: 'Adjacency' is mentioned on line 576, but not defined == Missing Reference: 'Node' is mentioned on line 576, but not defined == Unused Reference: 'I-D.ietf-spring-srv6-network-programming' is defined on line 1043, but no explicit reference was found in the text == Outdated reference: draft-ietf-spring-srv6-network-programming has been published as RFC 8986 == Outdated reference: A later version (-14) exists of draft-bashandy-rtgwg-segment-routing-uloop-09 == Outdated reference: A later version (-26) exists of draft-ietf-lsr-flex-algo-13 == Outdated reference: draft-ietf-spring-segment-routing-policy has been published as RFC 9256 Summary: 0 errors (**), 0 flaws (~~), 8 warnings (==), 1 comment (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Network Working Group S. Litkowski 3 Internet-Draft Cisco Systems 4 Intended status: Standards Track A. Bashandy 5 Expires: May 19, 2021 Individual 6 C. Filsfils 7 Cisco Systems 8 B. Decraene 9 Orange 10 D. Voyer 11 Bell Canada 12 November 15, 2020 14 Topology Independent Fast Reroute using Segment Routing 15 draft-ietf-rtgwg-segment-routing-ti-lfa-05 17 Abstract 19 This document presents Topology Independent Loop-free Alternate Fast 20 Re-route (TI-LFA), aimed at providing protection of node and 21 adjacency segments within the Segment Routing (SR) framework. This 22 Fast Re-route (FRR) behavior builds on proven IP-FRR concepts being 23 LFAs, remote LFAs (RLFA), and remote LFAs with directed forwarding 24 (DLFA). It extends these concepts to provide guaranteed coverage in 25 any IGP network. A key aspect of TI-LFA is the FRR path selection 26 approach establishing protection over the expected post-convergence 27 paths from the point of local repair, dramatically reducing the 28 operational need to control the tie-breaks among various FRR options. 30 Status of This Memo 32 This Internet-Draft is submitted in full conformance with the 33 provisions of BCP 78 and BCP 79. 35 Internet-Drafts are working documents of the Internet Engineering 36 Task Force (IETF). Note that other groups may also distribute 37 working documents as Internet-Drafts. The list of current Internet- 38 Drafts is at https://datatracker.ietf.org/drafts/current/. 40 Internet-Drafts are draft documents valid for a maximum of six months 41 and may be updated, replaced, or obsoleted by other documents at any 42 time. It is inappropriate to use Internet-Drafts as reference 43 material or to cite them other than as "work in progress." 45 This Internet-Draft will expire on May 19, 2021. 47 Copyright Notice 49 Copyright (c) 2020 IETF Trust and the persons identified as the 50 document authors. All rights reserved. 52 This document is subject to BCP 78 and the IETF Trust's Legal 53 Provisions Relating to IETF Documents 54 (https://trustee.ietf.org/license-info) in effect on the date of 55 publication of this document. Please review these documents 56 carefully, as they describe your rights and restrictions with respect 57 to this document. Code Components extracted from this document must 58 include Simplified BSD License text as described in Section 4.e of 59 the Trust Legal Provisions and are provided without warranty as 60 described in the Simplified BSD License. 62 Table of Contents 64 1. Acronyms . . . . . . . . . . . . . . . . . . . . . . . . . . 3 65 2. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3 66 2.1. Conventions used in this document . . . . . . . . . . . . 8 67 3. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 8 68 4. Intersecting P-Space and Q-Space with post-convergence paths 9 69 4.1. P-Space property computation for a resource X . . . . . . 9 70 4.2. Q-Space property computation for a link S-F, over post- 71 convergence paths . . . . . . . . . . . . . . . . . . . . 9 72 4.3. Q-Space property computation for a set of links adjacent 73 to S, over post-convergence paths . . . . . . . . . . . 9 74 4.4. Q-Space property computation for a node F, over post- 75 convergence paths . . . . . . . . . . . . . . . . . . . . 10 76 4.5. Scaling considerations when computing Q-Space . . . . . . 10 77 5. TI-LFA Repair path . . . . . . . . . . . . . . . . . . . . . 10 78 5.1. FRR path using a direct neighbor . . . . . . . . . . . . 10 79 5.2. FRR path using a PQ node . . . . . . . . . . . . . . . . 11 80 5.3. FRR path using a P node and Q node that are adjacent . . 11 81 5.4. Connecting distant P and Q nodes along post-convergence 82 paths . . . . . . . . . . . . . . . . . . . . . . . . . . 11 83 6. Building TI-LFA repair lists . . . . . . . . . . . . . . . . 11 84 6.1. Link protection . . . . . . . . . . . . . . . . . . . . . 11 85 6.1.1. The active segment is a node segment . . . . . . . . 11 86 6.1.2. The active segment is an adjacency segment . . . . . 12 87 6.2. Protecting SR policy midpoints against node failure . . . 13 88 6.2.1. Protecting {F, T, D} or {S->F, T, D} . . . . . . . . 13 89 6.2.2. Protecting {F, F->T, D} or {S->F, F->T, D} . . . . . 14 90 6.3. Dataplane specific considerations . . . . . . . . . . . . 15 91 6.3.1. MPLS dataplane considerations . . . . . . . . . . . . 15 92 6.3.2. SRv6 dataplane considerations . . . . . . . . . . . . 15 93 7. TI-LFA and SR algorithms . . . . . . . . . . . . . . . . . . 16 94 8. Usage of Adjacency segments in the repair list . . . . . . . 16 95 9. Measurements on Real Networks . . . . . . . . . . . . . . . . 17 96 10. Security Considerations . . . . . . . . . . . . . . . . . . . 22 97 11. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 22 98 12. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . 22 99 13. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 22 100 14. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 22 101 15. References . . . . . . . . . . . . . . . . . . . . . . . . . 23 102 15.1. Normative References . . . . . . . . . . . . . . . . . . 23 103 15.2. Informative References . . . . . . . . . . . . . . . . . 23 104 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 24 106 1. Acronyms 108 o DLFA: Remote LFA with Directed forwarding. 110 o FRR: Fast Re-route. 112 o IGP: Interior Gateway Protocol. 114 o LFA: Loop-Free Alternate. 116 o LSDB: Link State DataBase. 118 o PLR: Point of Local Repair. 120 o RL: Repair list. 122 o RLFA: Remote LFA. 124 o SID: Segment Identifier. 126 o SLA: Service Level Agreement. 128 o SPF: Shortest Path First. 130 o SPT: Shortest Path Tree. 132 o SR: Segment Routing. 134 o SRLG: Shared Risk Link Group. 136 o TI-LFA: Topology Independant LFA. 138 2. Introduction 140 Segment Routing aims at supporting services with tight SLA guarantees 141 [RFC8402]. By relying on SR this document provides a local repair 142 mechanism for standard IGP shortest path capable of restoring end-to- 143 end connectivity in the case of a sudden directly connected failure 144 of a network component. Non-SR mechanisms for local repair are 145 beyond the scope of this document. Non-local failures are addressed 146 in a separate document [I-D.bashandy-rtgwg-segment-routing-uloop]. 148 The term topology independent (TI) refers to the ability to provide a 149 loop free backup path irrespective of the topologies used in the 150 network. This provides a major improvement compared to LFA [RFC5286] 151 and remote LFA [RFC7490] which cannot provide a complete protection 152 coverage in some topologies as described in [RFC6571]. 154 For each destination in the network, TI-LFA pre-installs a backup 155 forwarding entry for each protected destination ready to be activated 156 upon detection of the failure of a link used to reach the 157 destination. TI-LFA provides protection in the event of any one of 158 the following: single link failure, single node failure, or single 159 SRLG failure. In link failure mode, the destination is protected 160 assuming the failure of the link. In node protection mode, the 161 destination is protected assuming that the neighbor connected to the 162 primary link has failed. In SRLG protecting mode, the destination is 163 protected assuming that a configured set of links sharing fate with 164 the primary link has failed (e.g. a linecard or a set of links 165 sharing a common transmission pipe). 167 Protection techniques outlined in this document are limited to 168 protecting links, nodes, and SRLGs that are within a routing domain. 169 Protecting domain exit routers and/or links attached to another 170 routing domains are beyond the scope of this document 172 Thanks to SR, TI-LFA does not require the establishment of TLDP 173 sessions with remote nodes in order to take advantage of the 174 applicability of remote LFAs (RLFA) [RFC7490][RFC7916] or remote LFAs 175 with directed forwarding (DLFA)[RFC5714]. All the Segment 176 Identifiers (SIDs) are available in the link state database (LSDB) of 177 the IGP. As a result, preferring LFAs over RLFAs or DLFAs, as well 178 as minimizing the number of RLFA or DLFA repair nodes is not required 179 anymore. 181 Thanks to SR, there is no need to create state in the network in 182 order to enforce an explicit FRR path. This relieves the nodes 183 themselves from having to maintain extra state, and it relieves the 184 operator from having to deploy an extra protocol or extra protocol 185 sessions just to enhance the protection coverage. 187 [RFC7916] raised several operational considerations when using LFA or 188 remote LFA. [RFC7916] Section 3 presents a case where a high 189 bandwidth link between two core routers is protected through a PE 190 router connected with low bandwidth links. In such a case, 191 congestion may happen when the FRR backup path is activated. 192 [RFC7916] introduces a local policy framework to let the operator 193 tuning manually the best alternate election based on its own 194 requirements. 196 From a network capacity planning point of view, it is often assumed 197 that if a link L fails on a particular node X, the bandwidth consumed 198 on L will be spread over some of the remaining links of X. The 199 remaining links to be used are determined by the IGP routing 200 considering that the link L has failed (we assume that the traffic 201 uses the post-convergence path starting from the node X). In 202 Figure 1, we consider a network with all metrics equal to 1 except 203 the metrics on links used by PE1, PE2 and PE3 which are 1000. An 204 easy network capacity planning method is to consider that if the link 205 L (X-B) fails, the traffic actually flowing through L will be spread 206 over the remaining links of X (X-H, X-D, X-A). Considering the IGP 207 metrics, only X-H and X-D can only be used in reality to carry the 208 traffic flowing through the link L. As a consequence, the bandwidth 209 of links X-H and X-D is sized according to this rule. We should 210 observe that this capacity planning policy works, however it is not 211 fully accurate. 213 In Figure 1, considering that the source of traffic is only from PE1 214 and PE4, when the link L fails, depending on the convergence speed of 215 the nodes, X may reroute its forwarding entries to the remote PEs 216 onto X-H or X-D; however in a similar timeframe, PE1 will also 217 reroute a subset of its traffic (the subset destined to PE2) out of 218 its nominal path reducing the quantity of traffic received by X. The 219 capacity planning rule presented previously has the drawback of 220 oversizing the network, however it allows to prevent any transient 221 congestion (when for example X reroutes traffic before PE1 does). 223 H --- I --- J 224 | | \ 225 PE4 | | PE3 226 \ | (L) | / 227 A --- X --- B --- G 228 / | | \ 229 PE1 | | PE2 230 \ | | / 231 C --- D --- E --- F 233 Figure 1 235 Based on this assumption, in order to facilitate the operation of 236 FRR, and limit the implementation of local FRR policies, it looks 237 interesting to steer the traffic onto the post-convergence path from 238 the PLR point of view during the FRR phase. In our example, when 239 link L fails, X switches the traffic destined to PE3 and PE2 on the 240 post-convergence paths. This is perfectly inline with the capacity 241 planning rule that was presented before and also inline with the fact 242 X may converge before PE1 (or any other upstream router) and may 243 spread the X-B traffic onto the post-convergence paths rooted at X. 245 It should be noted, that some networks may have a different capacity 246 planning rule, leading to an allocation of less bandwidth on X-H and 247 X-D links. In such a case, using the post-convergence paths rooted 248 at X during FRR may introduce some congestion on X-H and X-D links. 249 However it is important to note, that a transient congestion may 250 possibly happen, even without FRR activated, for instance when X 251 converges before the upstream routers. Operators are still free to 252 use the policy framework defined in [RFC7916] if the usage of the 253 post-convergence paths rooted at the PLR is not suitable. 255 Readers should be aware that FRR protection is pre-computing a backup 256 path to protect against a particular type of failure (link, node, 257 SRLG). When using the post-convergence path as FRR backup path, the 258 computed post-convergence path is the one considering the failure we 259 are protecting against. This means that FRR is using an expected 260 post-convergence path, and this expected post-convergence path may be 261 actually different from the post-convergence path used if the failure 262 that happened is different from the failure FRR was protecting 263 against. As an example, if the operator has implemented a protection 264 against a node failure, the expected post-convergence path used 265 during FRR will be the one considering that the node has failed. 266 However, even if a single link is failing or a set of links is 267 failing (instead of the full node), the node-protecting post- 268 convergence path will be used. The consequence is that the path used 269 during FRR is not optimal with respect to the failure that has 270 actually occurred. 272 Another consideration to take into account is: while using the 273 expected post-convergence path for SR traffic using node segments 274 only (for instance, PE to PE traffic using shortest path) has some 275 advantages, these advantages reduce when SR policies 276 ([I-D.ietf-spring-segment-routing-policy]) are involved. A segment- 277 list used in an SR policy is computed to obey a set of path 278 constraints defined locally at the head-end or centrally in a 279 controller. TI-LFA cannot be aware of such path constraints and 280 there is no reason to expect the TI-LFA backup path protecting one 281 the segments in that segment list to obey those constraints. When SR 282 policies are used and the operator wants to have a backup path which 283 still follows the policy requirements, this backup path should be 284 computed as part of the SR policy in the ingress node (or central 285 controller) and the SR policy should not rely on local protection. 286 Another option could be to use FlexAlgo ([I-D.ietf-lsr-flex-algo]) to 287 express the set of constraints and use a single node segment 288 associated with a FlexAlgo to reach the destination. When using a 289 node segment associated with a FlexAlgo, TI-LFA keeps providing an 290 optimal backup by applying the appropriate set of constraints. The 291 relationship between TI-LFA and the SR-algorithm is detailed in 292 Section 7. 294 Thanks to SR and the combination of Adjacency segments and Node 295 segments, the expression of the expected post-convergence path rooted 296 at the PLR is facilitated and does not create any additional state on 297 intermediate nodes. The easiest way to express the expected post- 298 convergence path in a loop-free manner is to encode it as a list of 299 adjacency segments. However, in an MPLS world, this may create a 300 long stack of labels to be pushed that some hardware may not be able 301 to push. One of the challenges of TI-LFA is to encode the expected 302 post-convergence path by combining adjacency segments and node 303 segments. Each implementation will be free to have its own path 304 compression optimization algorithm. This document details the basic 305 concepts that could be used to build the SR backup path as well as 306 the associated dataplane procedures. 308 L ____ 309 S----F--{____}----D 310 /\ | / 311 | | | _______ / 312 |__}---Q{_______} 314 Figure 2: TI-LFA Protection 316 We use Figure 2 to illustrate the TI-LFA approach. 318 The Point of Local Repair (PLR), S, needs to find a node Q (a repair 319 node) that is capable of safely forwarding the traffic to a 320 destination D affected by the failure of the protected link L, a set 321 of links including L (SRLG), or the node F itself. The PLR also 322 needs to find a way to reach Q without being affected by the 323 convergence state of the nodes over the paths it wants to use to 324 reach Q: the PLR needs a loop-free path to reach Q. 326 Section 3 defines the main notations used in the document. They are 327 in line with [RFC5714]. 329 Section 4 suggests to compute the P-Space and Q-Space properties 330 defined in Section 3, for the specific case of nodes lying over the 331 post-convergence paths towards the protected destinations. 333 Using the properties defined in Section 4, Section 5 describes how to 334 compute protection lists that encode a loop-free post-convergence 335 path towards the destination. 337 Section 6 defines the segment operations to be applied by the PLR to 338 ensure consistency with the forwarding state of the repair node. 340 By applying the algorithms specified in this document to actual 341 service providers and large enterprise networks, we provide real life 342 measurements for the number of SIDs used by repair paths. Section 9 343 summarizes these measurements. 345 2.1. Conventions used in this document 347 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 348 "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and 349 "OPTIONAL" in this document are to be interpreted as described in BCP 350 14 [RFC2119] [RFC8174] when, and only when, they appear in all 351 capitals, as shown here. 353 3. Terminology 355 We define the main notations used in this document as the following. 357 We refer to "old" and "new" topologies as the LSDB state before and 358 after the considered failure. 360 SPT_old(R) is the Shortest Path Tree rooted at node R in the initial 361 state of the network. 363 SPT_new(R, X) is the Shortest Path Tree rooted at node R in the state 364 of the network after the resource X has failed. 366 PLR stands for "Point of Local Repair". It is the router that 367 applies fast traffic restoration after detecting failure in a 368 directly attached link, set of links, and/or node. 370 Similar to [RFC7490], we use the concept of P-Space and Q-Space for 371 TI-LFA. 373 The P-Space P(R,X) of a node R w.r.t. a resource X (e.g. a link S-F, 374 a node F, or a SRLG) is the set of nodes that are reachable from R 375 without passing through X. It is the set of nodes that are not 376 downstream of X in SPT_old(R). 378 The Extended P-Space P'(R,X) of a node R w.r.t. a resource X is the 379 set of nodes that are reachable from R or a neighbor of R, without 380 passing through X. 382 The Q-Space Q(D,X) of a destination node D w.r.t. a resource X is the 383 set of nodes which do not use X to reach D in the initial state of 384 the network. In other words, it is the set of nodes which have D in 385 their P-Space w.r.t. S-F, F, or a set of links adjacent to S). 387 A symmetric network is a network such that the IGP metric of each 388 link is the same in both directions of the link. 390 4. Intersecting P-Space and Q-Space with post-convergence paths 392 One of the challenges of defining an SR path following the expected 393 post-convergence path is to reduce the size of the segment list. In 394 order to reduce this segment list, an implementation MAY determine 395 the P-Space/Extended P-Space and Q-Space properties (defined in 396 [RFC7490]) of the nodes along the expected post-convergence path from 397 the PLR to the protected destination and compute an SR-based explicit 398 path from P to Q when they are not adjacent. Such properties will be 399 used in Section 5 to compute the TI-LFA repair list. 401 4.1. P-Space property computation for a resource X 403 A node N is in P(R, X) if it is not downstream of X in SPT_old(R). X 404 can be a link, a node, or a set of links adjacent to the PLR. A node 405 N is in P'(R,X) if it is not downstream of X in SPT_old(N), for at 406 least one neighbor N of R. 408 4.2. Q-Space property computation for a link S-F, over post-convergence 409 paths 411 We want to determine which nodes on the post-convergence path from 412 the PLR to the destination D are in the Q-Space of destination D 413 w.r.t. link S-F. 415 This can be found by intersecting the post-convergence path to D, 416 assuming the failure of S-F, with Q(D, S-F). 418 4.3. Q-Space property computation for a set of links adjacent to S, 419 over post-convergence paths 421 We want to determine which nodes on the post-convergence path from 422 the PLR to the destination D are in the Q-Space of destination D 423 w.r.t. a set of links adjacent to S (S being the PLR). That is, we 424 aim to find the set of nodes on the post-convergence path that use 425 none of the members of the protected set of links, to reach D. 427 This can be found by intersecting the post-convergence path to D, 428 assuming the failure of the set of links, with the intersection among 429 Q(D, S->X) for all S->X belonging to the set of links. 431 4.4. Q-Space property computation for a node F, over post-convergence 432 paths 434 We want to determine which nodes on the post-convergence from the PLR 435 to the destination D are in the Q-Space of destination D w.r.t. node 436 F. 438 This can be found by intersecting the post-convergence path to D, 439 assuming the failure of F, with Q(D, F). 441 4.5. Scaling considerations when computing Q-Space 443 [RFC7490] raises scaling concerns about computing a Q-Space per 444 destination. Similar concerns may affect TI-LFA computation if an 445 implementation tries to compute a reverse SPT for every destination 446 in the network to determine the Q-Space. It will be up to each 447 implementation to determine the good tradeoff between scaling and 448 accuracy of the optimization. 450 5. TI-LFA Repair path 452 The TI-LFA repair path (RP) consists of an outgoing interface and a 453 list of segments (repair list (RL)) to insert on the SR header. The 454 repair list encodes the explicit post-convergence path to the 455 destination, which avoids the protected resource X and, at the same 456 time, is guaranteed to be loop-free irrespective of the state of FIBs 457 along the nodes belonging to the explicit path. Thus there is no 458 need for any co-ordination or message exchange between the PLR and 459 any other router in the network. 461 The TI-LFA repair path is found by intersecting P(S,X) and Q(D,X) 462 with the post-convergence path to D and computing the explicit SR- 463 based path EP(P, Q) from P to Q when these nodes are not adjacent 464 along the post convergence path. The TI-LFA repair list is expressed 465 generally as (Node_SID(P), EP(P, Q)). 467 Most often, the TI-LFA repair list has a simpler form, as described 468 in the following sections. Section 9 provides statistics for the 469 number of SIDs in the explicit path to protect against various 470 failures. 472 5.1. FRR path using a direct neighbor 474 When a direct neighbor is in P(S,X) and Q(D,x) and on the post- 475 convergence path, the outgoing interface is set to that neighbor and 476 the repair segment list MUST be empty. 478 This is comparable to a post-convergence LFA FRR repair. 480 5.2. FRR path using a PQ node 482 When a remote node R is in P(S,X) and Q(D,x) and on the post- 483 convergence path, the repair list MUST be made of a single node 484 segment to R and the outgoing interface MUST be set to the outgoing 485 interface used to reach R. 487 This is comparable to a post-convergence RLFA repair tunnel. 489 5.3. FRR path using a P node and Q node that are adjacent 491 When a node P is in P(S,X) and a node Q is in Q(D,x) and both are on 492 the post-convergence path and both are adjacent to each other, the 493 repair list MUST be made of two segments: A node segment to P (to be 494 processed first), followed by an adjacency segment from P to Q. 496 This is comparable to a post-convergence DLFA repair tunnel. 498 5.4. Connecting distant P and Q nodes along post-convergence paths 500 In some cases, there is no adjacent P and Q node along the post- 501 convergence path. However, the PLR can perform additional 502 computations to compute a list of segments that represent a loop-free 503 path from P to Q. How these computations are done is out of scope of 504 this document. 506 6. Building TI-LFA repair lists 508 The following sections describe how to build the repair lists using 509 the terminology defined in [RFC8402]. The procedures described in 510 Section 6.1 and Section 6.2 are equally applicable to both SR-MPLS 511 and SRv6 dataplane, while the dataplane-specific considerations are 512 described in Section 6.3. 514 6.1. Link protection 516 In this section, we explain how a protecting router S processes the 517 active segment of a packet upon the failure of its primary outgoing 518 interface for the packet, S-F. 520 6.1.1. The active segment is a node segment 522 The active segment MUST be kept on the SR header unchanged and the 523 repair list MUST be inserted at the head of the list. The active 524 segment becomes the first segment of the inserted repair list. 526 6.1.2. The active segment is an adjacency segment 528 We define hereafter the FRR behavior applied by S for any packet 529 received with an active adjacency segment S-F for which protection 530 was enabled. As protection has been enabled for the segment S-F and 531 signalled in the IGP, any SR policy using this segment knows that it 532 may be transiently rerouted out of S-F in case of S-F failure. 534 The simplest approach for link protection of an adjacency segment S-F 535 is to create a repair list that will carry the traffic to F. To do 536 so, one or two "PUSH" operations are performed. If the repair list, 537 while avoiding S-F, terminates on F, S only pushes the repair list. 538 Otherwise, S pushes a node segment of F, followed by by push of the 539 repair list. For details on the "NEXT" and "PUSH" operations, refer 540 to [RFC8402]. 542 This method which merges back the traffic at the remote end of the 543 adjacency segment has the advantage of keeping as much as possible 544 the traffic on the pre-failure path. As stated in Section 2, when SR 545 policies are involved and a strict compliance of the policy is 546 required, an end-to-end protection should be preferred over a local 547 repair mechanism. However this method may not provide the expected 548 post-convergence path to the final destination as the expected post- 549 convergence path may not go through F. Another method requires to 550 look to the next segment in the segment list. 552 We distinguish the case where this active segment is followed by 553 another adjacency segment from the case where it is followed by a 554 node segment. 556 6.1.2.1. Protecting [Adjacency, Adjacency] segment lists 558 If the next segment in the list is an Adjacency segment, then the 559 packet has to be conveyed to F. 561 To do so, S MUST apply a "NEXT" operation on Adj(S-F) and then one or 562 two "PUSH" operations. If the repair list, while avoiding S-F, 563 terminates on F, S only pushes the repair list. Otherwise, S pushes 564 a node segment of F, followed by push of the repair list.. For 565 details on the "NEXT" and "PUSH" operations, refer to [RFC8402]. 567 Upon failure of S-F, a packet reaching S with a segment list matching 568 [adj(S-F),adj(F-M),...] will thus leave S with a segment list 569 matching [RL(F),node(F),adj(F-M)], where RL(F) is the repair path for 570 destination F. 572 In Section 6.2.2, we describe the TI-LFA behavior of PLR S when node 573 protection is applied and the two first segments are Adjacency 574 Segments. 576 6.1.2.2. Protecting [Adjacency, Node] segment lists 578 If the next segment in the stack is a node segment, say for node T, 579 the segment list on the packet matches [adj(S-F),node(T),...]. 581 In this case, S MUST apply a "NEXT" operation on the Adjacency 582 segment related to S-F, followed by a "PUSH" of a repair list 583 redirecting the traffic to a node Q, whose path to node segment T is 584 not affected by the failure. 586 Upon failure of S-F, packets reaching S with a segment list matching 587 [adj(S-F), node(T), ...], would leave S with a segment list matching 588 [RL(Q),node(T), ...]. Note that this second behavior is the one 589 followed for node protection, as described in Section 6.2.1. 591 6.2. Protecting SR policy midpoints against node failure 593 In this section, we describe the behavior of a node S configured to 594 interpret the failure of link S->F as the node failure of F, in the 595 specific case where the active segment of the packet received by S is 596 a Prefix SID of F represented as "F"), or an Adjacency SID for the 597 link S-F (represented as "S->F"). 599 The description below is intended to specify the forwarding behavior 600 required for node protection. The description should not be 601 interpreted as limiting the possible implementations of this 602 forwarding behavior. An implementation complies with the description 603 below as long as the externally visible forwarding behavior produced 604 by the implementation is the same as that described below. 606 6.2.1. Protecting {F, T, D} or {S->F, T, D} 608 This section describes the protection behavior of S when all of the 609 following conditions are true: 611 1. the active segment is a prefix SID for a neighbor F, or an 612 adjacency segment S->F 614 2. the primary interface used to forward the packet failed 616 3. the segment following the active segment is a prefix SID (for 617 node T) 619 4. node protection is active for that interface. 621 In such a case, the PLR should: 623 1. apply a NEXT operation; the segment F or S->F is removed 625 2. Confirm that the next segment is in the SRGB of F, meaning that 626 the next segment is a prefix segment, e.g. for node T 628 3. Retrieve the segment ID of T (as per the SRGB of F) 630 4. Apply a NEXT operation followed by a PUSH operation of T's 631 segment based on the SRGB of node S. 633 5. Look up T's segment (based on the updated label value) and 634 forward accordingly. 636 6.2.2. Protecting {F, F->T, D} or {S->F, F->T, D} 638 This section describes the protection behavior of S when all of the 639 following conditions are true: 641 1. the active segment is a prefix SID for a neighbor F, or an 642 adjacency segment S->F 644 2. the primary interface used to forward the packet failed 646 3. the segment following the active segment is an adjacency SID (F- 647 >T) 649 4. node protection is active for that interface. 651 In such a case, the PLR should: 653 1. Apply a NEXT operation; the segment F or S->F is removed 655 2. Confirm that the next segment is an adjacency SID of F, say F->T 657 3. Retrieve the node segment ID associated to T (as per the set of 658 Adjacency Segments of F) 660 4. Apply a NEXT operation on the next segment followed by a PUSH of 661 T's segment based on the SRGB of the node S. 663 5. Look up T's segment (based on the updated label value) and 664 forward accordingly. 666 It is noteworthy to mention that node "S" in the procedures described 667 in Sections 5.3.1 and 5.3.2 can always determine whether the segment 668 after popping the top segment is an adjacency SID or a prefix-SID of 669 the next-hop "F" as follows: 671 1. In a link state environment, the node "S" knows the SRGB and the 672 adj-SIDs of the neighboring node "F" 674 2. If the new segment after popping the top segment is within the 675 SRGB or the adj-SIDs of "F", then node "S" is certain that the 676 failure of node "F" is a midpoint failure and hence node "S" 677 applies the procedures specified in Sections 5.3.1 or 5.3.2, 678 respectively. 680 3. Otherwise the failure is not a midpoint failure and hence the 681 node "S" may apply other protection techniques that are beyond 682 the scope of this document or simply drop the packet and wait for 683 normal protocol convergence. 685 6.3. Dataplane specific considerations 687 6.3.1. MPLS dataplane considerations 689 The following dataplane behaviors apply when creating a repair list 690 using an MPLS dataplane: 692 1. If the active segment is a node segment that has been signaled 693 with penultimate hop popping and the repair list ends with an 694 adjacency segment terminating on the tail-end of the active 695 segment, then the active segment MUST be popped before pushing 696 the repair list. 698 2. If the active segment is a node segment but the other conditions 699 in 1. are not met, the active segment MUST be popped then pushed 700 again with a label value computed according to the SRGB of Q, 701 where Q is the endpoint of the repair list. Finally, the repair 702 list MUST be pushed. 704 6.3.2. SRv6 dataplane considerations 706 The TI-LFA path computation algorithm is the same as in the SR-MPLS 707 dataplane. Note however that the Adjacency SIDs are typically 708 globally routed. In such case, there is no need for a preceding 709 Prefix SID and the resulting repair list is likely shorter. 711 If the traffic is protected at a Transit Node, then an SRv6 SID list 712 is added on the packet to apply the repair list. 714 If the traffic is protected at an SR Segment Endpoint Node, first the 715 Segment Endpoint packet processing is executed. Then the packet is 716 protected as if its were a transit packet. 718 7. TI-LFA and SR algorithms 720 SR allows an operator to bind an algorithm to a prefix SID (as 721 defined in [RFC8402]. The algorithm value dictates how the path to 722 the prefix is computed. The SR default algorithm is known has the 723 "Shortest Path" algorithm. The SR default algorithm allows an 724 operator to override the IGP shortest path by using local policies. 725 When TI-LFA uses Node-SIDs associated with the default algorithm, 726 there is no guarantee that the path will be loop-free as a local 727 policy may have overriden the expected IGP path. As the local 728 policies are defined by the operator, it becomes the responsibility 729 of this operator to ensure that the deployed policies do not affect 730 the TI-LFA deployment. It should be noted that such situation can 731 already happen today with existing mechanisms as remote LFA. 733 [I-D.ietf-lsr-flex-algo] defines a flexible algorithm (FlexAlgo) 734 framework to be associated with Prefix SIDs. FlexAlgo allows a user 735 to associate a constrained path to a Prefix SID rather than using the 736 regular IGP shortest path. An implementation MAY support TI-LFA to 737 protect Node-SIDs associated to a FlexAlgo. In such a case, rather 738 than computing the expected post-convergence path based on the 739 regular SPF, an implementation SHOULD use the constrained SPF 740 algorithm bound to the FlexAlgo (using the Flex Algo Definition) 741 instead of the regular Dijkstra in all the SPF/rSPF computations that 742 are occurring during the TI-LFA computation. This includes the 743 computation of the P-Space and Q-Space as well as the post- 744 convergence path. An implementation MUST only use Node-SIDs bound to 745 the FlexAlgo and/or Adj-SIDs that are unprotected to build the repair 746 list. 748 8. Usage of Adjacency segments in the repair list 750 The repair list of segments computed by TI-LFA may contain one or 751 more adjacency segments. An adjacency segment may be protected or 752 not protected. 754 S --- R2 --- R3 --- R4 --- R5 --- D 755 \ | \ / 756 R7 -- R8 757 | | 758 R9 -- R10 760 Figure 3 762 In Figure 3, all the metrics are equal to 1 except 763 R2-R7,R7-R8,R8-R4,R7-R9 which have a metric of 1000. Considering R2 764 as a PLR to protect against the failure of node R3 for the traffic 765 S->D, the repair list computed by R2 will be [adj(R7-R8),adj(R8-R4)] 766 and the outgoing interface will be to R7. If R3 fails, R2 pushes the 767 repair list onto the incoming packet to D. During the FRR, if R7-R8 768 fails and if TI-LFA has picked a protected adjacency segment for 769 adj(R7-R8), R7 will push an additional repair list onto the packet 770 following the procedures defined in Section 6. 772 To avoid the possibility of this double FRR, an implementation of TI- 773 LFA MAY pick only non protected adjacency segments when building the 774 repair list. 776 9. Measurements on Real Networks 778 This section presents measurements performed on real service provider 779 and large enterprise networks. The objective of the measurements is 780 to assess the number of SIDs required in an explicit path when the 781 mechanisms described in this document are used to protect against the 782 failure scenarios within the scope of this document. The number of 783 segments described in this section are applicable to instantiating 784 segment routing over the MPLS forwarding plane. 786 The measurements below indicate that for link and local SRLG 787 protection, a 1 SID repair path delivers more than 99% coverage. For 788 node protection a 2 SIDs repair path yields 99% coverage. 790 Table 1 below lists the characteristics of the networks used in our 791 measurements. The number of links refers to the number of 792 "bidirectional" links (not directed edges of the graph). The 793 measurements are carried out as follows: 795 o For each network, the algorithms described in this document are 796 applied to protect all prefixes against link, node, and local SRLG 797 failure 799 o For each prefix, the number of SIDs used by the repair path is 800 recored 802 o The percentage of number of SIDs are listed in Tables 2A/B, 3A/B, 803 and 4A/B 805 The measurements listed in the tables indicate that for link and 806 local SRLG protection, 1 SID repair paths are sufficient to protect 807 more than 99% of the prefix in almost all cases. For node protection 808 2 SIDs repair paths yield 99% coverage. 810 +-------------+------------+------------+------------+------------+ 811 | Network | Nodes | Links |Node-to-Link| SRLG info? | 812 | | | | Ratio | | 813 +-------------+------------+------------+------------+------------+ 814 | T1 | 408 | 665 | 1.63 | Yes | 815 +-------------+------------+------------+------------+------------+ 816 | T2 | 587 | 1083 | 1.84 | No | 817 +-------------+------------+------------+------------+------------+ 818 | T3 | 93 | 401 | 4.31 | Yes | 819 +-------------+------------+------------+------------+------------+ 820 | T4 | 247 | 393 | 1.59 | Yes | 821 +-------------+------------+------------+------------+------------+ 822 | T5 | 34 | 96 | 2.82 | Yes | 823 +-------------+------------+------------+------------+------------+ 824 | T6 | 50 | 78 | 1.56 | No | 825 +-------------+------------+------------+------------+------------+ 826 | T7 | 82 | 293 | 3.57 | No | 827 +-------------+------------+------------+------------+------------+ 828 | T8 | 35 | 41 | 1.17 | Yes | 829 +-------------+------------+------------+------------+------------+ 830 | T9 | 177 | 1371 | 7.74 | Yes | 831 +-------------+------------+------------+------------+------------+ 832 Table 1: Data Set Definition 834 The rest of this section presents the measurements done on the actual 835 topologies. The convention that we use is as follows 837 o 0 SIDs: the calculated repair path starts with a directly 838 connected neighbor that is also a loop free alternate, in which 839 case there is no need to explicitly route the traffic using 840 additional SIDs. This scenario is described in Section 5.1. 842 o 1 SIDs: the repair node is a PQ node, in which case only 1 SID is 843 needed to guarantee loop-freeness. This scenario is covered in 844 Section 5.2. 846 o 2 or more SIDs: The repair path consists of 2 or more SIDs as 847 described in Sections 4.3 and 4.4. We do not cover the case for 2 848 SIDs (Section 5.3) separately because there was no granularity in 849 the result. Also we treat the node-SID+adj-SID and node-SID + 850 node-SID the same because they do not differ from the data plane 851 point of view. 853 Table 2A and 2B below summarize the measurements on the number of 854 SIDs needed for link protection 856 +-------------+------------+------------+------------+------------+ 857 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 858 +-------------+------------+------------+------------+------------+ 859 | T1 | 74.227% | 25.256% | 0.517% | 0.001% | 860 +-------------+------------+------------+------------+------------+ 861 | T2 | 81.097% | 18.738% | 0.165% | 0.0% | 862 +-------------+------------+------------+------------+------------+ 863 | T3 | 95.878% | 4.067% | 0.056% | 0.0% | 864 +-------------+------------+------------+------------+------------+ 865 | T4 | 62.547% | 35.666% | 1.788% | 0.0% | 866 +-------------+------------+------------+------------+------------+ 867 | T5 | 85.733% | 14.267% | 0.0% | 0.0% | 868 +-------------+------------+------------+------------+------------+ 869 | T6 | 81.252% | 18.714% | 0.033% | 0.0% | 870 +-------------+------------+------------+------------+------------+ 871 | T7 | 98,857% | 1.143% | 0.0% | 0.0% | 872 +-------------+------------+------------+------------+------------+ 873 | T8 | 94,118% | 5.882% | 0.0% | 0.0% | 874 +-------------+------------+------------+------------+------------+ 875 | T9 | 98.950% | 1.050% | 0.0% | 0.0% | 876 +-------------+------------+------------+------------+------------+ 877 Table 2A: Link protection (repair size distribution) 879 +-------------+------------+------------+------------+------------+ 880 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 881 +-------------+------------+------------+------------+------------+ 882 | T1 | 74.227% | 99.482% | 99.999% | 100.0% | 883 +-------------+------------+------------+------------+------------+ 884 | T2 | 81.097% | 99.835% | 100.0% | 100.0% | 885 +-------------+------------+------------+------------+------------+ 886 | T3 | 95.878% | 99.944% | 100.0% | 100.0% | 887 +-------------+------------+------------+------------+------------+ 888 | T4 | 62.547% | 98.212% | 100.0% | 100.0% | 889 +-------------+------------+------------+------------+------------+ 890 | T5 | 85.733% | 100.000% | 100.0% | 100.0% | 891 +-------------+------------+------------+------------+------------+ 892 | T6 | 81.252% | 99.967% | 100.0% | 100.0% | 893 +-------------+------------+------------+------------+------------+ 894 | T7 | 98,857% | 100.000% | 100.0% | 100.0% | 895 +-------------+------------+------------+------------+------------+ 896 | T8 | 94,118% | 100.000% | 100.0% | 100.0% | 897 +-------------+------------+------------+------------+------------+ 898 | T9 | 98,950% | 100.000% | 100.0% | 100.0% | 899 +-------------+------------+------------+------------+------------+ 900 Table 2B: Link protection repair size cumulative distribution 901 Table 3A and 3B summarize the measurements on the number of SIDs 902 needed for local SRLG protection. 904 +-------------+------------+------------+------------+------------+ 905 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 906 +-------------+------------+------------+------------+------------+ 907 | T1 | 74.177% | 25.306% | 0.517% | 0.001% | 908 +-------------+------------+------------+------------+------------+ 909 | T2 | No SRLG Information | 910 +-------------+------------+------------+------------+------------+ 911 | T3 | 93.650% | 6.301% | 0.049% | 0.0% | 912 +-------------+------------+------------+------------+------------+ 913 | T4 | 62,547% | 35.666% | 1.788% | 0.0% | 914 +-------------+------------+------------+------------+------------+ 915 | T5 | 83.139% | 16.861% | 0.0% | 0.0% | 916 +-------------+------------+------------+------------+------------+ 917 | T6 | No SRLG Information | 918 +-------------+---------------------------------------------------+ 919 | T7 | No SRLG Information | 920 +-------------+------------+------------+------------+------------+ 921 | T8 | 85.185% | 14.815% | 0.0% | 0.0% | 922 +-------------+------------+------------+------------+------------+ 923 | T9 | 98,940% | 1.060% | 0.0% | 0.0% | 924 +-------------+------------+------------+------------+------------+ 925 Table 3A: Local SRLG protection repair size distribution 927 +-------------+------------+------------+------------+------------+ 928 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 929 +-------------+------------+------------+------------+------------+ 930 | T1 | 74.177% | 99.482% | 99.999% | 100.001% | 931 +-------------+------------+------------+------------+------------+ 932 | T2 | No SRLG Information | 933 +-------------+------------+------------+------------+------------+ 934 | T3 | 93.650% | 99.951% | 100.000% | 0.0% | 935 +-------------+------------+------------+------------+------------+ 936 | T4 | 62,547% | 98.212% | 100.000% | 100.0% | 937 +-------------+------------+------------+------------+------------+ 938 | T5 | 83.139% | 100.000% | 100.0% | 100.0% | 939 +-------------+------------+------------+------------+------------+ 940 | T6 | No SRLG Information | 941 +-------------+---------------------------------------------------+ 942 | T7 | No SRLG Information | 943 +-------------+------------+------------+------------+------------+ 944 | T8 | 85.185% | 100,000% | 100.000% | 100.0% | 945 +-------------+------------+------------+------------+------------+ 946 | T9 | 98,940% | 100,000% | 100.000% | 100.0% | 947 +-------------+------------+------------+------------+------------+ 948 Table 3B: Local SRLG protection repair size Cumulative distribution 949 The remaining two tables summarize the measurements on the number of 950 SIDs needed for node protection. 952 +---------+----------+----------+----------+----------+----------+ 953 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 4 SIDs | 954 +---------+----------+----------+----------+----------+----------+ 955 | T1 | 49.771% | 47.902% | 2.156% | 0.148% | 0.023% | 956 +---------+----------+----------+----------+----------+----------+ 957 | T2 | 36,528% | 59.625% | 3.628% | 0.194% | 0.025% | 958 +---------+----------+----------+----------+----------+----------+ 959 | T3 | 73,287% | 25,574% | 1,128% | 0.010% | 0% | 960 +---------+----------+----------+----------+----------+----------+ 961 | T4 | 36.112% | 57.350% | 6.329% | 0.199% | 0.010% | 962 +---------+----------+----------+----------+----------+----------+ 963 | T5 | 73.185% | 26.815% | 0% | 0% | 0% | 964 +---------+----------+----------+----------+----------+----------+ 965 | T6 | 78.362% | 21.320% | 0.318% | 0% | 0% | 966 +---------+----------+----------+----------+----------+----------+ 967 | T7 | 66.106% | 32.813% | 1.082% | 0% | 0% | 968 +---------+----------+----------+----------+----------+----------+ 969 | T8 | 59.712% | 40.288% | 0% | 0% | 0% | 970 +---------+----------+----------+----------+----------+----------+ 971 | T9 | 98.950% | 1.050% | 0% | 0% | 0% | 972 +---------+----------+----------+----------+----------+----------+ 973 Table 4A: Node protection (repair size distribution) 975 +---------+----------+----------+----------+----------+----------+ 976 | Network | 0 SIDs | 1 SID | 2 SIDs | 3 SIDs | 4 SIDs | 977 +---------+----------+----------+----------+----------+----------+ 978 | T1 | 49.771% | 97.673% | 99.829% | 99.977% | 100% | 979 +---------+----------+----------+----------+----------+----------+ 980 | T2 | 36,528% | 96.153% | 99.781% | 99.975% | 100% | 981 +---------+----------+----------+----------+----------+----------+ 982 | T3 | 73,287% | 98.862% | 99.990% |100.0% | 100% | 983 +---------+----------+----------+----------+----------+----------+ 984 | T4 | 36.112% | 93.461% | 99.791% | 99.990% | 100% | 985 +---------+----------+----------+----------+----------+----------+ 986 | T5 | 73.185% | 100.0% | 100.0% |100.0% | 100% | 987 +---------+----------+----------+----------+----------+----------+ 988 | T6 | 78.362% | 99.682% | 100.0% |100.0% | 100% | 989 +---------+----------+----------+----------+----------+----------+ 990 | T7 | 66.106% | 98,918% | 100.0% |100.0% | 100% | 991 +---------+----------+----------+----------+----------+----------+ 992 | T8 | 59.712% | 100.0% | 100.0% |100.0% | 100% | 993 +---------+----------+----------+----------+----------+----------+ 994 | T9 | 98.950% | 100.0% | 100.0% |100.0% | 100% | 995 +---------+----------+----------+----------+----------+----------+ 996 Table 4B: Node protection (repair size cumulative distribution) 998 10. Security Considerations 1000 The techniques described in this document are internal 1001 functionalities to a router that result in the ability to guarantee 1002 an upper bound on the time taken to restore traffic flow upon the 1003 failure of a directly connected link or node. As these techniques 1004 steer traffic to the post-convergence path as quickly as possible, 1005 this serves to minimize the disruption associated with a local 1006 failure which can be seen as a modest security enhancement. The 1007 protection mechanisms does not protect external destinations, but 1008 rather provides quick restoration for destination that are internal 1009 to a routing domain. 1011 11. IANA Considerations 1013 No requirements for IANA 1015 12. Conclusions 1017 This document proposes a mechanism that is able to pre-calculate a 1018 backup path for every primary path so as to be able to protect 1019 against the failure of a directly connected link, node, or SRLG. The 1020 mechanism is able to calculate the backup path irrespective of the 1021 topology as long as the topology is sufficiently redundant. 1023 13. Contributors 1025 In addition to the authors listed on the front page, the following 1026 co-authors have also contributed to this document: 1028 Pierre Francois, INSA Lyon 1030 Francois Clad, Cisco Systems 1032 Pablo Camarillo, Cisco Systems 1034 14. Acknowledgments 1036 We would like to thank Les Ginsberg, Stewart Bryant, Alexander 1037 Vainsthein, Chris Bowers, Shraddha Hedge for their valuable comments. 1039 15. References 1041 15.1. Normative References 1043 [I-D.ietf-spring-srv6-network-programming] 1044 Filsfils, C., Camarillo, P., Leddy, J., Voyer, D., 1045 Matsushima, S., and Z. Li, "SRv6 Network Programming", 1046 draft-ietf-spring-srv6-network-programming-24 (work in 1047 progress), October 2020. 1049 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 1050 Requirement Levels", BCP 14, RFC 2119, 1051 DOI 10.17487/RFC2119, March 1997, 1052 . 1054 [RFC7916] Litkowski, S., Ed., Decraene, B., Filsfils, C., Raza, K., 1055 Horneffer, M., and P. Sarkar, "Operational Management of 1056 Loop-Free Alternates", RFC 7916, DOI 10.17487/RFC7916, 1057 July 2016, . 1059 [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 1060 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, 1061 May 2017, . 1063 [RFC8402] Filsfils, C., Ed., Previdi, S., Ed., Ginsberg, L., 1064 Decraene, B., Litkowski, S., and R. Shakir, "Segment 1065 Routing Architecture", RFC 8402, DOI 10.17487/RFC8402, 1066 July 2018, . 1068 15.2. Informative References 1070 [I-D.bashandy-rtgwg-segment-routing-uloop] 1071 Bashandy, A., Filsfils, C., Litkowski, S., Decraene, B., 1072 Francois, P., and P. Psenak, "Loop avoidance using Segment 1073 Routing", draft-bashandy-rtgwg-segment-routing-uloop-09 1074 (work in progress), June 2020. 1076 [I-D.ietf-lsr-flex-algo] 1077 Psenak, P., Hegde, S., Filsfils, C., Talaulikar, K., and 1078 A. Gulko, "IGP Flexible Algorithm", draft-ietf-lsr-flex- 1079 algo-13 (work in progress), October 2020. 1081 [I-D.ietf-spring-segment-routing-policy] 1082 Filsfils, C., Talaulikar, K., Voyer, D., Bogdanov, A., and 1083 P. Mattes, "Segment Routing Policy Architecture", draft- 1084 ietf-spring-segment-routing-policy-09 (work in progress), 1085 November 2020. 1087 [RFC5286] Atlas, A., Ed. and A. Zinin, Ed., "Basic Specification for 1088 IP Fast Reroute: Loop-Free Alternates", RFC 5286, 1089 DOI 10.17487/RFC5286, September 2008, 1090 . 1092 [RFC5714] Shand, M. and S. Bryant, "IP Fast Reroute Framework", 1093 RFC 5714, DOI 10.17487/RFC5714, January 2010, 1094 . 1096 [RFC6571] Filsfils, C., Ed., Francois, P., Ed., Shand, M., Decraene, 1097 B., Uttaro, J., Leymann, N., and M. Horneffer, "Loop-Free 1098 Alternate (LFA) Applicability in Service Provider (SP) 1099 Networks", RFC 6571, DOI 10.17487/RFC6571, June 2012, 1100 . 1102 [RFC7490] Bryant, S., Filsfils, C., Previdi, S., Shand, M., and N. 1103 So, "Remote Loop-Free Alternate (LFA) Fast Reroute (FRR)", 1104 RFC 7490, DOI 10.17487/RFC7490, April 2015, 1105 . 1107 Authors' Addresses 1109 Stephane Litkowski 1110 Cisco Systems 1111 France 1113 Email: slitkows@cisco.com 1115 Ahmed Bashandy 1116 Individual 1118 Email: abashandy.ietf@gmail.com 1120 Clarence Filsfils 1121 Cisco Systems 1122 Brussels 1123 Belgium 1125 Email: cfilsfil@cisco.com 1126 Bruno Decraene 1127 Orange 1128 Issy-les-Moulineaux 1129 France 1131 Email: bruno.decraene@orange.com 1133 Daniel Voyer 1134 Bell Canada 1135 Canada 1137 Email: daniel.voyer@bell.ca