draft-ietf-ccamp-gmpls-general-constraints-ospf-te-05.txt   draft-ietf-ccamp-gmpls-general-constraints-ospf-te-06.txt 
Network work group Fatai Zhang Network work group Fatai Zhang
Internet Draft Young Lee Internet Draft Young Lee
Intended status: Standards Track Jianrui Han Intended status: Standards Track Jianrui Han
Huawei Huawei
G. Bernstein G. Bernstein
Grotto Networking Grotto Networking
Yunbin Xu Yunbin Xu
CATR CATR
Expires: December 26, 2013 June 26, 2013 Expires: June 23, 2014 December 23, 2013
OSPF-TE Extensions for General Network Element Constraints OSPF-TE Extensions for General Network Element Constraints
draft-ietf-ccamp-gmpls-general-constraints-ospf-te-05.txt draft-ietf-ccamp-gmpls-general-constraints-ospf-te-06.txt
Status of this Memo Status of this Memo
This Internet-Draft is submitted to IETF in full conformance with This Internet-Draft is submitted to IETF in full conformance with
the provisions of BCP 78 and BCP 79. the provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 1, line 38 skipping to change at page 1, line 38
months and may be updated, replaced, or obsoleted by other documents months and may be updated, replaced, or obsoleted by other documents
at any time. It is inappropriate to use Internet-Drafts as at any time. It is inappropriate to use Internet-Drafts as
reference material or to cite them other than as "work in progress." reference material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html http://www.ietf.org/shadow.html
This Internet-Draft will expire on December 26, 2013. This Internet-Draft will expire on June 23, 2014.
Copyright Notice Copyright Notice
Copyright (c) 2013 IETF Trust and the persons identified as the Copyright (c) 2013 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with carefully, as they describe your rights and restrictions with
respect to this document. Code Components extracted from this respect to this document. Code Components extracted from this
document must include Simplified BSD License text as described in document must include Simplified BSD License text as described in
Section 4.e of the Trust Legal Provisions and are provided without Section 4.e of the Trust Legal Provisions and are provided without
warranty as described in the Simplified BSD License. warranty as described in the Simplified BSD License.
Abstract Abstract
Generalized Multiprotocol Label Switching can be used to control a Generalized Multiprotocol Label Switching (GMPLS) can be used to
wide variety of technologies including packet switching (e.g., MPLS), control a wide variety of technologies including packet switching
time-division (e.g., SONET/SDH, OTN), wavelength (lambdas), and (e.g., MPLS), time-division (e.g., SONET/SDH, Optical Transport
spatial switching (e.g., incoming port or fiber to outgoing port or Network (OTN)), wavelength (lambdas), and spatial switching (e.g.,
fiber). In some of these technologies network elements and links may incoming port or fiber to outgoing port or fiber). In some of these
impose additional routing constraints such as asymmetric switch technologies, network elements and links may impose additional
connectivity, non-local label assignment, and label range routing constraints such as asymmetric switch connectivity, non-
limitations on links. This document describes OSPF routing protocol local label assignment, and label range limitations on links. This
document describes Open Shortest Path First (OSPF) routing protocol
extensions to support these kinds of constraints under the control extensions to support these kinds of constraints under the control
of Generalized MPLS (GMPLS). of GMPLS.
Conventions used in this document Conventions used in this document
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC-2119 [RFC2119]. document are to be interpreted as described in RFC-2119 [RFC2119].
Table of Contents Table of Contents
1. Introduction...................................................3 1. Introduction...................................................3
2. Node Information...............................................3 2. Node Information...............................................4
2.1. Connectivity Matrix.......................................4 2.1. Connectivity Matrix.......................................4
3. Link Information...............................................5 3. Link Information...............................................5
3.1. Port Label Restrictions...................................5 3.1. Port Label Restrictions...................................5
4. Routing Procedures.............................................6 4. Routing Procedures.............................................6
5. Scalability and Timeliness.....................................6 5. Scalability and Timeliness.....................................6
5.1. Different Sub-TLVs into Multiple LSAs.....................7 5.1. Different Sub-TLVs into Multiple LSAs.....................7
5.2. Decomposing a Connectivity Matrix into Multiple Matrices..7 5.2. Decomposing a Connectivity Matrix into Multiple Matrices..7
6. Security Considerations........................................7 6. Security Considerations........................................7
7. IANA Considerations............................................8 7. IANA Considerations............................................8
7.1. Node Information..........................................8 7.1. Node Information..........................................8
skipping to change at page 3, line 4 skipping to change at page 3, line 5
3. Link Information...............................................5 3. Link Information...............................................5
3.1. Port Label Restrictions...................................5 3.1. Port Label Restrictions...................................5
4. Routing Procedures.............................................6 4. Routing Procedures.............................................6
5. Scalability and Timeliness.....................................6 5. Scalability and Timeliness.....................................6
5.1. Different Sub-TLVs into Multiple LSAs.....................7 5.1. Different Sub-TLVs into Multiple LSAs.....................7
5.2. Decomposing a Connectivity Matrix into Multiple Matrices..7 5.2. Decomposing a Connectivity Matrix into Multiple Matrices..7
6. Security Considerations........................................7 6. Security Considerations........................................7
7. IANA Considerations............................................8 7. IANA Considerations............................................8
7.1. Node Information..........................................8 7.1. Node Information..........................................8
7.2. Link Information..........................................8 7.2. Link Information..........................................8
8. References.....................................................8 8. References.....................................................8
8.1. Normative References......................................8 8.1. Normative References......................................8
8.2. Informative References....................................9 8.2. Informative References....................................9
9. Authors' Addresses .............................................9 9. Authors' Addresses .............................................9
Acknowledgment...................................................11 Acknowledgment...................................................11
1. Introduction 1. Introduction
Some data plane technologies that wish to make use of a GMPLS Some data plane technologies that require the use of a GMPLS control
control plane contain additional constraints on switching capability plane impose additional constraints on switching capability and
and label assignment. In addition, some of these technologies should label assignment. In addition, some of these technologies should be
be capable of performing non-local label assignment based on the capable of performing non-local label assignment based on the nature
nature of the technology, e.g., wavelength continuity constraint in of the technology, e.g., wavelength continuity constraint in
WSON [RFC6163]. Such constraints can lead to the requirement for Wavelength Switched Optical Network (WSON) [RFC6163]. Such
link by link label availability in path computation and label constraints can lead to the requirement for link by link label
assignment. availability in path computation and label assignment.
[GEN-Encode] provides efficient encodings of information needed by [GEN-Encode] provides efficient encodings of information needed by
the routing and label assignment process in technologies such as the routing and label assignment process in technologies such as
WSON and are potentially applicable to a wider range of WSON and are potentially applicable to a wider range of
technologies. technologies. The encoding provided in [GEN-Encode] is protocol-
neutral and can be used in routing, signaling and/or Path
Computation Element communication protocol extensions.
This document defines extensions to the OSPF routing protocol based This document defines extensions to the OSPF routing protocol based
on [GEN-Encode] to enhance the Traffic Engineering (TE) properties on [GEN-Encode] to enhance the Traffic Engineering (TE) properties
of GMPLS TE which are defined in [RFC3630], [RFC4202], and [RFC4203]. of GMPLS TE which are defined in [RFC3630], [RFC4202], and [RFC4203].
The enhancements to the Traffic Engineering (TE) properties of GMPLS The enhancements to the TEproperties of GMPLS TE links can be
TE links can be announced in OSPF TE LSAs. The TE LSA, which is an advertised in OSPF TE LSAs. The TE LSA, which is an opaque LSA with
opaque LSA with area flooding scope [RFC3630], has only one top- area flooding scope [RFC3630], has only one top-level
level Type/Length/Value (TLV) triplet and has one or more nested Type/Length/Value (TLV) triplet and has one or more nested sub-TLVs
sub-TLVs for extensibility. The top-level TLV can take one of three for extensibility. The top-level TLV can take one of three values (1)
values (1) Router Address [RFC3630], (2) Link [RFC3630], (3) Generic Router Address [RFC3630], (2) Link [RFC3630], (3) Generic Node
Node Attribute defined in Section 2. In this document, we enhance Attribute defined in Section 2. In this document, we enhance the
the sub-TLVs for the Link TLV and define a new top-level TLV sub-TLVs for the Link TLV and define a new top-level TLV (Generic
(Generic Node Attribute TLV) in support of the general network Node Attribute TLV) in support of the general network element
element constraints under the control of GMPLS. constraints under the control of GMPLS.
The detailed encoding of OSPF extensions are not defined in this The detailed encoding of OSPF extensions are not defined in this
document. [GEN-Encode] provides encoding detail. document. [GEN-Encode] provides encoding details.
2. Node Information 2. Node Information
According to [GEN-Encode], the additional node information According to [GEN-Encode], the additional node information
representing node switching asymmetry constraints includes Node ID, representing node switching asymmetry constraints includes Node ID
connectivity matrix. Except for the Node ID which should comply with and connectivity matrix. Except for the Node ID, which should comply
Routing Address described in [RFC3630], the other pieces of with Routing Address described in [RFC3630], the other pieces of
information are defined in this document. information are defined in this document.
This document defines a new top TLV named the Generic Node Attribute
TLV which carries attributes related to a general network element.
This Generic Node Attribute TLV contains one or more sub-TLVs
Per [GEN-Encode], we have identified the following new Sub-TLVs to Per [GEN-Encode], we have identified the following new Sub-TLVs to
the Generic Node Attribute TLV. Detail description for each newly the Node Attribute TLV as defined in [RFC5786]. Detailed description
defined Sub-TLV is provided in subsequent sections: for each newly defined Sub-TLV is provided in subsequent sections:
Sub-TLV Type Length Name Sub-TLV Type Length Name
TBD variable Connectivity Matrix TBD variable Connectivity Matrix
In some specific technologies, e.g., WSON networks, Connectivity In some specific technologies, e.g., WSON networks, the Connectivity
Matrix sub-TLV may be optional, which depends on the control plane Matrix sub-TLV may be optional, which depends on the control plane
implementations. Usually, for example, in WSON networks, implementations. Usually, for example, in WSON networks,
Connectivity Matrix sub-TLV may appear in the LSAs because WSON Connectivity Matrix sub-TLV may be advertised in the LSAs since WSON
switches are asymmetric at present. It is assumed that the switches switches are currently asymmetric. If no Connectivity Matrix sub-TLV
are symmetric switching, if there is no Connectivity Matrix sub-TLV is included, it is assumed that the switches support symmetric
in the LSAs. switching.
2.1. Connectivity Matrix 2.1. Connectivity Matrix
It is necessary to identify which ingress ports and labels can be If the switching devices supporting certain data plane technology is
switched to some specific labels on a specific egress port, if the asymmetric, it is necessary to identify which ingress ports and
switching devices in some technology are highly asymmetric. labels can be switched to some specific labels on a specific egress
port.
The Connectivity Matrix is used to identify these restrictions, The Connectivity Matrix is used to identify these restrictions,
which can represent either the potential connectivity matrix for which can represent either the potential connectivity matrix for
asymmetric switches (e.g. ROADMs and such) or fixed connectivity for asymmetric switches (e.g., ROADMs and such) or fixed connectivity
an asymmetric device such as a multiplexer as defined in [WSON- for an asymmetric device such as a multiplexer as defined in [WSON-
Info]. Info].
The Connectivity Matrix is a sub-TLV (the type is TBD by IANA) of The Connectivity Matrix is a sub-TLV of the Generic Node Attribute
the Generic Node Attribute TLV. The length is the length of value TLV. The length is the length of value field in octets. The meaning
field in octets. The meaning and format of this sub-TLV are defined and format of this sub-TLV value field are defined in Section 2.1 of
in Section 5.3 of [GEN-Encode]. One sub-TLV contains one matrix. The [GEN-Encode]. One sub-TLV contains one matrix. The Connectivity
Connectivity Matrix sub-TLV may occur more than once to contain Matrix sub-TLV may occur more than once to contain multiple matrices
multi-matrices within the Generic Node Attribute TLV. In addition a within the Generic Node Attribute TLV. In addition a large
large connectivity matrix can be decomposed into smaller separate connectivity matrix can be decomposed into smaller sub-matrices for
matrices for transmission in multiple LSAs as described in Section 5. transmission in multiple LSAs as described in Section 5.
3. Link Information 3. Link Information
The most common link sub-TLVs nested to link top-level TLV are The most common link sub-TLVs nested in the top-level link TLV are
already defined in [RFC3630], [RFC4203]. For example, Link ID, already defined in [RFC3630], [RFC4203]. For example, Link ID,
Administrative Group, Interface Switching Capability Descriptor Administrative Group, Interface Switching Capability Descriptor
(ISCD), Link Protection Type, Shared Risk Link Group Information (ISCD), Link Protection Type, Shared Risk Link Group Information
(SRLG), and Traffic Engineering Metric are among the typical link (SRLG), and Traffic Engineering Metric are among the typical link
sub-TLVs. sub-TLVs.
Per [GEN-Encode], we add the following additional link sub-TLVs to Per [GEN-Encode], we add the following additional link sub-TLVs to
the link-TLV in this document. the link TLV in this document.
Sub-TLV Type Length Name Sub-TLV Type Length Name
TBD variable Port Label Restrictions TBD variable Port Label Restrictions
Generally all the sub-TLVs above are optional, which depends on the Generally all the sub-TLVs above are optional, which depends on the
control plane implementations. If it is default no restrictions on control plane implementations. The Port Label Restrictions sub-TLV
labels, Port Label Restrictions sub-TLV may not appear in the LSAs. will not be advertised when there are no restrictions on label
assignment.
3.1. Port Label Restrictions 3.1. Port Label Restrictions
Port label restrictions describe the label restrictions that the Port label restrictions describe the label restrictions that the
network element (node) and link may impose on a port. These network element (node) and link may impose on a port. These
restrictions represent what labels may or may not be used on a link restrictions represent what labels may or may not be used on a link
and are intended to be relatively static. More dynamic information and are intended to be relatively static. For increased modeling
is contained in the information on available labels. Port label flexibility, port label restrictions may be specified relative to
restrictions are specified relative to the port in general or to a the port in general or to a specific connectivity matrix.
specific connectivity matrix for increased modeling flexibility.
For example, Port Label Restrictions describes the wavelength For example, the Port Label Restrictions describes the wavelength
restrictions that the link and various optical devices such as OXCs, restrictions that the link and various optical devices such as OXCs,
ROADMs, and waveband multiplexers may impose on a port in WSON. ROADMs, and waveband multiplexers may impose on a port in WSON.
These restrictions represent what wavelength may or may not be used These restrictions represent what wavelength may or may not be used
on a link and are relatively static. The detailed information about on a link and are relatively static. The detailed information about
Port label restrictions is described in [WSON-Info]. port label restrictions is described in [WSON-Info].
The Port Label Restrictions is a sub-TLV (the type is TBD by IANA) The Port Label Restrictions sub-TLV is a sub-TLV of the Link TLV.
of the Link TLV. The length is the length of value field in octets. The length is the length of value field in octets. The meaning and
The meaning and format of this sub-TLV are defined in Section 5.4 of format of this sub-TLV value field are defined in Section 2.2 of
[GEN-Encode]. The Port Label Restrictions sub-TLV may occur more [GEN-Encode]. The Port Label Restrictions sub-TLV may occur more
than once to specify a complex port constraint within the link TLV. than once to specify a complex port constraint within the link TLV.
4. Routing Procedures 4. Routing Procedures
All the sub-TLVs are nested to top-level TLV(s) and contained in All the sub-TLVs are nested in top-level TLV(s) and contained in
Opaque LSAs. The flooding of Opaque LSAs must follow the rules Opaque LSAs. The flooding rules of Opaque LSAs are specified in
specified in [RFC2328], [RFC5250], [RFC3630], [RFC4203]. [RFC2328], [RFC5250], [RFC3630], [RFC4203].
Considering the routing scalability issues in some cases, the Considering the routing scalability issues in some cases, the
routing protocol should be capable of supporting the separation of routing protocol should be capable of supporting the separation of
dynamic information from relatively static information to avoid dynamic information from relatively static information to avoid
unnecessary updates of static information when dynamic information unnecessary updates of static information when dynamic information
is changed. A standard-compliant approach is to separate the dynamic is changed. A standards-compliant approach is to separate the
information sub-TLVs from the static information sub-TLVs, each dynamic information sub-TLVs from the static information sub-TLVs,
nested to top-level TLV ([RFC3630 and RFC5876]), and advertise them each nested in a separate top-level TLV ([RFC3630 and RFC5876]), and
in the separate OSPF TE LSAs. advertise them in the separate OSPF TE LSAs.
For node information, since the Connectivity Matrix information is For node information, since the Connectivity Matrix information is
static, the LSA containing the Generic Node Attribute TLV can be static, the LSA containing the Generic Node Attribute TLV can be
updated with a lower frequency to avoid unnecessary updates. updated with a lower frequency to avoid unnecessary updates.
For link information, a mechanism MAY be applied such that static For link information, a mechanism MAY be applied such that static
information and dynamic information of one TE link are contained in information and dynamic information of one TE link are contained in
separate Opaque LSAs. For example, the Port Label Restrictions separate Opaque LSAs. For example, the Port Label Restrictions
information sub-TLV could be nested to the top level link TLVs and information sub-TLV could be nested in separate top level link TLVs
advertised in the separate LSAs. and advertised in the separate LSAs.
Note that as with other TE information, an implementation SHOULD Note that as with other TE information, an implementation SHOULD
take measures to avoid rapid and frequent updates of routing take measures to avoid rapid and frequent updates of routing
information that could cause the routing network to become swamped. information that could cause the routing network to become swamped.
A threshold mechanism MAY be applied such that updates are only A threshold mechanism MAY be applied such that updates are only
flooded when a number of changes have been made to the label flooded when a number of changes have been made to the label
availability information (e.g., wavelength availability) within a availability information (e.g., wavelength availability) within a
specific time. Such mechanisms MUST be configurable if they are specific time interval. Such mechanisms MUST be configurable if they
implemented. are implemented.
5. Scalability and Timeliness 5. Scalability and Timeliness
This document has defined four sub-TLVs for describing generic This document has defined two sub-TLVs for describing generic
routing contraints. The examples given in [Gen-Encode] show that routing contraints. The examples given in [Gen-Encode] show that
very large systems, in terms of label count or ports can be very very large systems, in terms of label count or ports can be very
efficiently encoded. However there has been concern expressed that efficiently encoded. However there has been concern expressed that
some possible systems may produce LSAs that exceed the IP Maximum some possible systems may produce LSAs that exceed the IP Maximum
Transmission Unit (MTU) and that methods be given to allow for the Transmission Unit (MTU) and that methods be given to allow for the
splitting of general constraint LSAs into smaller LSA that are under splitting of general constraint LSAs into smaller LSAs that are
the MTU limit. This section presents a set of techniques that can be under the MTU limit. This section presents a set of techniques that
used for this purpose. can be used for this purpose.
5.1. Different Sub-TLVs into Multiple LSAs 5.1. Different Sub-TLVs into Multiple LSAs
Two sub-TLVs are defined in this document: Two sub-TLVs are defined in this document:
1. Connectivity Matrix (Generic Node Attribute TLV) 1. Connectivity Matrix (Node Attribute TLV)
2. Port Label Restrictions (Link TLV) 2. Port Label Restrictions (Link TLV)
Except for the Connectivity Matrix all these are carried in an Link The Connectivity Matrix can be carried in the Node Attribute TLV as
TLV of which there can be at most one in an LSA [RFC3630]. Of these defined in [RFC5786] while the Port Label Restrictions can
sub-TLVs the Port Label Restrictions are relatively static, i.e., becarried in an Link TLV of which there can be at most one in an LSA
only would change with hardware changes or significant system as defined in [RFC3630]. Note that the Port Label Restrictions are
reconfiguration. relatively static, i.e., only would change with hardware changes or
significant system reconfiguration.
5.2. Decomposing a Connectivity Matrix into Multiple Matrices 5.2. Decomposing a Connectivity Matrix into Multiple Matrices
In the highly unlikely event that a Connectivity matrix sub-TLV by In the highly unlikely event that a Connectivity Matrix sub-TLV by
itself would result in an LSA exceeding the MTU, a single large itself would result in an LSA exceeding the MTU, a single large
matrix can be decomposed into sub-matrices. Per [GEN-Encode] a matrix can be decomposed into sub-matrices. Per [GEN-Encode] a
connectivity matrix just consists of pairs of input and output ports connectivity matrix just consists of pairs of input and output ports
that can reach each other and hence such this decomposition would be that can reach each other and hence such this decomposition would be
straightforward. Each of these sub-matrices would get a unique straightforward. Each of these sub-matrices would get a unique
matrix identifier per [GEN-Encode]. matrix identifier per [GEN-Encode].
From the point of view of a path computation process, prior to From the point of view of a path computation process, prior to
receiving an LSA with a Connectivity Matrix sub-TLV, no connectivity receiving an LSA with a Connectivity Matrix sub-TLV, no connectivity
restrictions are assumed, i.e., the standard GMPLS assumption of any restrictions are assumed, i.e., the standard GMPLS assumption of any
skipping to change at page 8, line 5 skipping to change at page 8, line 5
a path through the system when one actually exists. Both cases are a path through the system when one actually exists. Both cases are
currently encountered and handled with existing GMPLS mechanisms. currently encountered and handled with existing GMPLS mechanisms.
Due to the reliability mechanisms in OSPF the phenomena of late or Due to the reliability mechanisms in OSPF the phenomena of late or
missing Connectivity Matrix sub-TLVs would be relatively rare. missing Connectivity Matrix sub-TLVs would be relatively rare.
6. Security Considerations 6. Security Considerations
This document does not introduce any further security issues other This document does not introduce any further security issues other
than those discussed in [RFC 3630], [RFC 4203]. than those discussed in [RFC 3630], [RFC 4203].
7. IANA Considerations For general security aspects relevant to Generalized Multiprotocol
Label Switching (GMPLS)-controlled networks, please refer to
[RFC5920].
[RFC3630] says that the top level Types in a TE LSA and Types for 7. IANA Considerations
sub-TLVs for each top level Types must be assigned by Expert Review,
and must be registered with IANA.
IANA is requested to allocate new Types for the TLV or sub-TLVs as IANA is requested to allocate new sub-TLVs as defined in Sections 2
defined in Sections 2 and 3 as follows: and 3 as follows:
7.1. Node Information 7.1. Node Information
This document introduces a new Top Level Node TLV (Generic Node This document also introduces the following sub-TLVs of Node
Attribute TLV) under the OSPF TE LSA defined in [RFC3630].
Value TLV Type
TBA Generic Node Attribute
This document also introduces the following sub-TLVs of Generic Node
Attribute TLV: Attribute TLV:
Type sub-TLV Type sub-TLV
TBD Connectivity Matrix TBD Connectivity Matrix
7.2. Link Information 7.2. Link Information
This document introduces the following sub-TLV of TE Link TLV (Value This document introduces the following sub-TLV of TE Link TLV (Value
2): 2):
skipping to change at page 8, line 48 skipping to change at page 8, line 41
8. References 8. References
8.1. Normative References 8.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997. Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC2328] Moy, J., "OSPF Version 2", STD 54, RFC 2328, April 1998. [RFC2328] Moy, J., "OSPF Version 2", STD 54, RFC 2328, April 1998.
[RFC5250] L. Berger, I. Bryskin, A. Zinin, R. Coltun "The OSPF
Opaque LSA Option", RFC 5250, July 2008.
[RFC3630] Katz, D., Kompella, K., and Yeung, D., "Traffic [RFC3630] Katz, D., Kompella, K., and Yeung, D., "Traffic
Engineering (TE) Extensions to OSPF Version 2", RFC 3630, Engineering (TE) Extensions to OSPF Version 2", RFC 3630,
September 2003. September 2003.
[RFC4202] Kompella, K., Ed., and Y. Rekhter, Ed., "Routing [RFC4202] Kompella, K., Ed., and Y. Rekhter, Ed., "Routing
Extensions in Support of Generalized Multi-Protocol Label Extensions in Support of Generalized Multi-Protocol Label
Switching (GMPLS)", RFC 4202, October 2005 Switching (GMPLS)", RFC 4202, October 2005
[RFC4203] Kompella, K., Ed., and Y. Rekhter, Ed., "OSPF Extensions [RFC4203] Kompella, K., Ed., and Y. Rekhter, Ed., "OSPF Extensions
in Support of Generalized Multi-Protocol Label Switching in Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 4203, October 2005. (GMPLS)", RFC 4203, October 2005.
[RFC5250] L. Berger, I. Bryskin, A. Zinin, R. Coltun "The OSPF
Opaque LSA Option", RFC 5250, July 2008.
[RFC5786] R. Aggarwal and K. Kompella,'' Advertising a Router's Local
Addresses in OSPF Traffic Engineering (TE) Extensions'',
RFC 5786, March 2010.
[GEN-Encode] G. Bernstein, Y. Lee, D. Li, W. Imajuku, " General [GEN-Encode] G. Bernstein, Y. Lee, D. Li, W. Imajuku, " General
Network Element Constraint Encoding for GMPLS Controlled Network Element Constraint Encoding for GMPLS Controlled
Networks", work in progress: draft-ietf-ccamp-general- Networks", work in progress: draft-ietf-ccamp-general-
constraint-encode. constraint-encode.
[RFC6205] T. Otani, H. Guo, K. Miyazaki, D. Caviglia, " Generalized
Labels for Lambda-Switching Capable Label Switching
Routers", RFC 6205, January 2011.
8.2. Informative References 8.2. Informative References
[RFC6163] Y. Lee, G. Bernstein, W. Imajuku, "Framework for GMPLS and [RFC6163] Y. Lee, G. Bernstein, W. Imajuku, "Framework for GMPLS and
PCE Control of Wavelength Switched Optical Networks PCE Control of Wavelength Switched Optical Networks
(WSON)", RFC 6163, February 2011. (WSON)", RFC 6163, February 2011.
[WSON-Info] Y. Lee, G. Bernstein, D. Li, W. Imajuku, "Routing and [WSON-Info] Y. Lee, G. Bernstein, D. Li, W. Imajuku, "Routing and
Wavelength Assignment Information Model for Wavelength Wavelength Assignment Information Model for Wavelength
Switched Optical Networks", work in progress: draft-ietf- Switched Optical Networks", work in progress: draft-ietf-
ccamp-rwa-info. ccamp-rwa-info.
skipping to change at page 13, line 11 skipping to change at page 13, line 4
All IETF Documents and the information contained therein are All IETF Documents and the information contained therein are
provided on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION provided on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION
HE/SHE REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET HE/SHE REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET
SOCIETY, THE IETF TRUST AND THE INTERNET ENGINEERING TASK FORCE SOCIETY, THE IETF TRUST AND THE INTERNET ENGINEERING TASK FORCE
DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT
LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION THEREIN LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION THEREIN
WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Full Copyright Statement Full Copyright Statement
Copyright (c) 2013 IETF Trust and the persons identified as the
Copyright (c) 2010 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with carefully, as they describe your rights and restrictions with
respect to this document. Code Components extracted from this respect to this document. Code Components extracted from this
document must include Simplified BSD License text as described in document must include Simplified BSD License text as described in
Section 4.e of the Trust Legal Provisions and are provided without Section 4.e of the Trust Legal Provisions and are provided without
 End of changes. 43 change blocks. 
120 lines changed or deleted 112 lines changed or added

This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/