idnits 2.17.1 draft-ietf-ospf-node-admin-tag-09.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 17, 2015) is 3082 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) == Unused Reference: 'RFC4970' is defined on line 560, but no explicit reference was found in the text ** Obsolete normative reference: RFC 4970 (Obsoleted by RFC 7770) == Outdated reference: A later version (-29) exists of draft-ietf-ospf-yang-03 == Outdated reference: A later version (-31) exists of draft-ietf-rtgwg-policy-model-00 Summary: 1 error (**), 0 flaws (~~), 4 warnings (==), 1 comment (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Open Shortest Path First IGP S. Hegde 3 Internet-Draft Juniper Networks, Inc. 4 Intended status: Standards Track R. Shakir 5 Expires: May 20, 2016 Individual 6 A. Smirnov 7 Cisco Systems, Inc. 8 Z. Li 9 Huawei Technologies 10 B. Decraene 11 Orange 12 November 17, 2015 14 Advertising per-node administrative tags in OSPF 15 draft-ietf-ospf-node-admin-tag-09 17 Abstract 19 This document describes an extension to the OSPF protocol to add an 20 optional operational capability, that allows tagging and grouping of 21 the nodes in an OSPF domain. This allows simplification, ease of 22 management and control over route and path selection based on 23 configured policies. This document describes an extension to the 24 OSPF protocol to advertise per-node administrative tags. The node- 25 tags can be used to express and apply locally-defined network 26 policies which is a very useful operational capability. Node tags 27 may be used either by OSPF itself or by other applications consuming 28 information propagated via OSPF. 30 This document describes the protocol extensions to disseminate per- 31 node administrative tags to the OSPFv2 and OSPFv3 protocol. It 32 provides example use cases of administrative node tags. 34 Requirements Language 36 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 37 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this 38 document are to be interpreted as described in RFC 2119 [RFC2119]. 40 Status of This Memo 42 This Internet-Draft is submitted in full conformance with the 43 provisions of BCP 78 and BCP 79. 45 Internet-Drafts are working documents of the Internet Engineering 46 Task Force (IETF). Note that other groups may also distribute 47 working documents as Internet-Drafts. The list of current Internet- 48 Drafts is at http://datatracker.ietf.org/drafts/current/. 50 Internet-Drafts are draft documents valid for a maximum of six months 51 and may be updated, replaced, or obsoleted by other documents at any 52 time. It is inappropriate to use Internet-Drafts as reference 53 material or to cite them other than as "work in progress." 55 This Internet-Draft will expire on May 20, 2016. 57 Copyright Notice 59 Copyright (c) 2015 IETF Trust and the persons identified as the 60 document authors. All rights reserved. 62 This document is subject to BCP 78 and the IETF Trust's Legal 63 Provisions Relating to IETF Documents 64 (http://trustee.ietf.org/license-info) in effect on the date of 65 publication of this document. Please review these documents 66 carefully, as they describe your rights and restrictions with respect 67 to this document. Code Components extracted from this document must 68 include Simplified BSD License text as described in Section 4.e of 69 the Trust Legal Provisions and are provided without warranty as 70 described in the Simplified BSD License. 72 Table of Contents 74 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3 75 2. Administrative Tag TLV . . . . . . . . . . . . . . . . . . . 3 76 3. OSPF per-node administrative tag TLV . . . . . . . . . . . . 3 77 3.1. TLV format . . . . . . . . . . . . . . . . . . . . . . . 3 78 3.2. Elements of procedure . . . . . . . . . . . . . . . . . . 4 79 3.2.1. Interpretation of Node Administrative Tags . . . . . 4 80 3.2.2. Use of Node Administrative Tags . . . . . . . . . . . 5 81 3.2.3. Processing Node Administrative Tag changes . . . . . 5 82 4. Applications . . . . . . . . . . . . . . . . . . . . . . . . 6 83 4.1. Service auto-discovery . . . . . . . . . . . . . . . . . 6 84 4.2. Fast-Re-routing policy . . . . . . . . . . . . . . . . . 6 85 4.3. Controlling Remote LFA tunnel termination . . . . . . . . 8 86 4.4. Mobile back-haul network service deployment . . . . . . . 8 87 4.5. Explicit routing policy . . . . . . . . . . . . . . . . . 9 88 5. Security Considerations . . . . . . . . . . . . . . . . . . . 11 89 6. Operational Considerations . . . . . . . . . . . . . . . . . 11 90 7. Manageability Considerations . . . . . . . . . . . . . . . . 12 91 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12 92 9. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 12 93 10. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 12 94 11. References . . . . . . . . . . . . . . . . . . . . . . . . . 12 95 11.1. Normative References . . . . . . . . . . . . . . . . . . 12 96 11.2. Informative References . . . . . . . . . . . . . . . . . 13 97 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 14 99 1. Introduction 101 It is useful to assign a per-node administrative tag to a router in 102 the OSPF domain and use it as an attribute associated with the node. 103 The per-node administrative tag can be used in variety of 104 applications, for example: 106 (a) Traffic-engineering applications to provide different path- 107 selection criteria. 109 (b) Prefer or prune certain paths in Loop Free Alternate (LFA) 110 backup selection via local policies as defined in 111 [I-D.ietf-rtgwg-lfa-manageability]. 113 This document provides mechanisms to advertise per-node 114 administrative tags in OSPF for route and path selection. Route and 115 path selection functionality applies to both to TE and non Traffic 116 Engineering (TE) applications and hence new TLV for carrying per-node 117 administrative tags is included in Router Information (RI) Link State 118 Advertisement (LSA) [I-D.ietf-ospf-rfc4970bis]. 120 2. Administrative Tag TLV 122 An administrative Tag is a 32-bit integer value that can be used to 123 identify a group of nodes in the OSPF domain. 125 The new TLV defined will be carried within an RI LSA for OSPFV2 and 126 OSPFV3. Router information (RI)LSA [I-D.ietf-ospf-rfc4970bis] can 127 have link-, area- or Autonomous Sytem (AS) level flooding scope. The 128 choice of what scope at which to flood the group tags is a matter of 129 local policy.It is expected that node administrative tag values will 130 not be portable across administrative domains. 132 The TLV specifies one or more administrative tag values. An OSPF 133 node advertises the set of groups it is part of in the OSPF domain 134 (for example, all PE-nodes are configured with certain tag value, all 135 P-nodes are configured with a different tag value in the domain). 136 Multiple TLVs MAY be added in same RI-LSA or in a different instance 137 of the RI LSA as defined in [I-D.ietf-ospf-rfc4970bis]. 139 3. OSPF per-node administrative tag TLV 141 3.1. TLV format 143 [I-D.ietf-ospf-rfc4970bis], defines Router Information (RI) LSA which 144 may be used to advertise properties of the originating router. The 145 payload of the RI LSA consists of one or more nested Type/Length/ 146 Value (TLV) triplets. Node administrative tags are advertised in the 147 Node Administrative Tag TLV. The format of the Node Administrative 148 Tag TLV is: 150 0 1 2 3 151 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 152 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 153 | Type | Length | 154 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 155 | Administrative Tag #1 | 156 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 157 | Administrative Tag #2 | 158 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 159 // // 160 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 161 | Administrative Tag #N | 162 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 164 Figure 1: OSPF per-node Administrative Tag TLV 166 Type : TBA, Suggested value 10 168 Length: A 16-bit field that indicates the length of the value portion 169 in octets and will be a multiple of 4 octets dependent on the number 170 of tags advertised. 172 Value: A sequence of multiple four octets defining the administrative 173 tags. At least one tag MUST be carried if this TLV is included in 174 the RI-LSA. 176 3.2. Elements of procedure 178 3.2.1. Interpretation of Node Administrative Tags 180 The meaning of the Node administrative tags is generally opaque to 181 OSPF. Routers advertising the per-node administrative tag (or tags) 182 may be configured to do so without knowing (or even without 183 supporting processing of) the functionality implied by the tag. This 184 section describes general rules/ regulations and guidelines for using 185 and interpreting an administrative tag which will facilitate 186 interoperable implementations by vendors. 188 Interpretation of tag values is specific to the administrative domain 189 of a particular network operator, and hence tag values SHOULD NOT be 190 propagated outside the administrative domain to which they apply. 191 The meaning of a per-node administrative tag is defined by the 192 network local policy and is controlled via the configuration. If a 193 receiving node does not understand the tag value or does not have a 194 local policy corresponding to the tag, it ignores the specific tag 195 and floods the RI LSA without any change as defined in 196 [I-D.ietf-ospf-rfc4970bis]. 198 The semantics of the tag order has no meaning. That is, there is no 199 implied meaning to the ordering of the tags that indicates a certain 200 operation or set of operations that need to be performed based on the 201 ordering. 203 Each tag must be treated as an independent identifier that may be 204 used in policy to perform a policy action. Each tag carried by the 205 administrative tag TLV should be used to indicate a characteristic of 206 a node that is independent of the characteristics indicated by other 207 administrative tags. The administrative tag list within the TLV MUST 208 be considered an unordered list. Whilst policies may be implemented 209 based on the presence of multiple tags (e.g., if tag A AND tag B are 210 present), they MUST NOT be reliant upon the order of the tags (i.e., 211 all policies should be considered commutative operations, such that 212 tag A preceding or following tag B does not change their outcome). 214 3.2.2. Use of Node Administrative Tags 216 The per-node administrative tags are not meant to be extended by 217 future OSPF standards. New OSPF extensions are not expected to 218 require use of per-node administrative tags or define well-known tag 219 values. Node administrative tags are for generic use and do not 220 require IANA registry. Future OSPF extensions requiring well known 221 values MAY define their own data signalling tailored to the needs of 222 the feature or MAY use the capability TLV as defined in 223 [I-D.ietf-ospf-rfc4970bis]. 225 Being part of the RI LSA, the per-node administrative tag TLV must be 226 reasonably small and stable. In particular, implementations 227 supporting per-node administrative tags MUST NOT be used to convey 228 attributes of the routing topology or associate tags with changes in 229 the network topology (both within and outside the OSPF domain) or 230 reachability of routes. 232 3.2.3. Processing Node Administrative Tag changes 234 Multiple node administrative tag TLVs MAY appear in an RI LSA or 235 multiple node administrative tag TLVs MAY be contained in different 236 instances of the RI LSA. The node administrative tags associated 237 with a node that originates tags for the purpose of any computation 238 or processing at a receiving node SHOULD be a superset of node 239 administrative tags from all the TLVs in all the received RI LSA 240 instances in the Link-State Database (LSDB) advertised by the 241 corresponding OSPF router. When an RI LSA is received that changes 242 the set of tags applicable to any originating node, which has 243 features depending on node administrative tags , a receiving node 244 MUST repeat any computation or processing that is based on those 245 administrative tags. 247 When there is a change or removal of an administrative affiliation of 248 a node, the node MUST re-originate the RI LSA with the latest set of 249 node administrative tags. On the receiver, When there is a change in 250 the node administrative tag TLV or removal/ addition of a TLV in any 251 instance of the RI-LSA, implementations MUST take appropriate 252 measures to update their state according to the changed set of tags. 253 The exact actions needed depend on features working with 254 administrative tags and is outside of scope of this specification. 256 4. Applications 258 This section lists several examples of how implementations might use 259 the per-node administrative tags. These examples are given only to 260 demonstrate the generic usefulness of the router tagging mechanism. 261 Implementations supporting this specification are not required to 262 implement any of these use cases. It is also worth noting that in 263 some described use cases routers configured to advertise tags help 264 other routers in their calculations but do not themselves implement 265 the same functionality. 267 4.1. Service auto-discovery 269 Router tagging may be used to automatically discover a group of 270 routers sharing a particular service. 272 For example, a service provider might desire to establish a full mesh 273 of MPLS TE tunnels between all PE routers in the area of the MPLS VPN 274 network. Marking all PE routers with a tag and configuring devices 275 with a policy to create MPLS TE tunnels to all other devices 276 advertising this tag will automate maintenance of the full mesh. 277 When new PE router is added to the area, all other PE devices will 278 open TE tunnels to it without the need of reconfiguring them. 280 4.2. Fast-Re-routing policy 282 Increased deployment of Loop Free Alternates (LFA) as defined in 283 [RFC5286] poses operation and management challenges. 284 [I-D.ietf-rtgwg-lfa-manageability] proposes policies which, when 285 implemented, will ease LFA operation concerns. 287 One of the proposed refinements is to be able to group the nodes in 288 an IGP domain with administrative tags and engineer the LFA based on 289 configured policies. 291 (a) Administrative limitation of LFA scope 293 Service provider access infrastructure is frequently designed in 294 a layered approach with each layer of devices serving different 295 purposes and thus having different hardware capabilities and 296 configured software features. When LFA repair paths are being 297 computed, it may be desirable to exclude devices from being 298 considered as LFA candidates based on their layer. 300 For example, if the access infrastructure is divided into the 301 Access, Distribution and Core layers it may be desirable for a 302 Distribution device to compute LFA only via Distribution or Core 303 devices but not via Access devices. This may be due to features 304 enabled on Access routers, due to capacity limitations or due to 305 the security requirements. Managing such a policy via 306 configuration of the router computing LFA is cumbersome and error 307 prone. 309 With the Node administrative tags it is possible to assign a tag 310 to each layer and implement LFA policy of computing LFA repair 311 paths only via neighbors which advertise the Core or Distribution 312 tag. This requires minimal per-node configuration and the 313 network automatically adapts when new links or routers are added. 315 (b) LFA calculation optimization 317 Calculation of LFA paths may require significant resources of the 318 router. One execution of Dijkstra's algorithm is required for 319 each neighbor eligible to become the next hop of repair paths. 320 Thus, a router with a few hundreds of neighbors may need to 321 execute the algorithm hundreds of times before the best (or even 322 valid) repair path is found. Manually excluding from the 323 calculation neighbors that are known to provide no valid LFA 324 (such as single-connected routers) may significantly reduce 325 number of Dijkstra algorithm runs. 327 LFA calculation policy may be configured so that routers 328 advertising certain tag value are excluded from LFA calculation 329 even if they are otherwise suitable. 331 4.3. Controlling Remote LFA tunnel termination 333 [RFC7490] defined a method of tunnelling traffic after connected link 334 failure to extend the basic LFA coverage and an algorithm to find 335 tunnel tail-end routers fitting LFA requirement. In most cases the 336 proposed algorithm finds more than one candidate tail-end router. In 337 real-life network it may be desirable to exclude some nodes from the 338 list of candidates based on the local policy. This may be either due 339 to known limitations of the node (the router does not accept the 340 targeted LDP sessions required to implement Remote LFA tunnelling) or 341 due to administrative requirements (for example, it may be desirable 342 to choose the tail-end router among co-located devices). 344 The Node administrative tag delivers a simple and scalable solution. 345 Remote LFA can be configured with a policy to accept during the tail- 346 end router calculation as candidates only routers advertising a 347 certain tag. Tagging routers allows to both exclude nodes not 348 capable of serving as Remote LFA tunnel tail-ends and to define a 349 region from which tail-end router must be selected. 351 4.4. Mobile back-haul network service deployment 353 Mobile back-haul networks usually adopt a ring topology to save fibre 354 resources; it is usually divided into the aggregate network and the 355 access network. Cell Site Gateways(CSGs) connects the eNodeBs and 356 RNC(Radio Network Controller) Site Gateways(RSGs) connects the RNCs. 357 The mobile traffic is transported from CSGs to RSGs. The network 358 takes a typical aggregate traffic model that more than one access 359 rings will attach to one pair of aggregate site gateways(ASGs) and 360 more than one aggregate rings will attach to one pair of RSGs. 362 ---------------- 363 / \ 364 / \ 365 / \ 366 +------+ +----+ Access +----+ 367 |eNodeB|---|CSG1| Ring 1 |ASG1|------------ 368 +------+ +----+ +----+ \ 369 \ / \ 370 \ / +----+ +---+ 371 \ +----+ |RSG1|----|RNC| 372 -------------| | Aggregate +----+ +---+ 373 |ASG2| Ring | 374 -------------| | +----+ +---+ 375 / +----+ |RSG2|----|RNC| 376 / \ +----+ +---+ 377 / \ / 378 +------+ +----+ Access +----+ / 379 |eNodeB|---|CSG2| Ring 2 |ASG3|----------- 380 +------+ +----+ +----+ 381 \ / 382 \ / 383 \ / 384 ----------------- 386 Figure 2: Mobile Backhaul Network 388 A typical mobile back-haul network with access rings and aggregate 389 links is shown in figure above. The mobile back-haul networks deploy 390 traffic engineering due to strict Service Level Agreements(SLA). The 391 Traffic Engineering(TE) paths may have additional constraints to 392 avoid passing via different access rings or to get completely 393 disjoint backup TE paths. The mobile back-haul networks towards the 394 access side change frequently due to the growing mobile traffic and 395 addition of new LTE Evolved NodeBs (eNodeB). It's complex to satisfy 396 the requirements using cost, link color or explicit path 397 configurations. The node administrative tag defined in this document 398 can be effectively used to solve the problem for mobile back-haul 399 networks. The nodes in different rings can be assigned with specific 400 tags. TE path computation can be enhanced to consider additional 401 constraints based on node administrative tags. 403 4.5. Explicit routing policy 405 A partially meshed network provides multiple paths between any two 406 nodes in the network. In a data centre environment, the topology is 407 usually highly symmetric with many/all paths having equal cost. In a 408 long distance network, this is usually less the case, for a variety 409 of reasons (e.g. historic, fibre availability constraints, different 410 distances between transit nodes, different roles ...). Hence between 411 a given source and destination, a path is typically preferred over 412 the others, while between the same source and another destination, a 413 different path may be preferred. 415 +----------------------+ +----------------+ 416 | \ / | 417 | +-----------------+ x +---------+ | 418 | | \/ \/ | | 419 | | +-T-10-T | | 420 | | / | /| | | 421 | | / 100 / | | | 422 | | / | | 100 | | 423 | | / +-+-+ | | | 424 | | / / | | | | 425 | | / / R-18-R | | 426 | | 10 10 /\ /\ | | 427 | | / / / \ / \ | | 428 | | / / / x \ | | 429 | | / / 10 10 \ \ | | 430 | | / / / / 10 10 | | 431 | | / / / / \ \ | | 432 | | A-25-A A-25-A A-25-A | | 433 | | | | \ \ / / | | 434 | | | | 201 201 201 201 | | 435 | | | | \ \ / / | | 436 | | 201 201 \ x / | | 437 | | | | \ / \ / | | 438 | | | | \/ \/ | | 439 | | I-24-I I-24-I 100 100 440 | | / / | | | | 441 | +-+ / | +-----------+ | 442 +---------+ +---------------------+ 444 Figure 3: Explicit Routing topology 446 In the above topology, operator may want to enforce the following 447 high level explicit routing policies: 449 - Traffic from A nodes to A nodes should preferably go through R 450 or T nodes (rather than through I nodes); 452 - Traffic from A nodes to I nodes must not go through R and T 453 nodes. 455 With node admin tags, tag A (resp. I, R, T) can be configured on all 456 A (resp. I, R, T) nodes to advertise their role. The first policy 457 is about preferring one path over another. Given the chosen metrics, 458 it is achieved with regular SPF routing. The second policy is about 459 prohibiting (pruning) some paths. It requires an explicit routing 460 policy. With the use of node tags, this may be achieved with a 461 generic CSPF policy configured on A nodes: for destination nodes 462 having the tag "A" runs a CSPF with the exclusion of nodes having the 463 tag "I". 465 5. Security Considerations 467 Node administrative tags may be used by operators to indicate 468 geographical location or other sensitive information. As indicated 469 in [RFC2328] and [RFC5340] OSPF authentication mechanisms do not 470 provide confidentiality and the information carried in node 471 administrative tags could be leaked to an IGP snooper. 472 Confidentiality for the OSPF control packets can be achieved by 473 either running OSPF on top of IP Security (IPSEC) tunnels or by 474 applying IPSEC based security mechanisms as described in [RFC4552]. 476 Advertisement of tag values for one administrative domain into 477 another risks misinterpretation of the tag values (if the two domains 478 have assigned different meanings to the same values), which may have 479 undesirable and unanticipated side effects. 481 [RFC4593] and [RFC6863] discuss the generic threats to routing 482 protocols and OSPF respectively. These security threats are also 483 applicable to the mechanisms described in this document.OSPF 484 authentication described in [RFC2328] and [RFC5340] or extended 485 authentication mechanisms described in [RFC7474] or [RFC7166] SHOULD 486 be used in deployments where attackers have access to the physical 487 networks and nodes included in the OSPF domain are vulnerable. 489 6. Operational Considerations 491 Operators can assign meaning to the node administrative tags which is 492 local to the operator's administrative domain. The operational use 493 of node administrative tags is analogical to the IS-IS prefix tags 494 [RFC5130] and BGP communities [RFC1997]. Operational discipline and 495 procedures followed in configuring and using BGP communities and ISIS 496 Prefix tags is also applicable to the usage of node administrative 497 tags. 499 Defining language for local policies is outside the scope of this 500 document. As in case of other policy applications, the pruning 501 policies can cause the path to be completely removed from forwarding 502 plane, and hence have the potential for more severe operational 503 impact (e.g., node unreachability due to path removal) by comparison 504 to preference policies that only affect path selection. 506 7. Manageability Considerations 508 Node administrative tags are configured and managed using routing 509 policy enhancements. YANG data definition language is the latest 510 model to describe and define configuration for network devices. OSPF 511 YANG data model is described in [I-D.ietf-ospf-yang] and routing 512 policy configuration model is described in 513 [I-D.ietf-rtgwg-policy-model]. These two documents will be enhanced 514 to include the node administrative tag related configurations. 516 8. IANA Considerations 518 This specification updates one OSPF registry: OSPF Router Information 519 (RI) TLVs Registry 521 i) Node Admin Tag TLV - Suggested value 10 523 ** RFC Editor**: Please replace above suggested value with the IANA- 524 assigned value. 526 9. Contributors 528 Thanks to Hannes Gredler for his substantial review,guidance and to 529 the editing of this document. Thanks to Harish Raguveer for his 530 contributions to initial versions of the draft. 532 10. Acknowledgements 534 Thanks to Bharath R, Pushpasis Sarakar and Dhruv Dhody for useful 535 inputs. Thanks to Chris Bowers for providing useful inputs to remove 536 ambiguity related to tag-ordering. Thanks to Les Ginsberg and Acee 537 Lindem for the inputs. Thanks to David Black for careful review and 538 valuable suggestions for the document especially for the operations 539 section. 541 11. References 543 11.1. Normative References 545 [I-D.ietf-ospf-rfc4970bis] 546 Lindem, A., Shen, N., Vasseur, J., Aggarwal, R., and S. 547 Shaffer, "Extensions to OSPF for Advertising Optional 548 Router Capabilities", draft-ietf-ospf-rfc4970bis-07 (work 549 in progress), October 2015. 551 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 552 Requirement Levels", BCP 14, RFC 2119, 553 DOI 10.17487/RFC2119, March 1997, 554 . 556 [RFC2328] Moy, J., "OSPF Version 2", STD 54, RFC 2328, 557 DOI 10.17487/RFC2328, April 1998, 558 . 560 [RFC4970] Lindem, A., Ed., Shen, N., Vasseur, JP., Aggarwal, R., and 561 S. Shaffer, "Extensions to OSPF for Advertising Optional 562 Router Capabilities", RFC 4970, DOI 10.17487/RFC4970, July 563 2007, . 565 [RFC5340] Coltun, R., Ferguson, D., Moy, J., and A. Lindem, "OSPF 566 for IPv6", RFC 5340, DOI 10.17487/RFC5340, July 2008, 567 . 569 [RFC7490] Bryant, S., Filsfils, C., Previdi, S., Shand, M., and N. 570 So, "Remote Loop-Free Alternate (LFA) Fast Reroute (FRR)", 571 RFC 7490, DOI 10.17487/RFC7490, April 2015, 572 . 574 11.2. Informative References 576 [I-D.ietf-ospf-yang] 577 Yeung, D., Qu, Y., Zhang, J., Bogdanovic, D., and K. 578 Koushik, "Yang Data Model for OSPF Protocol", draft-ietf- 579 ospf-yang-03 (work in progress), October 2015. 581 [I-D.ietf-rtgwg-lfa-manageability] 582 Litkowski, S., Decraene, B., Filsfils, C., Raza, K., 583 Horneffer, M., and P. Sarkar, "Operational management of 584 Loop Free Alternates", draft-ietf-rtgwg-lfa- 585 manageability-11 (work in progress), June 2015. 587 [I-D.ietf-rtgwg-policy-model] 588 Shaikh, A., rjs@rob.sh, r., D'Souza, K., and C. Chase, 589 "Routing Policy Configuration Model for Service Provider 590 Networks", draft-ietf-rtgwg-policy-model-00 (work in 591 progress), September 2015. 593 [RFC1997] Chandra, R., Traina, P., and T. Li, "BGP Communities 594 Attribute", RFC 1997, DOI 10.17487/RFC1997, August 1996, 595 . 597 [RFC4552] Gupta, M. and N. Melam, "Authentication/Confidentiality 598 for OSPFv3", RFC 4552, DOI 10.17487/RFC4552, June 2006, 599 . 601 [RFC4593] Barbir, A., Murphy, S., and Y. Yang, "Generic Threats to 602 Routing Protocols", RFC 4593, DOI 10.17487/RFC4593, 603 October 2006, . 605 [RFC5130] Previdi, S., Shand, M., Ed., and C. Martin, "A Policy 606 Control Mechanism in IS-IS Using Administrative Tags", 607 RFC 5130, DOI 10.17487/RFC5130, February 2008, 608 . 610 [RFC5286] Atlas, A., Ed. and A. Zinin, Ed., "Basic Specification for 611 IP Fast Reroute: Loop-Free Alternates", RFC 5286, 612 DOI 10.17487/RFC5286, September 2008, 613 . 615 [RFC6863] Hartman, S. and D. Zhang, "Analysis of OSPF Security 616 According to the Keying and Authentication for Routing 617 Protocols (KARP) Design Guide", RFC 6863, 618 DOI 10.17487/RFC6863, March 2013, 619 . 621 [RFC7166] Bhatia, M., Manral, V., and A. Lindem, "Supporting 622 Authentication Trailer for OSPFv3", RFC 7166, 623 DOI 10.17487/RFC7166, March 2014, 624 . 626 [RFC7474] Bhatia, M., Hartman, S., Zhang, D., and A. Lindem, Ed., 627 "Security Extension for OSPFv2 When Using Manual Key 628 Management", RFC 7474, DOI 10.17487/RFC7474, April 2015, 629 . 631 Authors' Addresses 633 Shraddha Hegde 634 Juniper Networks, Inc. 635 Embassy Business Park 636 Bangalore, KA 560093 637 India 639 Email: shraddha@juniper.net 640 Rob Shakir 641 Individual 643 Email: rjs@rob.sh 645 Anton Smirnov 646 Cisco Systems, Inc. 647 De Kleetlaan 6a 648 Diegem 1831 649 Belgium 651 Email: as@cisco.com 653 Li zhenbin 654 Huawei Technologies 655 Huawei Bld. No.156 Beiqing Rd 656 Beijing 100095 657 China 659 Email: lizhenbin@huawei.com 661 Bruno Decraene 662 Orange 664 Email: bruno.decraene@orange.com