Network Working Group P. Srisuresh INTERNET-DRAFT Kuokoa Networks Expires as ofMarch 16,June 8, 2003 P. Joseph Force10 NetworksSeptember 16,December 8, 2002TE LSAsOSPF-TE: An experimental extension toextendOSPF for Traffic Engineering<draft-srisuresh-ospf-te-03.txt><draft-srisuresh-ospf-te-04.txt> Status of this Memo This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet- Drafts. 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." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. AbstractOSPF is a link stateThis document defines OSPF-TE, an experimental traffic engineering (TE) extension to the link-state routing protocolused for IP-network topology discovery and collection and dissemination of link access metrics. The resulting Link State Database (LSDB) is used to compute IP address forwarding table based on shortest-path criteria. Traffic Engineering extensions(OSPF-TE) outlined in this documentOSPF. New TE LSAs arebuilt on the native OSPF foundation, utilizing new LSAs,designedspecifically for TE. OSPF-TE sets outtodiscover TE network topology and perform collection and dissemination ofdisseminate TE metrics withinthean autonomous System (AS) - intra-area as well as inter-area. An Autonomous System may consist of TEnetwork. This results inand non-TE nodes. Non-TE nodes are uneffected by thegeneration of an independent TE-LSDB, that would permit computationdistribution of TEcircuit paths. UnlikeLSAs. A stand-alone TE Link State Database (TE-LSDB), separate from the native OSPFlink metrics, TE metrics can be rapidly changing and varied across different elements ofLSDB, is generated for thenetwork.computation of TE circuitpaths are computed using varied TE criteria, often different from the shortest-path, to route traffic around congestionpaths.Principal motivations to designing theOSPF-TEover [OPQLSA-TE]is also extendible to non-packet networks such as SONET/TDM and optical networks. A transition path is provided forvendorsthose currently using [OPQLSA-TE] and wish to adaptthe OSPF-TE are outlined in separate sections within the document. OSPF-TE provides a single unified mechanism for traffic engineering across packet and non-packet networks, and may be adapted for a peer networking model.OSPF-TE. Table of Contents 1. Introduction ................................................3 2.Traffic Engineering .........................................4Principles of traffic engineering ...........................3 3. Terminology .................................................5 3.1.OSPF-TETE node...........................................5................................................5 3.2.Native OSPF node .......................................5TE link ................................................5 3.3. TEnodes vs. native(non-TE) nodes ......................6circuit path ........................................5 3.4.TE links vs. native(non-TE) links ......................6OSPF-TE node ...........................................6 3.5.Packet-TE network vs. non-packet-TETE control network............6.....................................6 3.6. TEtopology vs. non-TE topology ........................6network (TE topology) ...............................6 3.7.TLV ....................................................7Packet-TE network ......................................6 3.8. Non-packet-TE network ..................................6 3.9. Native (non-TE) node ...................................7 3.10. Native (non-TE) link ..................................7 3.11. Non-TE network (Non-TE topology) ......................7 3.12. Peer network (combination network) ....................7 3.13. LSP ...................................................7 3.14. LSA ...................................................7 3.14. LSDB ..................................................7 3.15. CSPF ..................................................7 3.16. TLV ...................................................8 3.17. Router-TE TLVs.........................................7 3.9.........................................8 3.18. Link-TE TLVs...........................................7..........................................8 4. Motivationsto designingbehind the design of OSPF-TEusing TE-LSAs ..........7....................8 4.1.CleanScalable design- TE-LSDB, independent of the native LSDB .7........................................9 4.2.ExtendibleCoexistent design- based on the OSPF foundation .......8......................................9 4.3.Scalable design - TE-AS may be sub-divided into areas ..9Efficient in flooding reach ............................9 4.4.UnifiedAbility to reserve TE-exclusive links .................10 4.5. Extendible design-.....................................10 4.6. Unified for packet and non-packet networks....9 4.5. Efficient design - in LSA content and flooding reach ..10 4.6. SLA enforceable TE network can coexist with IP network 10............11 4.7.Right Framework for future OSPF extensibility .........11 4.8. Network scenariosNetworks benefiting from the OSPF-TE design..12 4.8.1. IP providers transitioning to TE services ......12 4.8.2. Providers offering Best-effort IP & TE services.12 4.8.3. Multi-area networks ............................12 4.8.4. Non-packet and Peer-networking models ..........12...........11 5. OSPF-TEsolution, assumptions and limitations ..............13solution overview ..................................12 5.1. OSPF-TE Solution......................................14......................................12 5.2. Assumptions...........................................16 5.3. Limitations ...........................................16...........................................13 6.Transition strategy for implementations usingOpaque LSAs..16to OSPF-TE transition strategy .................14 7. OSPF-TE router adjacency - TE topology discovery ...........14 7.1. The OSPF Options field.....................................16 8. Bringing up TE adjacencies; TE vs. Non-TE topologies .......17 8.1.................................15 7.2. The Hello Protocol....................................17 8.2.....................................15 7.3. Flooding and the Synchronization of Databases.........18 8.3..........16 7.4. The Designated Router.................................19 8.4..................................16 7.5. The Backup Designated Router..........................19 8.5...........................16 7.6. The graph of adjacencies..............................19 9...............................17 8. TE LSAs....................................................20 9.1.- Packet network ...................................18 8.1. TE-Router LSA (0x81)..................................22 9.1.1. Router-TE flags - TE capabilities of the router.24 9.1.2. Router-TE TLVs .................................25 9.1.3. Link-TE options - TE capabilities of a TE-link .26 9.1.4. Link-TE TLVs ...................................26 9.2...................................19 8.2. TE-incremental-link-Update LSA (0x8d).................27 9.3..................26 8.3. TE-Circuit-paths LSA (0x8C)...........................29 9.4............................27 8.4. TE-Summary LSAs.......................................31 9.4.1. TE-Summary Network LSA (0x83) ..................31 9.4.2. TE-Summary router LSA (0x84) ...................32 9.5........................................30 8.5. TE-AS-external LSAs (0x85)............................34 9.6.............................33 9. TE LSAs - Non-packet network ...............................34 9.1. TE-Router LSA (0x81) ..................................34 9.2. Changes to Network LSA................................35 9.6.1. Positional-Ring type network LSA ...............36 9.7.................................36 9.3. TE-Router-Proxy LSA (0x8e) ............................369.8. Others ................................................3710. Abstract topology representation with TE support ...........37 11. Changes to Data structures in OSPF-TE routers..............39..............40 11.1. Changes to Router data structure.....................39.....................40 11.2. Two set of Neighbors.................................39.................................40 11.3. Changes to Interface data structure..................39..................40 12. IANA Considerations........................................40........................................41 12.1.TE-compliant-SPF routers Multicast address allocation 40TE LSA type values ...................................41 12.2.New TE-LSA Types .....................................40 12.3. New TLVs (Router-TE and Link-TE TLVs) ................40 12.3.1. TE-selection-Criteria TLV (Tag ID = 1) .......40 12.3.2. MPLS-Signaling protocol TLV (Tag ID = 3) .....40 12.3.3. Constraint-SPF algorithms-SupportTE TLV(Tag ID=4) 12.3.4. SRLG-TLV (Tag ID = 0x81) .....................40 12.3.5. BW-TLV (Tag ID = 0x82) .......................41 12.3.6. CO-TLV (Tag ID = ox83) .......................41tag values ....................................42 13. Acknowledgements...........................................41...........................................42 14. Security Considerations....................................41....................................42 15. Normative References .......................................44 16. Informative References.....................................................41.....................................44 1. IntroductionThere is substantial industry experience with deploying OSPF link state routing protocol. That makes OSPF a good candidate to adapt forThis document defines OSPF-TE, an experimental traffic engineeringpurposes. The dynamic discovery of network topology, link access metrics, flooding algorithm and(TE) extension to thehierarchical organization of areas can all be used effectively in creating and tearing traffic links on demand.link-state routing protocol OSPF. Theintentobjective of OSPF-TE is to discover TE network topology andthedisseminate TE metricsof the nodes and links inwithin an autonomous system(AS). A stand-alone TE Link State Database (TE-LSDB), different from thenetwork. The objective of traffic engineeringnative OSPF LSDB, is created toset up circuit path(s) across a pairfacilitate computation ofnodes or links, as the case may be, so asTE circuit paths. Algorithms toforward traffic of a certain forwarding equivalency class. Circuit emulation in a packet network is accomplished by each MPLS intermediary node performing label swapping. Whereas,compute TE circuitemulation in a TDM or Fiber cross-connect networkpaths isaccomplished by configuring the switch fabric in each intermediary node to do the appropriate switching (TDM, fiber or Lamda) for the duration ofhowever not thecircuit. Theobjective of thisdocument is not how to set up traffic circuits, but rather provide the necessary TE parameters for the nodes and links that constitute the TE topology. Unlike the native OSPF,document. OSPF-TEwill be used to build circuit paths, meeting certain TE criteria. The only requirement is that end-nodes and/or end-links of a circuit be identifiable with an IP address. The approach suggested in this documentis different from the Opaque-LSA-basedapproachdesign outlined in [OPQLSA-TE]. Section 4 describes the motivations behinddesigningthe design of OSPF-TE. Section 6 outlines a strategy to transition Opaque-LSA based implementations to adapt OSPF-TE. Those interested in TE extensions for theOSPF-TE outlined here.packet networks only may skip section 9.0. 2.TrafficPrinciples of traffic engineeringoverviewThe objective of traffic engineering is to set up circuit path(s) between a pair of nodes or links and to forward traffic of a certain forwarding equivalency class through the circuit path. Only the unicast circuit paths are considered here. Multicast variations are out of scope for this document. A traffic engineered circuit path may be identified by the tuple of (Forwarding Equivalency Class, TE parameters for the circuit, Origin Node/Link, Destination node/Link).TheForwarding EquivalencyClass(FEC)Class (FEC) is a grouping of traffic that is forwarded in the same manner by a node. A FEC may beconstituted ofclassified based on a number of criteriasuchas(a)follows. a) Traffic arriving on a specific interface,(b)b) Traffic arriving at a certain time of day, c) Traffic meeting a certain classification criteria (ex: based on a match of the fields in the IP and transport headers),(c)d) Traffic in a certain priority class,(d)e) Traffic arriving on a specific set of TDM (STS) circuits on an interface,(e)f) Traffic arriving on a certainwave-lengthwavelength of aninterface, (f) Traffic arriving at a certain time of day, and so on. A FEC may be constituted as a combination of one or more of the above criteria.interface Discerning traffic based on the FEC criteria isamandatoryrequirement onfor Label Edge Routers (LERs).Traffic content is transparent to the IntermediateThe intermediate Label Switched Routers(LSRs), once a circuit is formed.(LSRs) are transparent to the traffic content. LSRs aresimplymerely responsible for keeping the circuit in-tact for thelifetime of the circuit(s). As such, thiscircuit lifetime. This document will not address defining FEC criteria, or the mapping of a FEC to circuit, or the associated signaling tosetupset up circuits. [MPLS-TE] and [GMPLS-TE] address the FEC criteria.Whereas,[RSVP-TE] and [CR-LDP] addressdifferent types ofsignalingprotocols.protocols to set up circuits. This document is concerned with the collection of TEparametersmetrics for all the TE enforceable nodes and links within an autonomous system. TEparametersmetrics for a node may include the following. a)abilityAbility to perform traffic prioritization, b)abilityAbility to provision bandwidth on interfaces, c)supportSupport forzero or more CSPFConstrained Shortest Path First (CSPF) algorithms, d)supportSupport fora specificcertain TE-Circuit switch type, e)supportSupport for a certain type of automatic protection switchingand so forth.TEparametersmetrics for a link may include the following. a)availableAvailable bandwidth, b)reliabilityReliability of the link, c)colorColor assigned to the link, d)costCost of bandwidth usage on the link,ande)membershipMembership to a Shared Risk Link Group (SRLG)and so forth. Only the unicast pathsA number of CSPF algorithms may be used to dynamically set up TE circuit pathsare considered here. Multicast variations are currently considered out of scopein a TE network. As forthis document. The requirement is thatorigin node/link and destination node/link, the originatingas well asand the terminating entities of a TE circuit path are identifiable by their IPaddress.addresses. 3. Terminology Definitionsfor majorityoftheterms used inthis document with regard tothe context of the OSPF protocol may be found in [OSPF-V2]. MPLS and traffic engineering terms may be found in [MPLS-ARCH]. RSVP-TE and CR-LDP signaling specific terms may be found in [RSVP-TE] and [CR-LDP] respectively. The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALLNOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described inRFC 2119.[IETF-STD]. Below are definitions for the terms used within this document. 3.1.OSPF-TETE nodeThisTE-Node is arouter that supports the OSPF-TE described in this document. At least one of the attached links for the node supports IP packet termination and runs the OSPF-TE protocol. An OSPF-TEnodesupports native OSPF as well asin theOSPF-TE. 3.2. Native OSPF nodetraffic engineered (TE) network. Anative OSPF node is an OSPF router that does not support the TE extensions described in this document or does not haveTE-node has aTE linkminimum of one TE-link attached to it.A Native OSPF node forwards IP traffic, using the shortest-path forwarding algorithm. A native OSPFAssociated with each TE nodemay be enhanced to be an OSPF-TE node. An autonomous system (AS) could be constituted ofis acombinationset ofnative-OSPF and OSPF-TE nodes. 3.3.supported TEnodes vs. native(non-TE) nodesmetrics. ATE-Node is an intermediate or edgeTE nodetaking partmay also participate inthe traffic engineered (TE) network. A TE-circuit is constituted ofaseries of TE nodes connected to each other through TE links.native IP network. In a SONET/TDMnetworkoraphotonic cross-connect network, a TE node is not required tosupport OSPF-TE.be an OSPF-TE router. An external OSPF-TEnoderouter mayrepresentact as proxy for the TEnodenodes that cannot be routers themselves. 3.2. TE link TE Link is a network attachment point to a TE-node and is intended forprotocol processing. A native (or non-TE) nodetraffic engineering use. Associated with each TE link isan IP router capablea set ofIP packet forwarding, does not havesupported TE metrics. A TE linkattachments and does notmay also optionally carry native IP traffic. Of the various links attached to a TE-node, only the links that take part in a traffic engineered network are called the TEnetwork. 3.4.links. 3.3. TElinks vs. native(non-TE) linkscircuit path A TELinkcircuit path is anetwork attachment that supports traffic engineering. A TE-circuit is constituted ofuni-directional data path, defined by aserieslist of TE nodes connected to each other through TE links. Anative (or non-TE) link is one thatTE circuit path isused for IP packet traversal. A link mayalso often referred merely as a circuit path or a circuit. For the purposes of OSPF-TE, the originating and terminating entities of a TE circuit path must beconfiguredidentifiable by their IP addresses. As a general rule, all nodes and links party to a Traffic Engineered network should bepureuniquely identifiable by an IP address. 3.4. OSPF-TE node An OSPF-TE node is a TElink ornode that runs the OSPF routing protocol and the OSPF-TE extensions described in this document. An autonomous system (AS) may be constituted of a combination of nativelinkand OSPF-TE nodes. 3.5. TE Control network The IP network used by the OSPF-TE nodes for OSPF-TE communication is referred as the TE control network or simply the control network. The control network can be independent of the TE data network. 3.6. TE network (TE topology) A TE network is aboth. 3.5. Packet-TEnetworkvs. non-packet-TEof connected TE-nodes and TE-links for the purpose of setting up one or more TE circuit paths. The terms TE network, TE data network and TE topology are used synonymously throughout the document. 3.7. Packet-TE network A packet-TE network isonea TE network in whichTE-circuit emulationthe nodes switch MPLS packets. An MPLS packet isaccomplished by eachdefined in [MPLS-TE] as a packet with an MPLS header, followed by data octets. The intermediarynode performingnode(s) of a circuit path in a packet-TE network perform MPLS label swappingonto emulate the circuit. Unless specified otherwise, the term packetdata.network is used throughout the document to refer a packet-TE network. 3.8. Non-packet-TEnetwork,network A non-packet-TE network is TE-network in which the nodes switch non-packet entities such asSONET/TDMan STS time slot, a Lambda wavelength or simply an interface. SONET/TDM and Fiber cross-connectnetwork is one in which TE-circuitnetworks are examples of non-packet-TE networks. Circuit emulation in these networks is accomplished byconfiguringthe switch fabric ineach intermediary node to dotheappropriate switching (TDM,intermediary nodes (based on TDM time slot, fiber interface orLamda) forLambda). Unless specified otherwise, thedurationterm non-packet network is used throughout the document to refer a non-packet-TE network. 3.9. Native (non-TE) node A native or non-TE node is an OSPF router capable of IP packet forwarding and does not take part in a TE network. A native OSPF node forwards IP traffic using the shortest-path forwarding algorithm and does not run thecircuit. In either case,OSPF-TEcan only be enabled on interfaces supportingextensions. 3.10. Native (non-TE) link A native (or non-TE) link is a network attachment to a TE or non-TE node used for IP packettermination. Interfaces supportingtraversal. 3.11. non-TE network (Non-TE topology) A non-TE network refers to an OSPFand/or OSPF-TE constitutenetwork that does not support TE. Non-TE network, native-OSPF network and non-TE topology are used synonymously throughout theOSPF control network. The OSPF controldocument. 3.12. Peer networkcan be independent(combination network) A peer network is a network that is constituted of packet and non-packet networks combined. In a peer network, a TE node could potentially support TE links for the packet as well as non-packet data. OSPF-TE is usable within a packet network or a non-packetdatanetwork or a peer network, which is a combination of the two. 3.13. LSP LSP stands for "Label Switched Path". LSP is a TE circuit path in a packet network.3.6.The terms LSP and TE circuit path are used synonymously in the context of packet networks. 3.14. LSA LSA stands for OSPF "Link State Advertisement". 3.15. LSDB LSDB stands for "LSA Database". LSDB is a representation of the topologyvs. non-TE topologyof a network. ATE topology isnative LSDB, constituted of native OSPF LSAs, represents the topology of asetnative IP network. TE-LSDB, on the other hand, is constituted ofcontiguousTEnodesLSAs and is a representation of the TElinks. Associated with eachnetwork topology. 3.16. CSPF CSPF stands for "Constrained Shortest Path First". Given a TEnodeLSDB andlink isa set ofTE criteriaconstraints thatmaymust besupported at any given time. A TE topology allows circuitssatisfied tobe overlayed statically or dynamically based onform aspecific TE criteria. A non-TE topology specifically refers to the network that does not support TE. Control protocols such as OSPFcircuit path, there may berun on the non-TE topology. IP forwarding table usedseveral CSPF algorithms toforward IP packets on this network is built based onobtain a TE circuit path that meets thecontrol protocol specific algorithm, such as OSPF shortest-pathcriteria.3.7.3.17. TLV A TLV stands for an object in the form of Tag-Length-Value. All TLVs are assumed to be of the following format, unless specified otherwise. The Tag and length are 16 bits wide each. The length includes the 4bytesoctets required for Tag and Length specification. All TLVs described in this document are padded to 32-bit alignment. Any padding required for alignment will not be a part of the length field, however. TLVs are used to describe traffic engineering characteristics of the TE nodes, TE links and TE circuit paths. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag | Length (4 or more) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Value .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+3.8.3.18. Router-TE TLVs TLVs used to describe the TE capabilities of a TE-node.3.9.3.19. Link-TE TLVs TLVs used to describe the TE capabilities of a TE-link. 4. Motivationsto designing the OSPF-TE using TE-LSAs The motivationbehinddesigningthe design of OSPF-TEusing TE-LSAs isThere are several motivations that lead to theapproachdesign of OSPF-TE. OSPF-TE isclean, extendible,scalable,unified, efficient,coexistent andSLA enforceable.efficient in flooding reach. Theapproach also provides the right framework for future OSPF extensibility. Each of thesemotivationsisare explained in detail in the following subsections.TheAlso listed in the last subsectionlistsare network scenarios that benefit from theTE-LSAOSPF-TE design. 4.1.CleanScalable design- TE-LSDB, independent of the native LSDB OSPF-TE using TE LSAsArea level abstraction providesa clean separation of Link State Data Bases (LSDB) between native (SPF-based) and TE networks. The OSPF-TE dynamically discovers TE network topology and the associated TE metrics of the nodes and links intheTE network. OSPF-TE design is based on the tried and tested OSPF paradigm. As such, it inherits all the benefits of the OSPF, present and future. With OSPF-TE, native OSPF nodes will keep just the native OSPF link state database. The OSPF-TE nodes will keep the native as well as the TE LSDB. In the case, where the network is used onlyscaling necessary forTraffic engineering purposes, the native-LSDB describes the control topology. In the Opaque-LSA-based TE scheme([OPQLSA-TE]), the TE-LSDB built using opaque LSAs refers the native LSDB to build the TE topology. Further, the LSDB has no knowledge of the TE capabilities of the routers. Point-to-point links are the only type of links that can formaTE network. It is apparent that [OPQLSA-TE] is a new protocol in itself within the constraints of an Opaque-LSA and is not tailored to benefit from the tried and tested native-OSPF. 4.2. Extendible design - based on the OSPF foundation TE LSAs are extendible, just as the native OSPF on whichlarge autonomous system (AS). OSPF-TEis founded. [OPQLSA-TE], on the other hand, is not extendible and is constrained by the Opaque LSA on which it is founded. For example, Opaque LSAs are not suited to advertising summary LSAs along a restricted flooding scope (as with TE-Summary network LSA). Opaque LSAs are also not suited to advertising incremental TLV changes. A change in any TLV of a TE-link will mandate the entire Opaque-LSA (with all the TLVs included) to be transmitted. TE-incremental-link-update LSA, on the other hand, is capable of advertising just the delta TLVs. Opaque LSAs are also not extendible to support advertisement of TLVs for non-members of the OSPF control network. This is a necessity for certain non-packet networks such as a SONET/TDM network. In a SONET/TDM network, data-path topology often differs from its OSPF control network counterpart. TE-Router-Proxy-LSA (section 9.7) permits advertising LSAs for non-members via a proxy node that is a member of the control network. Lastly, the expressibility of data in an Opaque LSA is strictly restricted to being in the form of TLVs and sub-TLVs, some mandatorily required and some positionally dependent in the TLV sequenceallows forinterpretation. 4.3. Scalable design - TE-AS may be sub-divided into areas OSPF-TE using TE LSAs inherits the hierarchicalindependent areaorganization used within native-OSPF. Without revealing the nodes and characteristics of the attached links within a TE-area, the TE-Summary network LSA (refer section 9.4) advertisesabstractions for thereachability ofTEnetworks within an area to the areas outside in the same AS. Providing area level abstractionandhaving the abstraction be distinct fornative topologies. The TE and nativetopologies is a necessity for inter-area communication. When the topologies are separate, thearea border routerscanwill advertise different summary LSAs to TE and non-TE routers.For example, a native Area Border router (ABR) simply announces the shortest path network summary LSAs (LSA type 3) for nodes outside the area. A TE-ABR, on the other hand, would use TE-summary network LSA to advertise network Reachability information - not aggregated path metric as requiredReaders may refer section 10 for anative OSPF LSDB. Clearly, the data content and flooding scope should be different fortopological view of theTE nodes. The flooding boundary for TE-summary LSAs would be (AS - OriginatingArea - StubAreas - NSSAs). Opaque-LSA-based TE scheme([OPQLSA-TE]) is restricted for use withinAS from anarea and is not applicable for flooding across areas. As-wide scope Opaque LSAs (Type 11 LSAs) will be unable to restrict floodingOSPF-TE node inits own originatingan area.4.4. Unified4.2. Coexistent design- for packetOSPF-TE regards an AS as constituted of a TE andnon-packetnon-TE networksOSPF-TE usescoexisting within the sameset of TE LSAs for disseminatingbounds. OSPF-TE dynamically discovers TEcharacteristics - irrespective of whethertopology and thenetwork is a packet network or a non-packet network or a combinationassociated TE metrics ofboth. OnlytheTLVs used to describe the characteristics will vary. Each TE node will be required to advertise its own TE capabilitiesnodes andthatlinks within, just as the native OSPF does in a non-TE network. An independent TE-LSDB, representative of theattachedTElinks. Intopology is generated as apeer networking TE model,result. A stand-alone TE-LSDB allows for speedy searches through theTE nodes are heterogeneous and have different TE characteristics. As such,database. In [OPQLSA-TE], thesignaling protocols will needTE-LSDB is derived from theTE characteristicscombination ofall nodesopaque LSAs andattached links so they can signal the nodes to formulate TE circuits across heterogeneous nodes.native LSDB. Theunderlying control protocol must be capableTE-LSDB derived has no knowledge ofproviding a unified LSDB for all nodes inthenetwork. OSPF-TE clearly meets this requirement. Opaque-LSA-basedTEscheme([OPQLSA-TE]) is limited in scope for packet networks. Extensions ([OPQLSA-GMPLS]) are underway to support GMPLS links within opaque LSAs. However, neither [OPQLSA-TE] nor [OPQLSA-GMPLS] is sufficient by itself or when combined for use within a peer networking model with heterogeneous nodes. Neithercapabilities of theOpaque LSA based extensions have provision to distinguish betweenrouters in thevarious nodes and link attachments that are different from point-to-point connections. SONET specific ring topologies and packet network specific LAN and other mesh topologies are not permitted. 4.5.network. 4.3. Efficientdesign -inLSA content andflooding reach OSPF-TE is capable of identifying the boundaries of a TE topology and limits the flooding of TE LSAs to only the TE-nodes.Nodes that do not have TE link attachmentsNon-TE nodes are not bombarded with TEspecificLSAs. This is a useful characteristic for networks supporting native and TE traffic in the same connected network. A subset of the TE metrics may be prone to rapid change, while others remain largely unchanged. Changes in TE metrics must be communicated at the earliest throughout the network to ensure that the TE-LSDB is up-to-date within the network. As a general rule, a TE network is likely to generate significantly more control traffic than a native OSPF network. The excess traffic is almost directly proportional to the rate at which TE circuits are set up and torn down within the TE network. The TE database synchronization should occur much quicker compared to the aggregate circuit set up and tear-down rates. TE-Incremental-Link-update LSA (section 8.2) permits advertising a subset of the link metrics. The more frequent and wider the floodingscope,frequency, the larger the number of retransmissions and acknowledgements. The same information (needed or not) may reach a router through multiple links. Even if the router did not forward the information past the node, it would still have to send acknowledgements across all the various links on which the LSAs tried to converge.Clearly, itIt isnot desirableundesirable to floodLSAs to nodes that do not require it. This can be a considerable impediment tonon-TE nodesin a network that is constituted of native and TE nodes. Opaque-LSA-based TE scheme([OPQLSA-TE]) makes no distinction betweenwith TEand native OSPF nodes as far as LSA flooding is concerned. It is possibleinformation. [OPQLSA-TE] uses Opaque LSAs forthe native OSPF nodes to silently ignore the unsupportedadvertising TE information. Opaque LSAsor add knobsreach all nodes withinimplementation to decide whether or not a certain opaque LSA mandates dijkstra SPF recomputation. In any case, unintended LSAs are disruptive and can be the cause of a large number of acknowledgements and retransmissions. TE metrics in a network could be rapidly changing. Only a subset of the metrics may be prone to rapid change, while others remain largely unchanged. Changes must be communicated at the earliest throughoutthe networkto ensure that the TE-LSDB is up-to-date. TE-Incremental-Link-update LSA (section 9.2) permits advertising only a subset of the link metrics- TE-nodes andnot the entire router-LSA all over.non-TE nodes alike. [OPQLSA-TE] also does not have provision to advertise just the TLVs that changed. A change in any TLV of a TE-link will mandate the entire LSA to be transmitted.This is clearly a serious shortcoming in the protocol. 4.6. SLA enforceable TE network can coexist with IP network4.4. Ability to reserve TE-exclusive links OSPF-TE is designed to draw distinction betweenlinks that support TE trafficTE-links andlinks that support native best-effort IP traffic. This flexibility to configure links as appropriate for a service, permits enforceability of service level agreements (SLAs).non-TE links. A TE link, configured to support TE trafficalonealone, will not permitnativebest-effort IP traffic on the link. This permits TE enforceability on the TE links. When links of a TE-topology do not overlap the links of a native IP network, OSPF-TE allows for virtual isolation of the two networks. Best-effort IP transit network and constraint based TE network often have differentSLA requirements and hence different billing models.service requirements. Keeping the two networks physically isolated will enable SLA enforceability, but can be expensive. Combining the two networks into a single physically connected network will bring economies of scale, if theSLAservice enforceability can be retained.When the links of a TE-network LSDB do[OPQLSA-TE] does notoverlapsupport thelinks of a native LSDB, such a virtual isolation of networks and hence SLA enforceability becomes possible. Opaque-LSA-basedability to isolate best- effort IP traffic from TEscheme([OPQLSA-TE]) is inherently not capable of having two virtual networks intraffic on asingle physically connected network.link. Allpoint-to-pointlinksin a packet networkare subject to best-effort IPtraffic, irrespective of whether a link is usable for TE traffic or not. In order to ensure that TE links are not cannibalized by best-effort traffic, the network provider will simply have to restrict best-effort traffic from entering the network. This is a severe limitation and is a direct result of not having LSDB isolation. When TE and native topologies are not separated (as is the case with Opaque-LSAs), a nativetraffic. An OSPFnoderouter couldbe utilizingpotentially select a TE linkasto be its least costlink, thereby stressing the TElink and inundate the link with best-effort IP traffic, thereby rendering theTElinkineffectiveunusable for TE purposes.4.7. Right Framework for future OSPF extensibility4.5. Extendible design OSPF-TE designprovides the right framework for future OSPF extensionsis based onindependent service provider needs. The framework essentially calls for building independent service specific LSDBs. Each such LSDB will consist of service specific metrics ofthe tried and tested OSPF paradigm, and inherits allresources withintheservice-specific topology. The TE-LSDB permits TLV scalability as wellbenefits of the OSPF, present and future. TE-LSAs are extendible, just as theability to perform fast searches throughnative OSPF on which OSPF-TE is founded. [OPQLSA-TE], on thedatabase. Just asother hand, is constrained by theTE-LSDB may be used for MPLS TE application, a different type of LSDB may be used for a different typesemantics ofapplication acrossthesame physically connected IP network. E.g., one can derive QOS based IP forwardingOpaque LSA on which it is founded. The content within anIP network. LimitingOpaque LSA is restricted to being in the form of TLVs and sub-TLVs, some of which are mandatory and some of which are positionally dependent in the TLV sequence for proper interpretation. Opaque LSAs are also restrictive when the flooding scope for the content is required to be different from the scope ofservice specific LSAs withintheservice specific topology eliminatesopaque LSAcontamination between virtual serviceitself. 4.6. Unified for packet and non-packet networksofOSPF-TE is usable within asingle physically connectedpacket network or a non-packet network or a combination peer network.Using service specific LSAs provides flexibility in LSA contentSignaling protocols such as RSVP andflooding scope. Opaque-LSA-basedLDP work the same across packet and non-packet networks. Signaling protocols merely need the TEscheme([OPQLSA-TE]) works best when a single typecharacteristics ofservice is assumed for a single physically connected network. As such, multiple disparate networksnodes and links so they canfunction running various flavorssignal the nodes to formulate TE circuit paths. In a peer network, the underlying control protocol must be capable ofOSPF. [OSPF-v2]providing a unified LSDB fornative best-effort IP networks,all TE nodes (nodes with packet-TE links as well as non-packet-TE links) in the network. OSPF-TE meets this requirement. [OPQLSA-TE] is limited in scope for packetnetworks andnetworks. An independent [OPQLSA-GMPLS]foris required to support GMPLS links in a non-packetnetworks. 4.8. Network scenariosnetwork. Neither of the Opaque LSA based extensions have provision to distinguish between node types. 4.7. Networks benefiting from the OSPF-TE design Many real-worldscenariosnetworks are better served by the new-TE-LSAs scheme. Here are a few examples.4.8.1.4.7.1. IP providers transitioning to provide TE services Providers needing to support MPLS based TE in their IP network may choose to transition gradually. Perhaps, add new TE links or convert existing links into TE links within an area first and progressively advance to offer in the entire AS. Not all routers will support TE extensions at the same time during the migration process. Use of TE specific LSAs and their flooding to OSPF-TE only nodes will allow the vendor to introduce MPLS TE without destabilizing the existing network.As such, theThe native OSPF-LSDB will remain undisturbed while newer TE links are added to the network.4.8.2.4.7.2. Providers offering Best-effort-IP & TE services Providers choosing to offer both best-effort-IP and TE based packet services simultaneously on the same physically connected network will benefit from the OSPF-TE design. By maintaining independent LSDBs for each type of service, TE links are notcannibalized by the non-TE routers for SPF forwarding. Unlike the [OPQLSA-TE] scheme, OSPF-TE provides the framework for SLA enforcement. 4.8.3. Multi-areacannibalized. 4.7.3. Large TE networks The OSPF-TE designparallelsis advantageous in large TE networks that require thetried and tested native-OSPF design. Unlike [OPQLSA-TE], OSPF-TE scales naturallyAS tomulti-area networks. 4.8.4.be sub-divided into multiple areas. 4.7.4. Non-packet networks andPeer-networking modelsPeer networks OSPF-TE is also theonly scheme that canright choice for vendors opting for a stable, well-founded protocol for their non-IP TE networks. OSPF-TE is uniquely qualified to support the following network attachmentsFor ain non-Packet TEnetwork.networks. (a) "Positional-Ring" type network LSA and (b) Router Proxying - allowing a router to advertise on behalf of other nodes (that are not Packet/OSPF capable).Opaque LSA based extensions ([OPQLSA-TE], [OPQLSA-GMPLS]) are not suited to distinguish the heterogeneous nodes in a peer-connected network. Opaque-LSA based extensions are also not suited to support link attachments that are different from point-to-point connections.5. OSPF-TEsolution, assumptions and limitationssolution overview 5.1. OSPF-TE SolutionThe OSPF-TE usesA new TE flag is introduced within the OSPF optionsflag as a meansfield todetermine theto enable discovery of TE topology.NewSection 8.0 describes the semantics of the TE flag. TE LSAs are designedto generate an independent TE-service tailored LSDB. Sections 8.0 andfor use by the OSPF-TE nodes. Section 9.0describedescribes the TEextensionsLSAs in detail. Changes required of the OSPF data structuresin orderto support OSPF-TE are described in section 11.0.The OSPF-TE design is based on the tried and tested OSPF paradigm. With TE-LSDB, you have the advantages of retaining the scalability of TLV's and the ability to run fast searches through the database. With the new TE-LSA scheme, an OSPF-TE node will have two types of Link state databases (LSDB). A native LSDB that describes the native control topology and a TE-LSDB that describes the TE topology. Shortest-Path-First algorithm will be used to forward IP packets along the native control network. OSPF neighbors data structure will be used for flooding along the control topology. The TE-LSDB is constituted only of TE nodes and TE links. A variety of CSPF algorithms may be used to dynamically setup TE circuit paths along the TE network.A new TE-neighbors data structure will be used to flood TE LSAs alongthe TE-only topology. Clearly, the the TE nodes will need the control (non-TE) network for OSPF communication. The control network may also be used for pingingTE-topology. An OSPF-TEnodes and performing any debug and monitoring tasks on the nodes. However,node will have theability to make distinction between TEnative LSDB andnon-TE topologies, allowsthebandwidth on TE links to be strictly SLA enforceable, even as a TE link is packet-capable. The actual characteristics of the TE-link are irrelevant fromTE-LSDB, A native OSPF node will have just theOPSF-TE perspective. As such, that allows for packet and non-packet networks to operate in peer mode.native LSDB. Consider the followingnetwork where someOSPF area constituted ofthe routersOSPF-TE andlinksnative OSPF routers. Nodes RT1, RT2, RT3 and RT6 are OSPF-TE routers with TEenabledandothersnon-TE link attachments. Nodes RT4 and RT5 are native OSPF routersandwith no TE links.All nodes inWhen thenetwork belong toLSA database is synchronized, all nodes will share the sameOSPF area.native LSDB OSPF-TE nodes alone will have the additional TE-LSDB. +---+ | |--------------------------------------+ |RT6|\\ | +---+ \\ | || \\ | || \\ | || \\ | || +---+ | || | |----------------+ | || |RT1|\\ | | || +---+ \\ | | || //| \\ | | || // | \\ | | || // | \\ | | +---+ // | \\ +---+ | |RT2|// | \\|RT3|------+ | |----------|----------------| | +---+ | +---+ | | | | | | +---+ +---+ |RT5|--------------|RT4| +---+ +---+ Legend: -- Native(non-TE) network link | Native(non-TE) network link \\ TE network link || TE network link Figure 6: A (TE + native) OSPF network topologyIn5.2. Assumptions OSPF-TE is an extension to theabove network, TE andnative OSPFLink State Data bases (LSDB) would have been synchronized within the area along the following nodes. Native OSPF LSDB nodes TE-LSDB nodes ---------------------- ------------- RT1, RT2, RT3. RT4, RT5, RT6 RT1, RT2, RT3, RT6 Nodes such as RT1 will have two LSDBs, a native LSDB and a TE-LSDB to reach nativeprotocol andTE networks. The TE LSA updates willdoes notimpact non-TE nodes RT4 and RT5. 5.2. Assumptionsmandate changes to the existing OSPF. OSPF-TE design makes the following assumptions. 1. An OSPF-TE nodewith links in an OSPF areawill need to establish router adjacency with at least one otherneighboringOSPF-TE node in the area in order for the router'sdatabaseTE-database to be synchronizedwith other routers inwithin the area. Failing this, the OSPF router will not be in the TE calculations of other TE routers in the area.Refer [FLOOD-OPT] for flooding optimizations. 2. UnlikeIt is thenative OSPF,responsibility of the network administrator(s) to ensure connectedness of the TE network. Otherwise, there can be disjoint TE topologies within a network. 2. OSPF-TE nodes mustbe capable of advertisingadvertise the link state ofinterfaces thatits TE-links. TE-links are notcapable of handlingobligated to support native IPpacket data. As such, thetraffic. Hence, an OSPF-TEprotocolnode cannot be required to synchronize its link-state database with neighborsacrosson all its links.ItThe only requirement issufficienttosynchronize link-state database in an area, across a subset of the IP termination links. Yet,have the TE LSDB(LSA database) should besynchronized across all OSPF-TE nodeswithin an area. All nodes and interfaces described by the TE LSAs will be presentin theTE topology database (a.k.a. TE LSDB).area. Refer [FLOOD-OPT] for flooding optimizations. 3. A link in a packet networkcanmay be designated as a TE-link or a native-IP link or both.There may be different ways by which to use a link for TE and non-TE traffic.For example, a link may be used for bothtypes of traffic and satisfy theTESLA requirements,and non-TE traffic, so long as the link is under-subscribed in bandwidth for TE(say,traffic - say, 50% of the link capacity isbeing used). Once the TE capacity requirement exceeds thesetmark (say, the 50% mark), the link may be removed from the non-TE topology. 4. This document does not require any changes to the existing OSPF LSDB implementation. Rather, it suggests the use of another database, the TE-LSDB, comprised of the TE LSAs,aside for TEpurposes. 5. As a general rule, all nodes and links that may be party to atraffic. 4. Non-packet TEcircuit should be uniquely identifiable by an IP address. As for router ID, a separate loopback IP address for the router, independent of the links attached, is recommended. 6. The assumption about to be stated is principally meant for non-packet networks such as a SONET TDM network. In non-packet networks, each IP subnet on a TE-configurable networksub-topologies MUST have a minimum of one nodewith an interfacerunning OSPF-TE protocol. For example, a SONET/SDH TDM ring must have a minimum of onenode (say, aGateway NetworkElement)Element(GNE) runningthe OSPF protocol in order to enable TE configuration on all nodes within the ring. An OSPF-TE node may advertise more than itself and the links it is directly attached to. It may also advertise other TE participants and their links, on their behalf. 5.3. Limitations Below are the limitations of theOSPF-TE.1. Disjoint TE topologies would have the same problem as anThe OSPF-TE nodenot forming adjacencies with any other node. The disjoint nodeswillnot be included in the TE topology of the rest of the TE routers. It will be the responsibility of the network administrator(s) to ensure connectednessadvertise on behalf of all theTE network. For example, two routers that are physically connected to the same link (or broadcast network) need not be router adjacent via the Hello protocol, ifin thelink is not IP packet terminated.ring. 6.Transition strategy for implementations usingOpaque LSAs to OSPF-TE transition strategy Below is a strategy to transition implementations using opaque LSAs to adapt thenew TE LSAOSPF-TE scheme in a gradual fashion. 1. Restrict the use of Opaque-LSAs to within an area. 2. Fold in the TE option flag to construct the TEand non-TEtopologiesin an area, even ifarea-wise. By doing this, thetopologies cannot be usedTE topology forflooding withinthearea.AS will be available at area level abstraction. 3. Use TE-Summary LSAs and TE-AS-external-LSAs for inter-area Communication. Make use of the TE-topology within an area to summarize the TE networks in the area and advertise the same to all TE-routers in the backbone. The TE-ABRs on the backbone area will in-turn advertise these summariesagainwithin their connected areas. 7. OSPF-TE router adjacency - TE topology discovery OSPF creates adjacencies between neighboring routers for the purpose of exchanging routing information. In the following subsections, we describe modifications to the OSPF options field and the use of Hello protocol to establish TE capability compliance between neighboring routers in an area. The capability is used as the basis to build TE topology. 7.1. The OSPF Options field A new TE flag is introduced within the options field by this draft to identify TE extensions to the OSPF. This bit will be used to distinguishbetweenrouters that supportTraffic engineering extensions and those that do not.OSPF-TE. The OSPF options field is present in OSPF Hello packets, Database Descriptionpacketspackets, and all link state advertisements. The TE bit, however, is a requirement only for the Hello packets. Use of TE-bit is optional in Database Description packets or LSAs. Below is a description of the TE-Bit. Refer [OSPF-V2], [OSPF-NSSA] and [OPAQUE] for a description of the remaining bits in the options field. -------------------------------------- |TE | O | DC | EA | N/P | MC | E | * | -------------------------------------- The OSPF options field - TE support TE-Bit: This bit is set to indicate support forTraffic Engineeringtraffic engineering extensions to the OSPF. The Hello protocol which is used for establishing router adjacencyand bidirectionality of the linkwill use the TE-bit tobuild adjacencies between two nodes that are either both TE-compliant or not.establish OSPF-TE adjacency. Two routers will not become TE-neighbors unless they agree on the state of the TE-bit. TE-compliant OSPF extensions are advertised only to the TE-compliant routers. All other routers may simply ignore the advertisements. There is however a caveat with the above use of the last remaining reserved bit in the options field. OSPF v2 will have no more reserved bits left for future option extensions. Ifit isdeemed necessary to leave this bit as is,we could usethe OPAQUE-9 LSA(Local(local scope)alongcan be used on each interface to communicate the support for OSPF-TE.8. Bringing up TE adjacencies; TE vs. Non-TE topologies OSPF creates adjacencies between neighboring routers for the purpose of exchanging routing information. In the following subsections, we describe the use of Hello protocol to establish TE capability compliance between neighboring routers of an area. Further, the capability is used as the basis to build a TE vs. non-TE network topology. 8.1.7.2. The Hello Protocol The Hello Protocol is primarily responsible for dynamically establishing and maintaining neighbor adjacencies. In a TE network, itmayis notberequiredor possiblefor all links and neighbors to establish adjacency using this protocol. The Hello protocol will use the TE-bit to establishTraffic Engineeringtraffic engineering capability(or not)between two OSPF routers. For NBMA and broadcast networks, this protocol is responsible for electing thedesignated routerDesignated Router and thebackup designated router.Backup Designated Router. For a TDM ring network, the designated and backup designated routers may either be preselected (ex: GNE, backup-GNE) or determined via the same Hello protocol. In any case, routers supporting the TE option shall be given a higher precedence for becoming a designated router over those that do not support TE.8.2. Flooding and the Synchronization of Databases In OSPF, adjacent routers within an area must synchronize their databases. However, as observed in [FLOOD-OPT], the requirement may be stated more concisely that all routers in an area must converge on the same link state database. To do that, it suffices to send single copies of LSAsIf deemed necessary to leave theneighboring routers in an area, rather than send one copy on each of the connected interfaces. [FLOOD-OPT] describesTE-bit unused indetail how to minimize flooding (Initial LSDB synchronization as well astheasynchronous LSA updates) within an area. Withoptions field, the OSPF-TEdescribed here, a TE-only network topology is constructed based on the TE option flag in the Hello packet. Subsequent to that, TE LSA flooding in an area is limited to TE-only routers in the area, and do not impact non-TEroutersin the area. A network may be constituted of a combination of a TE topology and a non-TE (control) topology. Standard IP packet forwarding and routing protocols are possible along the control topology. In the case where some of the neighbors are TE compliant and others are not, the designated router will exchange different sets of LSAs with its neighbors. TE LSAs are exchanged only with the TE neighbors. Native LSAs do not include description for TE links. As such, native LSAs are exchanged with all neighbors (TE and non-TE alike) over a shared non-TE link. Flooding optimization in a TE network is essential for two reasons. First, the control traffic for a TE network is likely to be much higher than that of a non-TE network. Flooding optimizations help to minimize the announcements and the associated retransmissions and acknowledgements on the network. Secondly, the TE nodes need to converge at the earliest to keep up with TE state changes occurring throughout the TE network. This process of flooding along a TE topology cannot be folded into the Opaque-LSA based TE scheme ([OPQLSA-TE]), because Opaque LSAs (say, LSA #10) have a pre-determined flooding scope. Even as a TE topology is available from thecould useof TE option flag, the TE topology is not usable for flooding unless a new TEOPAQUE-9 LSAis devised, whose boundaries can be set(local scope) tospan the TE-only routers in an area. NOTE, a new All-SPF-TE Multicast address may be used for the exchange ofcommunicate TEcompliant database descriptors. 8.3.capability between two OSPF routers. 7.3. The Designated Router The Designated Router is elected by the Hello Protocol on broadcast and NBMA networks. In general, when a router'sinterface to a networknon-TE link first becomes functional, it checks to see whether there is currently a Designated Router for the network. If thereis,is one, it accepts that Designated Router, regardless of its Router Priority, so long as the current designated router is TE compliant. Otherwise, the router itself becomes Designated Router if it has the highest Router Priority on the network and is TE compliant.Clearly,TE-compliance (I.e., OSPF-TE) must be implemented on the most robustrouters only,routers, as they becomemostlikely candidates to take onadditionalthe role as designated router. Alternatively, there can be two sets of designated routers, one for the TE compliant routers and another for the native OSPF routers (non-TE compliant).8.4.7.4. The Backup Designated Router The Backup Designated Router is also elected by the Hello Protocol. Each Hello Packet has a field that specifies the Backup Designated Router for the network. Once again, TE-compliance must be weighed in conjunction with router priority indeterminingelecting the backup designated router. Alternatively, there can be two sets of backup designated routers, one for the TE compliant routers and another for the native OSPF routers (non-TE compliant).8.5. The graph7.5. Flooding and the Synchronization ofadjacencies An adjacencyDatabases In OSPF, adjacent routers within an area must synchronize their databases. However, as observed in [FLOOD-OPT], a more concise requirement of OSPF is that all routers in an area must converge on the same link state database. It isboundsufficient to send a single copy of thenetwork thatLSAs to thetwoneighboring routershaveincommon.an area than send one copy on each connected interface. [FLOOD-OPT] describes in detail how to minimize flooding (Initial LSDB synchronization as well as the asynchronous LSA updates) within an area. In the case where some of the neighbors are TE compliant and others are not, the designated OSPF-TE router will exchange different sets of LSAs with its neighbors. TE LSAs are exchanged only with the TE neighbors. Native LSAs are exchanged with all neighbors (TE and non-TE alike). A new OSPFIGP-TE multicast address 224.0.0.24 may be used for the exchange of TE compliant database descriptors. Flooding optimization in a TE network is essential as the control traffic for a TE network is likely to be higher than that of a non-TE network. Flooding optimization will help minimize LSA announcements and the associated retransmissions and acknowledgements on the network. 7.6. The graph of adjacencies If two routers have multiple networks in common, they may have multiple adjacencies between them. The adjacency may besplit intoone of twodifferenttypes -Adjacency between TE-compliant routers andnative OSPF adjacencybetween non-TE compliant routers. A router may choose to support one orand TE adjacency. OSPF-TE routers will form both types of adjacency. Two types of adjacency graphs arepossible,possible depending on whether a Designated Router is elected for the network. On physical point-to-point networks,Point-to-MultiPointPoint-to-Multipoint networks andvirtualVirtual links, neighboring routers become adjacent whenever they can communicate directly. The adjacency canonlybe one of (a) TE-compliant or (b)non-TE compliant.native. In contrast, on broadcast and NBMA networks theDesignated Routerdesignated router and theBackup Designated Routerbackup designated router may maintain two sets of adjacency.However, theThe remaining routers willparticipate inform either TE-compliantadjacencyornon-TE-compliant adjacency, but not both.native adjacency. In the Broadcast network below,you will notice thatrouters RT7 and RT3 are chosen as the designated and backup routers respectively.Within the network,Routers RT3, RT4 and RT7 are TE-compliant. RT5 and RT6 are not. So,youRT4 willnoticehave TE and native adjacencies with the designated and backup routers. RT5 and RT6 will only have native adjacencyvariationwithRT4 vs. RT5 or RT6.the designated and backup routers. +---+ +---+ |RT1|------------|RT2| o---------------o +---+ N1 +---+ RT1 RT2 RT7 o:::::::::: +---+ +---+ +---+ /|: : |RT7| |RT3| |RT4| / | : : +---+ +---+ +---+ / | : : | | | / | : : +-----------------------+ RT5o RT6o oRT4 : | | N2 * * ; : +---+ +---+ * * ; : |RT5| |RT6| * * ; : +---+ +---+ **; : o:::::::::: RT3 Figure 6: The graph of adjacencies with TE-compliant routers.9.8. TE LSAs - Packet network Thenative OSPFOSPFv2 protocol, as of now, has a total of 11 LSA types. LSA types 1 through 5 are defined in [OSPF-v2]. LSA types 6, 7 and 8 are defined in [MOSPF], [NSSA] and [BGP-OSPF] respectively.Lastly,LSA types 9 through 11 are defined in [OPAQUE]. Eachof theLSAtypes havetype has a unique floodingscope defined.scope. Opaque LSA types 9 through 11 are general purpose LSAs, with flooding scope set to link-local, area-local and AS-wide (except stub areas) respectively.As will become apparent from this document, the general purpose content format and the coarse flooding scope of Opaque LSAs are not suitable for disseminating TE data.In the following subsections, we define new LSAs forTraffictraffic engineering (TE) use. The Values for the new TE LSA types are assigned such that the high bit of theLS-typeLSA-type octet is set to 1. The new TE LSAs are largely modeled after the existing LSAs for content format and have acustom suitedunique flooding scope.Flooding optimizations discussed in previous sections shall be used to disseminate TE LSAs along the TE-restricted topology. ATE-router LSA is defined to advertise TE characteristics ofthean OSPF-TE router and all the TE-links attached to theTE-router. TE-Link-Updaterouter. TE-incremental-Link-Update LSA is defined to advertiseindividual link specificincremental updates to the metrics of a TEupdates.link. Flooding scope for both these LSAs isthe TE topology within the arearestricted towhichthelinks belong. I.e., only those OSPFTE nodeswithinin thearea with TE links will receive these TE LSAs.area. TE-Summary network and router LSAs are defined to advertise the reachability of area-specific TE networks and Areaborder routers(alongBorder Routers (along with router TE characteristics) to external areas. Flooding Scope of the TE-Summary LSAs is the TE topology in the entire AS less the non-backbone area for which the the advertising router is an ABR. Just as with native OSPF summary LSAs, the TE-summary LSAs do not reveal the topological details of an area to external areas.But, the two summary LSAs do differ in some respects. The flooding scope of TE summary LSAs is different. As for content, TE summary network LSAs simply describe reachability without summarization of network access costs. And, unlike the native summary router LSA, TE-summary router LSA content includes TE capabilities of the advertising TE router.TE-AS-external LSA and TE-Circuit-Path LSA are defined to advertise AS external network reachability andpre-establishedpre-engineered TE circuits respectively. While flooding scope for both these LSAs can be theTE-topology in theentire AS, flooding scope for thepre-establishedpre-engineered TE circuit LSA may optionally be restricted to just the TE topology within an area.Lastly, the new TE LSAs are defined so as to permit peer operation of packet networks and non-packet networks alike. As such, a new TE-Router-Proxy LSA is defined to allow advertisement of a TE router, that is not OSPF capable, by an OSPF-TE node as a proxy. 9.1.8.1. TE-Router LSA (0x81) The TE-router LSA (0x81) is modeled after the router LSAwithand has the same flooding scope as therouter-LSA, except thatrouter-LSA. However, the scope is restricted toTE-onlyonly the OSPF-TE nodes within the area. The TE-router LSA describes the TE metrics of the router as well as the TE-links attached to the router. Below is the format of the TE-router LSA. Unless specified explicitly otherwise, the fields carry the same meaning as they do in a router LSA. Only the differences are explained below. Router-TE flags, Router-TE TLVs, Link-TE options, and Link-TE TLVs are eachindependentlydescribed ina separate sub-section.the following sub-sections. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x81 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 0 |V|E|B| 0 | Router-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Router-TE flags (contd.) | Router-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | .... | # of TE links | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | 0 | Link-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link-TE flags (contd.) | Zero or more Link-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | Option In TE-capable router nodes, the TE-bit may be set to 1.The following fields are used to describe each router link (i.e., interface). Each router link is typed (see the below Type field). The Type field indicates the kind of link being described. Type A new link type "Positional-Ring Type" (value 5) is defined. This is essentially a connection to a TDM-Ring. TDM ring network is different from LAN/NBMA transit network in that, nodes on the TDM ring do not necessarily have a terminating path between themselves. Secondly, the order of links is important in determining the circuit path. Third, the protection switching and the number of fibers from a node going into a ring are determined by the ring characteristics. I.e., 2-fiber vs 4-fiber ring and UPSR vs BLSR protected ring. Type Description __________________________________________________ 1 Point-to-point connection to another router 2 Connection to a transit network 3 Connection to a stub network 4 Virtual link 5 Positional-Ring Type. Link ID Identifies the object that this router link connects to. Value depends on the link's Type. For a positional-ring type, the Link ID shall be IP Network/Subnet number, just as with a broadcast transit network. The following table summarizes the updated Link ID values. Type Link ID ______________________________________ 1 Neighboring router's Router ID 2 IP address of Designated Router 3 IP network/subnet number 4 Neighboring router's Router ID 5 IP network/subnet number Link Data This depends on the link's Type field. For type-5 links, this specifies the router interface's IP address. 9.1.1.8.1.1. Router-TE flags - TE capabilities of the routerBelow is an initial set of definitions. More may be standardized if necessary. The TLVs are not expanded in the current rev. Will be done in the follow-on revs.Thefield imposes a restriction of no more than 32following flags are used to describe the TE capabilities ofa router-TE.an OSPF-TE router. The remaining bits of the 32-bit word are reserved for future use. +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+|L|L|P|T|L|F| |S|S|S|C| |S|E|S|D|S|S| |T|E|I|S| |R|R|C|M|C|C| |A|L|G|P||L|L|P| | | | |L|S|C| |S|E|S| | | | |S|I|S| |R|R|C| | | | |P|G|P| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |<---- Boolean TE flags ------->|<- TE flags pointing to TLVs ->| Bit LSR When set, the router is considered to have LSR capability. Bit LER When set, the router is considered to have LER capability. All MPLS border routers will be required to have the LER capability. When the E bit is also set, that indicates an AS Boundary router with LER capability. When the B bit is also set, that indicates an area border router with LER capability. Bit PSC Indicates the node is Packet Switch Capable. BitTDM Indicates the node is TDM circuit switch capable. Bit LSC Indicates the node is Lamda switch Capable. Bit FSC Indicates the node is Fiber (can also be a non-fiber link type) switch capable. Bit STALSP MPLS LabelStack Depth limitswitch TLV TE-NODE-TLV-MPLS-SWITCHING follows. This is applicable only when the PSC flag is set. BitSEL TE Selection Criteria TLV, supported by the router, follows. BitSIG MPLS Signaling protocol support TLV TE-NODE-TLV-MPLS-SIG-PROTOCOLS follows. BIT CSPF CSPF algorithm support TLV TE-NODE-TLV-CSPF-ALG follows.9.1.2.8.1.2. Router-TE TLVs The following Router-TE TLVs are defined.TE-selection-Criteria8.1.2.4. TE-NODE-TLV-MPLS-SWITCHING MPLS switching TLV(Tag ID = 1)is applicable only for packet switched nodes. Thevalues can be a seriesTLV specifies the MPLS packet switching capabilities ofresources that may be used asthecriteria for traffic engineering (typically withTE node. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x8001 | Length = 6 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Label depth | QOS | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 'Label depth' is theaiddepth ofa signaling protocol such as RSVP-TE or CR-LDP or LDP). - Bandwidth based LSPs (1) - Priority based LSPs (2) - Backup LSP (3) - Link cost (4) Bandwidth criterialabel stack the node isoften used in conjunction with Packet Switch Capable nodes. The unitcapable ofbandwidth permitted to be configured may however vary from vendor to vendor. Bandwidth criteria may also beprocessing on its ingress interfaces. An octet is usedin conjunction with TDM nodes. Once again, the granularity of bandwidth allocation may vary from vendortovendor. Priority based traffic switchingrepresent label depth. A default value of 1 isrelevant only to Packet Switch Capable nodes.assumed when the TLV is not listed. 'QOS' is a single octet field that may be assigned '1' or '0'. Nodes supportingthis criteria will beQOS are able to interpret the EXP bitsonin the MPLS header to prioritizethemultiple classes of trafficacrossthrough the same LSP.Backup criteria refers to whether or not the node is capable of finding automatic protection path in8.1.2.2. TE-NODE-TLV-MPLS-SIG-PROTOCOLS MPLS signaling protocols TLV lists all thecasesignaling protocol supported by theoriginally selected link fails. Such a local recoverynode. An octet isspecific to the node and may not need to be notifiedused tothe upstream node. MPLS-Signalinglist each signaling protocolTLV (Tag ID = 3) The value can besupported. 0 1 2bytes long, listing a combination of RSVP-TE,3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x8002 | Length = 5, 6 or 7 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Protocol-1 | ... | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ RSVP-TE protocol is represented as 1, CR-LDP as 2 andLDP. Constraint-SPF algorithms-SupportLDP as 3. These are the only permitted signaling protocols at this time. 8.1.2.3. TE-NODE-TLV-CSPF-ALGORITHMS The CSPF algorithms TLV(Tag ID = 4) Listlists all the CSPFalgorithmsalgorithm codes supported. Support for CSPF algorithmson a node is an indication thatmakes the nodemay be requested for alleligible to compute complete or partial circuitpath selection during circuit setup time. Thispaths. Support for CSPF algorithms can also be beneficial in knowing whether or notthea node is capable of expanding loose routes (in an MPLS signaling request) intoan LSP. Further, thea detailed circuit path. Two octets are used to list each CSPF algorithmsupport on an intermediate node cancode. The algorithm codes may bebeneficial whenvendor defined and unique within an Autonomous System. If the nodeterminates one or more ofsupports 'n' CSPF algorithms, thehierarchical LSP tunnels. Label Stack Depth TLV (Tag ID = 5) Applicable only for PSC-Type traffic. A default value ofLength would be (4 + 4 * ((n+1)/2)) octets. 0 1is assumed. This indicates the depth of label stack the node is capable of processing on an ingress interface. 9.1.3.2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x8003 | Length = 4(1 + (n+1)/2) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | CSPF-1 | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | CSPF-n | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 8.1.3. Link-TEoptionsflags - TE capabilities of aTE-linklink The following flags are used to describe the TE capabilities of a link. The remaining bits of the 32-bit word are reserved for future use. +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+|T|N|P|T|L|F|D||T|N|P| | | |D| |S|L|B|C||E|T|K|D|S|S|B||E|T|K| | | |B| |R|U|W|O| ||E|T|M|C|C|S| |L|G|A|L||E|T| | | |S| |L|G| |L| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |<---- Boolean TE flags ------->|<- TE flags pointing to TLVs ->| TE - Indicates whether TE is permitted on the link. A link can be denied for TE use by setting the flag to 0. NTE - Indicates whether non-TE traffic is permitted on the TE link. This flag is relevant only when the TE flag is set. PKT - Indicates whether or not the link is capable of IP packettermination. TDM, LSC, FSC bits - Same as defined for router TE options.processing. DBS - Indicates whether or not Database synchronization is permitted on this link. SRLG Bit - Shared Risk Link Group TLV TE-LINK-TLV-SRLG follows. LUG bit - Link usage cost metric TLV TE-LINK-TLV-LUG follows.BWABW bit -DataLink bandwidth TLV TE-LINK-TLV-BANDWIDTH follows. COL bit -Data linkLink Color TLV TE-LINK-TLV-COLOR follows.9.1.4.8.1.4. Link-TE TLVsSRLG-TLV This8.1.4.1. TE-LINK-TLV-SRLG The SRLG describes the list of Shared Risk Link Groups (SRLG) the link belongs to.Use 2 bytesTwo octets are used to list each SRLG.BWA-TLV This indicatesIf the link belongs to 'n' SRLGs, the Length would be (4 + 4 * ((n+1)/2)) octets. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x0001 | Length = 4(1 + (n+1)/2) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | SRLG-1 | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | SRLG-n | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 8.1.4.2. TE-LINK-TLV-BANDWIDTH The bandwidth TLV specifies maximum bandwidth, bandwidth availablebandwidth,for TE use and reserved bandwidth as follows. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x0002 | Length = 16 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Maximum Bandwidth | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Bandwidth available forlaterTE useetc. This TLV may also describe| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Reserved Bandwidth | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Bandwidth is expressed in units of 32 bytes/sec (256 bits/sec). A 32-bit field for bandwidth would permit specification not exceeding 1 tera-bits/sec. 'Maximum bandwidth' is be theDatamaximum linkLayer protocols supported andcapacity expressed in bandwidth units. 'Bandwidth available for TE use' is the maximum reservable bandwidth on theDatalinkMTU size. LUG-TLV This indicatesfor use by all the TE circuit paths traversing the link. The link is oversubscribed when this field is more than the 'Maximum Bandwidth'. When the field is less than the 'Maximum Bandwidth', the remaining bandwidth on the link may likely be used for non-TE traffic. 'Reserved Bandwidth' is the bandwidth that is currently subscribed from of the link. 'Reserved Bandwidth' must be less than the 'Bandwidth available for TE use'. New TE circuit paths are able to claim no more than the difference between the two bandwidths for reservation. 8.1.4.3. TE-LINK-TLV-LUG The link usage cost-TLV specifies Bandwidthunit, Unitunit usage cost,LSP setupTE circuit set-up cost,minimumandmaximum durations permittedany time constraints forsettingsetup and teardown of TE circuits on the link. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x0003 | Length = 28 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Bandwidth unit usage cost | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | TE circuit set-up cost | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | TE circuit set-up time constraint | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | TE circuit tear-down time constraint | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Circuit Setup time constraint This 64-bit number specifies the time at or after which a TE-circuit path may be set up on theTLV etc., including anylink. The set-up time constraint is specified as the number of seconds from the start of January 1, 1970 UTC. A reserved value of 0 implies no circuit setup time constraint. Circuit Teardown time constraint This 64-bit number specifies the time at or before which all TE-circuit paths using the link must be torn down. The teardown time constraint is specified as the number of seconds from the start of January 1 1970 UTC. A reserved value of 0 implies no circuit teardown time constraint. No. ofday constraints. COLOR-TLVTE Circuit paths This specifies the number of pre-engineered TE circuit paths between the advertising router and the router specified in the link state ID. 8.1.4.4. TE-LINK-TLV-COLOR The color TLV is similar to the SRLG TLV, in that anautonomous systemAutonomous System may choose to issue colors tolink based ona TE-link meeting certain criteria.ThisThe color TLV can be used to specifythe colorone or more colors assigned to the linkwithinas follows. Two octets are used to list each color. If thescopelink belongs to 'n' number of colors, theAS. 9.2.Length would be (4 + 4 * ((n+1)/2)) octets. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Tag = 0x0004 | Length = 4(1 + (n+1)/2) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Color-1 | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Color-n | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 8.2. TE-incremental-link-Update LSA (0x8d) A significant difference between a non-TE OSPF network and a TE OSPF network is that the latterismay be subject todynamicfrequent real-time circuit pinning and ismorelikely to undergostateTE-state updates.Specifically, someSome links might undergo changes more frequently than others.Advertising the entire TE-router LSA in response to a change in any single link could be repetitive.Flooding the network with TE-router LSAs at the aggregated speed of allthe dynamiclink metric changes is simply not desirable.TheA smaller in size, TE-incremental-link-update LSAadvertisesis designed to advertise only the incremental link updates.TheTE-incremental-link-Update LSA will be advertised as frequently as the link state is changed. The TE-link sequence is largely the advertisement of a sub-portion of router LSA. The sequence number on this will be incremented with the TE-router LSA's sequence as the basis. When an updated TE-router LSA is advertised within 30 minutes of the previous advertisement, the updated TE-router LSA will assume a sequence no. that is larger than the most frequently updated of its links. Below is the format of the TE-incremental-link-update LSA. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x8d | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID (same as Link ID) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | 0 | Link-TE options | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link-TE options | Zero or more Link-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | # TOS | metric | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | TOS | 0 | TOS metric | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Link State ID This would be exactly the same as would have been specified as as Link ID for a link within the router-LSA. Link Data This specifies the router ID the link belongs to. In majority of cases, this would be same as the advertising router. This choice for Link Data is primarily to facilitate proxy advertisement for incremental link updates. Say, arouter-proxy-LSarouter-proxy-LSA was used to advertise the TE-router-LSA of a SONET/TDM node. Say, the proxy router is now required to advertise incremental-link-update for the same SONET/TDM node. Specifying the actual router-ID the link in the incremental-link-update-LSA belongs to helps receiving nodes in finding the exact match for the LSA in their database. The tuple of (LS Type, LSA ID, Advertising router) uniquely identify the LSA and replace LSAs of the same tuple with an older sequence number. However, there is an exception to this rule in the context of TE-link-update LSA. TE-Link update LSA will initially assume the sequence number of the TE-router LSA it belongs to. Further, when a new TE-router LSA update with a larger sequence number is advertised, the newer sequence number is assumed by al the link LSAs.9.3. TE-Circuit-paths8.3. TE-Circuit-path LSA (0x8C)TE-Circuit-pathsTE-Circuit-path LSA may be used to advertise the availability ofpre-establishedpre-engineered TE circuit path(s) originating from any router in the network. The flooding scope may be Area wide or AS wide. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x84 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 0 |G|E|B|D|S|T|CktType| Circuit Duration (Optional) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit Duration cont... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | CircuitDuartionDuration cont.. | Circuit Setup time (Optional) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit Setup time cont... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit Setup time cont.. |Circuit Teardown time(Optional)| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit Teardown time cont... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit Teardown time cont.. | No. of TE circuit paths | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit-TE ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit-TE Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | 0 | Circuit-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit-TE flags (contd.) | Zero or more Circuit-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit-TE ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Circuit-TE Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | Link State ID The ID of the far-end router or the far-end Link-ID to which the TE circuit path(s) is being advertised. TE-circuit-path(s) flags Bit G - When set, the flooding scope is set to be AS wide. Otherwise, the flooding scope is set to be area wide. Bit E - When set, the advertised Link-State ID is an AS boundary router (E is for external). The advertising router and the Link State ID belong to the same area. Bit B - When set, the advertised Link state ID is an Area border router (B is for Border) Bit D - When set, this indicates that the duration of circuit path validity follows. Bit S - When set, this indicates that Setup-time of the circuit path follows. Bit T - When set, this indicates that teardown-time of the circuit path follows. CktType This 4-bit field specifies the Circuit type of the Forward Equivalency Class (FC). 0x01 - Origin is Router, Destination is Router. 0x02 - Origin is Link, Destination is Link. 0x04 - Origin is Router, Destination is Link. 0x08 - Origin is Link, Destination is Router. Circuit Duration (Optional) This 64-bit number specifies the seconds from the time of the LSA advertisement for which theadversited pre-established TEpre-engineered circuit path will be valid. This field is specified only when the D-bit is set in the TE-circuit-path flags. Circuit Setup time (Optional) This 64-bit number specifies the time at which the TE-circuit path may besetup.set up. This field is specified only when the S-bit is set in the TE-circuit-path flags. Thesetupset-up time is specified as the number of seconds from the start of January 1 1970 UTC. Circuit Teardown time (Optional) This 64-bit number specifies the time at which the TE-circuit path may be torn down. This field is specified only when the T-bit is set in the TE-circuit-path flags. The teardown time is specified as the number of seconds from the start of January 1 1970 UTC. No. of TE Circuit paths Thisindicatesspecifies the number ofpre-establishedpre-engineered TE circuit paths between the advertising router and the router specified in the link state ID. Circuit-TE ID This is the ID of the far-end router for a given TE-circuit path segment. Circuit-TE Data This is the virtual link identifier on the near-end router for a given TE-circuit path segment. This can be a private interface or handle the near-end router uses to identify the virtual link. The sequence of (circuit-TE ID, Circuit-TE Data) list the end-point nodes and links in the LSA as a series. Circuit-TE flags This lists the Zero or more TE-link TLVs that all member elements of the LSP meet.9.4.8.4. TE-Summary LSAs TE-Summary-LSAs are the Type 0x83 and 0x84 LSAs. These LSAs are originated by area border routers. TE-Summary-network-LSA (0x83) describes the reachability of TE networks in a non-backbone area, advertised by the Area Border Router. Type 0x84 summary-LSA describes the reachability of Area Border Routers and AS border routers and their TE capabilities. One of the benefits of having multiple areas within an AS is that frequent TE advertisements within the area do not impact outside the area. Only the TE abstractionsasbefitting the external areas are advertised.9.4.1.8.4.1. TE-Summary Network LSA (0x83) TE-summary network LSA may be used to advertise reachability of TE-networks accessible to areas external to the originating area. The content and the flooding scope of a TE-Summary LSA is different from that of a native summary LSA. The scope of flooding for a TE-summary network is AS wide, with the exception of the originating area and the stub areas. The area border router for each non-backbone area is responsible for advertising the reachability of backbone networks into the area. Unlike a native-summary network LSA, TE-summary network LSA does not advertise summary costs to reach networks within an area. This isbecause,because TE parameters are not necessarily additive or comparative. The parameters can be varied in their expression.AFor example, a TE-summary network LSA will notbe know tosummarize a network whose links do not fall under an SRLG (Shared-Risk Link Group). Thisisway, the TE-summary LSA merely advertises thereachablereachability of TE networks within an area. The specific circuit paths can be computed by the BDRs.On the other hand, if there are specificPre-engineered circuit pathsto advertise, that can be done independentlyare advertised using TE-Circuit-path LSA(refer:(refer section9.3)8.3). 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x83 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID (IP Network Number) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router (Area Border Router) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Network Mask | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Area-ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+9.4.2.8.4.2. TE-Summary router LSA (0x84) TE-summary router LSA may be used to advertise the availability of Area Border Routers (ABRs) and AS Border Routers (ASBRs) that are TE capable. The TE-summary router LSAs are originated by the Area Border Routers. The scope of flooding for the TE-summary router LSA is the non-backbone area the advertising ABR belongs to. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x84 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router (ABR) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 0 |E|B| 0 | No. of Areas | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Area-ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Router-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Router-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | .... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Link State ID The ID of the Area border router or the AS border router whose TE capability is being advertised. Advertising Router The ABR that advertises its TE capabilities (and the OSPF areas it belongs to) or the TE capabilities of an ASBR within one of the areas the ABR is a border router of. No. of Areas Specifies the number of OSPF areas the link state ID belongs to. Area-ID Specifies the OSPF area(s) the link state ID belongs to. When the link state ID is same as the advertising router ID,thisthe Area-ID lists all the areas the ABR belongs to. In the case the link state ID is an ASBR,thisthe Area-ID simply lists the area the ASBR belongs to. The advertising router is assumed to be the ABR from the same area the ASBR is located in. Summary-router-TE flags Bit E - When set, the advertised Link-State ID is an AS boundary router (E is for external). The advertising router and the Link State ID belong to the same area. Bit B - When set, the advertised Link state ID is an Area border router (B is for Border) Router-TE flags, Router-TE TLVs (TE capabilities of the link-state-ID router) TE Flags and TE TLVs are as applicable to the ABR/ASBR specified in the link state ID. The semantics is same as specified in the Router-TE LSA.9.5.8.5. TE-AS-external LSAs (0x85) TE-AS-external-LSAs are the Type 0x85 LSAs. This is modeled after AS-external LSA format and flooding scope.TheseTE-AS-external LSAs are originated by AS boundary routers with TEextensions (say, a BGP node which can communicate MPLS labels across to external ASes),extensions, and describe the TE networks andpre-established TE linkspre-engineered circuit paths external to the AS.TheAs with AS-external LSA, the flooding scope ofthisthe TE-AS-external LSA issimilar to that of an AS-external LSA. I.e.,AS wide, with the exception of stub areas. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x85 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Network Mask | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Forwarding address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | External Route Tag | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | # of Virtual TE links | 0 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | TE-Forwarding address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | External Route TE Tag | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... | Network Mask The IP address mask for the advertised TE destination. For example, this can be used to specify access to a specific TE-node or TE-link with an mask of 0xffffffff. This can also be used to specify access to an aggregated set of destinations using a differentmask,mask. ex: 0xff000000. Link-TE flags, Link-TE TLVs The TE attributes of this route. These fields are optional and are provided only when one or morepre-establishedpre-engineered circuits can be specified with the advertisement. Without these fields, the LSA will simply state TE reachability info. Forwarding address Data traffic for the advertised destination will be forwarded to this address. If the Forwarding address is set to 0.0.0.0, data traffic will be forwarded instead to the LSA's originator (i.e., the responsible AS boundary router). External Route Tag A 32-bit field attached to each external route. This is not used by the OSPF protocol itself. It may be used to communicate information between AS boundary routers; the precise nature of such information is outside the scope of this specification.9.6.9. TE LSAs - Non-packet network A non-packet network would use all the TE LSAs described in the previous section for a packet network, albeit with some variations. These variations are described in the following subsections. TE-Router-Proxy LSA is defined to allow proxy advertisement for non-packet TE-nodes by an OSPF-TE router. 9.1. TE-Router LSA (0x81) The following fields are used to describe each router link (i.e., interface). Each router link is typed (see the below Type field). The Type field indicates the kind of link being described. Type A new link type "Positional-Ring Type" (value 5) is defined. This is essentially a connection to a TDM-Ring. TDM ring network is different from LAN/NBMA transit network in that nodes on the TDM ring do not necessarily have a terminating path between themselves. Secondly, the order of links is important in determining the circuit path. Third, the protection switching and the number of fibers from a node going into a ring are determined by the ring characteristics. I.e., 2-fiber vs 4-fiber ring and UPSR vs BLSR protected ring. Type Description __________________________________________________ 1 Point-to-point connection to another router 2 Connection to a transit network 3 Connection to a stub network 4 Virtual link 5 Positional-Ring Type. Link ID Identifies the object that this router link connects to. Value depends on the link's Type. For a positional-ring type, the Link ID shall be IP Network/Subnet number just as the case with a broadcast transit network. The following table summarizes the updated Link ID values. Type Link ID ______________________________________ 1 Neighboring router's Router ID 2 IP address of Designated Router 3 IP network/subnet number 4 Neighboring router's Router ID 5 IP network/subnet number Link Data This depends on the link's Type field. For type-5 links, this specifies the router interface's IP address. 9.1.1. Router-TE flags - TE capabilities of the router Flags specific to non-packet TE-nodes are described below. +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |L|L|P|T|L|F| |S|S|S|C| |S|E|S|D|S|S| |T|E|I|S| |R|R|C|M|C|C| |A|L|G|P| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |<---- Boolean TE flags ------->|<- TE flags pointing to TLVs ->| Bit TDM Indicates the node is TDM circuit switch capable. Bit LSC Indicates the node is Lambda switch Capable. Bit FSC Indicates the node is Fiber (can also be a non-fiber link type) switch capable. 9.1.2. Link-TE options - TE capabilities of a TE-link +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |T|N|P|T|L|F|D| |S|L|B|C| |E|T|K|D|S|S|B| |R|U|W|O| | |E|T|M|C|C|S| |L|G|A|L| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |<---- Boolean TE flags ------->|<- TE flags pointing to TLVs ->| TDM, LSC, FSC bits - Same as defined for router TE options. 9.2. Changes to Network LSA Network-LSA is the Type 2 LSA. With the exception of the following, no additional changes will be required to this LSA for TE compatibility. The LSA format and flooding scope remains unchanged. A network-LSA is originated for each broadcast, NBMA and Positional-Ring type network in the area which supports two or more routers. The TE option is also required to be set while propagating the TDM network LSA.9.6.1.9.2.1. Positional-Ring type network LSA - New Network type for TDM-ring. - Ring ID: (Network Address/Mask) - No. of elements in the ring (a.k.a. ring neighbors) - Ring Bandwidth - Ring Protection (UPSR/BLSR) - ID of individual nodes (Interface IP address) - Ring type (2-Fiber vs. 4-Fiber, SONET vs. SDH) Network LSAwill beis required for SONET RING. Unlike the broadcast type, the sequence in which theNEsNetwork Elements (NEs) are placed on a RING-network is pertinent. The nodes in thetingring must be described clock wise, assuming theGNEGateway Network Element (GNE) as the starting element.9.7.9.3. TE-Router-Proxy LSA (0x8e) This is a variation to the TE-router LSA in that the TE-router LSA is not advertised by the network element, but rather by a trusted TE-router Proxy. This is typically the scenario in a non-packet TE network, where some of the nodes do not have OSPF functionality and count on a helper node to do the advertisement for them. One such example would be the SONET/SDH ADM nodes in a TDM ring. The nodes may principally depend upon the GNE (Gateway Network Element) to do the advertisement for them. TE-router-Proxy LSA shall not be used to advertise Area Border Routers and/or AS border Routers. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS age | Options | 0x8e | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link State ID (Router ID of the TE Network Element) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Advertising Router | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS sequence number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | LS checksum | length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 0 | Router-TE flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Router-TE flags (contd.) | Router-TE TLVs | +---------------------------------------------------------------+ | .... | +---------------------------------------------------------------+ | .... | # of TE links | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | 0 | Link-TE options | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link-TE flags | Zero or more Link-TE TLVs | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Link Data | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | ... |9.8. Others We may also introduce a new TE-NSSA LSA, similar to the native-NSSA LSA. TE-NSSA will help ensure that not all external TE routes are flooded into the NSSA area. A TE capable router can become the NSSA translator. All parameters and contents of TE-NSSA LSAs are transferred as is.10. Abstract topology representation with TE support Below, weassumeconsider a TE networkthat iscomposed of three OSPFareas, namelyareas - Area-1, Area-2 and Area-3, attached together through the backbone area.The following figure is an inter-area topology abstraction from the perspective of routers in Area-1. The abstraction is similar, but not the same, as that of the non-TE abstraction. As such, the authors claim the model is easy to understand and emulate. The abstraction illustrates reachability of TE networks and nodes in areas external to the local area and ASes external to the local AS. The abstraction also illustrates pre-established TE links that may be advertised by ABRs and ASBRs.Area-1 an has a single area border router, ABR-A1 and no ASBRs. Area-2 has anAreaarea border router ABR-A2 and an AS border router ASBR-S1. Area-3 has twoAreaarea border routers ABR-A2 andABR-A3;ABR-A3 and an AS border router ASBR-S2.There may be any number of Pre-engineered TE links amongst ABRs and ASBRs.The followingexamplenetwork also assumes asingle TE-linkpre-engineered TE circuit path between ABR-A1 and ABR-A2; between ABR-A1 and ABR-A3; between ABR-A2toand ASBR-S1; and between ABR-A3toand ASBR-S2.All Area borderThe following figure is an inter-area topology abstraction from the perspective of routers in Area-1. The abstraction illustrates reachability of TE networks and nodes within area to the external areas in the same ASborder routers are assumedand tobe represented by theirthe external ASes. The abstraction also illustrates pre-engineered TEcapabilities.circuit paths advertised by ABRs and ASBRs. +-------+ |Area-1 | +-------+ +-------------+ | |Reachable TE |+------++--------+ |networks in|--------|ABR-A1||-------| ABR-A1 | |backbone area|+------++--------+ +-------------+ | | |+-------------++--------------+ |+-------------------++-----------------+ | | | +-----------------+ | +-----------------+ |Pre-engineered TE| +----------+ |Pre-engineered TE| |circuit path(s) | | Backbone | |circuit path(s) | |to ABR-A2 | | Area | |to ABR-A3 | +-----------------+ +----------+ +-----------------+ | | | | +----------+ || | | |+--------------+ | +-----------+ | | | | +-----------+ |Reachable |+------------+ +------++--------+ +--------+ |Reachable | |TEnetworks|---|networks|------| ABR-A2 ||ABR-A3|--|TE| ABR-A3 |--|TE networks| |in Area A2 |+------------+ +------++--------+ +--------+ |in Area A3 | +-----------+/| | | | | | +-----------+/+-------------+ | |+-------------------++-----------------+ | +----------+/|+-------------+| +-----------+ | | | +-----------+ +--------------+ | | | +--------------+ |Reachable | |Pre-engineered| | | | |Pre-engineered| |TE networks| |TE Ckt path(s)| +------+ +------+ |TE Ckt path(s)| |in Area A3 | |to ASBR-S1 | |Area-2| |Area-3| |to ASBR-S2 | +-----------+ +--------------+ +------+ +------+ +--------------+ |/|/| | | +--------+ | +-----------+ +-------------+ |/|/| | |AS external | +---------++-------------++---------+ |TE-network|------||----| ASBR-S1 | | ASBR-S2 | |reachability | +---------++-------------++---------+ |from ASBR-S1 | | | | +-------------+ +---+ +-------+ +-----------+ | | | +-----------------+ +-------------+ +-----------------+ |Pre-engineered TE| |AS External | |Pre-engineered TE| |circuit path(s) | |TE-Network | |circuit path(s) | |reachable from | |reachability | |reachable from | |ASBR-S1 | |from ASBR-S2 | |ASBR-S2 | +-----------------+ +-------------+ +-----------------+ Figure 9: Inter-Area Abstraction as viewed by Area-1 TE-routers 11. Changes to Data structures in OSPF-TE nodes 11.1. Changes to Router data structure The router with TE extensions must be able to include all the TE capabilities (as specified in section 7.1) in the router data structure. Further, routers providing proxy service to other TE routers must also track the router and associated interface data structures for all the TE client nodes for which the proxy service is being provided. Presumably, the interaction between the Proxy server and the proxy clients is out-of-band. 11.2. Twosetsets of Neighbors Two sets of neighbor data structureswill need to be maintained.are required. TE-neighbors set is used to advertise TE LSAs. Only the TE-nodes will be members of the TE-neighbor set. Native neighbors set will be used to advertise native LSAs. All neighboring nodes supporting non-TE linkscan beare part of this set. As for flooding optimizations based on neighbors set, readers may refer [FLOOD-OPT]. 11.3. Changes to Interface data structure The following new fields are introduced to the interface data structure. These changes are in addition to the changes specified in [FLOOD-OPT]. TePermitted If the value of the flag is TRUE, the interfaceis permissible tomay be advertised as a TE-enabled interface. NonTePermitted If the value of the flag is TRUE, the interface permits non-TE traffic on the interface. Specifically, this is applicable to packet networks, where data links may permit both TE andnon-TEIP packets. For FSC and LSC TE networks, this flagwill be set to FALSE. For Packet networks that do not permit non-TE traffic on TE links also, this flagis set toTRUE. PktTerminatedFALSE. IpTerminated If the value of the flag is TRUE, the interfaceterminatesprocesses IP Packet data and hence may be used forIP andOSPF data exchange. AdjacencySychRequired If the value of the flag is TRUE, the interface may be used to synchronize the LSDB across all adjacent neighbors. This is TRUE by default to allPktTerminatedIpTerminated interfaces that are enabled for OSPF. However, it is possible to set this to FALSE for some of the interfaces. TE-TLVs Each interface may potentially have a maximum of 16 TLVS that describe the link characteristics. The following existing fields in Interface data structure will take on additional values to support TE extensions. Type The OSPF interface type can also be of type "Positional-RING". The Positional-ring type is different from other types (such as broadcast and NBMA) in that the exact location of the nodes on the ring is relevant, evenasthough they are all on the same ring. SONET ADM ring is a good example of this. Complete ring positional-ring description may be provided by the GNE on a ring as a TE-network LSA for the ring. List of Neighbors The list may be statically defined for aninterface,interface without requiring the use of Hello protocol. 12. IANA Considerations12.1. TE-compliant-SPF routers MulticastThis document proposes that TE LSA types and TE TLVs be maintained by the IANA. The document also proposes an OSPFIGP-TE multicast address be assigned by the IANA for the exchange of TE database descriptors. OSPFIGP-TE multicast address is suggested a value of 224.0.0.24 so as not to conflict with the recognized multicast addressallocationdefinitions, as defined in http://www.iana.org/assignments/multicast-addresses The following sub-section explains the criteria to be used by the IANA to assign TE LSA types and TE TLVs. 12.1. TE LSA type values LSA type is an 8-bit field required by each LSA. TE LSA types will have the high bit set to 1. TE LSAs can range from 0x80 through 0xFF. The following values are defined in sections 8.0 and 9.0. The remaining values are available for assignment by the IANA with IETF Consensus [Ref 11]. TE LSA Type Value _________________________________________ TE-Router LSA 0x81 TE-Summary Network LSA 0x83 TE-Summary router LSA 0x84 TE-AS-external LSAs 0x85 TE-Circuit-paths LSA 0x8C TE-incremental-link-Update LSA 0x8d TE-Router-Proxy LSA 0x8e 12.2.New TE-LSA Types 12.3. New TLVs (Router-TETE TLV tag values TLV type is a 16-bit field required by each TE TLV. TLV type shall be unique across the router andLink-TE TLVs) 12.3.1. TE-selection-Criterialink TLVs. A TLV(Tag ID = 1) - Bandwidth based LSPs (1) - Priority based LSPs (2) - Backup LSP (3) - Link cost (4) 12.3.2. MPLS-Signaling protocoltype can range from 0x0001 through 0xFFFF. TLV(Tag ID = 3) - RSVP-TE signaling - LDP signaling - CR-LDP signaling 12.3.3. Constraint-SPF algorithms-Supporttype 0 is reserved and unassigned. The following TLV(Tag ID = 4) - CSPF Algorithm Codes. 12.3.4. SRLG-TLV (Tag ID = 0x81) - SRLG group IDs 12.3.5. BW-TLV (Tag ID = 0x82) 12.3.6 CO-TLV (Tag ID = 0x83)types are defined in sections 8.0 and 9.0. The remaining values are available for assignment by the IANA with IETF Consensus [Ref 11]. TE TLV Tag Reference Value Section _________________________________________________________ TE-LINK-TLV-SRLG Section 8.1.4.1 0x0001 TE-LINK-TLV-BWA Section 8.1.4.2 0x0002 TE-LINK-TLV-LUG Section 8.1.4.3 0x0003 TE-LINK-TLV-COLOR Section 8.1.4.4 0x0004 TE-NODE-TLV-MPLS-SWITCHING Section 8.1.2.1 0x8001 TE-NODE-TLV-MPLS-SIG-PROTOCOLS Section 8.1.2.2 0x8002 TE-NODE-TLV-CSPF-ALG Section 8.1.2.3 0x8003 13. Acknowledgements The authors wish to specially thank Chitti Babu and his team for verifying portions of the specification for a packet network. The authors also wish to thank Vishwas Manral,Chitti Babu,Riyad Hartani and Tricci So for their valuable comments and feedback on the draft. 14. Security Considerations Security considerations for the base OSPF protocol are covered in [OSPF-v2] and [SEC-OSPF]. This memo does not create any new security issues for the OSPF protocol. Securityconsiderations formeasures applied to thebasenative OSPFprotocol(refer [SEC-OSPF]) arecovereddirectly applicable to the TE LSAs described in[OSPF-v2]. Asthe document. Discussed below are the security considerations in processing TE LSAs. Secure communication between OSPF-TE nodes has ageneral rule,number of components. Authorization, authentication, integrity and confidentiality. Authorization refers to whether aTE networkparticular OSPF-TE node islikelyauthorized togenerate significantly more control traffic thanreceive or propagate the TE LSAs to its neighbors. Failing the authorization process might indicate anative OSPF network. The excess traffic is almost directly proportionalresource theft attempt or unauthorized resource advertisement. In either case, the OSPF-TE nodes should take proper measures to audit/log such attempts so as to alert the administrator to take necessary action. OSPF-TE nodes may refuse to communicate with the neighboring nodes that fail to prompt the required credentials. Authentication refers to confirming the identity of an originator for the datagrams received from the originator. Lack of strong credentials for authentication of OSPF-TE LSAs can seriously jeopardize therate at whichTEcircuits are setupservice rendered by the network. A consequence of not authenticating a neighbor would be that an attacker could spoof the identity of a "legitimate" OSPF-TE node andtorn down withinmanipulate the state, and the TE database including the topology and metrics collected. This could potentially lead to denial-of-service on the TE network. Another consequence of not authenticating is that anautonomous system. Itattacker could pose as OSPF-TE neighbor and respond in a manner that would divert TE data to the attacker. Integrity isimportantrequired to ensure that an OSPF-TE message has not been accidentally or maliciously altered or destroyed. The result of a lack of data integrity enforcement in an untrusted environment could be that an imposter will alter the messages sent by a legitimate adjacent neighbor and bring the OSPF-TE on a node and the whole network to a halt or cause a denial of service for the TE circuit paths effected by the alteration. Confidentiality of MIDCOM messages ensure that the TEdatabase synchronizations happen quickly when comparedLSAs are accessible only to theaggregateauthorized entities. When OSPF-TE is deployed in an untrusted environment, lack of confidentiality will allow an intruder to perform traffic flow analysis and snoop the TE control network to monitor the traffic metrics and the rate at which circuit paths are being setupan tear-down rates. REFERENCESand torn-down. The intruder could cannibalize a lesser secure OSPF-TE node and destroy or compromise the state and TE-LDSB on the node. Needless to say, the least secure OSPF-TE will become the achilles heel and make the TE network vulnerable to security attacks. 15. Normative References [IETF-STD] Bradner, S.," The Internet Standards Process -- Revision 3","Key words for use in RFCs to indicate Requirement Levels", BCP 14, RFC1602, IETF, October 1996.2119, March 1997. [RFC 1700] J. Reynolds and J. Postel, "Assigned Numbers", RFC 1700 [RFC 2434] Narten, T. and H. Alvestrand, "Guidelines for writing an IANA Considerations Section in RFCs", BCP 26, RFC 2434, October 1998. [MPLS-TE] Awduche, D., et al, "Requirements for Traffic Engineering Over MPLS," RFC 2702, September 1999. [OSPF-v2] Moy, J., "OSPF Version 2", RFC 2328, April 1998. [SEC-OSPF] Murphy, S., Badger, M., and B. Wellington, "OSPF with Digital Signatures", RFC 2154, June 1997 [FLOOD-OPT] Zinin, A. and M. Shand, "Flooding Optimizations in link-state routing protocols", work in progress, <draft-ietf-ospf-isis-flood-opt-01.txt> 15. Informative References [GMPLS-TE] P.A. Smith et. al, "Generalized MPLS - Signaling Functional Description", work in progress,draft-ietf-mpls-generalized-signaling-03.txtdraft-ietf-mpls-generalized-signaling-09.txt [RSVP-TE] Awduche, D., L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP Tunnels", RFC3209, IETF, December 2001 [CR-LDP] Jamoussi, B. et al, "Constraint-Based LSP Setup using LDP", draft-ietf-mpls-cr-ldp-06.txt, Work in Progress.[OSPF-v2] Moy, J., "OSPF Version 2", RFC 2328, April 1998.[MOSPF] Moy, J., "Multicast Extensions to OSPF", RFC 1584, March 1994. [NSSA] Coltun, R., V. Fuller and P. Murphy, "The OSPF NSSA Option",draft-ietf-ospf-nssa-update-10.txt,draft-ietf-ospf-nssa-update-11.txt, Work in Progress. [OPAQUE] Coltun, R., "The OSPF Opaque LSA Option," RFC 2370, July 1998.[FLOOD-OPT] Zinin, A. and M. Shand, "Flooding Optimizations in link-state routing protocols", work in progress, <draft-ietf-ospf-isis-flood-opt-01.txt>[OPQLSA-TE] Katz, D., D. Yeung and K. Kompella, "Traffic Engineering Extensions to OSPF", work in progress,<draft-katz-yeung-ospf-traffic-06.txt><draft-katz-yeung-ospf-traffic-09.txt> [OPQLSA-GMPLS] Kompella, K., Y. Rekhter, A. Banerjee, J. Drake, G. Bernstein, D. Fedyk, E. Mannie, D. Saha and V. Sharma, "OSPF Extensions in Support of Generalized MPLS",<draft-ietf-ccamp-ospf-gmpls-extensions-01.txt>,<draft-ietf-ccamp-ospf-gmpls-extensions-09.txt>, work in progress. Authors' Addresses Pyda Srisuresh Kuokoa Networks, Inc. 475 Potrero Avenue Sunnyvale, CA 94085 U.S.A. EMail: srisuresh@yahoo.com Paul Joseph Force10 Networks 1440 McCarthy Boulevard Milpitas, CA 95035 U.S.A. EMail: pjoseph@Force10Networks.com